Abstract is missing.
- On Word Equations and Makanin s AlgorithmHabib Abdulrab, Jean-Pierre Pécuchet. 1-12
- Complexity Classes with Complete Problems Between P and NP-CCarme Àlvarez, Josep Díaz, Jacobo Torán. 13-24
- Interpretations of Synchronous Flowchart SchemesMiklós Bartha. 25-34
- Generalized Boolean Hierarchies and Boolean Hierarchies Over RP (Conference Abstract)Alberto Bertoni, Danilo Bruschi, Deborah Joseph, Meera Sitharam, Paul Young. 35-46
- The Equational Logic of Iterative ProcessesStephen L. Bloom. 47-57
- The Distributed Bit Complexity of the Ring: From the Anonymous to the Non-anonymous CaseHans Leo Bodlaender, Shlomo Moran, Manfred K. Warmuth. 58-67
- The Jump Number Problem for Biconvex Graphs and Rectangle Covers of Rectangular RegionsAndreas Brandstädt. 68-77
- Recent Developments in the Design of Asynchronous CircuitsJanusz A. Brzozowski, Jo C. Ebergen. 78-94
- New Simulations between CRCW PRAMsBogdan S. Chlebus, Krzysztof Diks, Torben Hagerup, Tomasz Radzik. 95-104
- About Connections Between Syntactical and Computational ComplexityJean-Luc Coquidé, Max Dauchet, Sophie Tison. 105-115
- Completeness in Approximation ClassesPierluigi Crescenzi, Alessandro Panconesi. 116-126
- Separating Completely Complexity Classes Related to Polynomial Size Omega-Decision TreesCarsten Damm, Christoph Meinel. 127-136
- On Product Hierarchies of AutomataPál Dömösi, Zoltán Ésik, Balázs Imreh. 137-144
- On the Communication Complexity of PlanarityPavol Duris, Pavel Pudlák. 145-147
- Context-Free NCE Graph GrammarsJoost Engelfriet. 148-161
- Dynamic Data Structures with Finite Population: A Combinatorial AnalysisJean Françon, B. Randrianarimanana, René Schott. 162-174
- Iterated Deterministic Top-Down Look-AheadZoltán Fülöp, Sándor Vágvölgyi. 175-184
- Using Generating Functions to Compute ConcurrencyDominique Geniet, Loÿs Thimonier. 185-196
- A Logic for Nondeterministic Functional Programs (Extended Abstract)Ana Gil-Luezas. 197-208
- Decision Problems and Coxeter GroupsBernd Graw. 209-223
- Complexity of Formula Classes in First Order Logic with FunctionsErich Grädel. 224-233
- Normal and Sinkless Petri NetsRodney R. Howell, Louis E. Rosier, Hsu-Chun Yen. 234-243
- Descriptive and Computational ComplexityNeil Immerman. 244-245
- The Effect of Null-Chains on the Complexity of Contact SchemesStasys Jukna. 246-256
- Monte-Carlo Inference and Its Relations to Reliable Frequency IdentificationEfim B. Kinber, Thomas Zeugmann. 257-266
- Semilinear Real-Time Systolic Trellis AutomataIvan Korec. 267-276
- Inducibility of the Composition of Frontier-to-Root Tree TransformationsTibor Kovács. 277-286
- On Oblivious Branching Programs of Linear Length (Extended Abstract)Matthias Krause, Stephan Waack. 287-296
- Some Time-Space Bounds for One-Tape Deterministic Turing MachinesMaciej Liskiewicz, Krzysztof Lorys. 297-307
- Rank of Rational Finitely Generated W-LanguagesIgor Litovsky. 308-317
- Extensional Properties of Sets of Time Bounded Complexity (Extended Abstract)Wolfgang Maass, Theodore A. Slaman. 318-326
- Learning Under Uniform DistributionAlberto Marchetti-Spaccamela, Marco Protasi. 327-338
- An Extended Framework for Default ReasoningM. A. Nait Abdallah. 339-348
- Logic Programming of Some Mathematical ParadoxesM. A. Nait Abdallah. 349-361
- Analysis of Compact 0-Complete Trees: A New Access Method to Large DatabasesRatko Orlandic, John L. Pfaltz. 362-371
- Representation of Recursively Enumerable Languages Using Alternating Finite Tree RecognizersKai Salomaa. 372-383
- About a Family of Binary Morphisms which Stationary Words are SturmianPatrice Séébold. 384-394
- On the Finite Degree of Ambiguity of Finite Tree AutomataHelmut Seidl. 395-404
- Approximation Algorithms for Channel Assignment in Cellular Radio NetworksHans-Ulrich Simon. 405-415
- The Borel Hierarchy is Infinite in the Class of Regular Sets of TreesJerzy Skurczynski. 416-423
- Parallel General Prefix Computations with Geometric, Algebraic and Other ApplicationsFrederick N. Springsteel, Ivan Stojmenovic. 424-433
- Kolmogorov Complexity and Hausdorff DimensionLudwig Staiger. 434-443
- Tree Language Problems in Pattern Recognition Theory (Extended Abstract)Magnus Steinby. 444-450
- The Computational Complexity of Cellular AutomataKlaus Sutner. 451-459
- On Restricted Boolean CircuitsGyörgy Turán. 460-469
- The Complexity of Connectivity Problems on Context-Free Graph Languages (Extended Abstract)Egon Wanke. 470-479
- Constructivity, Computability, and Computational Complexity in AnalysisKlaus Weihrauch. 480-493