Abstract is missing.
- Game Semantics for Programming Languages (Abstract)Samson Abramsky. 3-4
- Communication ComplexityLászló Babai. 5-18
- Treewidth: Algorithmoc Techniques and ResultsHans Leo Bodlaender. 19-36
- When are Two Rewrite Systems More than None?Nachum Dershowitz. 37-43
- Positive Applications of Lattices to CryptographyCynthia Dwork. 44-51
- A Tile-Based Coordination View of Asynchronous pi-CalculusGian Luigi Ferrari, Ugo Montanari. 52-70
- Communication Complexity and Sequential CompuationJuraj Hromkovic, Georg Schnitger. 71-84
- Lower Bounds for a Proof System with an Expentential Speed-up over Constant-Depth Frege Systems and over Polynomial CalculusJan Krajícek. 85-90
- Computational Limitations of Stochastic Turing Machines and Arthur-Merlin Games with Small Space BoundsMaciej Liskiewicz, Rüdiger Reischuk. 91-107
- Learning to Perform Knowledge-Intensive InferencesDan Roth. 108-109
- Resolution Proofs, Exponential Bounds, and Kolmogorov ComplexityUwe Schöning. 110-116
- The Expressiveness of Datalog Circuits (DAC)Foto N. Afrati, Irène Guessarian, Michel de Rougemont. 119-128
- The Complexity of Policy Evaluation for Finite-Horizon Partially-Observable Markov Decision ProcessesMartin Mundhenk, Judy Goldsmith, Eric Allender. 129-138
- A Category of Transition Systems and Its Relations with Orthomodular PosetsLuca Bernardinello, Lucia Pomello. 139-148
- Accepting Zeno Words Without Making Time Stand StillBéatrice Bérard, Claudine Picaronny. 149-158
- Complexity Theoretical Results on Partitioned (Nondeterministic) Binary Decision DiagramsBeate Bollig, Ingo Wegener. 159-168
- Specifying Computations Using Hyper Transition SystemsMarcello M. Bonsangue, Joost N. Kok. 169-178
- A Shift-Invariant Metric on S:::zz::: Inducing a Non-trivial TolologyGianpiero Cattaneo, Enrico Formenti, Luciano Margara, Jacques Mazoyer. 179-188
- Subtyping Calculus of Construction (Extended Abstract)Gang Chen. 189-198
- Distances Between Languages and Reflexivity of RelationsChristian Choffrut, Giovanni Pighizzini. 199-208
- Partial Characterization of Synchronization LanguagesIsabelle Ryl, Yves Roos, Mireille Clerbout. 209-218
- Integrating the Specification Techniques of Graph Transformation and Temporal LogicReiko Heckel, Hartmut Ehrig, Uwe Wolter, Andrea Corradini. 219-228
- On the Generation of Trees by Hyperedge ReplacementFrank Drewes. 229-238
- Regulations by ValencesHenning Fernau, Ralf Stiebe. 239-248
- Simulation as a Correct Transformation of Rewrite SystemsWan Fokkink, Jaco van de Pol. 249-258
- On the Dilation of Interval RoutingCyril Gavoille. 259-268
- Relating Conflict-Free Stable Transition and Event Models (Extended Abstract)Zurab Khasidashvili, John R. W. Glauert. 269-278
- The Giant Component Threshold for Random Regular Graphs with Edge FaultsAndreas Goerdt. 279-288
- A Topological Generalization of Propositional Linear Time Temporal LogicBernhard Heinemann. 289-297
- Multi-Head Finite Automata: Data-Independent Versus Data-Dependent ComputationsMarkus Holzer. 299-308
- Complexity of Finding Short Resolution ProofsKazuo Iwama. 309-318
- On O versus NP /cap co-NP for Decision Trees and Read-Once Branching ProgramsStasys Jukna, Alexander A. Razborov, Petr Savický, Ingo Wegener. 319-326
- A Characterization of Abstract Families of Algebraic Power SeriesGeorg Karner, Werner Kuich. 327-336
- Repetitiveness of D0L-Languages Is Decidable in Polynomial TimeYuji Kobayashi, Friedrich Otto. 337-346
- Minimal Letter Frequency in n-th Power-Free Binary WordsRoman M. Kolpakov, Gregory Kucherov. 347-357
- Real-Time Generation of Primes by a One-Dimensional Cellular Automaton with 11 StatesIvan Korec. 358-367
- Optimal Algorithms for Complete Linkage Clustering in d DimensionsDrago Krznaric, Christos Levcopoulos. 368-377
- Invertible Linear Cellular Automata over z::m::: Algorithmic and Dynamical AspectsGiovanni Manzini, Luciano Margara. 378-387
- Two-Level Contextual Grammars: The Internal CaseCarlos Martín-Vide, Joan Miquel-Verges, Gheorghe Paun. 388-397
- Counting Problems over the RealsKlaus Meer. 398-407
- On the Influence of the State Encoding on OBDD-Representations of Finite State MachinesChristoph Meinel, Thorsten Theobald. 408-417
- Decomposition of TrPTL FormulasRaphaël Meyer, Antoine Petit. 418-427
- NP-Hard Sets Have Many Hard InstancesMartin Mundhenk. 428-437
- Deciding Verbose Languages with Linear AdviceArfst Nickelsen. 438-447
- Homomorphic Images os Sentential Forms and Terminating Grammars (Extended Abstract)Holger Petersen. 448-457
- Simplification Orders for Term Graph RewritingDetlef Plump. 458-467
- Dependency-Based Action RefinementArend Rensink, Heike Wehrheim. 468-477
- A Hierarchy for (1, +k)-Branching Programs with Respect of kPetr Savický, Stanislav Zák. 478-487
- Routing with Finite Speeds of Memory and NetworkJop F. Sibeyn. 488-497
- Queries and Algorithms Computable by Polynomial Time Existential Reflective Machines (Extended Abstract)Jerzy Tyszkiewicz. 498-507
- Partial Order Semantics and Read ArcsWalter Vogler. 508-517