| 2001 | The Strength of Non-size-increasing Computation (Introduction and Summary). | Martin Hofmann |
| 2001 | The Complexity of the Minimal Polynomial. | Thanh Minh Hoang, Thomas Thierauf |
| 2001 | Hypertree Decompositions: A Survey. | Georg Gottlob, Nicola Leone, Francesco Scarcello |
| 2001 | Converting Two-Way Nondeterministic Unary Automata into Simpler Automata. | Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini |
| 2001 | Space Hierarchy Theorem Revised. | Viliam Geffert |
| 2001 | Quantifier Rank for Parity of Embedded Finite Models. | Herv Fournier |
| 2001 | Some Recent Results on Data Mining and Search. | Amos Fiat |
| 2001 | A 3-Approximation Algorithm for Movement Minimization in Conveyor Flow Shop Processing. | Wolfgang Espelage, Egon Wanke |
| 2001 | Approximation Algorithms and Complexity Results for Path Problems in Trees of Rings. | Thomas Erlebach |
| 2001 | Lower Bounds for On-Line Single-Machine Scheduling. | Leah Epstein, Rob van Stee |
| 2001 | On the Computational Complexity of Infinite Words. | Pavol Duris, Jn Manuch |
| 2001 | Randomness and Reducibility. | Rodney G. Downey, Denis R. Hirschfeldt, Geoffrey LaForte |
| 2001 | (H, C, K)-Coloring: Fast, Easy, and Hard Cases. | Josep Daz, Maria J. Serna, Dimitrios M. Thilikos |
| 2001 | Playing Games with Algorithms: Algorithmic Combinatorial Game Theory. | Erik D. Demaine |
| 2001 | There Are No Sparse NP | Felipe Cucker, Dima Grigoriev |
| 2001 | On Pseudorandom Generators in NC. | Mary Cryan, Peter Bro Miltersen |
| 2001 | Sharing One Secret vs. Sharing Many Secrets: Tight Bounds for the Max Improvement Ratio. | Giovanni Di Crescenzo |
| 2001 | The k-Median Problem for Directed Trees. | Marek Chrobak, Lawrence L. Larmore, Wojciech Rytter |
| 2001 | Algorithmic Information Theory and Cellular Automata Dynamics. | Julien Cervelle, Bruno Durand, Enrico Formenti |
| 2001 | On Implications between P-NP-Hypotheses: Decision versus Computation in Algebraic Complexity. | Peter Brgisser |
| 2001 | Automata on Linear Orderings. | Vronique Bruyre, Olivier Carton |
| 2001 | Graph-Driven Free Parity BDDs: Algorithms and Lower Bounds. | Henrik Brosenne, Matthias Homeister, Stephan Waack |
| 2001 | Computable Versions of Baire's Category Theorem. | Vasco Brattka |
| 2001 | Automatic Verification of Recursive Procedures with One Integer Parameter. | Ahmed Bouajjani, Peter Habermehl, Richard Mayr |
| 2001 | Computing Reciprocals of Bivariate Power Series. | Markus Blser |