Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top

Theory of Computing Systems

Issue 3/2012

CiE: Programs, Proofs, Processes

Content (8 Articles)

Open Access

Programs, Proofs, Processes

Fernando Ferreira, Benedikt Löwe, Elvira Mayordomo

A Faster Algorithm for Finding Minimum Tucker Submatrices

Guillaume Blin, Romeo Rizzi, Stéphane Vialette

Avoiding Simplicity is Complex

Eric Allender, Holger Spakowski

The Complexity of Explicit Constructions

Rahul Santhanam

Proofs, Programs, Processes

Ulrich Berger, Monika Seisenberger

How Powerful Are Integer-Valued Martingales?

Laurent Bienvenu, Frank Stephan, Jason Teutsch

Computability of Countable Subshifts in One Dimension

Douglas Cenzer, Ali Dashti, Ferit Toska, Sebastian Wyman

Approximate Self-Assembly of the Sierpinski Triangle

Jack H. Lutz, Brad Shutters

Aug 12
Issue: 2/2012
Theoretical Aspects of Computer Science
Nov 12
Issue: 4/2012
Distributed Computing and Networking

Current Publications

scroll for more

use your arrow keys for more

scroll or use arrow keys for more

Premium Partner

    Image Credits