| 2001 | (H, C, K)-Coloring: Fast, Easy, and Hard Cases. Josep Díaz, Maria J. Serna, Dimitrios M. Thilikos |
| 2001 | A 3-Approximation Algorithm for Movement Minimization in Conveyor Flow Shop Processing. Wolfgang Espelage, Egon Wanke |
| 2001 | A New Category for Semantics. Dana S. Scott |
| 2001 | A Time Hierarchy for Bounded One-Way Cellular Automata. Andreas Klein, Martin Kutrib |
| 2001 | Algorithmic Information Theory and Cellular Automata Dynamics. Julien Cervelle, Bruno Durand, Enrico Formenti |
| 2001 | Alignment between Two RNA Structures. Zhuozhi Wang, Kaizhong Zhang |
| 2001 | Analysis Problems for Sequential Dynamical Systems and Communicating State Machines. Christopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns |
| 2001 | Approximation Algorithms and Complexity Results for Path Problems in Trees of Rings. Thomas Erlebach |
| 2001 | Automata on Linear Orderings. Véronique Bruyère, Olivier Carton |
| 2001 | Automatic Verification of Recursive Procedures with One Integer Parameter. Ahmed Bouajjani, Peter Habermehl, Richard Mayr |
| 2001 | Characterization of Context-Free Languages with Polynomially Bounded Ambiguity. Klaus Wich |
| 2001 | Checking Amalgamability Conditions for C ASL Architectural Specifications. Bartek Klin, Piotr Hoffman, Andrzej Tarlecki, Lutz Schröder, Till Mossakowski |
| 2001 | Complexity Note on Mixed Hypergraphs. Daniel Král, Jan Kratochvíl, Heinz-Jürgen Voss |
| 2001 | Computable Versions of Baire's Category Theorem. Vasco Brattka |
| 2001 | Computing Reciprocals of Bivariate Power Series. Markus Bläser |
| 2001 | Converting Two-Way Nondeterministic Unary Automata into Simpler Automata. Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini |
| 2001 | Decomposition Methods and Sampling Circuits in the Cartesian Lattice. Dana Randall |
| 2001 | Exact Results for Accepting Probabilities of Quantum Automata. Andris Ambainis, Arnolds Kikusts |
| 2001 | From Bidirectionality to Alternation. Nir Piterman, Moshe Y. Vardi |
| 2001 | Graph-Driven Free Parity BDDs: Algorithms and Lower Bounds. Henrik Brosenne, Matthias Homeister, Stephan Waack |
| 2001 | Hierarchy of Monotonically Computable Real Numbers. Robert Rettinger, Xizhong Zheng |
| 2001 | Hypertree Decompositions: A Survey. Georg Gottlob, Nicola Leone, Francesco Scarcello |
| 2001 | Improved Bounds on the Weak Pigeonhole Principle and Infinitely Many Primes from Weaker Axioms. Albert Atserias |
| 2001 | Introduction to Recent Quantum Algorithms. Peter Høyer |
| 2001 | Linear Temporal Logic and Finite Semigroups. Thomas Wilke |
| 2001 | Lower Bounds for On-Line Single-Machine Scheduling. Leah Epstein, Rob van Stee |
| 2001 | Mathematical Foundations of Computer Science 2001, 26th International Symposium, MFCS 2001 Marianske Lazne, Czech Republic, August 27-31, 2001, Proceedings Jirí Sgall, Ales Pultr, Petr Kolman |
| 2001 | New Algorithms for k -SAT Based on the Local Search Principle. Uwe Schöning |
| 2001 | News from the Online Traveling Repairman. Sven Oliver Krumke, Willem de Paepe, Diana Poensgen, Leen Stougie |
| 2001 | Note on Minimal Finite Automata. Galina Jirásková |
| 2001 | On Implications between P-NP-Hypotheses: Decision versus Computation in Algebraic Complexity. Peter Bürgisser |
| 2001 | On Pseudorandom Generators in NC. Mary Cryan, Peter Bro Miltersen |
| 2001 | On Reducibility and Symmetry of Disjoint NP-Pairs. Pavel Pudlák |
| 2001 | On the Approximability of the Steiner Tree Problem. Martin Thimm |
| 2001 | On the Computational Complexity of Infinite Words. Pavol Duris, Ján Manuch |
| 2001 | On the Equational Definition of the Least Prefixed Point. Luigi Santocanale |
| 2001 | On the Periods of Partial Words. Arseny M. Shur, Yulia V. Konovalova |
| 2001 | On-Line Scheduling with Tight Deadlines. Chiu-Yuen Koo, Tak Wah Lam, Tsuen-Wan Ngan, Kar-Keung To |
| 2001 | Partial Information and Special Case Algorithms. Arfst Nickelsen |
| 2001 | Playing Games with Algorithms: Algorithmic Combinatorial Game Theory. Erik D. Demaine |
| 2001 | Quantifier Rank for Parity of Embedded Finite Models. Hervé Fournier |
| 2001 | Randomness and Reducibility. Rodney G. Downey, Denis R. Hirschfeldt, Geoffrey LaForte |
| 2001 | Rational Graphs Trace Context-Sensitive Languages. Christophe Morvan, Colin Stirling |
| 2001 | Refined Search Tree Technique for DOMINATING SET on Planar Graphs. Jochen Alber, Hongbing Fan, Michael R. Fellows, Henning Fernau, Rolf Niedermeier, Frances A. Rosamond, Ulrike Stege |
| 2001 | Satisfiability of Systems of Equations over Finite Monoids. Cristopher Moore, Pascal Tesson, Denis Thérien |
| 2001 | Sharing One Secret vs. Sharing Many Secrets: Tight Bounds for the Max Improvement Ratio. Giovanni Di Crescenzo |
| 2001 | Some Recent Results on Data Mining and Search. Amos Fiat |
| 2001 | Space Hierarchy Theorem Revised. Viliam Geffert |
| 2001 | Synchronizing Finite Automata on Eulerian Digraphs. Jarkko Kari |
| 2001 | Syntactic Semiring of a Language. Libor Polák |
| 2001 | The Complexity of Computing the Number of Self-Avoiding Walks in Two-Dimensional Grid Graphs and in Hypercube Graphs. Mitsunori Ogihara, Seinosuke Toda |
| 2001 | The Complexity of Tensor Circuit Evaluation. Martin Beaudry, Markus Holzer |
| 2001 | The Complexity of the Minimal Polynomial. Thanh Minh Hoang, Thomas Thierauf |
| 2001 | The Computational Power of a Family of Decision Forests. Kazuyuki Amano, Tsukuru Hirosawa, Yusuke Watanabe, Akira Maruoka |
| 2001 | The Size of Power Automata. Klaus Sutner |
| 2001 | The Strength of Non-size-increasing Computation (Introduction and Summary). Martin Hofmann |
| 2001 | The k-Median Problem for Directed Trees. Marek Chrobak, Lawrence L. Larmore, Wojciech Rytter |
| 2001 | There Are No Sparse NP Felipe Cucker, Dima Grigoriev |
| 2001 | Towards Regular Languages over Infinite Alphabets. Frank Neven, Thomas Schwentick, Victor Vianu |
| 2001 | Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs. Burkhard Monien, Robert Preis |
| 2001 | Variations on a Theorem of Fine & Wilf. Filippo Mignosi, Jeffrey O. Shallit, Ming-wei Wang |
| 2001 | Word Problems for 2-Homogeneous Monoids and Symmetric Logspace. Markus Lohrey |