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