Journal: Theory Comput. Syst.

Volume 40, Issue 4

301 -- 0Volker Diekert, Bruno Durand. Foreword
303 -- 325Andreas Krebs, Klaus-Jörn Lange, Stephanie Reifferscheid. Characterizing TC:::0::: in Terms of Infinite Groups
327 -- 353Gianni Franceschini. Sorting Stably, in Place, with O(n log n) Comparisons and O(n) Moves
355 -- 377Volker Weber, Thomas Schwentick. Dynamic Complexity Theory Revisited
379 -- 395Harry Buhrman, Ilan Newman, Hein Röhrig, Ronald de Wolf. Robust Polynomials and Quantum Algorithms
397 -- 407Emmanuel Jeandel. Topological Automata
409 -- 421Victor Poupet. Cellular Automata: Real-Time Equivalence between One-Dimensional Neighborhoods
423 -- 436Nir Andelman, Yossi Azar, Motti Sorani. Truthful Approximation Mechanisms for Scheduling Selfish Related Machines
437 -- 466Dietmar Berwanger, Erich Grädel, Giacomo Lenzi. The Variable Hierarchy of the µ-Calculus Is Strict
467 -- 483Benjamin Doerr. Roundings Respecting Hard Constraints
485 -- 505Telikepalli Kavitha, Kurt Mehlhorn. Algorithms to Compute Minimum Cycle Basis in Directed Graphs
507 -- 520Fabio Burderi, Antonio Restivo. Varieties of Codes and Kraft Inequality
521 -- 551Michal Kunc. The Power of Commuting with Finite Sets of Words
553 -- 570Gregorio Malajovich, Klaus Meer. Computing Minimal Multi-Homogeneous Bezout Numbers Is Hard

Volume 40, Issue 3

205 -- 223Peter J. Grabner, Michel Rigo. Distribution of Additive Functions with Respect to Numeration Systems on Regular Languages
225 -- 247Euripides Markou, Andrzej Pelc. Efficient Exploration of Faulty Trees
249 -- 262Thomas Hofmeister, Uwe Schöning, Rainer Schuler, Osamu Watanabe. Randomized Algorithms for 3-SAT
263 -- 297Ondrej Klíma, Pascal Tesson, Denis Thérien. Dichotomies in the Complexity of Solving Systems of Equations over Finite Semigroups

Volume 40, Issue 2

125 -- 142Yung H. Tsin. A Simple 3-Edge-Connected Component Algorithm
143 -- 162Lali Barrière, Paola Flocchini, Pierre Fraigniaud, Nicola Santoro. Rendezvous and Election of Mobile Agents: Impact of Sense of Direction
163 -- 185Frank Drewes, Johanna Högberg. Query Learning of Regular Tree Languages: How to Avoid Dead States
187 -- 204Guang Xu, Jinhui Xu. Constant Approximation Algorithms for Rectangle Stabbing and Related Problems

Volume 40, Issue 1

1 -- 31Valérie Berthé, Michel Rigo. Odometers on Regular Languages
33 -- 41Igor Shparlinski, Ron Steinfeld. Chinese Remaindering with Multiplicative Noise
43 -- 54Vesa Halava, Tero Harju, Juhani Karhumäki. The Structure of Infinite Solutions of Marked and Binary Post Correspondence Problems
55 -- 99Haim Kaplan, Tova Milo, Ronen Shabo. Compact Labeling Scheme for XML Ancestor Queries
101 -- 121Matthias Krause. OBDD-Based Cryptanalysis of Oblivious Keystream Generators