Volume 48; Issue 3

Theory of Computing Systems

Volume 48; Issue 3
1

Tractable Structures for Constraint Satisfaction with

Dániel Marx
Journal:
Theory of Computing Systems
Year:
2011
Language:
english
File:
PDF, 497 KB
english, 2011
2

Computability in Europe 2008

Arnold Beckmann, Benedikt Löwe
Journal:
Theory of Computing Systems
Year:
2011
Language:
english
File:
PDF, 158 KB
english, 2011
3

Computability and Complexity in Self-assembly

James I. Lathrop, Jack H. Lutz, Matthew J. Patitz, Scott M. Summers
Journal:
Theory of Computing Systems
Year:
2011
Language:
english
File:
PDF, 1.95 MB
english, 2011
4

Model Checking Weighted Integer Reset Timed Automata

Lakshmi Manasa, Shankara Narayanan Krishna, Chinmay Jain
Journal:
Theory of Computing Systems
Year:
2011
Language:
english
File:
PDF, 1.34 MB
english, 2011
5

On the Complexity of Computing Winning Strategies for Finite Poset Games

Michael Soltys, Craig Wilson
Journal:
Theory of Computing Systems
Year:
2011
Language:
english
File:
PDF, 480 KB
english, 2011
6

Topological Dynamics of Cellular Automata: Dimension Matters

Mathieu Sablik, Guillaume Theyssier
Journal:
Theory of Computing Systems
Year:
2011
Language:
english
File:
PDF, 560 KB
english, 2011
7

Enhanced Mobile Membranes: Computability

Gabriel Ciobanu, Shankara Narayanan Krishna
Journal:
Theory of Computing Systems
Year:
2011
Language:
english
File:
PDF, 376 KB
english, 2011
8

Randomness on Computable Probability Spaces—A

Peter Gács, Mathieu Hoyrup, Cristóbal Rojas
Journal:
Theory of Computing Systems
Year:
2011
Language:
english
File:
PDF, 523 KB
english, 2011
9

Fragments of First-Order Logic over Infinite Words

Volker Diekert, Manfred Kufleitner
Journal:
Theory of Computing Systems
Year:
2011
Language:
english
File:
PDF, 759 KB
english, 2011
10

Ambiguity and Communication

Juraj Hromkovič, Georg Schnitger
Journal:
Theory of Computing Systems
Year:
2011
Language:
english
File:
PDF, 447 KB
english, 2011
11

Generating Shorter Bases for Hard Random Lattices

Joël Alwen, Chris Peikert
Journal:
Theory of Computing Systems
Year:
2011
Language:
english
File:
PDF, 502 KB
english, 2011
12

Weak MSO with the Unbounding Quantifier

Mikołaj Bojańczyk
Journal:
Theory of Computing Systems
Year:
2011
Language:
english
File:
PDF, 503 KB
english, 2011
13

Semi-Online Preemptive Scheduling: One Algorithm for All Variants

Tomáš Ebenlendr, Jiří Sgall
Journal:
Theory of Computing Systems
Year:
2011
Language:
english
File:
PDF, 788 KB
english, 2011
14

Preface: Special Issue on Theoretical Aspects of

Susanne Albers, Jean-Yves Marion
Journal:
Theory of Computing Systems
Year:
2011
Language:
english
File:
PDF, 91 KB
english, 2011