Abstract is missing.
- A Linear-Time Recognition Algorithm for P::4::-Reducible GraphsBeverly Jamison, Stephan Olariu. 1-19
- Fast Parallel Approximations of hte Maximum Weighted Cut Problem through DerandomizationGrammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis. 20-29
- A New Class of Separators and Planarity of Chordal GraphsP. Sreenivasa Kumar, C. E. Veni Madhavan. 30-43
- Optimal Parallel Algorithms on Circular-Arc GraphsA. Srinivasa Rao, C. Pandu Rangan. 44-55
- Algebraic Properties of The Space of Multivalued and Paraconsistent Logic ProgramsV. S. Subrahmanian. 56-67
- An Autoepistemic Logical View of Knowledge BaseY. J. Jiang. 68-77
- A Natural Semantics for Logic Programs with NegationPhan Minh Dung, Kanchana Kanchanasut. 78-88
- A Transformation System for Deductive Database Modules with Perfect Model SemanticsMichael J. Maher. 89-98
- An Efficient Distributed Algorithm for Finding Articulation Points, Bridges, and Biconnected Components in Asynchronous NetworksMohan Ahuja, Yahui Zhu. 99-108
- Impossibility Results in the Presence of Multiple Faulty Processes (Preliminary Version)Gadi Taubenfeld, Shmuel Katz, Shlomo Moran. 109-120
- An Adaptive Regulator Approach for the Design of Load Sharing AlgorithmsFlavio Bonomi, Peter J. Fleming, P. Steinberg. 121-130
- An Algebraic Compositional Semantics of an Object Oriented Notation with ConcurrencyRuth Breu, Elena Zucca. 131-142
- An Axiomatization of Event StructuresMadhavan Mukund, P. S. Thiagarajan. 143-160
- Deducing Causal Relationships in CCSJeremy Gunawardena. 161-170
- Annotated Program TransformationsVictor N. Kasyanov. 171-180
- Algebraic Software Development Concepts for Module and Configuration FamiliesHartmut Ehrig, Werner Fey, Horst Hansen, Michael Löwe, Dean Jacobs. 181-192
- On the Limitations of Locally Robust Positive ReductionsLane A. Hemachandra, Sanjay Jain. 193-203
- Query Evaluation with Null Values: How Complex is Completeness?V. S. Lakshmanan. 204-222
- Average Case Complexity Analysis of RETE Pattern-Match Algorithm and Average Size of Join in DatabaseLuc Albert. 223-241
- The Frobenius ProblemRavi Kannan. 242-251
- An Efficient Implicit Data Structure for Path Testing and Searching in Rooted Trees and ForestsGiorgio Gambosi, Marco Protasi, Maurizio Talamo. 252-266
- Robust Decompositions of PolyhedraChandrajit L. Bajaj, Tamal K. Dey. 267-279
- Gate Matrix Layout Revisited: Algorithmic Performance and Probabilistic AnalysisSajal K. Das, Narsingh Deo, Sushil K. Prasad. 280-290
- Parallel Parsing on a One-way Linear Array of Finite-State MachinesOscar H. Ibarra, Tao Jiang, Hui Wang. 291-300
- Energy-Time Trade-offs in VLSI ComputationAkhilesh Tyagi. 301-311
- Time and Real-time in ProgramsMathai Joseph. 312-324
- A Proof System for Communicating Processes with Value-passing (Extended Abstract)Matthew Hennessy. 325-339