| 2003 | An Improved Approximation Algorithm for Computing Geometric Shortest Paths. | Lyudmil Aleksandrov, Anil Maheshwari, Jrg-Rdiger Sack |
| 2003 | Classical Simulation Complexity of Quantum Machines. | Farid M. Ablayev, Aida Gainutdinova |
| 2001 | Compositional Homomorphisms of Relational Structures. | Michal Walicki, Adis Hodzic, Sigurd Meldal |
| 2001 | Quantum Algorithms. | Umesh V. Vazirani |
| 2001 | A General Method for Graph Isomorphism. | Gabriel Valiente |
| 2001 | Piecewise and Local Threshold Testability of DFA. | A. N. Trahtman |
| 2001 | On Logical Method for Counting Dedekind Numbers. | Mati Tombak, Ain Isotamm, Tnu Tamme |
| 2001 | Linear Automata and Recognizable Subsets in Free Semirings. | Olga Sokratova |
| 2001 | Mathematical Models and Optimal Algorithms of Dynamic Data Structure Control. | Andrew V. Sokolov |
| 2001 | Polynomial Time Algorithms for Finding Unordered Tree Patterns with Internal Variables. | Takayoshi Shoudai, Tomoyuki Uchida, Tetsuhiro Miyahara |
| 2001 | Relating Automata-Theoretic Hierarchies to Complexity-Theoretic Hierarchies. | Victor L. Selivanov |
| 2001 | Quantum Real-Time Turing Machine. | Oksana Scegulnaja |
| 2001 | On Recursively Enumerable Subsets of N and Rees Matrix Semigroups over (Z | Bella V. Rozenblat |
| 2001 | Monte-Carlo Polynomial Versus Linear Time - The Truth-Table Case. | Robert Rettinger, Rutger Verbeek |
| 2001 | Universal Algebra and Computer Science. | Boris I. Plotkin, Tanya Plotkin |
| 2001 | Fuzzy Sets and Algorithms of Distributed Task Allocation for Cooperative Agents. | Tanya Plotkin |
| 2001 | Linear Time Recognizer for Subsets of Z | Christophe Papazian, Eric Rmila |
| 2001 | Two-States Bilinear Intrinsically Universal Cellular Automata. | Nicolas Ollinger |
| 2001 | Closure of Polynomial Time Partial Information Classes under Polynomial Time Reductions. | Arfst Nickelsen, Till Tantau |
| 2001 | On the Category of Event Structures with Dense Time. | Nataly S. Moskaljova, Irina B. Virbitskaite |
| 2001 | Differential Approximation Results for the Traveling Salesman Problem with Distances 1 and 2. | Jrme Monnot, Vangelis Th. Paschos, Sophie Toulouse |
| 2001 | The Complexity of Maximum Matroid-Greedoid Intersection. | Taneli Mielikinen, Esko Ukkonen |
| 2001 | Combining Arithmetic and Geometric Rounding Techniques for Knapsack Problems. | Monaldo Mastrolilli |
| 2001 | Pythagorean Triples in Unification Theory of Nilpotent Rings. | Ruvim Lipyanski |
| 2001 | Equivalence Problem of Composite Class Diagrams. | Girts Linde |