| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
Ambiguity and Communication
|
Hromkovič, Juraj
|
|
2010
|
48 |
3 |
p. 517-534
|
artikel
|
| 2 |
Computability and Complexity in Self-assembly
|
Lathrop, James I.
|
|
2010
|
48 |
3 |
p. 617-647
|
artikel
|
| 3 |
Computability in Europe 2008
|
Beckmann, Arnold
|
|
2010
|
48 |
3 |
p. 614-616
|
artikel
|
| 4 |
Enhanced Mobile Membranes: Computability Results
|
Ciobanu, Gabriel
|
|
2010
|
48 |
3 |
p. 715-729
|
artikel
|
| 5 |
Fragments of First-Order Logic over Infinite Words
|
Diekert, Volker
|
|
2010
|
48 |
3 |
p. 486-516
|
artikel
|
| 6 |
Generating Shorter Bases for Hard Random Lattices
|
Alwen, Joël
|
|
2010
|
48 |
3 |
p. 535-553
|
artikel
|
| 7 |
Model Checking Weighted Integer Reset Timed Automata
|
Manasa, Lakshmi
|
|
2010
|
48 |
3 |
p. 648-679
|
artikel
|
| 8 |
On the Complexity of Computing Winning Strategies for Finite Poset Games
|
Soltys, Michael
|
|
2010
|
48 |
3 |
p. 680-692
|
artikel
|
| 9 |
Preface: Special Issue on Theoretical Aspects of Computer Science (STACS)
|
Albers, Susanne
|
|
2010
|
48 |
3 |
p. 443
|
artikel
|
| 10 |
Randomness on Computable Probability Spaces—A Dynamical Point of View
|
Gács, Peter
|
|
2010
|
48 |
3 |
p. 465-485
|
artikel
|
| 11 |
Semi-Online Preemptive Scheduling: One Algorithm for All Variants
|
Ebenlendr, Tomáš
|
|
2010
|
48 |
3 |
p. 577-613
|
artikel
|
| 12 |
Topological Dynamics of Cellular Automata: Dimension Matters
|
Sablik, Mathieu
|
|
2010
|
48 |
3 |
p. 693-714
|
artikel
|
| 13 |
Tractable Structures for Constraint Satisfaction with Truth Tables
|
Marx, Dániel
|
|
2009
|
48 |
3 |
p. 444-464
|
artikel
|
| 14 |
Weak MSO with the Unbounding Quantifier
|
Bojańczyk, Mikołaj
|
|
2010
|
48 |
3 |
p. 554-576
|
artikel
|
Tijdschrift beschrijving