Volume 51, Issue 3

October 2012

CiE: Programs, Proofs, Processes

Issue Editors:

8 articles in this issue

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

Search