Preface: Special Issue on Theoretical Aspects of Computer Science (STACS) Susanne AlbersJean-Yves Marion EditorialNotes 22 September 2010 Pages: 443 - 443
Tractable Structures for Constraint Satisfaction with Truth Tables Dániel Marx OriginalPaper 02 December 2009 Pages: 444 - 464
Randomness on Computable Probability Spaces—A Dynamical Point of View Peter GácsMathieu HoyrupCristóbal Rojas OriginalPaper 09 April 2010 Pages: 465 - 485
Fragments of First-Order Logic over Infinite Words Volker DiekertManfred Kufleitner OriginalPaper 29 April 2010 Pages: 486 - 516
Ambiguity and Communication Juraj HromkovičGeorg Schnitger OriginalPaper 15 July 2010 Pages: 517 - 534
Generating Shorter Bases for Hard Random Lattices Joël AlwenChris Peikert OriginalPaper 13 July 2010 Pages: 535 - 553
Weak MSO with the Unbounding Quantifier Mikołaj Bojańczyk OriginalPaper 28 July 2010 Pages: 554 - 576
Semi-Online Preemptive Scheduling: One Algorithm for All Variants Tomáš EbenlendrJiří Sgall OriginalPaper 08 September 2010 Pages: 577 - 613
Computability in Europe 2008 Arnold BeckmannBenedikt Löwe EditorialNotes Open access 02 March 2010 Pages: 614 - 616
Computability and Complexity in Self-assembly James I. LathropJack H. LutzScott M. Summers OriginalPaper 20 April 2010 Pages: 617 - 647
Model Checking Weighted Integer Reset Timed Automata Lakshmi ManasaShankara Narayanan KrishnaChinmay Jain OriginalPaper 02 March 2010 Pages: 648 - 679
On the Complexity of Computing Winning Strategies for Finite Poset Games Michael SoltysCraig Wilson OriginalPaper 19 February 2010 Pages: 680 - 692
Topological Dynamics of Cellular Automata: Dimension Matters Mathieu SablikGuillaume Theyssier OriginalPaper 10 April 2010 Pages: 693 - 714
Enhanced Mobile Membranes: Computability Results Gabriel CiobanuShankara Narayanan Krishna OriginalPaper 25 February 2010 Pages: 715 - 729