Table of Contents

• A New Category for SemanticsDana S. Scott. 1-2 [doi]
• On Implications between P-NP-Hypotheses: Decision versus Computation in Algebraic ComplexityPeter Bürgisser. 3-17 [doi]
• Playing Games with Algorithms: Algorithmic Combinatorial Game TheoryErik D. Demaine. 18-32 [doi]
• Some Recent Results on Data Mining and SearchAmos Fiat. 33-36 [doi]
• Hypertree Decompositions: A SurveyGeorg Gottlob, Nicola Leone, Francesco Scarcello. 37-57 [doi]
• The Strength of Non-size-increasing Computation (Introduction and Summary)Martin Hofmann. 58-61 [doi]
• Introduction to Recent Quantum AlgorithmsPeter Høyer. 62-73 [doi]
• Decomposition Methods and Sampling Circuits in the Cartesian LatticeDana Randall. 74-86 [doi]
• New Algorithms for k -SAT Based on the Local Search PrincipleUwe Schöning. 87-95 [doi]
• Linear Temporal Logic and Finite SemigroupsThomas Wilke. 96-110 [doi]
• Refined Search Tree Technique for DOMINATING SET on Planar GraphsJochen Alber, Hongbing Fan, Michael R. Fellows, Henning Fernau, Rolf Niedermeier, Frances A. Rosamond, Ulrike Stege. 111-122 [doi]
• The Computational Power of a Family of Decision ForestsKazuyuki Amano, Tsukuru Hirosawa, Yusuke Watanabe, Akira Maruoka. 123-134 [doi]
• Exact Results for Accepting Probabilities of Quantum AutomataAndris Ambainis, Arnolds Kikusts. 135-147 [doi]
• Improved Bounds on the Weak Pigeonhole Principle and Infinitely Many Primes from Weaker AxiomsAlbert Atserias. 148-158 [doi]
• Analysis Problems for Sequential Dynamical Systems and Communicating State MachinesChristopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns. 159-172 [doi]
• The Complexity of Tensor Circuit EvaluationMartin Beaudry, Markus Holzer. 173-185 [doi]
• Computing Reciprocals of Bivariate Power SeriesMarkus Bläser. 186-197 [doi]
• Automatic Verification of Recursive Procedures with One Integer ParameterAhmed Bouajjani, Peter Habermehl, Richard Mayr. 198-211 [doi]
• Graph-Driven Free Parity BDDs: Algorithms and Lower BoundsHenrik Brosenne, Matthias Homeister, Stephan Waack. 212-223 [doi]
• Computable Versions of Baire s Category TheoremVasco Brattka. 224-235 [doi]
• Automata on Linear OrderingsVéronique Bruyère, Olivier Carton. 236-247 [doi]
• Algorithmic Information Theory and Cellular Automata DynamicsJulien Cervelle, Bruno Durand, Enrico Formenti. 248-259 [doi]
• The k-Median Problem for Directed TreesMarek Chrobak, Lawrence L. Larmore, Wojciech Rytter. 260-271 [doi]
• On Pseudorandom Generators in NCMary Cryan, Peter Bro Miltersen. 272-284 [doi]
• There Are No Sparse NP::W::-Hard SetsFelipe Cucker, Dima Grigoriev. 285-291 [doi]
• Sharing One Secret vs. Sharing Many Secrets: Tight Bounds for the Max Improvement RatioGiovanni Di Crescenzo. 292-303 [doi]
• (H, C, K)-Coloring: Fast, Easy, and Hard CasesJosep Díaz, Maria J. Serna, Dimitrios M. Thilikos. 304-315 [doi]
• Randomness and ReducibilityRodney G. Downey, Denis R. Hirschfeldt, Geoffrey LaForte. 316-327 [doi]
• On the Computational Complexity of Infinite WordsPavol Duris, Ján Manuch. 328-337 [doi]
• Lower Bounds for On-Line Single-Machine SchedulingLeah Epstein, Rob van Stee. 338-350 [doi]
• Approximation Algorithms and Complexity Results for Path Problems in Trees of RingsThomas Erlebach. 351-362 [doi]
• A 3-Approximation Algorithm for Movement Minimization in Conveyor Flow Shop ProcessingWolfgang Espelage, Egon Wanke. 363-374 [doi]
• Quantifier Rank for Parity of Embedded Finite ModelsHervé Fournier. 375-386 [doi]
• Space Hierarchy Theorem RevisedViliam Geffert. 387-397 [doi]
• Converting Two-Way Nondeterministic Unary Automata into Simpler AutomataViliam Geffert, Carlo Mereghetti, Giovanni Pighizzini. 398-407 [doi]
• The Complexity of the Minimal PolynomialThanh Minh Hoang, Thomas Thierauf. 408-420 [doi]
• Note on Minimal Finite AutomataGalina Jirásková. 421-431 [doi]
• Synchronizing Finite Automata on Eulerian DigraphsJarkko Kari. 432-438 [doi]
• A Time Hierarchy for Bounded One-Way Cellular AutomataAndreas Klein, Martin Kutrib. 439-450 [doi]
• Checking Amalgamability Conditions for C ASL Architectural SpecificationsBartek Klin, Piotr Hoffman, Andrzej Tarlecki, Lutz Schröder, Till Mossakowski. 451-463 [doi]
• On-Line Scheduling with Tight DeadlinesChiu-Yuen Koo, Tak Wah Lam, Tsuen-Wan Ngan, Kar-Keung To. 464-473 [doi]
• Complexity Note on Mixed HypergraphsDaniel Král, Jan Kratochvíl, Heinz-Jürgen Voss. 474-486 [doi]
• News from the Online Traveling RepairmanSven Oliver Krumke, Willem de Paepe, Diana Poensgen, Leen Stougie. 487-499 [doi]
• Word Problems for 2-Homogeneous Monoids and Symmetric LogspaceMarkus Lohrey. 500-511 [doi]
• Variations on a Theorem of Fine & WilfFilippo Mignosi, Jeffrey Shallit, Ming-wei Wang. 512-523 [doi]
• Upper Bounds on the Bisection Width of 3- and 4-Regular GraphsBurkhard Monien, Robert Preis. 524-536 [doi]
• Satisfiability of Systems of Equations over Finite MonoidsCristopher Moore, Pascal Tesson, Denis Thérien. 537-547 [doi]
• Rational Graphs Trace Context-Sensitive LanguagesChristophe Morvan, Colin Stirling. 548-559 [doi]
• Towards Regular Languages over Infinite AlphabetsFrank Neven, Thomas Schwentick, Victor Vianu. 560-572 [doi]
• Partial Information and Special Case AlgorithmsArfst Nickelsen. 573-584 [doi]
• The Complexity of Computing the Number of Self-Avoiding Walks in Two-Dimensional Grid Graphs and in Hypercube GraphsMitsunori Ogihara, Seinosuke Toda. 585-597 [doi]
• From Bidirectionality to AlternationNir Piterman, Moshe Y. Vardi. 598-610 [doi]
• Syntactic Semiring of a LanguageLibor Polák. 611-620 [doi]
• On Reducibility and Symmetry of Disjoint NP-PairsPavel Pudlák. 621-632 [doi]
• Hierarchy of Monotonically Computable Real NumbersRobert Rettinger, Xizhong Zheng. 633-644 [doi]
• On the Equational Definition of the Least Prefixed PointLuigi Santocanale. 645-656 [doi]
• On the Periods of Partial WordsArseny M. Shur, Yulia V. Konovalova. 657-665 [doi]
• The Size of Power AutomataKlaus Sutner. 666-677 [doi]
• On the Approximability of the Steiner Tree ProblemMartin Thimm. 678-689 [doi]
• Alignment between Two RNA StructuresZhuozhi Wang, Kaizhong Zhang. 690-702 [doi]
• Characterization of Context-Free Languages with Polynomially Bounded AmbiguityKlaus Wich. 703-714 [doi]