| 2001 | Concurrency in Timed Automata. | Ruggero Lanotte, Andrea Maggiolo-Schettini, Simone Tini |
| 2001 | How Powerful Are Infinite Time Machines? | Grgory Lafitte |
| 2001 | Divisibility Monoids: Presentation, Word Problem, and Rational Languages. | Dietrich Kuske |
| 2001 | Cones, Semi-AFPs, and AFPs of Algebraic Power Series. | Werner Kuich |
| 2001 | New Small Universal Circular Post Machines. | Manfred Kudlek, Yurii Rogozhin |
| 2001 | On Complexity of Colouring Mixed Hypertrees. | Daniel Krl |
| 2001 | A Primitive for Proving the Security of Every Bit and About Universal Hash Functions & Hard Core Bits. | Eike Kiltz |
| 2001 | Approximating Bounded Degree Instances of NP-Hard Problems. | Marek Karpinski |
| 2001 | On the Complexity of Decidable Cases of Commutation Problem for Languages. | Juhani Karhumki, Wojciech Plandowski, Wojciech Rytter |
| 2001 | Challenges of Commutation. | Juhani Karhumki |
| 2001 | Dense Families and Key Functions of Database Relation Instances. | Jouni Jrvinen |
| 2001 | Approximation Algorithms for Fractional Covering and Packing Problems, and Applications. | Klaus Jansen |
| 2001 | Prediction-Preserving Reducibility with Membership Queries on Formal Languages. | Kouichi Hirata, Hiroshi Sakamoto |
| 2001 | If P != NP Then Some Strongly Noninvertible Functions Are Invertible. | Lane A. Hemaspaandra, Kari Pasanen, Jrg Rothe |
| 2001 | Modelling Change with the Aid of Knowledge and Time. | Bernhard Heinemann |
| 2001 | Time/Space Efficient Compressed Pattern Matching. | Leszek Gasieniec, Igor Potapov |
| 2001 | Multicasting in Optical Networks. | Luisa Gargano |
| 2001 | A Combinatorial Aggregation Algorithm for Stationary Distribution of a Large Markov Chain. | Anna Gambin, Piotr Pokarowski |
| 2001 | Curved Edge Routing. | Karlis Freivalds |
| 2001 | Approximation Algorithms for Time-Dependent Orienteering. | Fedor V. Fomin, Andrzej Lingas |
| 2001 | Approximating Minimum Cocolourings. | Fedor V. Fomin, Dieter Kratsch, Jean-Christophe Novelli |
| 2001 | On Minimizing Average Weighted Completion Time: A PTAS for Scheduling General Multiprocessor Tasks. | Aleksei V. Fishkin, Klaus Jansen, Lorant Porkolab |
| 2001 | New Results for Path Problems in Generalized Stars, Complete Graphs, and Brick Wall Graphs. | Thomas Erlebach, Danica Vukadinovic |
| 2001 | Optimal Online Flow Time with Resource Augmentation. | Leah Epstein, Rob van Stee |
| 2001 | Space-Efficient 1.5-Way Quantum Turing Machine. | Andrej Dubrovsky |