The SCEAS System
Navigation Menu

Conferences in DBLP

Foundations of Software Technology and Theoretical Computer Science (FSTTCS) (fsttcs)
1996 (conf/fsttcs/1996)

  1. Eric Allender
    Circuit Complexity before the Dawn of the New Millennium. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1996, pp:1-18 [Conf]
  2. 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]
  3. J. Ian Munro
    Tables. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1996, pp:37-42 [Conf]
  4. John M. Rushby
    Mechanized Formal Methods: Progress and Prospects. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1996, pp:43-51 [Conf]
  5. 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]
  6. 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]
  7. 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]
  8. Richard Mayr
    Weak Bisimulation and Model Checking for Basic Parallel Processes. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1996, pp:88-99 [Conf]
  9. Kamal Jain, S. Arun-Kumar
    Testing Processes for Efficiency. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1996, pp:100-110 [Conf]
  10. Antonín Kucera
    Regularity is Decidable for Normed PA Processes in Polynomial Time. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1996, pp:111-122 [Conf]
  11. Sanjiv Kapoor, Tripurari Singh
    Dynamic Maintenance of Shortest Path Trees in Simple Polygons. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1996, pp:123-134 [Conf]
  12. Christos Levcopoulos, Joachim Gudmundsson
    Close Approximation of Minimum Rectangular Coverings. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1996, pp:135-146 [Conf]
  13. 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]
  14. 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]
  15. Philippe Codognet, Daniel Diaz, Francesca Rossi
    Constraint Reaction in FD. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1996, pp:168-179 [Conf]
  16. Tobias Nipkow
    Winskel is (Almost) Right: Towards a Mechanized Semantics Textbook. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1996, pp:180-192 [Conf]
  17. Bala Kalyanasundaram, Kirk Pruhs
    An Optimal Deterministic Algorithm for Online b-Matching. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1996, pp:193-199 [Conf]
  18. 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]
  19. 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]
  20. 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]
  21. 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]
  22. Ramaswamy Ramanujam
    Trace Consistency and Inevitablity. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1996, pp:250-261 [Conf]
  23. Ron van der Meyden
    Finite State Implementations of Knowledge-Based Programs. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1996, pp:262-273 [Conf]
  24. Henrik Linnestad, Christian Prehofer, Olav Lysne
    Higher-Order Proof by Consistency. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1996, pp:274-285 [Conf]
  25. Henning Fernau, Klaus-Jörn Lange, Klaus Reinhardt
    Advocating Ownership. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1996, pp:286-297 [Conf]
  26. 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]
  27. Miroslaw Kutylowski, Krzysztof Lorys
    Limitations of the QRQW and EREW PRAM Models. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1996, pp:310-321 [Conf]
  28. 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]
  29. 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]
  30. Milind Gandhe, G. Venkatesh, Amitabha Sanyal
    Correcting Errors in the Curry System. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1996, pp:347-358 [Conf]
  31. Harald Søndergaard
    Immediate Fixpoints and Their Use in Groundness Analysis. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1996, pp:359-370 [Conf]
  32. Nobuko Yoshida
    Graph Types for Monadic Mobile Processes. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1996, pp:371-386 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002