Foundations of software technology and theoretical computer science : 16th conference, Hyderabad, India, December 18-20, 1996 : proceedings /
V. Chandru, V. Vinay, eds.
- Berlin ; New York : Springer, c1996.
- xi, 386 p. : ill. ; 24 cm.
- Lecture notes in computer science ; 1180 .
- Lecture notes in computer science ; 1180. .
"FST and TCS 16"--Cover. "The proceedings of the Sixteenth Annual Conference on Foundations of Software Technology and Theoretical Computer Science"--Pref.
Includes bibliographical references and index.
Circuit Complexity before the Dawn of the New Millennium / A Lambda Calculus with Letrecs and Barriers / Tables / Mechanized Formal Methods: Progress and Prospects / The Parameter Space of the d-step Conjecture / On the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning Trees / Efficient Computation of Rectilinear Geodesic Voronoi Neighbor in Presence of Obstacles / Weak Bisimulation and Model Checking for Basic Parallel Processes / Testing Processes for Efficiency / Regularity is Decidable for Normed PA Processes in Polynomial Time / Dynamic Maintenance of Shortest Path Trees in Simple Polygons / Eric Allender -- Arvind, Jan-Willem Maessen and Rishiyur S. Nikhil [et al.] -- J. Ian Munro -- John Rushby -- J. C. Lagarias, N. Prabhu and J. A. Reeds -- G. Das, S. Kapoor and M. Smid -- P. Mitra and S. C. Nandy -- R. Mayr -- K. Jain and S. Arun-Kumar -- A. Kucera -- S. Kapoor and T. Singh -- Close Approximations of Minimum Rectangular Coverings / A New Competitive Algorithm for Agent Searching in Unknown Streets / On the Design of Hybrid Control Systems Using Automata Models / Constraint Retraction in FD / Winskel is (Almost) Right: Towards a Mechanized Semantics Textbooks / An Optimal Deterministic Algorithm for Online b-Matching / Tight Bounds for Prefetching and Buffer Management Algorithms for Parallel I/O Systems / Complexity of the Gravitational Method for Linear Programming / Optimal and Information Theoretic Syntactic Pattern Recognition Involving Traditional and Transposition Errors / C. Levcopoulos and J. Gudmundsson -- P. Dasgupta, P. P. Chakrabarti and S. C. DeSarkar -- D. V. Hung and W. Ji -- P. Codognet, D. Diaz and F. Rossi -- T. Nipkow -- B. Kalyanasundaram and K. Pruhs -- P. J. Varman and R. M. Verma -- T. L. Morin, N. Prabhu and Z. Zhang -- B. J. Oommen and R. K. S. Loke -- Minimal Relative Normalization in Orthogonal Expression Reduction Systems / Trace Consistency and Inevitability / Finite State Implementations of Knowledge-Based Programs / Higher-Order Proof by Consistency / Advocating Ownership / Non-cancellative Boolean Circuits: A Generalization of Monotone Boolean Circuits / Limitations of the QRQW and EREW PRAM Models / Pinpointing Computation with Modular Queries in the Boolean Hierarchy / Characterization of Principal Type of Normal Forms in an Intersection Type System / Correcting Type Errors in the Curry System / Immediate Fixpoints and Their Use in Groundness Analysis / J. Galuert and Z. Khashdashvili -- R. Ramanujam -- R. van der Meyden -- H. Linnestad, C. Prehofer and O. Lysne -- H. Fernau, K.-J. Lange and K. Reinhardt -- R. Sengupta and H. Venkateswaran -- M. Kutylowski and K. Lorys -- M. Agrawal, R. Beigel and T. Thierauf -- E. Sayag and M. Mauny -- M. Gandhe, G. Venkatesh and A. Sanyal -- H. Sondergaard -- Graph Types for Monadic Mobile Processes / N. Yoshida.
3540620346
Computer software--Congresses.
Computer science--Congresses.
005.3 / FOU
"FST and TCS 16"--Cover. "The proceedings of the Sixteenth Annual Conference on Foundations of Software Technology and Theoretical Computer Science"--Pref.
Includes bibliographical references and index.
Circuit Complexity before the Dawn of the New Millennium / A Lambda Calculus with Letrecs and Barriers / Tables / Mechanized Formal Methods: Progress and Prospects / The Parameter Space of the d-step Conjecture / On the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning Trees / Efficient Computation of Rectilinear Geodesic Voronoi Neighbor in Presence of Obstacles / Weak Bisimulation and Model Checking for Basic Parallel Processes / Testing Processes for Efficiency / Regularity is Decidable for Normed PA Processes in Polynomial Time / Dynamic Maintenance of Shortest Path Trees in Simple Polygons / Eric Allender -- Arvind, Jan-Willem Maessen and Rishiyur S. Nikhil [et al.] -- J. Ian Munro -- John Rushby -- J. C. Lagarias, N. Prabhu and J. A. Reeds -- G. Das, S. Kapoor and M. Smid -- P. Mitra and S. C. Nandy -- R. Mayr -- K. Jain and S. Arun-Kumar -- A. Kucera -- S. Kapoor and T. Singh -- Close Approximations of Minimum Rectangular Coverings / A New Competitive Algorithm for Agent Searching in Unknown Streets / On the Design of Hybrid Control Systems Using Automata Models / Constraint Retraction in FD / Winskel is (Almost) Right: Towards a Mechanized Semantics Textbooks / An Optimal Deterministic Algorithm for Online b-Matching / Tight Bounds for Prefetching and Buffer Management Algorithms for Parallel I/O Systems / Complexity of the Gravitational Method for Linear Programming / Optimal and Information Theoretic Syntactic Pattern Recognition Involving Traditional and Transposition Errors / C. Levcopoulos and J. Gudmundsson -- P. Dasgupta, P. P. Chakrabarti and S. C. DeSarkar -- D. V. Hung and W. Ji -- P. Codognet, D. Diaz and F. Rossi -- T. Nipkow -- B. Kalyanasundaram and K. Pruhs -- P. J. Varman and R. M. Verma -- T. L. Morin, N. Prabhu and Z. Zhang -- B. J. Oommen and R. K. S. Loke -- Minimal Relative Normalization in Orthogonal Expression Reduction Systems / Trace Consistency and Inevitability / Finite State Implementations of Knowledge-Based Programs / Higher-Order Proof by Consistency / Advocating Ownership / Non-cancellative Boolean Circuits: A Generalization of Monotone Boolean Circuits / Limitations of the QRQW and EREW PRAM Models / Pinpointing Computation with Modular Queries in the Boolean Hierarchy / Characterization of Principal Type of Normal Forms in an Intersection Type System / Correcting Type Errors in the Curry System / Immediate Fixpoints and Their Use in Groundness Analysis / J. Galuert and Z. Khashdashvili -- R. Ramanujam -- R. van der Meyden -- H. Linnestad, C. Prehofer and O. Lysne -- H. Fernau, K.-J. Lange and K. Reinhardt -- R. Sengupta and H. Venkateswaran -- M. Kutylowski and K. Lorys -- M. Agrawal, R. Beigel and T. Thierauf -- E. Sayag and M. Mauny -- M. Gandhe, G. Venkatesh and A. Sanyal -- H. Sondergaard -- Graph Types for Monadic Mobile Processes / N. Yoshida.
3540620346
Computer software--Congresses.
Computer science--Congresses.
005.3 / FOU