12. FSTTCS 1992: New Delhi, India

Invited Talk I

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

Logic and Semantics

• Mads Dam:
  Fixed Points of Büchi Automata. 39-50
  
• 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
  
• Philippe Granger:
  Improving the Results of Static Analyses Programs by Local Decreasing Iteration. 68-79
  

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
  
• Shreesh Jadhav, Asish Mukhopadhyay, Binay K. Bhattacharya:
  An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons. 92-103
  
• Christos Levcopoulos, Andrzej Lingas:
  C-sensitive Triangulations Approximate the MinMax Length Triangulation. 104-115
  

Complexity

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

Logic Programming

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

Formal Sofware Specification

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

Algorithms I

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

Invited Talk II

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

Concurrency

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

Algorithms II

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

Invited Talk III

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