Journal: Theory Comput. Syst.

Volume 51, Issue 4

401 -- 403Marcos K. Aguilera, Haifeng Yu. Special Issue on Distributed Computing
404 -- 424Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Corentin Travers. Generating Fast Indulgent Algorithms
425 -- 446Hagit Attiya, Eshcar Hillel. A Single-Version STM that Is Multi-Versioned Permissive
447 -- 473Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Vijay K. Garg, Yogish Sabharwal. Efficient Decentralized Algorithms for the Distributed Trigger Counting Problem
474 -- 491Bala Kalyanasundaram, Mahe Velauthapillai. A Near Optimal Periodic Transmission Schedule in Bounded Degree Wireless Sensor Network

Volume 51, Issue 3

267 -- 269Fernando Ferreira, Benedikt Löwe, Elvira Mayordomo. Programs, Proofs, Processes
270 -- 281Guillaume Blin, Romeo Rizzi, Stéphane Vialette. A Faster Algorithm for Finding Minimum Tucker Submatrices
282 -- 296Eric Allender, Holger Spakowski. Avoiding Simplicity is Complex
297 -- 312Rahul Santhanam. The Complexity of Explicit Constructions
313 -- 329Ulrich Berger, Monika Seisenberger. Proofs, Programs, Processes
330 -- 351Laurent Bienvenu, Frank Stephan, Jason Teutsch. How Powerful Are Integer-Valued Martingales?
352 -- 371Douglas Cenzer, S. Ali Dashti, Ferit Toska, Sebastian Wyman. Computability of Countable Subshifts in One Dimension
372 -- 400Jack H. Lutz, Brad Shutters. Approximate Self-Assembly of the Sierpinski Triangle

Volume 51, Issue 2

123 -- 124Jean-Yves Marion, Thomas Schwentick. Theoretical Aspects of Computer Science
125 -- 142Adrian Dumitrescu, Minghui Jiang. Dispersion in Disks
143 -- 178László Egri, Andrei A. Krokhin, Benoit Larose, Pascal Tesson. The Complexity of the List Homomorphism Problem for Graphs
179 -- 195Edward A. Hirsch, Dmitry Itsykson, Ivan Monakhov, Alexander Smal. On Optimal Heuristic Randomized Semidecision Procedures, with Applications to Proof Complexity and Cryptography
196 -- 228Artur Jez, Alexander Okhotin. Representing Hyper-arithmetical Sets by Equations over Sets of Integers
229 -- 247Lance Fortnow, Jack H. Lutz, Elvira Mayordomo. Inseparability and Strong Hypotheses for Disjoint NP Pairs
248 -- 265Xiaoyang Gu, John M. Hitchcock, Aduri Pavan. Collapsing and Separating Completeness Notions Under Average-Case and Worst-Case Hypotheses

Volume 51, Issue 1

1 -- 3Arnold Beckmann, Wolfgang Merkle, Benedikt Löwe. Computability in Europe 2009
4 -- 21Jean Cardinal, Samuel Fiorini, Gwenaël Joret. Minimum Entropy Combinatorial Optimization Problems
22 -- 49John Case, Samuel E. Moelius. Program Self-Reference in Constructive Scott Subdomains
50 -- 64Stefan S. Dantchev, Barnaby Martin. Cutting Planes and the Parameter Cutwidth
65 -- 84Tobias Gärtner, Günter Hotz. Representation Theorems for Analytic Machines and Computability of Analytic Functions
85 -- 105Lars Kristiansen, Bedeho Mesghina Wolde Mender. Non-determinism in Gödel's System T
106 -- 122Klaus Ambos-Spies, Timur Bakibayev. Comparing Nontriviality for E and EXP