Abstract is missing.
- On Range Searching with Semialgebraic SetsPankaj K. Agarwal, Jirí Matousek. 1-13
- Graph Layout ProblemsJosep Díaz. 14-23
- Parallel Recognition and Ranking of Context-Free LanguagesKlaus-Jörn Lange, Peter Rossmanith, Wojciech Rytter. 24-36
- On the Expansion of Combinatorial PolytopesMilena Mihail. 37-49
- Neural Networks and Complexity TheoryPekka Orponen. 50-61
- Theory of Computation over Stream Algebras, and its ApplicationsJ. V. Tucker, Jeffery I. Zucker. 62-80
- Methods in Parallel Algorithmics (Abstract)Uzi Vishkin. 81
- On the Complexity of Small Description and Related TopicsOsamu Watanabe. 82-94
- Weak Parallel Machines: a New Class of Physically Feasible Parallel Machine ModelsJuraj Wiedermann. 95-111
- The Complexity of Graph ConnectivityAvi Wigderson. 112-132
- A Perfect Parallel DictionaryHolger Bast, Martin Dietzfelbinger, Torben Hagerup. 133-141
- Some Remarks on the Test Complexity of Iterative Logic ArraysBernd Becker, Joachim Hartmann. 142-152
- The Degree Structure of 1-L ReductionsHans-Jörg Burtschick, Albrecht Hoene. 153-161
- Promise Problems and Access to Unambiguous ComputationJin-yi Cai, Lane A. Hemachandra, Jozef Vyskoc. 162-171
- On the Complexity of Incremental ComputationSuresh Chari, Desh Ranjan, Pankaj Rohatgi. 172-180
- Rational Transductions and Complexity of Counting ProblemsChristian Choffrut, Massimiliano Goldwurm. 181-190
- Negation Elimination in Equational FormulaeHubert Comon, Maribel Fernández. 191-199
- Object InteractionJosé Félix Costa, Amílcar Sernadas, Cristina Sernadas, Hans-Dieter Ehrich. 200-208
- Strong Normalization of SubstitutionsPierre-Louis Curien, Thérèse Hardin, Alejandro Ríos. 209-217
- Probabilistic and Pluralistic Learners with Mind ChangesRobert P. Daley, Bala Kalyanasundaram. 218-226
- Parallel Complexity of Iterated Morphisms and the Arithmetic of Small NumbersCarsten Damm, Markus Holzer, Klaus-Jörn Lange. 227-235
- On Computational Power of Weighted Finite AutomataDenis Derencourt, Juhani Karhumäki, Michel Latteux, Alain Terlutte. 236-245
- The Shuffle Exchange Network has a Hamiltonian PathRainer Feldmann, Peter Mysliwietz. 246-254
- Poset Properties of Complex TracesPaul Gastin, Antoine Petit. 255-263
- A Threshold for UnsatisfiabilityAndreas Goerdt. 264-274
- Dataflow Semantics for Petri NetsRobert Gold. 275-283
- About Boundedness for some DATALOG and DATALOG_neg ProgramsIrène Guessarian, Marcos Veloso Peixoto. 284-297
- Merging and Sorting Strings in ParallelTorben Hagerup, Ola Petersson. 298-306
- Characterization of Context-Free Languages by Erasing AutomataPetr Jancar, Frantisek Mráz, Martin Plátek. 307-314
- Insertion and Deletion of Words: Determinism and ReversibilityLila Kari. 315-326
- Small Universal One-State Linear Operator AlgorithmFrantisek Kascak. 327-335
- Mobility in the CC-ParadigmCosimo Laneve, Ugo Montanari. 336-345
- The Emptiness Problem for Intersections of Regular LanguagesKlaus-Jörn Lange, Peter Rossmanith. 346-354
- On Finite Automata with Limited NondeterminismHing Leung. 355-363
- Definitions and Comparisons of Local Computations on GraphsIgor Litovsky, Yves Métivier, Eric Sopena. 364-373
- Efficient Unidimensional Universal Cellular AutomatonBruno Martin. 374-382
- Inferring a Tree from WalksOsamu Maruyama, Satoru Miyano. 383-391
- Almost Every Set in Exponential Time is P-Bi-ImmuneElvira Mayordomo. 392-400
- A Functorial Semantics for Observed ConcurrencyDavid Murphy, Axel Poigné. 401-411
- Modelling Concurrency with Semi-CommutationsEdward Ochmanski. 412-420
- Decision Problems for Cellular Automata and Their SemigroupsJohn Pedersen. 421-429
- On the Nature of EventsG. Michele Pinna, Axel Poigné. 430-441
- New Parallel Algorithms for Convex Hull and Triangulation in 3-Dimensional SpaceW. Preilowski, Elias Dahlhaus, Gerd Wechsung. 442-450
- Two Simple Characterizations of Well-Founded SemanticsTeodor C. Przymusinski. 451-462
- Fully Abstract Semantics for Higher Order Communicating SystemsS. Ramesh. 463-471
- Superposable Trellis AutomataNicolas Reimen. 472-482
- Maintaining Proximity in Higher Dimensional SpacesThomas Roos, Gerhard Albers. 483-493
- Characterizing Regular Languages with Polynomial DensitiesAndrew Szilard, Sheng Yu, Kaizhong Zhang, Jeffrey Shallit. 494-503
- A Strategy for Speeding-up the Computation of Characteristic SetsDongming Wang. 504-510
- One-Rule Trace-Rewriting Systems and ConfluenceCelia Wrathall, Volker Diekert, Friedrich Otto. 511-521