Research Catalog
Foundations of software technology and theoretical computer science : 11th conference, New Delhi, India, December 17-19, 1991 : proceedings
- Title
- Foundations of software technology and theoretical computer science : 11th conference, New Delhi, India, December 17-19, 1991 : proceedings / S. Biswas, K.V. Nori (eds.).
- Publication
- Berlin ; New York : Springer-Verlag, ©1991.
Items in the Library & Off-site
Filter by
1 Item
| Status | Format | Access | Call Number | Item Location |
|---|---|---|---|---|
Not available - Please for assistance. | Text | Use in library | QA76.751 .F68 1991 | Off-site |
Details
- Additional Authors
- Description
- x, 419 pages : illustrations; 25 cm.
- Series Statement
- Lecture notes in computer science ; 560
- Uniform Title
- Lecture notes in computer science ; 560.
- Subject
- Genre/Form
- Conference papers and proceedings
- Bibliography (note)
- Includes bibliographical references.
- Contents
- Program checking -- Randomizing reductions of search problems -- Time analysis, cost equivalence, and program refinement -- AC-equation solving -- On the operational interpretation of complex types -- Tense logics for local reasong in distributed systems -- Failures semantics for a simple process language with refinement -- Correctness of programs over poor signatures -- Complexity issues for vacillatory function identification -- Purely algebraic proof of McNaughton's Theorem on infinite words -- Structure and complexity of minimal NFAs over a Unary alphabet -- Relativised cellular automata and complexity classes -- Computing the order of a locally testable automaton -- On the structure and complexity of infinite sets with minimal perfect hash functions -- NP-hard sets and creativeness over constant time languages -- Complete problems involving boolean labelled structures and project translations.
- Is BP.@P a probabililstic class? -- Fast stable in-place sorting with O(n) data moves -- Theorem on the approximation of set cover and vertex cover -- Fast algorithm for the principal partition of a graph -- Uniform circuits and exclusive read PRAMs -- Contracting planar graphs efficiently in parallel -- Fast deterministic selection on mesh-connected processor arrays -- Improved selection in totally monotone arrays -- Designing secure communication protocols from Trust specifications -- Computing the shortest path tree in a weak visibility polygon -- Usefulness of angle-sweep over line-sweep.
- ISBN
- 3540549676
- 9783540549673
- 0387549676
- 9780387549675
- LCCN
- 91039207
- OCLC
- ocm24796579
- 24796579
- SCSB-1936164
- Owning Institutions
- Princeton University Library