Abstract is missing.
- The Nature and Meaning of Perturbations in Geometric ComputingRaimund Seidel. 3-17
- One Binary Horn Clause is EnoughPhilippe Devienne, Patrick Lebègue, Jean-Christophe Routier, Jörg Würtz. 21-32
- Transforming Constraint Logic ProgramsN. Bensaou, Irène Guessarian. 33-46
- A Hierarchy of Temporal Logics with Past (Extended Abstract)François Laroussinie, Ph. Schnoebelen. 47-58
- The Complexity of Resource-Bounded First-Order Classical LogicJean Goubault. 59-70
- Two Proof Procedures for a Cardinality Based Language in Propositional CalculusBelaid Benhamou, Lakhdar Sais, Pierre Siegel. 71-82
- The Alternation Hierarchy for Machines with Sublogarithmic Space is InfiniteBurchard von Braunmühl, Romain Gengler, Robert Rettinger. 85-96
- Quasilinear Time Complexity TheoryAshish V. Naik, Kenneth W. Regan, D. Sivakumar. 97-108
- Space-Efficient Deterministic Simulation of Probabilistic Automata (Extended Abstract)Ioan I. Macarie. 109-122
- Reachability and the Power of Local OrderingKousha Etessami, Neil Immerman. 123-135
- Are Parallel Machines Always Faster than Sequential Machines? (Preliminary Version)Louis Mak. 137-148
- Ground Reducibility and Automata with Disequality ConstraintsHubert Comon, Florent Jacquemard. 151-162
- Perpetuality and Strong Normalization in Orthogonal Term Rewriting SystemsZurab Khasidashvili. 163-174
- About Changing the Ordering During Knuth-Bendix CompletionAndrea Sattler-Klein. 175-186
- Combination of Matching AlgorithmsChristophe Ringeissen. 187-198
- Periodic Constant Depth Sorting NetworksMarcin Kik, Miroslaw Kutylowski, Grzegorz Stachowiak. 201-212
- Optimal Pattern Matching on MeshesBogdan S. Chlebus, Leszek Gasieniec. 213-224
- Faster Sorting and Routing on Grids with DiagonalsManfred Kunde, Rolf Niedermeier, Peter Rossmanith. 225-236
- Deterministic 1-k Routing on MeshesJop F. Sibeyn, Michael Kaufmann. 237-248
- A Unifying Type-Theoretic Framework for ObjectsMartin Hofmann, Benjamin C. Pierce. 251-262
- Operational Specifications with Built-InsJürgen Avenhaus, Klaus Becker. 263-274
- Reactive Variables for System Specification and DesignE. Pascal Gribomont, Jacques Hagelstein. 275-286
- A New Parallel Vector Model, with Exact Characterization of NC^kKenneth W. Regan. 289-300
- On Adaptive Dlogtime and Polylogtime Reductions (Extended Abstract)Carme Àlvarez, Birgit Jenner. 301-312
- NC^k(NP) = AC^(k-1)(NP)Mitsunori Ogiwara. 313-324
- Hypertransition SystemsAndré Arnold. 327-338
- On the Star Operation and the Finite Power Property in Free Partially Commutative Monoids (Extended Abstract)Yves Métivier, Gwénaël Richomme. 341-352
- Coding with TracesVéronique Bruyère, Clelia de Felice, Giovanna Guaiana. 353-364
- Monadic Second-Order Logic Over Pictures and Recognizability by Tiling SystemsDora Giammarresi, Antonio Restivo, Sebastian Seibert, Wolfgang Thomas. 365-375
- q-Grammars: Results, ImplementationMaylis Delest, Jean-Philippe Dubernard. 377-388
- A Topology for Complete SemiringsGeorg Karner. 389-400
- The Global Power of Additional Queries to Random OraclesRonald V. Book, Jack H. Lutz, David M. Martin Jr.. 403-414
- Cook Versus Karp-Levin: Separating Completeness Notions if NP Is not Small (Extended Abstract)Jack H. Lutz, Elvira Mayordomo. 415-426
- On Sets Bounded Truth-Table Reducible to P-selective SetsThomas Thierauf, Seinosuke Toda, Osamu Watanabe. 427-438
- Two Refinements of the Polynomial HierarchtVictor L. Selivanov. 439-448
- On Different Reducibility Notions for Function ClassesHeribert Vollmer. 449-460
- Optimal Parallelization of Las Vegas AlgorithmsMichael Luby, Wolfgang Ertel. 463-474
- Efficient Parallel Algorithms for Geometric k-Clustering ProblemsAmitava Datta. 475-486
- A Simple Optimal Parallel Algorithm for Reporting Paths in a TreeAnil Maheshwari, Andrzej Lingas. 487-495
- Parallel Detection of all Palindromes in a StringAlberto Apostolico, Dany Breslauer, Zvi Galil. 497-506
- On the Structure of Parameterized Problems in NP (Extended Abstract)Liming Cai, Jianer Chen, Rodney G. Downey, Michael R. Fellows. 509-520
- On the Approximability of Finding Maximum Feasible Subsystems of Linear SystemsEdoardo Amaldi, Viggo Kann. 521-532
- On the Acceptance Power of Regular LanguagesBernd Borchert. 533-541
- Complexity Classes with Finite Acceptance TypesUlrich Hertrampf. 543-553
- The Complete Axiomatization of Cs-congruenceJoachim Parrow, Peter Sjödin. 557-568
- Transition System Specifications in Stalk Formal with Bisimulation as a CongruenceVincent van Oostrom, Erik P. de Vink. 569-580
- Decidability Questions for Bismilarity of Petri Nets and Some Related ProblemsPetr Jancar. 581-592
- The Variable Membership Problem: Succinctness Versus ComplexityGerhard Buntrock, Krzysztof Lorys. 595-606
- Economy of Description for Single-valued TransducersAndreas Weber, Reinhard Klemm. 607-618
- Automaticity: Properties of a Measure of Descriptional ComplexityJeffrey Shallit, Yuri Breitbart. 619-630
- Towards a Theory of Recursive StructuresDavid Harel. 633-645
- Finding Minimal Generalizations for Unions of Pattern Languages and Its Application to Inductive Inference from Positive DataHiroki Arimura, Takeshi Shinohara, Setsuko Otsuki. 649-660
- Nondeterminism in PatternsAlexandru Mateescu, Arto Salomaa. 661-668
- Upper Bounds for the Expected Length of a Longest Common Subsequence of Two Binary SequencesVlado Dancík, Mike Paterson. 669-678
- The Ambiguity of Primitive WordsH. Petersen. 679-690
- On Codes Having no Finite CompletionNguyen Huong Lam. 691-698
- A New Approach To Information TheoryRichard J. Lipton. 699-708
- On Voronoi Diagrams in the L_p-Metric in Higher DimensionsNgoc-Minh Lê. 711-722
- Total Protection of Analytic Invariant Information in Cross Tabulated TablesMing-Yang Kao. 723-734
- Dominating Cliques in Graphs with Hypertree StructuresFeodor F. Dragan, Andreas Brandstädt. 735-746
- On Vertex Ranking for Permutations and Other GraphsJitender S. Deogun, Ton Kloks, Dieter Kratsch, Haiko Müller. 747-758
- Finding All Minimal Separators of a GraphTon Kloks, Dieter Kratsch. 759-768
- On the Complexity of the Maximum Cut ProblemHans Leo Bodlaender, Klaus Jansen. 769-780