Abstract is missing.
- Descriptive Complexity and Model CheckingNeil Immerman. 1-5
- Approximation Algorithms with Bounded Performance Guarantees for the Clustered Traveling Salesman ProblemNili Guttmann-Beck, Refael Hassin, Samir Khuller, Balaji Raghavachari. 6-17
- A Hamiltonian Approach to the Assignment of Non-reusable FrequenciesDimitris Fotakis, Paul G. Spirakis. 18-29
- Deadlock Sensitive Types for Lambda Calculus with ResourcesCarolina Lavatelli. 30-41
- On Encoding p-pi in m-piPaola Quaglia, David Walker. 42-53
- Improved Methods for Approximating Node Weighted Steiner Trees and Connected Dominating SetsSudipto Guha, Samir Khuller. 54-65
- Red-Black Prefetching: An Approximation Algorithm for Parallel Disk SchedulingMahesh Kallahalla, Peter J. Varman. 66-77
- A Synchronous Semantics of Higher-Order Processes for Modeling Reconfigurable Reactive SystemsJean-Pierre Talpin, David Nowak. 78-89
- Testing Theories for Asynchronous LanguagesIlaria Castellani, Matthew Hennessy. 90-101
- Alternative Computational Models: A Comparison of Biomolecular and Quantum ComputationJohn H. Reif. 102-121
- Optimal Regular Tree Pattern Matching Using Pushdown AutomataMaya Madhavan, Priti Shankar. 122-133
- Locating Matches of Tree Patterns in ForestsAndreas Neumann, Helmut Seidl. 134-145
- Benefits of Tree Transducers for Optimizing Functional ProgramsArmin Kühnemann. 146-157
- Implementable Failure Detectors in Asynchronous SystemsVijay K. Garg, J. Roger Mitchell. 158-169
- BRICS and Quantum Information ProcessingErik Meineche Schmidt. 170-173
- Martingales and Locality in Distributed ComputingDevdatt P. Dubhashi. 174-185
- Space Efficient Suffix TreesJ. Ian Munro, Venkatesh Raman, S. Srinivasa Rao. 186-196
- Formal Verification of an O. S. SubmoduleN. S. Pendharkar, K. Gopinath. 197-208
- Infinite Probabilistic and Nonprobabilistic TestingK. Narayan Kumar, Rance Cleaveland, Scott A. Smolka. 209-220
- On Generating Strong Elimination Orderings of Strongly Chordal GraphsN. Kalyana Rama Prasad, P. Sreenivasa Kumar. 221-232
- A Parallel Approximation Algorithm for Minimum Weight TriangulationJoachim Gudmundsson, Christos Levcopoulos. 233-244
- The Power of Reachability Testing for Timed AutomataLuca Aceto, Patricia Bouyer, Augusto Burgueño, Kim Guldstrand Larsen. 245-256
- Recursive Mean-Value CalculusParitosh K. Pandya, Y. S. Ramakrishna. 257-268
- Efficient Formal Verification of Hierarchical DescriptionsRajeev Alur. 269
- Proof Rules for Model Checking Systems with DataKenneth L. McMillan. 270
- Partial Order Reductions for Bisimulation CheckingMichaela Huhn, Peter Niebert, Heike Wehrheim. 271-282
- First-Order-CTL Model CheckingJürgen Bohn, Werner Damm, Orna Grumberg, Hardi Hungar, Karen Laster. 283-294
- On the Complexity of Counting the Number of Vertices Moved by Graph AutomorphismsAntoni Lozano, Vijay Raghavan. 295-306
- Remarks on Graph ComplexitySatyanarayana V. Lokam. 307-318
- On the Confluence of Trace Rewriting SystemsMarkus Lohrey. 319-330
- A String-Rewriting Characterization of Muller and Schupp s Context-Free GraphsHugues Calbrix, Teodor Knapik. 331-342
- Different Types of Monotonicity for Restarting AutomataPetr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel. 343-354
- A Kleene Iteration for ParallelismKamal Lodaya, Pascal Weil. 355-366
- Quantum Computation and InformationUmesh V. Vazirani. 367