| 2002 | A Further Step towards a Theory of Regular MSC Languages. Dietrich Kuske |
| 2002 | A Lower Bound Technique for Restricted Branching Programs and Applications. Philipp Woelfel |
| 2002 | A New Diagram from Disks in the Plane. Joachim Giesen, Matthias John |
| 2002 | A Parametric Analysis of the State Explosion Problem in Model Checking. Stéphane Demri, François Laroussinie, Philippe Schnoebelen |
| 2002 | A Probabilistic 3-SAT Algorithm Further Improved. Thomas Hofmeister, Uwe Schöning, Rainer Schuler, Osamu Watanabe |
| 2002 | A Quantum Goldreich-Levin Theorem with Cryptographic Applications. Mark Adcock, Richard Cleve |
| 2002 | A Space Lower Bound for Routing in Trees. Pierre Fraigniaud, Cyril Gavoille |
| 2002 | An Asymptotic O(ln rho/ln ln rho)-Approximation Algorithm for the Scheduling Problem with Duplication on Large Communication Delay Graphs. Renaud Lepère, Christophe Rapine |
| 2002 | Approximate Strong Separation with Application in Fractional Graph Coloring and Preemptive Scheduling. Klaus Jansen |
| 2002 | Approximations for ATSP with Parametrized Triangle Inequality. L. Sunil Chandran, L. Shankar Ram |
| 2002 | Axiomatising Tree-Interpretable Structures. Achim Blumensath |
| 2002 | Axiomatizing GSOS with Termination. Jos C. M. Baeten, Erik P. de Vink |
| 2002 | Balanced Coloring: Equally Easy for All Numbers of Colors? Benjamin Doerr |
| 2002 | Bi-Immunity Separates Strong NP-Completeness Notions. Aduri Pavan, Alan L. Selman |
| 2002 | Comparing Verboseness for Finite Automata and Turing Machines. Till Tantau |
| 2002 | Complexity of Multi-dimensional Loop Alignment. Alain Darte, Guillaume Huard |
| 2002 | Complexity of Semi-algebraic Proofs. Dima Grigoriev, Edward A. Hirsch, Dmitrii V. Pasechnik |
| 2002 | Computing the Maximum Detour and Spanning Ratio of Planar Paths, Trees, and Cycles. Stefan Langerman, Pat Morin, Michael A. Soss |
| 2002 | Describing Parameterized Complexity Classes. Jörg Flum, Martin Grohe |
| 2002 | EXPSPACE-Complete Variant of Guarded Fragment with Transitivity. Emanuel Kieronski |
| 2002 | Existential and Positive Theories of Equations in Graph Products. Volker Diekert, Markus Lohrey |
| 2002 | Games with a Uniqueness Property. Shin Aida, Marcel Crâsmaru, Kenneth W. Regan, Osamu Watanabe |
| 2002 | Generalized Model-Checking over Locally Tree-Decomposable Classes. Markus Frick |
| 2002 | Ground Tree Rewriting Graphs of Bounded Tree Width. Christof Löding |
| 2002 | How Many Missing Answers Can Be Tolerated by Query Learners? Hans Ulrich Simon |
| 2002 | Hyper-Encryption and Everlasting Security. Yan Zong Ding, Michael O. Rabin |
| 2002 | Improved Quantum Communication Complexity Bounds for Disjointness and Equality. Peter Høyer, Ronald de Wolf |
| 2002 | Labeling Schemes for Dynamic Tree Networks. Amos Korman, David Peleg, Yoav Rodeh |
| 2002 | Learnability and Definability in Trees and Similar Structures. Martin Grohe, György Turán |
| 2002 | Models and Techniques for Communication in Dynamic Networks. Christian Scheideler |
| 2002 | Nesting Until and Since in Linear Temporal Logic. Denis Thérien, Thomas Wilke |
| 2002 | On Dualization in Products of Forests. Khaled M. Elbassioni |
| 2002 | On Quantum Computation with Some Restricted Amplitudes. Harumichi Nishimura |
| 2002 | On Quantum Versions of the Yao Principle. Mart de Graaf, Ronald de Wolf |
| 2002 | On Quantum and Approximate Privacy. Hartmut Klauck |
| 2002 | On the Average Parallelism in Trace Monoids. Daniel Krob, Jean Mairesse, Ioannis Michos |
| 2002 | On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets. Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino |
| 2002 | On the Complexity of Protein Similarity Search under mRNA Structure Constraints. Rolf Backofen, N. S. Narayanaswamy, Firas Swidan |
| 2002 | On the Computational Power of Boolean Decision Lists. Matthias Krause |
| 2002 | On the Enumerative Sequences of Regular Languages on k Symbols. Marie-Pierre Béal, Dominique Perrin |
| 2002 | On the Parameterized Intractability of CLOSEST SUBSTRINGsize and Related Problems. Michael R. Fellows, Jens Gramm, Rolf Niedermeier |
| 2002 | Pure Dominance Constraints. Manuel Bodirsky, Martin Kutz |
| 2002 | Randomized Acceleration of Fundamental Matrix Computations. Victor Y. Pan |
| 2002 | Recognizable Sets of Message Sequence Charts. Rémi Morin |
| 2002 | STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings Helmut Alt, Afonso Ferreira |
| 2002 | Scheduling at Twilight the Easy Way. Hannah Bast |
| 2002 | Strong Bisimilarity and Regularity of Basic Parallel Processes Is PSPACE-Hard. Jirí Srba |
| 2002 | The Complexity of Constraints on Intervals and Lengths. Andrei A. Krokhin, Peter Jeavons, Peter Jonsson |
| 2002 | The Complexity of Graph Isomorphism for Colored Graphs with Color Classes of Size 2 and 3. Johannes Köbler, Jacobo Torán |
| 2002 | The Membership Problem for Regular Expressions with Intersection Is Complete in LOGCFL. Holger Petersen |
| 2002 | The Secret of Selective Game Tree Search, When Using Random-Error Evaluations. Ulf Lorenz, Burkhard Monien |
| 2002 | Tight Bounds for the Performance of Longest-in-System on DAGs. Micah Adler, Adi Rosén |
| 2002 | Timed Control Synthesis for External Specifications. Deepak D'Souza, P. Madhusudan |
| 2002 | What Is a Theory? Gilles Dowek |