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. Lecture Notes in Computer Science 560 Springer 1991, ISBN 3-540-54967-6 BibTeX

@proceedings{DBLP:conf/fsttcs/1991,
  editor    = {Somenath Biswas and
               Kesav V. Nori},
  title     = {Foundations of Software Technology and Theoretical Computer Science,
               11th Conference, New Delhi, India, December 17-19, 1991, Proceedings},
  booktitle = {FSTTCS},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {560},
  year      = {1991},
  isbn      = {3-540-54967-6},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Invited Papers

Manuel Blum: Program Checking. 1-9 BibTeX
Andreas Blass, Yuri Gurevich: Randomizing Reductions of Search Problems. 10-24 BibTeX

Term Rewriting, Type Theory

David Sands: Time Analysis, Cost Equivalence and Program Refinement. 25-39 BibTeX
Subrata Mitra, G. Sivakumar: AC-Equation Solving. 40-56 BibTeX
Qing-Ping Tan, Huo-Wang Chen: On the Operational Interpretation of Complex Types. 57-70 BibTeX

Semantics, Chair: R. K. Shyamasundar

Kamal Lodaya, Ramaswamy Ramanujam: Tense Logics for Local Reasoning in Distributed Systems. 71-88 BibTeX
Luca Aceto, Uffe Engberg: Failures Semantics for a Simple Process Language with Refinement. 89-108 BibTeX
Hardi Hungar: Correstness of Programs over Poor Signatures. 109-120 BibTeX
John Case, Sanjay Jain, Arun Sharma: Complexity Issues for Vacillatory Function Identification. 121-140 BibTeX

Automata Theory

Bertrand Le Saëc, Jean-Eric Pin, Pascal Weil: A Purely Algebraic Proof of McNaughton's Theorem on Infinite Words. 141-151 BibTeX
Tao Jiang, Edward McDowell, Bala Ravikumar: The Structure and Complexity of Minimal NFA's over a Unary Alphabet. 152-171 BibTeX
Meena Mahajan, Kamala Krithivasan: Relativised Cellular Automata and Complexity Classes. 172-185 BibTeX
Sam M. Kim, Robert McNaughton: Computing the Order of a Locally Testable Automaton. 186-211 BibTeX

Structural Complexity

Judy Goldsmith, Lane A. Hemachandra, Kenneth Kunen: On the Structure and Complexity of Infinite Sets with Minimal Perfect Hash Functions. 212-223 BibTeX
Manindra Agrawal: NP-hard Sets and Creativeness over Constant Time Languages. 224-241 BibTeX
Iain A. Stewart: Complete Problems Involving Boolean Labelled Structures and Projections Translations. 242-260 BibTeX
V. Vinay: Is BP.+P a Probabilistic Class? 261-265 BibTeX

Agorithms I

J. Ian Munro, Venkatesh Raman: Fast Sorting In-Place Sorting with O(n) Data. 266-277 BibTeX
Vangelis Th. Paschos: A Theorem on the Approximation of Set Cover and Vertex Cover. 278-287 BibTeX
Sachin B. Patkar, H. Narayanan: A Fast Algorithm for the Principle Partition of a Graph. 288-306 BibTeX

Algorithms II

Inga Niepel, Peter Rossmanith: Uniform Circuits and Exclusive Read PRAMs. 307-318 BibTeX
Martin Fürer: Contracting Planar Graphs Efficiency in Parallel. 319-335 BibTeX
Danny Krizanc, Lata Narayanan, Rajeev Raman: Fast Deterministic Selection on Mesh-Connected Processor Arrays. 336-346 BibTeX

Algorithms III

Yishay Mansour, James K. Park, Baruch Schieber: Improved Selection on Totally Monotone Arrays. 347-359 BibTeX
Christos H. Papadimitriou, P. Venkat Rangan, Martha Sideri: Designing Secure Communication Protocols from Trust Specifications. 360-368 BibTeX
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 BibTeX
Binay K. Bhattacharya: Usefulness of Angle-Sweep over Line-Sweep. 390-419 BibTeX

Invited Paper

Glynn Winskel: Petri Nets and Transition Systems (Abstract for an invited talk). 420 BibTeX