| 2001 | A Combinatorial Aggregation Algorithm for Stationary Distribution of a Large Markov Chain. Anna Gambin, Piotr Pokarowski |
| 2001 | A Discrete Approximation and Communication Complexity Approach to the Superposition Problem. Farid M. Ablayev, Svetlana Ablayeva |
| 2001 | A General Method for Graph Isomorphism. Gabriel Valiente |
| 2001 | A Primitive for Proving the Security of Every Bit and About Universal Hash Functions & Hard Core Bits. Eike Kiltz |
| 2001 | Ambainis-Freivalds' Algorithm for Measure-Once Automata. Aija Berzina, Richard F. Bonner |
| 2001 | Approximating Bounded Degree Instances of NP-Hard Problems. Marek Karpinski |
| 2001 | Approximating Minimum Cocolourings. Fedor V. Fomin, Dieter Kratsch, Jean-Christophe Novelli |
| 2001 | Approximation Algorithms for Fractional Covering and Packing Problems, and Applications. Klaus Jansen |
| 2001 | Approximation Algorithms for Time-Dependent Orienteering. Fedor V. Fomin, Andrzej Lingas |
| 2001 | Are There Essentially Incomplete Knowledge Representation Systems? Janis Cirulis |
| 2001 | Best Increments for the Average Case of Shellsort. Marcin Ciura |
| 2001 | Challenges of Commutation. Juhani Karhumäki |
| 2001 | Closure of Polynomial Time Partial Information Classes under Polynomial Time Reductions. Arfst Nickelsen, Till Tantau |
| 2001 | Combining Arithmetic and Geometric Rounding Techniques for Knapsack Problems. Monaldo Mastrolilli |
| 2001 | Compositional Homomorphisms of Relational Structures. Michal Walicki, Adis Hodzic, Sigurd Meldal |
| 2001 | Concurrency in Timed Automata. Ruggero Lanotte, Andrea Maggiolo-Schettini, Simone Tini |
| 2001 | Cones, Semi-AFPs, and AFPs of Algebraic Power Series. Werner Kuich |
| 2001 | Curved Edge Routing. Karlis Freivalds |
| 2001 | Dense Families and Key Functions of Database Relation Instances. Jouni Järvinen |
| 2001 | Designing PTASs for MIN-SUM Scheduling Problems. Foto N. Afrati, Ioannis Milis |
| 2001 | Differential Approximation Results for the Traveling Salesman Problem with Distances 1 and 2. Jérôme Monnot, Vangelis Th. Paschos, Sophie Toulouse |
| 2001 | Divisibility Monoids: Presentation, Word Problem, and Rational Languages. Dietrich Kuske |
| 2001 | Efficient Computation of Singular Moduli with Application in Cryptography. Harald Baier |
| 2001 | Equivalence Problem of Composite Class Diagrams. Girts Linde |
| 2001 | Fundamentals of Computation Theory, 13th International Symposium, FCT 2001, Riga, Latvia, August 22-24, 2001, Proceedings Rusins Freivalds |
| 2001 | Fuzzy Sets and Algorithms of Distributed Task Allocation for Cooperative Agents. Tanya Plotkin |
| 2001 | How Powerful Are Infinite Time Machines? Grégory Lafitte |
| 2001 | If P != NP Then Some Strongly Noninvertible Functions Are Invertible. Lane A. Hemaspaandra, Kari Pasanen, Jörg Rothe |
| 2001 | Linear Automata and Recognizable Subsets in Free Semirings. Olga Sokratova |
| 2001 | Linear Time Recognizer for Subsets of Z Christophe Papazian, Eric Rémila |
| 2001 | Mathematical Models and Optimal Algorithms of Dynamic Data Structure Control. Andrew V. Sokolov |
| 2001 | Modelling Change with the Aid of Knowledge and Time. Bernhard Heinemann |
| 2001 | Monte-Carlo Polynomial Versus Linear Time - The Truth-Table Case. Robert Rettinger, Rutger Verbeek |
| 2001 | Multicasting in Optical Networks. Luisa Gargano |
| 2001 | New Results for Path Problems in Generalized Stars, Complete Graphs, and Brick Wall Graphs. Thomas Erlebach, Danica Vukadinovic |
| 2001 | New Small Universal Circular Post Machines. Manfred Kudlek, Yurii Rogozhin |
| 2001 | On Complexity of Colouring Mixed Hypertrees. Daniel Král |
| 2001 | On Computational Power of Quantum Branching Programs. Farid M. Ablayev, Aida Gainutdinova, Marek Karpinski |
| 2001 | On Logical Method for Counting Dedekind Numbers. Mati Tombak, Ain Isotamm, Tõnu Tamme |
| 2001 | On Minimizing Average Weighted Completion Time: A PTAS for Scheduling General Multiprocessor Tasks. Aleksei V. Fishkin, Klaus Jansen, Lorant Porkolab |
| 2001 | On Recursively Enumerable Subsets of N and Rees Matrix Semigroups over (Z Bella V. Rozenblat |
| 2001 | On Robust Algorithms for the Maximum Weight Stable Set Problem. Andreas Brandstädt |
| 2001 | On the Category of Event Structures with Dense Time. Nataly S. Moskaljova, Irina B. Virbitskaite |
| 2001 | On the Complexity of Decidable Cases of Commutation Problem for Languages. Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter |
| 2001 | Optimal Online Flow Time with Resource Augmentation. Leah Epstein, Rob van Stee |
| 2001 | Piecewise and Local Threshold Testability of DFA. A. N. Trahtman |
| 2001 | Polynomial Time Algorithms for Finding Unordered Tree Patterns with Internal Variables. Takayoshi Shoudai, Tomoyuki Uchida, Tetsuhiro Miyahara |
| 2001 | Prediction-Preserving Reducibility with Membership Queries on Formal Languages. Kouichi Hirata, Hiroshi Sakamoto |
| 2001 | Pythagorean Triples in Unification Theory of Nilpotent Rings. Ruvim Lipyanski |
| 2001 | Quantum Algorithms. Umesh V. Vazirani |
| 2001 | Quantum Real-Time Turing Machine. Oksana Scegulnaja |
| 2001 | Quantum Reversibility and a New Model of Quantum Automaton. Massimo Pica Ciamarra |
| 2001 | Relating Automata-Theoretic Hierarchies to Complexity-Theoretic Hierarchies. Victor L. Selivanov |
| 2001 | Representation of Autonomous Automata. Janis Buls, Vaira Buza, Roberts Glaudins |
| 2001 | Space-Efficient 1.5-Way Quantum Turing Machine. Andrej Dubrovsky |
| 2001 | Structured Randomized Rounding and Coloring. Benjamin Doerr |
| 2001 | The Complexity of Maximum Matroid-Greedoid Intersection. Taneli Mielikäinen, Esko Ukkonen |
| 2001 | Time/Space Efficient Compressed Pattern Matching. Leszek Gasieniec, Igor Potapov |
| 2001 | Towards Axiomatic Basis of Inductive Inference. Janis Barzdins, Rusins Freivalds, Carl H. Smith |
| 2001 | Two-States Bilinear Intrinsically Universal Cellular Automata. Nicolas Ollinger |
| 2001 | Universal Algebra and Computer Science. Boris I. Plotkin, Tanya Plotkin |