16. FSTTCS 1996: Hyderabad, India

Invited Papers

• Eric Allender:
  Circuit Complexity before the Dawn of the New Millennium. 1-18
  
• Arvind, Jan-Willem Maessen, Rishiyur S. Nikhil, Joseph E. Stoy:
  A Lambda Calculus with Letrecs and Barriers. 19-36
  
• J. Ian Munro:
  Tables. 37-42
  
• John M. Rushby:
  Mechanized Formal Methods: Progress and Prospects. 43-51
  

Computational Geometry I

• J. C. Lagarias, N. Prabhu, James A. Reeds:
  The Parameter Space of the d-step Conjecture. 52-63
  
• Gautam Das, Sanjiv Kapoor, Michiel H. M. Smid:
  On the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning Trees. 64-75
  
• Pinaki Mitra, Subhas C. Nandy:
  Efficient Computation of Rectilinear Geodesic Voronoi Neighbor in Presence of Obstacles. 76-87
  

Process Algebra

• Richard Mayr:
  Weak Bisimulation and Model Checking for Basic Parallel Processes. 88-99
  
• Kamal Jain, S. Arun-Kumar:
  Testing Processes for Efficiency. 100-110
  
• Antonín Kucera:
  Regularity is Decidable for Normed PA Processes in Polynomial Time. 111-122
  

Computational Geometry II

• Sanjiv Kapoor, Tripurari Singh:
  Dynamic Maintenance of Shortest Path Trees in Simple Polygons. 123-134
  
• Christos Levcopoulos, Joachim Gudmundsson:
  Close Approximation of Minimum Rectangular Coverings. 135-146
  
• Pallab Dasgupta, P. P. Chakrabarti, S. C. De Sarkar:
  A New Competitive Algorithm for Agent Searching in Unknown Streets. 147-155
  

Semantics

• Dang Van Hung, Wang Ji:
  On the Design of Hybrid Control Systems Using Automata Models. 156-167
  
• Philippe Codognet, Daniel Diaz, Francesca Rossi:
  Constraint Reaction in FD. 168-179
  
• Tobias Nipkow:
  Winskel is (Almost) Right: Towards a Mechanized Semantics Textbook. 180-192
  

Algorithms

• Bala Kalyanasundaram, Kirk Pruhs:
  An Optimal Deterministic Algorithm for Online b-Matching. 193-199
  
• Peter J. Varman, Rakesh M. Verma:
  Tight Bounds for Prefetching and Buffer Management Algorithms for Parallel I/O Systems. 200-211
  
• Thomas L. Morin, Nagabhushana Prabhu, Z. Zhang:
  Complexity of the Gravitational Method for Linear Programming. 212-223
  
• B. John Oommen, R. K. S. Loke:
  Optimal and Information Theoretic Syntactic Pattern Recognition Involving Traditional and Transposition Errors. 224-237
  

Rewriting/Equational-Temporal Logics

• John R. W. Glauert, Zurab Khasidashvili:
  Minimal Relative Normalization in Orthogonal Expression Reduction Systems. 238-249
  
• Ramaswamy Ramanujam:
  Trace Consistency and Inevitablity. 250-261
  
• Ron van der Meyden:
  Finite State Implementations of Knowledge-Based Programs. 262-273
  
• Henrik Linnestad, Christian Prehofer, Olav Lysne:
  Higher-Order Proof by Consistency. 274-285
  

Complexity Theory

• Henning Fernau, Klaus-Jörn Lange, Klaus Reinhardt:
  Advocating Ownership. 286-297
  
• Rimli Sengupta, H. Venkateswaran:
  Non-cancellative Boolean Circuits: A Generalization of Monotone Boolean Circuits. 298-309
  
• Miroslaw Kutylowski, Krzysztof Lorys:
  Limitations of the QRQW and EREW PRAM Models. 310-321
  
• Manindra Agrawal, Richard Beigel, Thomas Thierauf:
  Pinpointing Computation with Modular Queries in the Boolean Hierarchy. 322-334
  

Type Theory

• Emilie Sayag, Michel Mauny:
  Characterization of the Principal Type of Normal Forms in an Intersection Type System. 335-346
  
• Milind Gandhe, G. Venkatesh, Amitabha Sanyal:
  Correcting Errors in the Curry System. 347-358
  
• Harald Søndergaard:
  Immediate Fixpoints and Their Use in Groundness Analysis. 359-370
  
• Nobuko Yoshida:
  Graph Types for Monadic Mobile Processes. 371-386