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