Abstract is missing.
- On-Line Addition in Real BaseChristiane Frougny. 1-11
- Query Languages for Real Number Databases Based on Descriptive Complexity over RKlaus Meer. 12-22
- The Arithmetical Hierarchy of Real NumbersXizhong Zheng, Klaus Weihrauch. 23-33
- Invited Lecture: The Burrows-Wheeler Transform: Theory and PracticeGiovanni Manzini. 34-47
- Efficiency of Fast Parallel Pattern Searching in Highly Compressed TextsLeszek Gasieniec, Alan Gibbons, Wojciech Rytter. 48-58
- Computing and Comparing Semantics of Programs in Four-Valued LogicsYann Loyer, Nicolas Spyratos, Daniel Stamate. 59-69
- Foundations of Modular SOSPeter D. Mosses. 70-80
- Message Sequence Graphs and Decision Problems on Mazurkiewicz TracesAnca Muscholl, Doron Peled. 81-91
- On the Complexity of Recognizing the Hilbert Basis of a Linear Diophantine SystemArnaud Durand, Miki Hermann, Laurent Juban. 92-102
- The Complexity of the Extended GCD ProblemGeorge Havas, Jean-Pierre Seifert. 103-113
- Complexity Results for Confluence ProblemsMarkus Lohrey. 114-124
- Is Your Model Checker on Time? On the Complexity of Model Checking for Timed Modal LogicsLuca Aceto, François Laroussinie. 125-136
- Clausal Resolution for CTL:::*:::Alexander Bolotov, Clare Dixon, Michael Fisher. 137-148
- Model Checking and Higher-Order RecursionHardi Hungar. 149-159
- Multiparty Communication Complexity: Very Hard FunctionsJán Manuch. 160-169
- New Perspectives in Distributed ComputingMaurice Herlihy, Sergio Rajsbaum. 170-186
- An Improved Disjunctive Strictness Analysis for Lazy Functional LanguagesGrzegorz Grudzinski. 187-197
- Unique Fixed Point Induction for McCarthy s AmbSøren B. Lassen, Andrew Moran. 198-208
- On Some Topological Properties of Linear Cellular AutomataLuciano Margara. 209-219
- Real-Time Language Recognition by One-Way and Two-Way Cellular AutomataKatsuhiko Nakamura. 220-230
- Average State Complexity of Operations on Unary AutomataCyril Nicaud. 231-240
- Fooling Rebound AutomataHolger Petersen. 241-250
- The Complexity of Minimizing FBDDsDetlef Sieling. 251-261
- Efficient Strongly Universal and Optimally Universal HashingPhilipp Woelfel. 262-272
- Lower and Upper Bounds for the Problem of Page Replication in Ring NetworksWlodzimierz Glazek. 273-283
- Language-Based SecurityDexter Kozen. 284-298
- An Algebraic Approach to Knowledge RepresentationJanis Cirulis. 299-309
- On the Structure of the Monadic Logic of the Binary TreeDavid Janin, Giacomo Lenzi. 310-320
- A New Space Bound for the Modal Logics K4, KD4 and S4Linh Anh Nguyen. 321-331
- On Approximating the Number of Bases of Exchange Preserving MatroidsAnna Gambin. 332-342
- The Semantic Foundations of a Compositional Proof Method for Synchronously Communicating ProcessesFrank S. de Boer, Willem P. de Roever, Ulrich Hannemann. 343-353
- On Plain and Hereditary History-Preserving BisimulationSibylle B. Fröschle, Thomas T. Hildebrandt. 354-365
- Approximating Weak Bisimulation on Basic Process AlgebrasJitka Stríbrná. 366-375
- Edge Coloring of Bipartite Graphs with ConstraintsIoannis Caragiannis, Christos Kaklamanis, Pino Persiano. 376-386
- An Efficient Exact Algorithm for Constraint Bipartite Vertex CoverHenning Fernau, Rolf Niedermeier. 387-397
- On Minimum Edge Ranking Spanning TreesKazuhisa Makino, Yushi Uno, Toshihide Ibaraki. 398-409
- Football Elimination Is Hard to Decide Under the 3-Point-RuleThorsten Bernholt, Alexander Gülich, Thomas Hofmeister, Niels Schmitt. 410-418
- Generalized Regular Counting ClassesUlrich Hertrampf. 419-429
- A Foundation of Programming a Multi-tape Quantum Turing MachineTomoyuki Yamakami. 430-441
- A Type Discipline for Solving Year 2000 Problems in COBOL ProgramsMads Tofte. 442
- Type Reconstruction for Functional Programs with Subtyping over a Lattice of Atomic TypesJerzy Tiuryn. 443-453