| 2002 | A Chomsky-Like Hierarchy of Infinite Graphs. Didier Caucal, Teodor Knapik |
| 2002 | A Lower Bound Technique for Nondeterministic Graph-Driven Read-Once-Branching Programs and Its Applications. Beate Bollig, Philipp Woelfel |
| 2002 | Accessibility in Automata on Scattered Linear Orderings. Olivier Carton |
| 2002 | Algorithms for Computing Small NFAs. Lucian Ilie, Sheng Yu |
| 2002 | An Approximation Semantics for the Propositional Mu-Calculus. Roger Villemaire |
| 2002 | An Explicit Lower Bound of 5n - o(n) for Boolean Circuits. Kazuo Iwama, Hiroki Morizumi |
| 2002 | An Improved Algorithm for the Membership Problem for Extended Regular Expressions. Orna Kupferman, Sharon Zuhovitzky |
| 2002 | An Optimal Lower Bound for Resolution with 2-Conjunctions. Jan Johannsen, N. S. Narayanaswamy |
| 2002 | Applications of Finite Automata. Juhani Karhumäki |
| 2002 | Approximability of the Minimum Bisection Problem: An Algorithmic Challenge. Marek Karpinski |
| 2002 | Autoreducibility of Random Sets: A Sharp Bound on the Density of Guessed Bits. Todd Ebert, Wolfgang Merkle |
| 2002 | Characterizing Simpler Recognizable Sets of Integers. Michel Rigo |
| 2002 | Coloring k-Colorable Semirandom Graphs in Polynomial Expected Time via Semidefinite Programming. Amin Coja-Oghlan |
| 2002 | Comorphism-Based Grothendieck Logics. Till Mossakowski |
| 2002 | Competitive Analysis of On-line Stream Merging Algorithms. Wun-Tat Chan, Tak Wah Lam, Hing-Fung Ting, Prudence W. H. Wong |
| 2002 | Computational Complexity in the Hyperbolic Plane. Chuzo Iwamoto, Takeshi Andou, Kenichi Morita, Katsunobu Imai |
| 2002 | Computing Partial Information out of Intractable One - The First Digit of 2 Mika Hirvensalo, Juhani Karhumäki |
| 2002 | Derivation of Rational Expressions with Multiplicity. Sylvain Lombardy, Jacques Sakarovitch |
| 2002 | Edge-Colouring Pairs of Binary Trees: Towards a Concise Proof of the Four-Colour Theorem of Planar Maps. Alan Gibbons, Paul Sant |
| 2002 | Efficient Algorithms for Locating the Length-Constrained Heaviest Segments, with Applications to Biomolecular Sequence Analysis. Yaw-Ling Lin, Tao Jiang, Kun-Mao Chao |
| 2002 | Evolutive Tandem Repeats Using Hamming Distance. Richard Groult, Martine Léonard, Laurent Mouchard |
| 2002 | Fast Algorithms with Algebraic Monge Properties. Wolfgang W. Bein, Peter Brucker, Lawrence L. Larmore, James K. Park |
| 2002 | Finite Domain Constraint Satisfaction Using Quantum Computation. Ola Angelsmark, Vilhelm Dahllöf, Peter Jonsson |
| 2002 | Finite Test-Sets for Overlap-Free Morphisms. Gwénaël Richomme, Francis Wlazinski |
| 2002 | Global Development via Local Observational Construction Steps. Michel Bidoit, Donald Sannella, Andrzej Tarlecki |
| 2002 | Hypothesis-Founded Semantics for Datalog Programs with Negation. Yann Loyer, Nicolas Spyratos |
| 2002 | Improved Parameterized Algorithms for Planar Dominating Set. Iyad A. Kanj, Ljubomir Perkovic |
| 2002 | Low Stretch Spanning Trees. David Peleg |
| 2002 | Mathematical Foundations of Computer Science 2002, 27th International Symposium, MFCS 2002, Warsaw, Poland, August 26-30, 2002, Proceedings Krzysztof Diks, Wojciech Rytter |
| 2002 | Matroid Intersections, Polymatroid Inequalities, and Related Problems. Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan |
| 2002 | More on Weighted Servers or FIFO is Better than LRU. Leah Epstein, Csanád Imreh, Rob van Stee |
| 2002 | On Infinite Terms Having a Decidable Monadic Theory. Didier Caucal |
| 2002 | On Maximizing the Throughput of Multiprocessor Tasks. Aleksei V. Fishkin, Guochuan Zhang |
| 2002 | On Radiocoloring Hierarchically Specified Planar Graphs: PSPACE-Completeness and Approximations. Maria I. Andreou, Dimitris Fotakis, Sotiris E. Nikoletseas, Vicky G. Papadopoulou, Paul G. Spirakis |
| 2002 | On Verifying Fair Lossy Channel Systems. Benoît Masson, Philippe Schnoebelen |
| 2002 | On Word Equations in One Variable. Robert Dabrowski, Wojciech Plandowski |
| 2002 | On a Mereological System for Relational Software Specifications. Ryszard Janicki |
| 2002 | On the Complexity of Semantic Equivalences for Pushdown Automata and BPA. Antonín Kucera, Richard Mayr |
| 2002 | On the Construction of Effective Random Sets. Wolfgang Merkle, Nenad Mihailovic |
| 2002 | On the Problem of Scheduling Flows on Distributed Networks. Thomas Lücking, Burkhard Monien, Manuel Rode |
| 2002 | On the Structure of the Simulation Order of Proof Systems. Jochen Messner |
| 2002 | Optimal Free Binary Decision Diagrams for Computation of EAR Jan Kára, Daniel Král |
| 2002 | Optimal Non-preemptive Semi-online Scheduling on Two Related Machines. Leah Epstein, Lene M. Favrholdt |
| 2002 | Packing Edges in Random Regular Graphs. Mihalis Beis, William Duckworth, Michele Zito |
| 2002 | Parameterized Counting Problems. Catherine McCartin |
| 2002 | Some Results on Random Unsatisfiable k-Sat Instances and Approximation Algorithms Applied to Random Structures. Andreas Goerdt, Tomasz Jurdzinski |
| 2002 | Space-Economical Construction of Index Structures for All Suffixes of a String. Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Hideo Bannai, Setsuo Arikawa |
| 2002 | Subgraph Isomorphism, log-Bounded Fragmentation and Graphs of (Locally) Bounded Treewidth. Mohammad Taghi Hajiaghayi, Naomi Nishimura |
| 2002 | Symbolic Semantics and Analysis for Crypto-CCS with (Almost) Generic Inference Systems. Fabio Martinelli |
| 2002 | The Complexity of Tree Multicolorings. Dániel Marx |
| 2002 | Towards a Cardinality Theorem for Finite Automata. Till Tantau |
| 2002 | Two-Way Finite State Transducers with Nested Pebbles. Joost Engelfriet, Sebastian Maneth |
| 2002 | Unification Modulo Associativity and Idempotency Is NP-complete. Ondrej Klíma |
| 2002 | Unit Testing for CASL Architectural Specifications. Patrícia D. L. Machado, Donald Sannella |