Abstract is missing.
- A Note on the Almost-Everywhere Hierarchy for Nondeterministic TimeEric Allender, Richard Beigel, Ulrich Hertrampf, Steven Homer. 1-11
- The Ring of k-Regular SequencesJean-Paul Allouche, Jeffrey Shallit. 12-23
- Minimal Pairs and Complete ProblemsKlaus Ambos-Spies, Steven Homer, Robert I. Soare. 24-36
- Hiding Instances in Multioracle QueriesDonald Beaver, Joan Feigenbaum. 37-48
- Counting Classes: Thresholds, Parity, Mods, and FewnessRichard Beigel, John Gill, Ulrich Hertrampf. 49-57
- Playing Games of Incomplete InformationJin-yi Cai, Anne Condon, Richard J. Lipton. 58-69
- Caterpillars and Context-Free LanguagesMichal Chytil, Burkhard Monien. 70-81
- Semi-Commutations and Algebraic LanguagesMireille Clerbout, Yves Roos. 82-94
- Towards a Process Semantics in the Logic Programming StyleAndrea Corradini, Ugo Montanari. 95-108
- Parallel Computations on Strings and ArraysMaxime Crochemore, Wojciech Rytter. 109-125
- Minimum Vertex Hulls for Polyhedral DomainsGautam Das, Deborah Joseph. 126-137
- Combinatorial Rewriting on TracesVolker Diekert. 138-151
- Kolmogorov Complexity, Restrited Nondeterminism and Generalized SpectraDeborah Joseph, Meera Sitharam. 152-164
- Relation-Sorted Algebraic Specifications with Built-in Coercers: Basic Notions and ResultsHans-Jörg Kreowski, Zhenyu Qian. 165-175
- Computational Power of One-Way Multihead Finite AutomataMiroslaw Kutylowski. 176-187
- Updating Almost Complete Trees or One Level Makes All the DifferenceTony W. Lai, Derick Wood. 188-194
- Sorting the Sums (xi+yj) in O(n²) ComparisonsJean-Luc Lambert. 195-206
- Efficient Checking of ComputationsRichard J. Lipton. 207-215
- Hard Promise Problems and Nonuniform ComplexityLuc Longpré, Alan L. Selman. 216-226
- On the Construction of Abstract Voronoi DiagramsKurt Mehlhorn, Stefan Meiser, Colm Ó Dúnlaing. 227-239
- Approximation of Convex Figures by Pairs of RectanglesOtfried Schwarzkopf, Ulrich Fuchs, Günter Rote, Emo Welzl. 240-249
- Nonblocking Graphs: Greedy Algorithms to Compute Disjoint PathsAndreas Schwill. 250-262
- Infinite Trees and Automaton Definable Relations over Omega-WordsWolfgang Thomas. 263-277
- Enumerative Combinatorics and Computer ScienceXavier Gérard Viennot. 278-284
- Failures Semantics Based on Interval Semiwords is a Congruence for RefinementWalter Vogler. 285-297
- The Analysis of Local Search Problems and Their HeuristicsMihalis Yannakakis. 298-311