| 2002 | On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets. | Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino |
| 2002 | Pure Dominance Constraints. | Manuel Bodirsky, Martin Kutz |
| 2002 | Axiomatising Tree-Interpretable Structures. | Achim Blumensath |
| 2002 | On the Enumerative Sequences of Regular Languages on k Symbols. | Marie-Pierre Bal, Dominique Perrin |
| 2002 | Scheduling at Twilight the Easy Way. | Hannah Bast |
| 2002 | Axiomatizing GSOS with Termination. | Jos C. M. Baeten, Erik P. de Vink |
| 2002 | On the Complexity of Protein Similarity Search under mRNA Structure Constraints. | Rolf Backofen, N. S. Narayanaswamy, Firas Swidan |
| 2002 | Games with a Uniqueness Property. | Shin Aida, Marcel Crsmaru, Kenneth W. Regan, Osamu Watanabe |
| 2002 | Tight Bounds for the Performance of Longest-in-System on DAGs. | Micah Adler, Adi Rosn |
| 2002 | A Quantum Goldreich-Levin Theorem with Cryptographic Applications. | Mark Adcock, Richard Cleve |
| 2001 | A Primal-Dual Approximation Algorithm for the Survivable Network Design Problem in Hypergraph. | Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki |
| 2001 | New Bounds on the OBDD-Size of Integer Multiplication via Universal Hashing. | Philipp Woelfel |
| 2001 | Regular Languages Defined by Generalized First-Order Formulas with a Bounded Number of Bound Variables. | Howard Straubing, Denis Thrien |
| 2001 | A Logical Approach to Decidability of Hierarchies of Regular Star-Free Languages. | Victor L. Selivanov |
| 2001 | The #a = #b Pictures Are Recognizable. | Klaus Reinhardt |
| 2001 | Semantical Principles in the Modal Logic of Coalgebras. | Dirk Pattinson |
| 2001 | Approximation Algorithms for the Bottleneck Stretch Factor Problem. | Giri Narasimhan, Michiel H. M. Smid |
| 2001 | The Complexity of Copy Constant Detection in Parallel Programs. | Markus Mller-Olm |
| 2001 | A New Logical Characterization of Bchi Automata. | Giacomo Lenzi |
| 2001 | An Ehrenfeucht-Frass Approach to Collapse Results for First-Order Queries over Embedded Databases. | Clemens Lautemann, Nicole Schweikardt |
| 2001 | A Model Theoretic Proof of Bchi-Type Theorems and First-Order Logic for N-Free Pomsets. | Dietrich Kuske |
| 2001 | Approximation Algorithms for Minimum Size 2-Connectivity Problems. | Piotr Krysta, V. S. Anil Kumar |
| 2001 | On the Minimal Hardware Complexity of Pseudorandom Function Generators. | Matthias Krause, Stefan Lucks |
| 2001 | Myhill-Nerode Relations on Automatic Systems and the Completeness of Kleene Algebra. | Dexter Kozen |
| 2001 | The Complexity of Minimal Satisfiability Problems. | Lefteris M. Kirousis, Phokion G. Kolaitis |