Abstract is missing.
- Why Sometimes Probabilistic Algorithms Can Be More EffectiveFarid M. Ablayev, Rusins Freivalds. 1-14
- Recent Results in the Theory of Rational SetsJean Berstel, Jacques Sakarovitch. 15-28
- Partial Interpretations of Higher Order Algebraic Types (Extended Abstract)Manfred Broy. 29-43
- Kins of Context-Free LanguagesMichal Chytil. 44-58
- Algebraic Theory of Module Specification with ConstraintsHartmut Ehrig, Werner Fey, Francesco Parisi-Presicce, Edward K. Blum. 59-77
- A Semantical Model for Integration and Modularization of RulesPeter van Emde Boas. 78-92
- Parallel Arithmetic Computations: A SurveyJoachim von zur Gathen. 93-112
- An Approach to Proof CheckerKen Hirose. 113-127
- The Promise of Electronic PrototypingJohn E. Hopcroft. 128-139
- Systolic Arrays: Characterizations and ComplexityOscar H. Ibarra. 140-153
- Geometric Location Problems and Their ComplexityD. T. Lee. 154-167
- Developing Implicit Data StructuresJ. Ian Munro. 168-176
- Higher-Order Arrays and Stacks in Programming. An Application of Complexity Theory to Logics of ProgramsJerzy Tiuryn. 177-198
- Deterministic Simulation of Idealized Parallel Computers on More Realistic OnesHelmut Alt, Torben Hagerup, Kurt Mehlhorn, Franco P. Preparata. 199-208
- Relational Specifications and Observational SemanticsEgidio Astesiano, Gianna Reggio, Martin Wirsing. 209-217
- Efficient Testing of Optimal Time Adders (Extended Abstract)Bernd Becker. 218-229
- Properties of Complexity Measures for PRAMs and WRAMsSiegfried Bublitz, Ute Schürfeld, Bernd Voigt, Ingo Wegener. 230-238
- Iterative Systems of EquationsVirgil Emil Cazanescu. 239-246
- Polynomial Complexity of the Newton-Puiseux AlgorithmAlexander L. Chistov. 247-255
- Unique Deciperability for Partially Commutative Alphabet (Extended Abstract)Marek Chrobak, Wojciech Rytter. 256-263
- The Equivalence of Finite Valued Transducers (on HDTOL Languages) is DecidableKarel Culik II, Juhani Karhumäki. 264-272
- A Fast Parallel Algorithm for Six-Colouring of Planar Graphs (Extended Abstract)Krzysztof Diks. 273-282
- Quicksort Without a StackBranislav Durian. 283-289
- Towards an Efficient MergingS. Dvorák, Branislav Durian. 290-298
- Homomorphic Realizations of Automata with CompositionsZoltán Ésik, Pál Dömösi, Ferenc Gécseg, J. Virágh. 299-307
- Refined Bounds on the Complexity of Sorting and Selection in D-Dimensional SpaceThomas M. Fischer. 308-314
- On the Inherent Combinatorial Complexity of Geometric Problems in D-Dimensional SpaceThomas M. Fischer, K. Wolfrum. 315-324
- The Evolution of Two Stacks in Bounded Space and Random Walks in a TrianglePhilippe Flajolet. 325-340
- P-Genericity and Strong G-GenericityHans Fleischhack. 341-349
- Fibonacci Numeration Systems and Rational FunctionsChristiane Frougny. 350-359
- Safe Implementation Equivalence for Asynchronous Nondeterministic ProcessesB. Gammatie. 360-369
- Grammars with Context Dependency Restricted to SynchronizationViliam Geffert. 370-378
- Some Improved Parallelisms for GraphsA. Goralciková, Václav Koubek. 379-385
- A Complete Inference System for an Algebra or Regular Acceptance ModelsSusanne Graf. 386-395
- Nondeterministic Turing Machines with Modified AcceptanceThomas Gundermann, Gerd Wechsung. 396-404
- Remark on the Power of Compass (Extended Abstract)Armin Hemmerling. 405-413
- Regular Chain Code Picture Languages of Nonlinear Descriptional ComplexityFriedhelm Hinz. 414-421
- An Analysis of the Nonemptiness Problem for Classes of Reversal-Bounded Multicounter MachinesRodney R. Howell, Louis E. Rosier. 422-430
- A New Approach to Defining the Complexity for VLSIJuraj Hromkovic. 431-439
- Lower Bounds on the Complexity of Local Circuits (Preliminary Report)Stasys Jukna. 440-448
- Optimal Sorting of Seven Element SetsLubor Kollár. 449-457
- Undecidable Problems Concerning Generalized Pascal Triangles of Commutative AlgebrasIvan Korec. 458-466
- Regular Augmentation of Automata and Transducers (Extended Abstract)Václav Koubek, Antonín Ríha. 467-475
- On Some Types of Pseudo-Random SequencesIvan Kramosil. 476-483
- The Space Complexity of the Accessibility Problem for Undirected Graphs of Log N Bounded GenusKlaus Kriegel. 484-492
- An Alternative, Priority-Free, Solution to Post s ProblemAntonín Kucera. 493-500
- Near Optimal Algorithms for Finding Minimum Steiner Trees on Random GraphsLudek Kucera, Alberto Marchetti-Spaccamela, Marco Protasi, Maurizio Talamo. 501-511
- Matrix Systems and Principal Cones of Algebraic Power SeriesWerner Kuich. 512-517
- Two Characterizations of the Logarithmic Alternation HierarchyKlaus-Jörn Lange. 518-526
- p-Projection Reducibility and the Complexity Classes L(nonuniform) and NL(nonuniform)Christoph Meinel. 527-535
- A Proof System to Derive Evantually Properties Under Justice HypothesisDominique Méry. 536-544
- AL-Khowarizmi: A Formal System for Higher-Order Logic ProgrammingM. A. Nait Abdallah. 545-553
- One-Sided Dyck Reduction Over Two Letter Alphabet and Deterministic Context-Free LanguagesFabienne Romian, Jacques Sakarovitch. 554-563
- Model and Complexity of Termination for Distributed ComputationsBrigitte Rozoy. 564-572
- Complexity of Generalized Graph ColoringVladislav Rutenburg. 573-581
- The Parallel Complexity of Deadlock DetectionPaul G. Spirakis. 582-593
- The Centers of Context-Sensitive LanguagesLudwig Staiger, Werner Nehrlich. 594-601
- A Greedy Algorithm for Constructing Shortest Common SubstringsJorma Tarhio, Esko Ukkonen. 602-610
- The OI-Hierarchy is Closed under ControlHeiko Vogler. 611-619
- On the Degree of Ambiguity of Finite AutomataAndreas Weber, Helmut Seidl. 620-629
- Learning in Knowledge Based System, a Possibilistic ApproachZbigniew W. Ras, Maria Zemankova. 630-638
- Proofs that Release Minimum KnowledgeOded Goldreich, Silvio Micali, Avi Wigderson. 639-650