| 2002 | A PTAS for Distinguishing (Sub)string Selection. | Xiaotie Deng, Guojun Li, Zimao Li, Bin Ma, Lusheng Wang |
| 2002 | Improved Bounds and New Trade-Offs for Dynamic All Pairs Shortest Paths. | Camil Demetrescu, Giuseppe F. Italiano |
| 2002 | Scheduling Search Procedures. | Peter Damaschke |
| 2002 | Constraint Satisfaction Problems in Non-deterministic Logarithmic Space. | Vctor Dalmau |
| 2002 | Polynomial-Time Approximation Schemes for the Euclidean Survivable Network Design Problem. | Artur Czumaj, Andrzej Lingas, Hairong Zhao |
| 2002 | On Families of Graphs Having a Decidable First Order Theory with Reachability. | Thomas Colcombet |
| 2002 | Preemptive Scheduling in Overloaded Systems. | Marek Chrobak, Leah Epstein, John Noga, Jir Sgall, Rob van Stee, Toms Tich, Nodari Vakhania |
| 2002 | Gossiping with Bounded Size Messages in ad hoc Radio Networks. | Malin Christersson, Leszek Gasieniec, Andrzej Lingas |
| 2002 | New Algorithms for Subset Query, Partial Match, Orthogonal Range Searching, and Related Problems. | Moses Charikar, Piotr Indyk, Rina Panigrahy |
| 2002 | Finding Frequent Items in Data Streams. | Moses Charikar, Kevin C. Chen, Martin Farach-Colton |
| 2002 | A Spatial Logic for Querying Graphs. | Luca Cardelli, Philippa Gardner, Giorgio Ghelli |
| 2002 | Symbolic Strategy Synthesis for Games on Pushdown Graphs. | Thierry Cachat |
| 2002 | Solving the String Statistics Problem in Time O(n log n). | Gerth Stlting Brodal, Rune B. Lyngs, Anna stlin, Christian N. S. Pedersen |
| 2002 | Cache Oblivious Distribution Sweeping. | Gerth Stlting Brodal, Rolf Fagerberg |
| 2002 | Testing Labelled Markov Processes. | Franck van Breugel, Steven Shalit, James Worrell |
| 2002 | Random Numbers and an Incomplete Immune Recursive Set. | Vasco Brattka |
| 2002 | Wagner's Theorem on Realizers. | Nicolas Bonichon, Bertrand Le Sac, Mohamed Mosbah |
| 2002 | Two-Way Alternating Automata and Finite Models. | Mikolaj Bojanczyk |
| 2002 | Finding a Path of Superlogarithmic Length. | Andreas Bjrklund, Thore Husfeldt |
| 2002 | Navigating with a Browser. | Michal Bielecki, Jan Hidders, Jan Paredaens, Jerzy Tyszkiewicz, Jan Van den Bussche |
| 2002 | Approximating Huffman Codes in Parallel. | Piotr Berman, Marek Karpinski, Yakov Nekrich |
| 2002 | Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION. | Piotr Berman, Marek Karpinski |
| 2002 | Exponential Structures for Efficient Cache-Oblivious Algorithms. | Michael A. Bender, Richard Cole, Rajeev Raman |
| 2002 | Energy Optimal Routing in Radio Networks Using Geometric Data Structures. | Ren Beier, Peter Sanders, Naveen Sivadasan |
| 2002 | Comparing Functional Paradigms for Exact Real-Number Computation. | Andrej Bauer, Martn Htzel Escard, Alex K. Simpson |