| 647 | -- | 649 | S. Barry Cooper, Elvira Mayordomo, Andrea Sorbi. Computation and Logic in the Real World: CiE 2007 |
| 650 | -- | 674 | Pieter W. Adriaans. Between Order and Chaos: The Quest for Meaningful Information |
| 675 | -- | 723 | Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty, Samir Datta, Sambuddha Roy. Planar and Grid Graph Reachability Problems |
| 724 | -- | 739 | Luis Filipe Coelho Antunes, Armando Matos, Andre Souto, Paul M. B. Vitányi. Depth as Randomness Deficiency |
| 740 | -- | 755 | Laurent Bienvenu, David Doty, Frank Stephan. Constructive Dimension and Turing Degrees |
| 756 | -- | 772 | John Case, Samuel E. Moelius. Characterizing Programming Systems Allowing Program Self-Reference |
| 773 | -- | 786 | John Case. Resource Restricted Computability Theoretic Learning: Illustrative Topics and Problems |
| 787 | -- | 821 | Norman Danner, James S. Royer. Two Algorithms in Search of a Type-System |
| 822 | -- | 848 | Michael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Matthias Mnich, Frances A. Rosamond, Saket Saurabh. The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number |
| 849 | -- | 864 | Sanjay Jain, Eric Martin, Frank Stephan. Input-Dependence in Function-Learning |
| 865 | -- | 879 | Michal Koucký. Circuit Complexity of Regular Languages |
| 880 | -- | 896 | Chung-Chih Li. Speed-Up Theorems in Type-2 Computations Using Oracle Turing Machines |
| 897 | -- | 916 | Alexander G. Melnikov. Enumerations and Completely Decomposable Torsion-Free Abelian Groups |
| 917 | -- | 925 | Martin Olsen. Nash Stability in Additively Separable Hedonic Games and Community Structures |
| 926 | -- | 942 | Mikael Onsjö, Osamu Watanabe. Theory of Computing Systems (TOCS) Submission Version Finding Most Likely Solutions |
| 943 | -- | 0 | Mikael Onsjö, Osamu Watanabe. Finding Most Likely Solutions |
| 944 | -- | 962 | Alexandre Pinto. Comparing Notions of Computational Entropy |
| 963 | -- | 994 | José Espírito Santo. lambda-Calculus and the Unity of Structural Proof Theory |
| 995 | -- | 1010 | Jirà Wiedermann, Lukás Petru. On the Universal Computing Power of Amorphous Computing Systems |