16. FSTTCS 1996: Hyderabad, India

Vijay Chandru, V. Vinay (Eds.): Foundations of Software Technology and Theoretical Computer Science, 16th Conference, Hyderabad, India, December 18-20, 1996, Proceedings. Lecture Notes in Computer Science 1180 Springer 1996, ISBN 3-540-62034-6 BibTeX

@proceedings{DBLP:conf/fsttcs/1996,
  editor    = {Vijay Chandru and
               V. Vinay},
  title     = {Foundations of Software Technology and Theoretical Computer Science,
               16th Conference, Hyderabad, India, December 18-20, 1996, Proceedings},
  booktitle = {FSTTCS},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {1180},
  year      = {1996},
  isbn      = {3-540-62034-6},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Invited Papers

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

Computational Geometry I

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

Process Algebra

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

Computational Geometry II

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

Semantics

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

Algorithms

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

Rewriting/Equational-Temporal Logics

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

Complexity Theory

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

Type Theory

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