| 2001 | 2-Nested Simulation Is Not Finitely Equationally Axiomatizable. Luca Aceto, Wan J. Fokkink, Anna Ingólfsdóttir |
| 2001 | A (5/2)n Markus Bläser |
| 2001 | A Logical Approach to Decidability of Hierarchies of Regular Star-Free Languages. Victor L. Selivanov |
| 2001 | A Model Theoretic Proof of Büchi-Type Theorems and First-Order Logic for N-Free Pomsets. Dietrich Kuske |
| 2001 | A New Logical Characterization of Büchi Automata. Giacomo Lenzi |
| 2001 | A Primal-Dual Approximation Algorithm for the Survivable Network Design Problem in Hypergraph. Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki |
| 2001 | A Simple Undecidable Problem: The Inclusion Problem for Finite Substitutions on ab Juhani Karhumäki, Leonid P. Lisovik |
| 2001 | A Toolkit for First Order Extensions of Monadic Games. David Janin, Jerzy Marcinkowski |
| 2001 | An Ehrenfeucht-Fraïssé Approach to Collapse Results for First-Order Queries over Embedded Databases. Clemens Lautemann, Nicole Schweikardt |
| 2001 | Approximation Algorithms for Minimum Size 2-Connectivity Problems. Piotr Krysta, V. S. Anil Kumar |
| 2001 | Approximation Algorithms for the Bottleneck Stretch Factor Problem. Giri Narasimhan, Michiel H. M. Smid |
| 2001 | Deterministic Radio Broadcasting at Low Cost. Anders Dessmark, Andrzej Pelc |
| 2001 | Efficient Minimal Perfect Hashing in Nearly Minimal Space. Torben Hagerup, Torsten Tholey |
| 2001 | Efficient Recognition of Random Unsatisfiable k-SAT Instances by Spectral Methods. Andreas Goerdt, Michael Krivelevich |
| 2001 | Evasiveness of Subgraph Containment and Related Properties. Amit Chakrabarti, Subhash Khot, Yaoyun Shi |
| 2001 | Gathering of Asynchronous Oblivious Robots with Limited Visibility. Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Peter Widmayer |
| 2001 | Generalized Langton's Ant: Dynamical Behavior and Complexity. Anahí Gajardo, Eric Goles Ch., Andrés Moreira |
| 2001 | Generalized Model-Checking Problems for First-Order Logic. Martin Grohe |
| 2001 | Learning Expressions over Monoids. Ricard Gavaldà, Denis Thérien |
| 2001 | Matching Polygonal Curves with Respect to the Fréchet Distance. Helmut Alt, Christian Knauer, Carola Wenk |
| 2001 | Myhill-Nerode Relations on Automatic Systems and the Completeness of Kleene Algebra. Dexter Kozen |
| 2001 | New Bounds on the OBDD-Size of Integer Multiplication via Universal Hashing. Philipp Woelfel |
| 2001 | New Results on Alternating and Non-deterministic Two-Dimensional Finite-State Automata. Jarkko Kari, Cristopher Moore |
| 2001 | On Multipartition Communication Complexity. Pavol Duris, Juraj Hromkovic, Stasys Jukna, Martin Sauerhoff, Georg Schnitger |
| 2001 | On Presburger Liveness of Discrete Timed Automata. Zhe Dang, Pierluigi San Pietro, Richard A. Kemmerer |
| 2001 | On the Circuit Complexity of Random Generation Problems for Regular and Context-Free Languages. Massimiliano Goldwurm, Beatrice Palano, Massimo Santini |
| 2001 | On the Class of Languages Recognizable by 1-Way Quantum Finite Automata. Andris Ambainis, Arnolds Kikusts, Maris Valdats |
| 2001 | On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs. Andrea E. F. Clementi, Pierluigi Crescenzi, Paolo Penna, Gianluca Rossi, Paola Vocca |
| 2001 | On the Difference between Polynomial-Time Many-One and Truth-Table Reducibilities on Distributional Problems. Shin Aida, Rainer Schuler, Tatsuie Tsukiji, Osamu Watanabe |
| 2001 | On the Minimal Hardware Complexity of Pseudorandom Function Generators. Matthias Krause, Stefan Lucks |
| 2001 | Optimal Preemptive Scheduling on Uniform Processors with Non-decreasing Speed Ratios. Leah Epstein |
| 2001 | Optimal and Approximate Station Placement in Networks (With Applications to Multicasting and Space Efficient Traversals). Clemente Galdi, Christos Kaklamanis, Manuela Montangero, Pino Persiano |
| 2001 | Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs. Klaus Jansen, Marek Karpinski, Andrzej Lingas, Eike Seidel |
| 2001 | Randomness, Computability, and Density. Rodney G. Downey, Denis R. Hirschfeldt, André Nies |
| 2001 | Recurrence in Infinite Words. Julien Cassaigne |
| 2001 | Recursive Randomized Coloring Beats Fair Dice Random Colorings. Benjamin Doerr, Anand Srivastav |
| 2001 | Refining the Hierarchy of Blind Multicounter Languages. Matthias Jantzen, Alexy Kurganskyy |
| 2001 | Regular Languages Defined by Generalized First-Order Formulas with a Bounded Number of Bound Variables. Howard Straubing, Denis Thérien |
| 2001 | Residual Finite State Automata. François Denis, Aurélien Lemay, Alain Terlutte |
| 2001 | STACS 2001, 18th Annual Symposium on Theoretical Aspects of Computer Science, Dresden, Germany, February 15-17, 2001, Proceedings Afonso Ferreira, Horst Reichel |
| 2001 | Scalable Sparse Topologies with Small Spectrum. Robert Elsässer, Rastislav Kralovic, Burkhard Monien |
| 2001 | Semantical Principles in the Modal Logic of Coalgebras. Dirk Pattinson |
| 2001 | Small PCPs with Low Query Complexity. Prahladh Harsha, Madhu Sudan |
| 2001 | Space Efficient Algorithms for Series-Parallel Graphs. Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk |
| 2001 | Star-Free Open Languages and Aperiodic Loops. Martin Beaudry, François Lemieux, Denis Thérien |
| 2001 | The #a = #b Pictures Are Recognizable. Klaus Reinhardt |
| 2001 | The Complexity of Copy Constant Detection in Parallel Programs. Markus Müller-Olm |
| 2001 | The Complexity of Minimal Satisfiability Problems. Lefteris M. Kirousis, Phokion G. Kolaitis |
| 2001 | The Existential Theory of Equations with Rational Constraints in Free Groups is PSPACE-Complete. Volker Diekert, Claudio Gutierrez, Christian Hagenah |
| 2001 | The UPS Problem. Cristina G. Fernandes, Till Nierhoff |