Volume 51, Issue 2

August 2012

Theoretical Aspects of Computer Science

Issue Editors:

7 articles in this issue

Theoretical Aspects of Computer Science
Jean-Yves Marion
Thomas Schwentick
EditorialNotes 13 April 2012 Pages: 123 - 124
Dispersion in Disks
Adrian Dumitrescu
Minghui Jiang
OriginalPaper 11 May 2011 Pages: 125 - 142
The Complexity of the List Homomorphism Problem for Graphs
László Egri
Andrei Krokhin
Pascal Tesson
OriginalPaper 19 May 2011 Pages: 143 - 178
On Optimal Heuristic Randomized Semidecision Procedures, with Applications to Proof Complexity and Cryptography
Edward A. Hirsch
Dmitry Itsykson
Alexander Smal
OriginalPaper 29 July 2011 Pages: 179 - 195
Representing Hyper-arithmetical Sets by Equations over Sets of Integers
Artur Jeż
Alexander Okhotin
OriginalPaper Open access 04 August 2011 Pages: 196 - 228
Inseparability and Strong Hypotheses for Disjoint NP Pairs
Lance Fortnow
Jack H. Lutz
Elvira Mayordomo
OriginalPaper 14 April 2011 Pages: 229 - 247
Collapsing and Separating Completeness Notions Under Average-Case and Worst-Case Hypotheses
Xiaoyang Gu
John M. Hitchcock
A. Pavan
OriginalPaper 08 October 2011 Pages: 248 - 265

Search