Vai al contenuto principale della pagina
Titolo: |
Foundations of Software Technology and Theoretical Computer Science [[electronic resource] ] : Fourth Conference, Bangalore, India December 13-15, 1984. Proceedings / / edited by M. Joseph, R. Shyamasundar
![]() |
Pubblicazione: | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1984 |
Edizione: | 1st ed. 1984. |
Descrizione fisica: | 1 online resource (X, 470 p.) |
Disciplina: | 005.1 |
Soggetto topico: | Software engineering |
Algorithms | |
Software Engineering/Programming and Operating Systems | |
Software Engineering | |
Algorithm Analysis and Problem Complexity | |
Persona (resp. second.): | JosephM |
ShyamasundarR | |
Note generali: | Bibliographic Level Mode of Issuance: Monograph |
Nota di contenuto: | Logic for knowledge representation -- Logical specification and implementation -- Process specification of logic programs -- Functional programming systems revisited -- Models and transformations for nondeterministic extensions of functional programming -- Degrees of non-determinism and concurrency: A Petri net view -- Proof rules for communication abstractions -- A distributed algorithm for detecting communication deadlocks -- On the existence and construction of robust communication protocols for unreliable channels -- Heuristic search approach to optimal routing in a distributed architecture -- Replacement in monotone Boolean networks: An algebraic perspective -- A new characterization of BPP -- Treating terminals as function values of time -- Logics of knowledge, games and dynamic logic -- Persistent first class procedures are enough -- Abstraction concepts for modeling screen oriented dialogue interfaces -- VLSI systems for design rule checks -- Bounds on the length of convex partitions of polygons -- On mapping cube graphs onto VLSI arrays -- A linear-time algorithm for determining the intersection type of two star polygons -- Eliminating cascading rollback in structured databases -- Recognition and top-down generation of ?-acyclic database schemes -- Universal and representative instances using unmarked nulls -- On some computational problems related to data base coding -- Generic oracles -- Approximation algorithm for maximum independent set in planar traingle-free graphs -- Grid file algorithms: An analysis in the biased case -- On the mean weight balance factor of binary trees -- An efficient algorithm for random sampling without replacement -- Proof rules for communication abstractions. |
Titolo autorizzato: | Foundations of software technology and theoretical computer science ![]() |
ISBN: | 3-540-39087-1 |
Formato: | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione: | Inglese |
Record Nr.: | 996466098603316 |
Lo trovi qui: | Univ. di Salerno |
Opac: | Controlla la disponibilità qui |