| A New Category for Semantics | p. 1 |
| On Implications between P-NP-Hypotheses: Decision versus Computation in Algebraic Complexity | p. 3 |
| Playing Games with Algorithms: Algorithmic Combinatorial Game Theory | p. 18 |
| Some Recent Results on Data Mining and Search | p. 33 |
| Hypertree Decompositions: A Survey | p. 37 |
| The Strength of Non-size-increasing Computation (Introduction and Summary) | p. 58 |
| Introduction to Recent Quantum Algorithms | p. 62 |
| Decomposition Methods and Sampling Circuits in the Cartesian Lattice | p. 74 |
| New Algorithms for k-SAT Based on the Local Search Principle | p. 87 |
| Linear Temporal Logic and Finite Semigroups | p. 96 |
| Refined Search Tree Technique for Dominating Set on Planar Graphs | p. 111 |
| The Computational Power of a Family of Decision Forests | p. 123 |
| Exact Results for Accepting Probabilities of Quantum Automata | p. 135 |
| Improved Bounds on the Weak Pigeonhole Principle and Infinitely Many Primes from Weaker Axioms | p. 148 |
| Analysis Problems for Sequential Dynamical Systems and Communicating State Machines | p. 159 |
| The Complexity of Tensor Circuit Evaluation | p. 173 |
| Computing Reciprocals of Bivariate Power Series | p. 186 |
| Automatic Verification of Recursive Procedures with One Integer Parameter | p. 198 |
| Graph-Driven Free Parity BDDs: Algorithms and Lower Bounds | p. 212 |
| Computable Versions of Baire's Category Theorem | p. 224 |
| Automata on Linear Orderings | p. 236 |
| Algorithmic Information Theory and Cellular Automata Dynamics | p. 248 |
| The k-Median Problem for Directed Trees | p. 260 |
| On Pseudorandom Generators in NC[superscript 0] | p. 272 |
| There Are No Sparse NP[subscript W]-Hard Sets | p. 285 |
| Sharing One Secret vs. Sharing Many Secrets: Tight Bounds for the Max Improvement Ratio | p. 292 |
| (H,C,K)-Coloring: Fast, Easy, and Hard Cases | p. 304 |
| Randomness and Reducibility | p. 316 |
| On the Computational Complexity of Infinite Words | p. 328 |
| Lower Bounds for On-Line Single-Machine Scheduling | p. 338 |
| Approximation Algorithms and Complexity Results for Path Problems in Trees of Rings | p. 351 |
| A 3-Approximation Algorithm for Movement Minimization in Conveyor Flow Shop Processing | p. 363 |
| Quantifier Rank for Parity of Embedded Finite Models | p. 375 |
| Space Hierarchy Theorem Revised | p. 387 |
| Converting Two-Way Nondeterministic Unary Automata into Simpler Automata | p. 398 |
| The Complexity of the Minimal Polynomial | p. 408 |
| Note on Minimal Finite Automata | p. 421 |
| Synchronizing Finite Automata on Eulerian Digraphs | p. 432 |
| A Time Hierarchy for Bounded One-Way Cellular Automata | p. 439 |
| Checking Amalgamability Conditions for CASL Architectural Specifications | p. 451 |
| On-Line Scheduling with Tight Deadlines | p. 464 |
| Complexity Note on Mixed Hypergraphs | p. 474 |
| News from the Online Traveling Repairman | p. 487 |
| Word Problems for 2-Homogeneous Monoids and Symmetric Logspace | p. 500 |
| Variations on a Theorem of Fine and Wilf | p. 512 |
| Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs | p. 524 |
| Satisfiability of Systems of Equations over Finite Monoids | p. 537 |
| Rational Graphs Trace Context-Sensitive Languages | p. 548 |
| Towards Regular Languages over Infinite Alphabets | p. 560 |
| Partial Information and Special Case Algorithms | p. 573 |
| The Complexity of Computing the Number of Self-Avoiding Walks in Two-Dimensional Grid Graphs and in Hypercube Graphs | p. 585 |
| From Bidirectionality to Alternation | p. 598 |
| Syntactic Semiring of a Language | p. 611 |
| On Reducibility and Symmetry of Disjoint NP-Pairs | p. 621 |
| Hierarchy of Monotonically Computable Real Numbers | p. 633 |
| On the Equational Definition of the Least Prefixed Point | p. 645 |
| On the Periods of Partial Words | p. 657 |
| The Size of Power Automata | p. 666 |
| On the Approximability of the Steiner Tree Problem | p. 678 |
| Alignment between Two RNA Structures | p. 690 |
| Characterization of Context-Free Languages with Polynomially Bounded Ambiguity | p. 703 |
| Author Index | p. 715 |
| Table of Contents provided by Blackwell. All Rights Reserved. |