
Conferences in DBLP
 Vijaya Ramachandran
QSM: A General Purpose SharedMemory Model for Parallel Computation. [Citation Graph (0, 0)][DBLP] FSTTCS, 1997, pp:15 [Conf]
 Tamal K. Dey, Arunabha Roy, Nimish R. Shah
Approximating Geometric Domains through Topological Triangulations. [Citation Graph (0, 0)][DBLP] FSTTCS, 1997, pp:621 [Conf]
 Sanjeev Mahajan, Edgar A. Ramos, K. V. Subrahmanyam
Solving Some Discrepancy Problems in NC. [Citation Graph (0, 0)][DBLP] FSTTCS, 1997, pp:2236 [Conf]
 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:3753 [Conf]
 Edmund M. Clarke
Model Cheking. [Citation Graph (0, 0)][DBLP] FSTTCS, 1997, pp:5456 [Conf]
 A. J. Kfoury
Recursion Versus Iteration at HigherOrders. [Citation Graph (0, 0)][DBLP] FSTTCS, 1997, pp:5773 [Conf]
 Andrew D. Gordon, Paul D. Hankin, Søren B. Lassen
Compilation and Equivalence of Imperative Objects. [Citation Graph (0, 0)][DBLP] FSTTCS, 1997, pp:7487 [Conf]
 Massimo Marchiori
On the Expressive Power of Rewriting. [Citation Graph (0, 0)][DBLP] FSTTCS, 1997, pp:88102 [Conf]
 Deepak Kapur, Mahadevan Subramaniam
Mechanizing Verification of Arithmetic Circuits: SRT Division. [Citation Graph (0, 0)][DBLP] FSTTCS, 1997, pp:103122 [Conf]
 Enrico Pontelli, Desh Ranjan, Gopal Gupta
On the Complexity of Parallel Implementation of Logic Programs. [Citation Graph (0, 0)][DBLP] FSTTCS, 1997, pp:123137 [Conf]
 JiaHuai You, LiYan Yuan, Randy Goebel
An Abductive Semantics for Disjunctive Logic Programs and Its Proof Procedure. [Citation Graph (0, 0)][DBLP] FSTTCS, 1997, pp:138152 [Conf]
 Swarup Mohalik, Ramaswamy Ramanujam
AssumptionCommitment in Automata. [Citation Graph (0, 0)][DBLP] FSTTCS, 1997, pp:153168 [Conf]
 Sandeep S. Kulkarni, Anish Arora
Compositional Design of Multitolerant Repetitive Byzantine Agreement. [Citation Graph (0, 0)][DBLP] FSTTCS, 1997, pp:169183 [Conf]
 Madhu Sudan
Algorithmic Issues in Coding Theory. [Citation Graph (0, 0)][DBLP] FSTTCS, 1997, pp:184199 [Conf]
 Anil Seth
Sharper Results on the Expressive Power of Generalized Quantifiers. [Citation Graph (0, 0)][DBLP] FSTTCS, 1997, pp:200219 [Conf]
 N. V. Vinodchandran
Improved Lowness Results for Solvable Blackbox Group Problems. [Citation Graph (0, 0)][DBLP] FSTTCS, 1997, pp:220234 [Conf]
 Vikraman Arvind, Johannes Köbler
On ResourceBounded Measure and Pseudorandomness. [Citation Graph (0, 0)][DBLP] FSTTCS, 1997, pp:235249 [Conf]
 Moshe Y. Vardi
Verification of Open Systems. [Citation Graph (0, 0)][DBLP] FSTTCS, 1997, pp:250266 [Conf]
 Frank S. de Boer, Ulrich Hannemann, Willem P. de Roever
HoareStyle Compositional Proof Systems for Reactive Shared Variable Concurency. [Citation Graph (0, 0)][DBLP] FSTTCS, 1997, pp:267283 [Conf]
 Kedar S. Namjoshi
A Simple Characterization of Stuttering Bisimulation. [Citation Graph (0, 0)][DBLP] FSTTCS, 1997, pp:284296 [Conf]
 Raymond R. Devillers, Hanna Klaudel, RobertC. Riemann
General Refinement for High Level Petri Nets. [Citation Graph (0, 0)][DBLP] FSTTCS, 1997, pp:297311 [Conf]
 Catherine Dufourd, Alain Finkel
PolynomialTime ManzOne Reductions for Petri Nets. [Citation Graph (0, 0)][DBLP] FSTTCS, 1997, pp:312326 [Conf]
 Burkhard Graves
Computing Reachability Properties Hidden in Finite Net Unfoldings. [Citation Graph (0, 0)][DBLP] FSTTCS, 1997, pp:327341 [Conf]
