12. FSTTCS 1992: New Delhi, India

@proceedings{DBLP:conf/fsttcs/1992,
  editor    = {R. K. Shyamasundar},
  title     = {Foundations of Software Technology and Theoretical Computer Science,
               12th Conference, New Delhi, India, December 18-20, 1992, Proceedings},
  booktitle = {FSTTCS},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {652},
  year      = {1992},
  isbn      = {3-540-56287-7},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Invited Talk I

• Amir Pnueli: System Specification and Refinement in Temporal Logic. 1-38 BibTeX

Logic and Semantics

• Mads Dam: Fixed Points of Büchi Automata. 39-50 BibTeX
• Y. S. Ramakrishna, Laura K. Dillon, Louise E. Moser, P. M. Melliar-Smith, G. Kutty: An Automata-Theoretic Decision Procedure for Future Interval Logic. 51-67 BibTeX
• Philippe Granger: Improving the Results of Static Analyses Programs by Local Decreasing Iteration. 68-79 BibTeX

Computational Geometry

• Pankaj K. Agarwal, Marc J. van Kreveld: Implicit Point Location in Arrangements of Line Segments, with an Application to Motion Planning. 80-91 BibTeX
• Shreesh Jadhav, Asish Mukhopadhyay, Binay K. Bhattacharya: An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons. 92-103 BibTeX
• Christos Levcopoulos, Andrzej Lingas: C-sensitive Triangulations Approximate the MinMax Length Triangulation. 104-115 BibTeX

Complexity

• Harry Buhrman, Steven Homer: Superpolynomial Circuits, Almost Sparse Oracles and the Exponential Hierarchy. 116-127 BibTeX
• Rainer Schuler, Tomoyuki Yamakami: Structural Average Case Complexity. 128-139 BibTeX
• Vikraman Arvind, Johannes Köbler, Martin Mundhenk: On Bounded Truth-Table, Conjunctive, and Randomized Reductions to Sparse Sets. 140-151 BibTeX
• K. Ganesan: One-way Functions and Isomorphism Conjecture. 152-163 BibTeX

Logic Programming

• Richa Agarwala, David Fernández-Baca: Solving the Lagrangian Dual when the Number of Constraints is Fixed. 164-175 BibTeX
• Laks V. S. Lakshmanan, Daniel A. Nonen: Superfiniteness of Query Answers in Deductive Databases: An Automata-Theoretic Approach. 176-190 BibTeX
• Joachim Steinbach: Proving Polynomials Positive. 191-202 BibTeX
• Renganathan Sundararajan, John S. Conery: An Abstract Interpretation Scheme for Groundedness, Freeness, and Sharing Analysis of Logic Programs. 203-216 BibTeX

Formal Sofware Specification

• Bruno Monsuez: Polymorphic Typing by Abstract Interpretation. 217-228 BibTeX
• Gérard P. Huet: The Gallina Specification language: A Case Study. 229-240 BibTeX
• Wolfgang Reif: Verification of Large Software Systems. 241-252 BibTeX
• Vijay K. Garg, Brian Waldecker: Detection of Unstable Predicates in Distributed Programs. 253-264 BibTeX

Algorithms I

• Sachin B. Patkar, H. Narayanan: Fast Sequential and Randomised Parallel Algorithms for Rigidity and approximate Min k-cut. 265-278 BibTeX
• R. Ravi, Balaji Raghavachari, Philip N. Klein: Approximation Through Local Optimality: Designing Networks with Small Degree. 279-290 BibTeX

Invited Talk II

• Samson Abramsky, Radha Jagadeesan: Games and Full Completeness for Multiplicative Linear Logic (Extended Abstract). 291-301 BibTeX

Concurrency

• Jens Chr. Godskesen, Kim Guldstrand Larsen: Real-Time Calculi and Expansion Theorems. 302-315 BibTeX
• Didier Caucal: Branching Bisimulation for Context-free Processes. 316-327 BibTeX
• Madhavan Mukund, Mogens Nielsen: CCS, Location and Asynchronous Transition Systems. 328-341 BibTeX
• Linda Christoff, Ivan Christoff: Reasonong about Safety and Liveness Properties for Probabilistic Processes. 342-355 BibTeX

Algorithms II

• S. Muthukrishnan, H. Ramesh: String Matching Under a General Matching Relation. 356-367 BibTeX
• Charles U. Martel, Ramesh Subramonian: On the Complexity of Certified Write All Algorithms. 368-379 BibTeX
• J. Ian Munro, Venkatesh Raman: Selection from Read-Only Memory and Sorting with Optimum Data Movement. 380-391 BibTeX
• Bala Ravikumar: Some Observations on 2-way Probabilistic Finite Automata. 392-403 BibTeX

Invited Talk III

• Kurt Mehlhorn: Recent Developments in Algorithms for the Maximum-Flow Problem (Abstract). 404 BibTeX