443 | -- | 0 | Susanne Albers, Jean-Yves Marion. Preface: Special Issue on Theoretical Aspects of Computer Science (STACS) |
444 | -- | 464 | Dániel Marx. Tractable Structures for Constraint Satisfaction with Truth Tables |
465 | -- | 485 | Péter Gács, Mathieu Hoyrup, Cristobal Rojas. Randomness on Computable Probability Spaces - A Dynamical Point of View |
486 | -- | 516 | Volker Diekert, Manfred Kufleitner. Fragments of First-Order Logic over Infinite Words |
517 | -- | 534 | Juraj Hromkovic, Georg Schnitger. Ambiguity and Communication |
535 | -- | 553 | Joël Alwen, Chris Peikert. Generating Shorter Bases for Hard Random Lattices |
554 | -- | 576 | Mikolaj Bojanczyk. Weak MSO with the Unbounding Quantifier |
577 | -- | 613 | Tomás Ebenlendr, Jiri Sgall. Semi-Online Preemptive Scheduling: One Algorithm for All Variants |
614 | -- | 616 | Arnold Beckmann, Benedikt Löwe. Computability in Europe 2008 |
617 | -- | 647 | James I. Lathrop, Jack H. Lutz, Matthew J. Patitz, Scott M. Summers. Computability and Complexity in Self-assembly |
648 | -- | 679 | Lakshmi Manasa, Shankara Narayanan Krishna, Chinmay Jain. Model Checking Weighted Integer Reset Timed Automata |
680 | -- | 692 | Michael Soltys, Craig Wilson. On the Complexity of Computing Winning Strategies for Finite Poset Games |
693 | -- | 714 | Mathieu Sablik, Guillaume Theyssier. Topological Dynamics of Cellular Automata: Dimension Matters |
715 | -- | 729 | Gabriel Ciobanu, Shankara Narayanan Krishna. Enhanced Mobile Membranes: Computability Results |