Abstract is missing.
- LEDA: A Library of Efficient Data Types and AlgorithmsStefan Näher, Kurt Mehlhorn. 1-5
- A New Universal Class of Hash Functions and Dynamic Hashing in Real TimeMartin Dietzfelbinger, Friedhelm Meyer auf der Heide. 6-19
- A Complete and Decidable Proof System for Call-by-Value Equalities (Preliminary Report)Jon G. Riecke. 20-31
- Static Correctness of Hierarchical ProceduresMichael I. Schwartzbach. 32-45
- Generic Terms Having No Polymorphic TypesSophie Malecki. 46-59
- A Complete System of B-Rational IdentitiesDaniel Krob. 60-73
- On Non-Counting Regular ClassesAldo de Luca, Stefano Varricchio. 74-87
- Two-Way Automata with MultiplicityMarcella Anselmo. 88-102
- Omega-Continuous Semirings, Algebraich Systems and Pushdown AutomataWerner Kuich. 103-110
- Nondeterministic Computations in Sublogarithmic Space and Space ConstructibilityViliam Geffert. 111-124
- Normalizing and Accelerating RAM Computations and the Problem of Reasonable Space MeasuresJuraj Wiedermann. 125-138
- A Formal Study of Learning via QueriesOsamu Watanabe. 139-152
- Language Learning by a Team (Extended Abstract)Sanjay Jain, Arun Sharma. 153-166
- Functions as ProcessesRobin Milner. 167-180
- A Domain-Theoretic Model for a Higher-Order Process CalculusRadha Jagadeesan, Prakash Panangaden. 181-194
- Concurrency, Automata and DomainsManfred Droste. 195-208
- A Theory of Communicating Processes with Value-PassingMatthew Hennessy, Anna Ingólfsdóttir. 209-219
- Analytic Variations on the Common Subexpression ProblemPhilippe Flajolet, Paolo Sipala, Jean-Marc Steyaert. 220-234
- Can A Maximum Flow be Computed on o(nm) Time?Joseph Cheriyan, Torben Hagerup, Kurt Mehlhorn. 235-248
- On the Distributional Complexity of DisjontnessAlexander A. Razborov. 249-253
- Computing Boolean Functions on Anonymous NetworksEvangelos Kranakis, Danny Krizanc, Jacob van den Berg. 254-267
- On the Composition of Zero-Knowledge Proof SystemsOded Goldreich, Hugo Krawczyk. 268-282
- Additional Queries to Random and Pseudorandom OraclesRonald V. Book, Jack H. Lutz, Shouwen Tang. 283-293
- Communication among Relations (Extended Abstract)Alexander Moshe Rabinovich, Boris A. Trakhtenbrot. 294-307
- Stability and Sequentiality in Dataflow NetworksPrakash Panangaden, Vasant Shanbhogue, Eugene W. Stark. 308-321
- Automata For Modeling Real-Time SystemsRajeev Alur, David L. Dill. 322-335
- Markov Decision Processes and Regular Events (Extended Abstract)Costas Courcoubetis, Mihalis Yannakakis. 336-349
- Term Rewriting Systems: From Church-Rosser to Knuth-Bendix and BeyondJan Willem Klop. 350-369
- Nonoblivious Normalization Algorithms for Nonlinear Rewrite SystemsRakesh M. Verma, I. V. Ramakrishnan. 370-385
- Algebraic Properties of Idempotent SubstitutionsCatuscia Palamidessi. 386-399
- Determining the Separation of Preprocessed Polyhedra - A Unified ApproachDavid P. Dobkin, David G. Kirkpatrick. 400-413
- Randomized Incremental Construction of Delaunay and Voronoi DiagramsLeonidas J. Guibas, Donald E. Knuth, Micha Sharir. 414-431
- Merging Free Trees in Parallel for Efficient Voronoi Diagram Construction (Preliminary Version)Richard Cole, Michael T. Goodrich, Colm Ó Dúnlaing. 432-445
- Local Optimization and the Traveling Salesman ProblemDavid S. Johnson. 446-461
- Polynomial-Time Approximation Algorithms for Ising Model (Extended Abstract)Mark Jerrum, Alistair Sinclair. 462-475
- On Parallelizing Graph-Partitioning HeuristicsJohn E. Savage, Markus G. Wloka. 476-489
- Iterated Substitutions and Locally Catanative Systems: A Decidability Result in the Binary CaseChristian Choffrut. 490-500
- Decomposition of Partial CommutationsMireille Clerbout, Michel Latteux, Yves Roos. 501-511
- Boolean Closure and Unambiguity of Rational SetsMaryse Pelletier. 512-525
- Compositionality Through an Operational Semantics of ContextsKim Guldstrand Larsen, Liu Xinxin. 526-539
- Structural and Behavioural Equivalences of NetworksJoachim Parrow. 540-552
- Proving Partial Order Liveness PropertiesDoron Peled, Amir Pnueli. 553-571
- A Proof System for the Parallel Object-Oriented Language POOLFrank S. de Boer. 572-585
- A New Approach to Maximum Matching in General GraphsNorbert Blum. 586-597
- On-Line Graph Algorithms with SPQR-TreesGiuseppe Di Battista, Roberto Tamassia. 598-611
- On the Bit-Complexity of Discrete Solutions of PDEs: Compact MultigridVictor Y. Pan, John H. Reif. 612-625
- An Efficient Algorithm for Branching Bisimulation and Stuttering EquivalenceJan Friso Groote, Frits W. Vaandrager. 626-638
- Partial Evaluation, Self-Application and TypesNeil D. Jones. 639-659 [doi]
- Provable Computable Functions on Abstract Data TypesJ. V. Tucker, S. S. Wainer, Jeffery I. Zucker. 660-673
- Equational Formulas in Order-Sorted AlgebrasHubert Comon. 674-688
- An Input-Size/Output-Size Trade-Off in the Time-Complexity of Rectilinear Hidden Surface Removal (Preliminary Version)Michael T. Goodrich, Mikhail J. Atallah, Mark H. Overmars. 689-702
- Approximation of Convex PolygonsHelmut Alt, Johannes Blömer, Hubert Wagener. 703-716
- On the Rectilinear Art Gallery Problem (Extended Abstract)Frank Hoffmann. 717-728
- On Parallel Hashing and Integer Sorting (Extended Summary)Yossi Matias, Uzi Vishkin. 729-743
- The Parallel Simplicity of Compaction and ChainingPrabhakar Radge. 744-751
- The Importance of the Left Merge Operator in Process AlgebrasFaron Moller. 752-764
- Operational and Algebraic Semantics for Facile: A Symmetric Integration of Concurrent and Functional ProgrammingSanjiva Prasad, Alessandro Giacalone, Prateek Mishra. 765-778