Abstract is missing.
- QSM: A General Purpose Shared-Memory Model for Parallel ComputationVijaya Ramachandran. 1-5 [doi]
- Approximating Geometric Domains through Topological TriangulationsTamal K. Dey, Arunabha Roy, Nimish R. Shah. 6-21 [doi]
- Solving Some Discrepancy Problems in NCSanjeev Mahajan, Edgar A. Ramos, K. V. Subrahmanyam. 22-36 [doi]
- Graph Editing to Bipartite Interval Graphs: Exact and Asymtotic BoundsK. Cirino, S. Muthukrishnan, N. S. Narayanaswamy, H. Ramesh. 37-53 [doi]
- Model ChekingEdmund M. Clarke. 54-56 [doi]
- Recursion Versus Iteration at Higher-OrdersA. J. Kfoury. 57-73 [doi]
- Compilation and Equivalence of Imperative ObjectsAndrew D. Gordon, Paul D. Hankin, Søren B. Lassen. 74-87 [doi]
- On the Expressive Power of RewritingMassimo Marchiori. 88-102 [doi]
- Mechanizing Verification of Arithmetic Circuits: SRT DivisionDeepak Kapur, Mahadevan Subramaniam. 103-122 [doi]
- On the Complexity of Parallel Implementation of Logic ProgramsEnrico Pontelli, Desh Ranjan, Gopal Gupta. 123-137 [doi]
- An Abductive Semantics for Disjunctive Logic Programs and Its Proof ProcedureJia-Huai You, Li-Yan Yuan, Randy Goebel. 138-152 [doi]
- Assumption-Commitment in AutomataSwarup Mohalik, Ramaswamy Ramanujam. 153-168 [doi]
- Compositional Design of Multitolerant Repetitive Byzantine AgreementSandeep S. Kulkarni, Anish Arora. 169-183 [doi]
- Algorithmic Issues in Coding TheoryMadhu Sudan. 184-199 [doi]
- Sharper Results on the Expressive Power of Generalized QuantifiersAnil Seth. 200-219 [doi]
- Improved Lowness Results for Solvable Black-box Group ProblemsN. V. Vinodchandran. 220-234 [doi]
- On Resource-Bounded Measure and PseudorandomnessVikraman Arvind, Johannes Köbler. 235-249 [doi]
- Verification of Open SystemsMoshe Y. Vardi. 250-266 [doi]
- Hoare-Style Compositional Proof Systems for Reactive Shared Variable ConcurencyFrank S. de Boer, Ulrich Hannemann, Willem P. de Roever. 267-283 [doi]
- A Simple Characterization of Stuttering BisimulationKedar S. Namjoshi. 284-296 [doi]
- General Refinement for High Level Petri NetsRaymond R. Devillers, Hanna Klaudel, Robert-C. Riemann. 297-311 [doi]
- Polynomial-Time Manz-One Reductions for Petri NetsCatherine Dufourd, Alain Finkel. 312-326 [doi]
- Computing Reachability Properties Hidden in Finite Net UnfoldingsBurkhard Graves. 327-341 [doi]