Conferences in DBLP

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

1. Vijaya Ramachandran
   QSM: A General Purpose Shared-Memory Model for Parallel Computation. [Citation Graph (0, 0)][DBLP]
   FSTTCS, 1997, pp:1-5 [Conf]
   
2. Tamal K. Dey, Arunabha Roy, Nimish R. Shah
   Approximating Geometric Domains through Topological Triangulations. [Citation Graph (0, 0)][DBLP]
   FSTTCS, 1997, pp:6-21 [Conf]
   
3. Sanjeev Mahajan, Edgar A. Ramos, K. V. Subrahmanyam
   Solving Some Discrepancy Problems in NC. [Citation Graph (0, 0)][DBLP]
   FSTTCS, 1997, pp:22-36 [Conf]
   
4. K. Cirino, S. Muthukrishnan, N. S. Narayanaswamy, H. Ramesh
   Graph Editing to Bipartite Interval Graphs: Exact and Asymtotic Bounds. [Citation Graph (0, 0)][DBLP]
   FSTTCS, 1997, pp:37-53 [Conf]
   
5. Edmund M. Clarke
   Model Cheking. [Citation Graph (0, 0)][DBLP]
   FSTTCS, 1997, pp:54-56 [Conf]
   
6. A. J. Kfoury
   Recursion Versus Iteration at Higher-Orders. [Citation Graph (0, 0)][DBLP]
   FSTTCS, 1997, pp:57-73 [Conf]
   
7. Andrew D. Gordon, Paul D. Hankin, Søren B. Lassen
   Compilation and Equivalence of Imperative Objects. [Citation Graph (0, 0)][DBLP]
   FSTTCS, 1997, pp:74-87 [Conf]
   
8. Massimo Marchiori
   On the Expressive Power of Rewriting. [Citation Graph (0, 0)][DBLP]
   FSTTCS, 1997, pp:88-102 [Conf]
   
9. Deepak Kapur, Mahadevan Subramaniam
   Mechanizing Verification of Arithmetic Circuits: SRT Division. [Citation Graph (0, 0)][DBLP]
   FSTTCS, 1997, pp:103-122 [Conf]
   
10. Enrico Pontelli, Desh Ranjan, Gopal Gupta
    On the Complexity of Parallel Implementation of Logic Programs. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1997, pp:123-137 [Conf]
    
11. Jia-Huai You, Li-Yan Yuan, Randy Goebel
    An Abductive Semantics for Disjunctive Logic Programs and Its Proof Procedure. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1997, pp:138-152 [Conf]
    
12. Swarup Mohalik, Ramaswamy Ramanujam
    Assumption-Commitment in Automata. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1997, pp:153-168 [Conf]
    
13. Sandeep S. Kulkarni, Anish Arora
    Compositional Design of Multitolerant Repetitive Byzantine Agreement. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1997, pp:169-183 [Conf]
    
14. Madhu Sudan
    Algorithmic Issues in Coding Theory. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1997, pp:184-199 [Conf]
    
15. Anil Seth
    Sharper Results on the Expressive Power of Generalized Quantifiers. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1997, pp:200-219 [Conf]
    
16. N. V. Vinodchandran
    Improved Lowness Results for Solvable Black-box Group Problems. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1997, pp:220-234 [Conf]
    
17. Vikraman Arvind, Johannes Köbler
    On Resource-Bounded Measure and Pseudorandomness. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1997, pp:235-249 [Conf]
    
18. Moshe Y. Vardi
    Verification of Open Systems. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1997, pp:250-266 [Conf]
    
19. Frank S. de Boer, Ulrich Hannemann, Willem P. de Roever
    Hoare-Style Compositional Proof Systems for Reactive Shared Variable Concurency. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1997, pp:267-283 [Conf]
    
20. Kedar S. Namjoshi
    A Simple Characterization of Stuttering Bisimulation. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1997, pp:284-296 [Conf]
    
21. Raymond R. Devillers, Hanna Klaudel, Robert-C. Riemann
    General Refinement for High Level Petri Nets. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1997, pp:297-311 [Conf]
    
22. Catherine Dufourd, Alain Finkel
    Polynomial-Time Manz-One Reductions for Petri Nets. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1997, pp:312-326 [Conf]
    
23. Burkhard Graves
    Computing Reachability Properties Hidden in Finite Net Unfoldings. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1997, pp:327-341 [Conf]