Conferences in DBLP
Eric Allender Circuit Complexity before the Dawn of the New Millennium. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1996, pp:1-18 [Conf ] Arvind , Jan-Willem Maessen , Rishiyur S. Nikhil , Joseph E. Stoy A Lambda Calculus with Letrecs and Barriers. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1996, pp:19-36 [Conf ] J. Ian Munro Tables. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1996, pp:37-42 [Conf ] John M. Rushby Mechanized Formal Methods: Progress and Prospects. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1996, pp:43-51 [Conf ] J. C. Lagarias , N. Prabhu , James A. Reeds The Parameter Space of the d -step Conjecture. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1996, pp:52-63 [Conf ] Gautam Das , Sanjiv Kapoor , Michiel H. M. Smid On the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning Trees. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1996, pp:64-75 [Conf ] Pinaki Mitra , Subhas C. Nandy Efficient Computation of Rectilinear Geodesic Voronoi Neighbor in Presence of Obstacles. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1996, pp:76-87 [Conf ] Richard Mayr Weak Bisimulation and Model Checking for Basic Parallel Processes. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1996, pp:88-99 [Conf ] Kamal Jain , S. Arun-Kumar Testing Processes for Efficiency. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1996, pp:100-110 [Conf ] Antonín Kucera Regularity is Decidable for Normed PA Processes in Polynomial Time. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1996, pp:111-122 [Conf ] Sanjiv Kapoor , Tripurari Singh Dynamic Maintenance of Shortest Path Trees in Simple Polygons. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1996, pp:123-134 [Conf ] Christos Levcopoulos , Joachim Gudmundsson Close Approximation of Minimum Rectangular Coverings. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1996, pp:135-146 [Conf ] Pallab Dasgupta , P. P. Chakrabarti , S. C. De Sarkar A New Competitive Algorithm for Agent Searching in Unknown Streets. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1996, pp:147-155 [Conf ] Dang Van Hung , Wang Ji On the Design of Hybrid Control Systems Using Automata Models. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1996, pp:156-167 [Conf ] Philippe Codognet , Daniel Diaz , Francesca Rossi Constraint Reaction in FD. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1996, pp:168-179 [Conf ] Tobias Nipkow Winskel is (Almost) Right: Towards a Mechanized Semantics Textbook. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1996, pp:180-192 [Conf ] Bala Kalyanasundaram , Kirk Pruhs An Optimal Deterministic Algorithm for Online b-Matching. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1996, pp:193-199 [Conf ] Peter J. Varman , Rakesh M. Verma Tight Bounds for Prefetching and Buffer Management Algorithms for Parallel I/O Systems. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1996, pp:200-211 [Conf ] Thomas L. Morin , Nagabhushana Prabhu , Z. Zhang Complexity of the Gravitational Method for Linear Programming. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1996, pp:212-223 [Conf ] B. John Oommen , R. K. S. Loke Optimal and Information Theoretic Syntactic Pattern Recognition Involving Traditional and Transposition Errors. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1996, pp:224-237 [Conf ] John R. W. Glauert , Zurab Khasidashvili Minimal Relative Normalization in Orthogonal Expression Reduction Systems. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1996, pp:238-249 [Conf ] Ramaswamy Ramanujam Trace Consistency and Inevitablity. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1996, pp:250-261 [Conf ] Ron van der Meyden Finite State Implementations of Knowledge-Based Programs. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1996, pp:262-273 [Conf ] Henrik Linnestad , Christian Prehofer , Olav Lysne Higher-Order Proof by Consistency. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1996, pp:274-285 [Conf ] Henning Fernau , Klaus-Jörn Lange , Klaus Reinhardt Advocating Ownership. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1996, pp:286-297 [Conf ] Rimli Sengupta , H. Venkateswaran Non-cancellative Boolean Circuits: A Generalization of Monotone Boolean Circuits. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1996, pp:298-309 [Conf ] Miroslaw Kutylowski , Krzysztof Lorys Limitations of the QRQW and EREW PRAM Models. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1996, pp:310-321 [Conf ] Manindra Agrawal , Richard Beigel , Thomas Thierauf Pinpointing Computation with Modular Queries in the Boolean Hierarchy. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1996, pp:322-334 [Conf ] Emilie Sayag , Michel Mauny Characterization of the Principal Type of Normal Forms in an Intersection Type System. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1996, pp:335-346 [Conf ] Milind Gandhe , G. Venkatesh , Amitabha Sanyal Correcting Errors in the Curry System. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1996, pp:347-358 [Conf ] Harald Søndergaard Immediate Fixpoints and Their Use in Groundness Analysis. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1996, pp:359-370 [Conf ] Nobuko Yoshida Graph Types for Monadic Mobile Processes. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1996, pp:371-386 [Conf ]