| 727 | -- | 728 | Klaus Ambos-Spies, Arnold Beckmann, Erzsébet Csuhaj-Varjú, Benedikt Löwe. Computability in Europe 2009 |
| 729 | -- | 751 | Thomas Anberrée. First-order universality for real programs |
| 753 | -- | 760 | Manuel Bodirsky, Miki Hermann, Florian Richoux. Complexity of existential positive first-order logic |
| 761 | -- | 798 | Luca Bortolussi, Alberto Policriti. The hybrid automata lattice of a stochastic program |
| 799 | -- | 814 | Robert Brijder, Hendrik Blockeel. On the inference of non-confluent NLC graph grammars |
| 815 | -- | 838 | Guénola Drillon, Alessandra Carbone, Gilles Fischer. Combinatorics of chromosomal rearrangements based on synteny blocks and synteny packs |
| 839 | -- | 854 | Martín Hötzel Escardó. Algorithmic solution of higher type equations |
| 855 | -- | 872 | Benedek Nagy. On a hierarchy of 5′ → 3′ sensing Watson-Crick finite automata languages |
| 873 | -- | 895 | Ian Pratt-Hartmann, Ivo Düntsch. Functions definable by numerical set-expressions |
| 897 | -- | 908 | Thomas Zerjatke, Monika Sturm. Solving a PSPACE-complete problem by gene assembly |
| 909 | -- | 924 | Marius Zimand. Generating Kolmogorov random strings from sources with limited independence |