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