default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheory of Computing Systems, Volume 51
Volume 51, Number 1, July 2012
- Arnold Beckmann, Wolfgang Merkle, Benedikt Löwe:
Computability in Europe 2009. 1-3 - Jean Cardinal, Samuel Fiorini, Gwenaël Joret:
Minimum Entropy Combinatorial Optimization Problems. 4-21 - John Case, Samuel E. Moelius:
Program Self-Reference in Constructive Scott Subdomains. 22-49 - Stefan S. Dantchev, Barnaby Martin
:
Cutting Planes and the Parameter Cutwidth. 50-64 - Tobias Gärtner, Günter Hotz:
Representation Theorems for Analytic Machines and Computability of Analytic Functions. 65-84 - Lars Kristiansen, Bedeho Mesghina Wolde Mender:
Non-determinism in Gödel's System T. 85-105 - Klaus Ambos-Spies, Timur Bakibayev:
Comparing Nontriviality for E and EXP. 106-122
Volume 51, Number 2, August 2012
- Jean-Yves Marion, Thomas Schwentick:
Theoretical Aspects of Computer Science. 123-124 - Adrian Dumitrescu, Minghui Jiang:
Dispersion in Disks. 125-142 - László Egri, Andrei A. Krokhin, Benoît Larose, Pascal Tesson:
The Complexity of the List Homomorphism Problem for Graphs. 143-178 - Edward A. Hirsch, Dmitry Itsykson, Ivan Monakhov, Alexander Smal:
On Optimal Heuristic Randomized Semidecision Procedures, with Applications to Proof Complexity and Cryptography. 179-195 - Artur Jez, Alexander Okhotin:
Representing Hyper-arithmetical Sets by Equations over Sets of Integers. 196-228 - Lance Fortnow, Jack H. Lutz, Elvira Mayordomo:
Inseparability and Strong Hypotheses for Disjoint NP Pairs. 229-247 - Xiaoyang Gu, John M. Hitchcock, Aduri Pavan:
Collapsing and Separating Completeness Notions Under Average-Case and Worst-Case Hypotheses. 248-265
Volume 51, Number 3, October 2012
- Fernando Ferreira, Benedikt Löwe, Elvira Mayordomo:
Programs, Proofs, Processes. 267-269 - Guillaume Blin, Romeo Rizzi, Stéphane Vialette:
A Faster Algorithm for Finding Minimum Tucker Submatrices. 270-281 - Eric Allender, Holger Spakowski:
Avoiding Simplicity is Complex. 282-296 - Rahul Santhanam:
The Complexity of Explicit Constructions. 297-312 - Ulrich Berger, Monika Seisenberger:
Proofs, Programs, Processes. 313-329 - Laurent Bienvenu, Frank Stephan, Jason Teutsch:
How Powerful Are Integer-Valued Martingales? 330-351 - Douglas Cenzer, S. Ali Dashti, Ferit Toska, Sebastian Wyman:
Computability of Countable Subshifts in One Dimension. 352-371 - Jack H. Lutz, Brad Shutters:
Approximate Self-Assembly of the Sierpinski Triangle. 372-400
Volume 51, Number 4, November 2012
- Marcos K. Aguilera, Haifeng Yu:
Special Issue on Distributed Computing. 401-403 - Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Corentin Travers:
Generating Fast Indulgent Algorithms. 404-424 - Hagit Attiya, Eshcar Hillel:
A Single-Version STM that Is Multi-Versioned Permissive. 425-446 - Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Vijay K. Garg, Yogish Sabharwal:
Efficient Decentralized Algorithms for the Distributed Trigger Counting Problem. 447-473 - Bala Kalyanasundaram, Mahe Velauthapillai:
A Near Optimal Periodic Transmission Schedule in Bounded Degree Wireless Sensor Network. 474-491
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-11-04 22:23 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
