Abstract is missing.
- New Trends in Quantum ComputingGilles Brassard. 3-10
- Compressibility and Resource Bounded MeasureHarry Buhrman, Luc Longpré. 13-24
- On the Complexity of Random Strings (Extended Abstract)Martin Kummer. 25-36
- Remarks on Generalized Post Correspondence ProblemTero Harju, Juhani Karhumäki, Daniel Krob. 39-48
- Cyclic Languages and Strongly Cyclic LanguagesMarie-Pierre Béal, Olivier Carton, Christophe Reutenauer. 49-59
- Resource-Bounded Balanced Genericity, Stochasticity and Weak RandomnessKlaus Ambos-Spies, Elvira Mayordomo, Yongge Wang, Xizhong Zheng. 63-74
- The Complexity of Generating and Checking Proffs of MembershipHarry Buhrman, Thomas Thierauf. 75-86
- Observations on Measure and Lowness for Delta^P_2Jack H. Lutz. 87-97
- Solvable Black-Box Group Problems Are Low for PPVikraman Arvind, N. V. Vinodchandran. 99-110
- Languages Recognized by Finite Aperiodic GroupoidsMartin Beaudry. 113-124
- Star-Height of an N-Rational SeriesFrédérique Bassino. 125-135
- An Aperiodic Set of Wang CubesKarel Culik II, Jarkko Kari. 137-146
- Lyndon Factorization of Infinite WordsGuy Melançon. 147-154
- Embedding Graphs with Bounded Treewidth into Optimal HypercubesVolker Heun, Ernst W. Mayr. 157-168
- Parallel Comparability Graph Recognition and Modular DecompositionMichel Morvan, Laurent Viennot. 169-180
- Fault-Tolerant Shared Memory SimulationsPetra Berenbrink, Friedhelm Meyer auf der Heide, Volker Stemann. 181-192
- On Word-Level Parallelism in Fault-Tolerant ComputingPiotr Indyk. 193-204
- Learning with ConfidenceJanis Barzdins, Rusins Freivalds, Carl H. Smith. 207-218
- Extracting Best Consensus Motifs from Positive and Negative ExamplesErika Tateishi, Osamu Maruyama, Satoru Miyano. 219-230
- PAC Learning with Simple ExamplesFrançois Denis, Cyrille D Halluin, Rémi Gilleron. 231-242
- General Inductive Inference Types Based on Linearly-Ordered SetsAndris Ambainis, Rusins Freivalds, Carl H. Smith. 243-253
- On the Power of Non-Observable Actions in Timed AutomataBéatrice Bérard, Paul Gastin, Antoine Petit. 257-268
- Trace Rewriting: Computing Normal Forms in Time O(n log n)Michael Bertol, Volker Diekert. 269-280
- A Decision Procedure for Well-Formed Linear Quantum Cellular AutomataChristoph Dürr, Huong Lê Thanh, Miklos Santha. 281-292
- On the Complexity of Worst Case and Expected Time in a CircuitAndreas Jakoby, Christian Schindelhauer. 295-306
- On the Existence of Hard Sparse Sets under Weak ReductionsJin-yi Cai, Ashish V. Naik, D. Sivakumar. 307-318
- Optimal Bounds on the Approximation of Boolean Functions with Consequences on the Concept of HardwareAlexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim. 319-330
- Fine Separation of Average Time Complexity ClassesJin-yi Cai, Alan L. Selman. 331-343
- Compositional Specification of Timed Systems (Extended Abstract)Joseph Sifakis, Sergio Yovine. 347-359
- Optimal Tree-Based One-Time Digital Signature SchemesDaniel Bleichenbacher, Ueli M. Maurer. 363-374
- The Action of a Few Random Permutations on r-Tuples and an Application to CryptographyJoel Friedman, Antoine Joux, Yuval Roichman, Jacques Stern, Jean-Pierre Tillich. 375-386
- A Unified and Generalized Treatment of Authentification TheoryUeli M. Maurer. 387-398
- Monadic Second Order Logic on Tree-Like StructuresIgor Walukiewicz. 401-413
- On Bijections vs. Unary FunctionsThomas Schwentick. 415-426
- The 3 Frenchmen Method Proves Undecidability of the Uniform Boundedness for Single Recursive Rule Ternary DATALOG ProgramsJerzy Marcinkowski. 427-438
- A Combinatorial Design Approach to MAXCUTThomas Hofmeister, Hanno Lefmann. 441-452
- Characterizing the Complexity of Subgraph Isomorphism for Graphs of Bounded Path-WidthArvind Gupta, Naomi Nishimura. 453-464
- A Characterization of the Quadrilateral Meshes of a Surface Which Admit a Compatible Hexahedral Mesh of the Enclosed VolumeScott A. Mitchell. 465-476
- On the Expressivity of the Modal Mu-CalculusJulian C. Bradfield. 479-490
- Read-once Projections and Formal Circuit Verification with Binary Decision DiagramsBeate Bollig, Ingo Wegener. 491-502
- Optimal Collecting Semantics for Analysis in a Hierarchy of Logic Program SemanticsRoberto Giacobazzi. 503-514
- Flip-Flop NetsVincent Schmitt. 517-528
- Lower Bounds for Compact Routing (Extended Abstract)Evangelos Kranakis, Danny Krizanc. 529-540
- On the Successor Function in Non-Classical Numeration SystemsChristiane Frougny. 543-553
- Minimal Forbidden Words and Symbolic DynamicsMarie-Pierre Béal, Filippo Mignosi, Antonio Restivo. 555-566
- Universal Hashing and k-Wise Independent Random Variables via Integer Arithmetic without PrimesMartin Dietzfelbinger. 569-580
- Ranking and Unranking Trees Using Regular ReductionsPierre Kelsen. 581-592
- On Competitive On-Line Paging with LookaheadDany Breslauer. 593-603
- Hypothesis Testing in Perfect Phylogeny for a Bounded Number of CharactersJens Lagergren. 605-616
- The log Rank Conjecture for Modular Communication ComplexityChristoph Meinel, Stephan Waack. 619-630
- Upper Bounds on Multiparty Communication Complexity of ShiftsAndris Ambainis. 631-642
- Some Bounds on Multiparty Communication Complexity of Pointer JumpingCarsten Damm, Stasys Jukna, Jiri Sgall. 643-654
- Optimal Schedules for d-D Grid Graphs with Communication Delays (Extended Abstract)Evripidis Bampis, Charles Delorme, Jean-Claude König. 655-666
- Linear Programming - Randomization and Abstract FrameworksBernd Gärtner, Emo Welzl. 669-687