Abstract is missing.
- A Logical Operational Semantics of Full Prolog, Part II: Built-in Predicates for Database ManipulationEgon Börger. 1-14
- Syntactic TheoriesJean-Pierre Jouannaud. 15-25
- On Kleene Algebras and Closed SemiringsDexter Kozen. 26-47
- Interactive Computations of Optimal SolutionsJan Krajícek, Pavel Pudlák, Jiri Sgall. 48-60
- Restricted Branching Programs and Their Computational PowerChristoph Meinel. 61-75
- Dynamic Hashing StrategiesFriedhelm Meyer auf der Heide. 76-87
- One-Way Functions in Complexity TheoryAlan L. Selman. 88-104
- Type Inference Problems: A SurveyJerzy Tiuryn. 105-120
- Counting the Number of SolutionsJacobo Torán. 121-134
- Implementation of Parallel Graph Reduction by Explicit Annotation and Program TransformationWillem G. Vree. 135-151
- Interrogative Complexity of omega-Languages RecognitionMaris Alberts. 152-157
- On the Power of Uniform Families of Constant Depth Treshold CircuitsEric Allender, Ulrich Hertrampf. 158-164
- Separating Sets of HyperrectanglesFabrizio d Amore, Paolo Giulio Franciosa. 165-172
- On Preemptive Scheduling of Periodic, Real-Time Tasks on One ProcessorSanjoy K. Baruah, Rodney R. Howell, Louis E. Rosier. 173-179
- Retractions in Comparing Prolog Semantics (Extended Abstract)Arie de Bruin, Erik P. de Vink. 180-186
- Using Inductive Counting to Simulate Nondeterministic ComputationGerhard Buntrock, Lane A. Hemachandra, Dirk Siefkes. 187-194
- Some Properties of Zerotesting Bounded One-Way Multicounter MachinesIvana Cerná. 195-201
- On Fast Algorithms for Two ServersMarek Chrobak, Lawrence L. Larmore. 202-208
- Decomposition of Semi CommutationsMireille Clerbout, D. Gonzalez. 209-216
- Parallel Construction of Minimal Suffix and Factor AutomataMaxime Crochemore, Wojciech Rytter. 217-223
- Affine Automata: A Technique to Generate Complex ImagesKarel Culik II, Simant Dube. 224-231
- The Complexity of Symmetric Functions in Parity Normal FormsCarsten Damm. 232-238
- Event Structures, Causal Trees, and RefinementsPhilippe Darondeau, Pierpaolo Degano. 239-245
- Query Languages which Express all PTIME Queries for Trees and Unicyclic GraphsPratul Dublish, S. N. Maheshwari. 246-253
- Comparisons Among Classes of Y-Tree Systolic AutomataEmanuela Fachini, Andrea Maggiolo-Schettini, Davide Sangiorgi. 254-260
- On Checking Versus Evaluation of Multiple QueriesWilliam I. Gasarch, Lane A. Hemachandra, Albrecht Hoene. 261-268
- Generalized Kolmogorov Complexity in Relativized Separations (Extended Abstract)Ricard Gavaldà, Leen Torenvliet, Osamu Watanabe, José L. Balcázar. 269-276
- A First-Order Logic for Partial Recursive FunctionsAntonio Gavilanes-Franco. 277-284
- Speed-Up Theorem Without Tape CompressionViliam Geffert. 285-291
- On Possibilities of One-Way Synchronized and Alternating AutomataDainis Geidmanis. 292-299
- Unrestricted Resolution versus N-ResolutionAndreas Goerdt. 300-305
- Quality Criteria for Partial Order Semantics of Place/Transition-NetsRobert Gold, Walter Vogler. 306-312
- Tree-Stack AutomataWolfgang Golubski, Wolfram-Manfred Lippe. 313-321
- Specification & Verification of Higher Order ProcessesMichael R. Hansen, Zhou Chaochen. 322-328
- The Membership Problem for Context-Free Chain Code Picture LanguagesFriedhelm Hinz. 329-336
- Optimal Algorithms for Dissemination of Information in Some Interconnection Networks (Extended Abstract)Juraj Hromkovic, Claus-Dieter Jeschke, Burkhard Monien. 337-346
- A Hierarchy of Compositional Models of I/O-Automata (Extended Abstract)Bengt Jonsson. 347-354
- Minimal Nontrivial Space Complexity of Probabilistic One-Way Turing MachinesJanis Kaneps, Rusins Freivalds. 355-361
- On the Complexity of Genuinely Polynomial ComputationMarek Karpinski, Friedhelm Meyer auf der Heide. 362-368
- Pumping Lemmas for Tree Languages Generated by Rewrite SystemsEmmanuel Kounalis. 369-377
- Vector Language: Simple Description of Hard Instances (Extended Abstract)Miroslaw Kowaluk, Klaus W. Wagner. 378-384
- Separating +L From L, NL, co-NL and AL (=P) for Oblivious Turing Machines of Linear Access TimeMatthias Krause. 385-391
- The Use of Graphs of Elliptical Influence in Visuel Hierarchical ClusteringMirko Krivánek. 392-398
- Characterizing Unambiguous Augmented Pushdown Automata by CircuitsKlaus-Jörn Lange, Peter Rossmanith. 399-406
- Rational omega-TransductionsMichel Latteux, Erick Timmerman. 407-415
- Splitsort - An Adaptive Sorting AlgorithmChristos Levcopoulos, Ola Petersson. 416-422
- Equational Calculi for Many-Sorted Algebras with Empty Carrier SetsVincenzo Manca, Antonino Salibra. 423-429
- Semi-Commutation and Deterministic Petri NetsEdward Ochmanski. 430-438
- Internal Labellings in Lambda-CalculusMichel Parigot. 439-445
- A Sup-Preserving Completion of Ordered Partial AlgebrasAna Pasztor. 446-456
- ATIME(N) is Closed Under CountingMarek Priotrów. 457-463
- Investigation of Finitary Calculi for the Temporal Logics by Means of Infinitary CalculiRegimantas Pliuskevicius. 464-469
- Typed Horn LogicAxel Poigné. 470-477
- Results on the Glory of the PastIldikó Sain. 478-484
- A Stronger Version of Parikh TheoremPham Huu Uyen. 485-491
- The Parallel Complexity of Some Constructions in Combinatorial Group Theory (Abstract)Stephan Waack. 492-498
- Gentzen Type Axiomatizations for PALIgor Walukiewicz. 499-507
- Distance Automata Having Large Finite Distance or Finite AmbiguityAndreas Weber. 508-515
- Bottom-Up-Heap Sort, a New Variant of Heap Sort Beating on Average Quick Sort (if n is not very small)Ingo Wegener. 516-522
- Symmetric Functions in AC:::0:::A Can Be Computed in Constant Depth With Very Small SizeIngo Wegener, Norbert Wurm, Sang-Zin Yi. 523-529
- The k-section of Treewidth Restricted GraphsManfred Wiegers. 530-537
- Computing Large Polynomial Powers Very Fast in ParallelThomas Zeugmann. 538-544