11. FSTTCS 1991: New Delhi, India
Somenath Biswas, Kesav V. Nori (Eds.): Foundations of Software Technology and Theoretical Computer Science, 11th Conference, New Delhi, India, December 17-19, 1991, Proceedings. Springer 1991 Lecture Notes in Computer Science 560 ISBN 3-540-54967-6
Invited Papers
- Manuel Blum: Program Checking. 1-9
Term Rewriting, Type Theory
- David Sands: Time Analysis, Cost Equivalence and Program Refinement. 25-39
Semantics, Chair: R. K. Shyamasundar
- Hardi Hungar: Correstness of Programs over Poor Signatures. 109-120
- John Case, Sanjay Jain, Arun Sharma: Complexity Issues for Vacillatory Function Identification. 121-140
Automata Theory
- Bertrand Le Saëc, Jean-Eric Pin, Pascal Weil: A Purely Algebraic Proof of McNaughton's Theorem on Infinite Words. 141-151
- Tao Jiang, Edward McDowell, Bala Ravikumar: The Structure and Complexity of Minimal NFA's over a Unary Alphabet. 152-171
Structural Complexity
- Judy Goldsmith, Lane A. Hemachandra, Kenneth Kunen: On the Structure and Complexity of Infinite Sets with Minimal Perfect Hash Functions. 212-223
- Manindra Agrawal: NP-hard Sets and Creativeness over Constant Time Languages. 224-241
- Iain A. Stewart: Complete Problems Involving Boolean Labelled Structures and Projections Translations. 242-260
- V. Vinay: Is BP.+P a Probabilistic Class? 261-265
Agorithms I
- Vangelis Th. Paschos: A Theorem on the Approximation of Set Cover and Vertex Cover. 278-287
Algorithms II
- Martin Fürer: Contracting Planar Graphs Efficiency in Parallel. 319-335
- Danny Krizanc, Lata Narayanan, Rajeev Raman: Fast Deterministic Selection on Mesh-Connected Processor Arrays. 336-346
Algorithms III
- Yishay Mansour, James K. Park, Baruch Schieber: Improved Selection on Totally Monotone Arrays. 347-359
- Christos H. Papadimitriou, P. Venkat Rangan, Martha Sideri: Designing Secure Communication Protocols from Trust Specifications. 360-368
- Subir Kumar Ghosh, Anil Maheshwari, Sudebkumar Prasant Pal, Sanjeev Saluja, C. E. Veni Madhavan: Computing the Shortest Path Tree in a Weak Visibility Polygon. 369-389
- Binay K. Bhattacharya: Usefulness of Angle-Sweep over Line-Sweep. 390-419
Invited Paper
- Glynn Winskel: Petri Nets and Transition Systems (Abstract for an invited talk). 420
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-12-09T212705 by the dblp team