| 2002 | A Banach-Mazur Computable But Not Markov Computable Function on the Computable Real Numbers. Peter Hertling |
| 2002 | A Faster All-Pairs Shortest Path Algorithm for Real-Weighted Sparse Graphs. Seth Pettie |
| 2002 | A PTAS for Distinguishing (Sub)string Selection. Xiaotie Deng, Guojun Li, Zimao Li, Bin Ma, Lusheng Wang |
| 2002 | A Spatial Logic for Querying Graphs. Luca Cardelli, Philippa Gardner, Giorgio Ghelli |
| 2002 | A Total Approach to Partial Algebraic Specification. José Meseguer, Grigore Rosu |
| 2002 | An Elementary Expressively Complete Temporal Logic for Mazurkiewicz Traces. Paul Gastin, Madhavan Mukund |
| 2002 | Antirandomizing the Wrong Game. Benjamin Doerr |
| 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 | Automata, Languages and Programming, 29th International Colloquium, ICALP 2002, Malaga, Spain, July 8-13, 2002, Proceedings Peter Widmayer, Francisco Triguero Ruiz, Rafael Morales Bueno, Matthew Hennessy, Stephan J. Eidenbenz, Ricardo Conejo |
| 2002 | Axiomatising Divergence. Markus Lohrey, Pedro R. D'Argenio, Holger Hermanns |
| 2002 | Bialgebraic Modelling of Timed Processes. Marco Kick |
| 2002 | Bounded-Depth Frege Systems with Counting Axioms Polynomially Simulate Nullstellensatz Refutations. Russell Impagliazzo, Nathan Segerlind |
| 2002 | Cache Oblivious Distribution Sweeping. Gerth Stølting Brodal, Rolf Fagerberg |
| 2002 | Call Control in Rings. Udo Adamy, Christoph Ambühl, R. Sai Anand, Thomas Erlebach |
| 2002 | Church-Rosser Languages vs. UCFL. Tomasz Jurdzinski, Krzysztof Lorys |
| 2002 | Circular Arrangements. Vincenzo Liberatore |
| 2002 | Comparing Functional Paradigms for Exact Real-Number Computation. Andrej Bauer, Martín Hötzel Escardó, Alex K. Simpson |
| 2002 | Complete and Tractable Local Linear Time Temporal Logics over Traces. Bharat Adsul, Milind A. Sohoni |
| 2002 | Constraint Satisfaction Problems in Non-deterministic Logarithmic Space. Víctor Dalmau |
| 2002 | Control Message Aggregation in Group Communication Protocols. Sanjeev Khanna, Joseph Naor, Danny Raz |
| 2002 | Correspondence Principles for Effective Dimensions. John M. Hitchcock |
| 2002 | Cryptographic Hardness Based on the Decoding of Reed-Solomon Codes. Aggelos Kiayias, Moti Yung |
| 2002 | Deciding DPDA Equivalence Is Primitive Recursive. Colin Stirling |
| 2002 | Discrete Tomography: Reconstruction under Periodicity Constraints. Alberto Del Lungo, Andrea Frosini, Maurice Nivat, Laurent Vuillon |
| 2002 | Efficient Testing of Hypergraphs. Yoshiharu Kohayakawa, Brendan Nagle, Vojtech Rödl |
| 2002 | Energy Optimal Routing in Radio Networks Using Geometric Data Structures. René Beier, Peter Sanders, Naveen Sivadasan |
| 2002 | Equivariant Syntax and Semantics. Andrew M. Pitts |
| 2002 | Exponential Lower Bound for Static Semi-algebraic Proofs. Dima Grigoriev, Edward A. Hirsch, Dmitrii V. Pasechnik |
| 2002 | Exponential Structures for Efficient Cache-Oblivious Algorithms. Michael A. Bender, Richard Cole, Rajeev Raman |
| 2002 | Fast Universalization of Investment Strategies with Provably Good Relative Returns. Karhan Akcoglu, Petros Drineas, Ming-Yang Kao |
| 2002 | Finding Frequent Items in Data Streams. Moses Charikar, Kevin C. Chen, Martin Farach-Colton |
| 2002 | Finding a Path of Superlogarithmic Length. Andreas Björklund, Thore Husfeldt |
| 2002 | Games Characterizing Levy-Longo Trees. C.-H. Luke Ong, Pietro Di Gianantonio |
| 2002 | Gossiping with Bounded Size Messages in ad hoc Radio Networks. Malin Christersson, Leszek Gasieniec, Andrzej Lingas |
| 2002 | Heuristically Optimized Trade-Offs: A New Paradigm for Power Laws in the Internet. Alex Fabrikant, Elias Koutsoupias, Christos H. Papadimitriou |
| 2002 | Histogramming Data Streams with Fast Per-Item Processing. Sudipto Guha, Piotr Indyk, S. Muthukrishnan, Martin Strauss |
| 2002 | Hyperbolic Recognition by Graph Automata. Christophe Papazian, Eric Rémila |
| 2002 | Improved Bounds and New Trade-Offs for Dynamic All Pairs Shortest Paths. Camil Demetrescu, Giuseppe F. Italiano |
| 2002 | Improved Inapproximability Results for Vertex Cover on k -Uniform Hypergraphs. Jonas Holmerin |
| 2002 | Improved Results for Stackelberg Scheduling Strategies. V. S. Anil Kumar, Madhav V. Marathe |
| 2002 | Improving Time Bounds on Maximum Generalised Flow Computations by Contracting the Network. Tomasz Radzik |
| 2002 | Inapproximability Results for Equations over Finite Groups. Lars Engebretsen, Jonas Holmerin, Alexander Russell |
| 2002 | Infinite-State High-Level MSCs: Model-Checking and Realizability. Blaise Genest, Anca Muscholl, Helmut Seidl, Marc Zeitoun |
| 2002 | Intersection of Regular Languages and Star Hierarchy. Sebastian Bala |
| 2002 | L(A) = L(B)? Decidability Results from Complete Formal Systems. Géraud Sénizergues |
| 2002 | Linear Time Algorithms on Chordal Bipartite and Strongly Chordal Graphs. Ryuhei Uehara |
| 2002 | Local and Global Methods in Data Mining: Basic Techniques and Open Problems. Heikki Mannila |
| 2002 | Measuring the Probabilistic Powerdomain. Keye Martin, Michael W. Mislove, James Worrell |
| 2002 | Molecular Assembly and Computation: From Theory to Experimental Demonstrations. John H. Reif |
| 2002 | Navigating with a Browser. Michal Bielecki, Jan Hidders, Jan Paredaens, Jerzy Tyszkiewicz, Jan Van den Bussche |
| 2002 | New Algorithms for Subset Query, Partial Match, Orthogonal Range Searching, and Related Problems. Moses Charikar, Piotr Indyk, Rina Panigrahy |
| 2002 | New Bounds for Variable-Sized and Resource Augmented Online Bin Packing. Leah Epstein, Steven S. Seiden, Rob van Stee |
| 2002 | On Families of Graphs Having a Decidable First Order Theory with Reachability. Thomas Colcombet |
| 2002 | On the Average Performance of Orthogonal Range Search in Multidimensional Data Structures. Amalia Duch, Conrado Martínez |
| 2002 | On the Complexity of Resolution with Bounded Conjunctions. Juan Luis Esteban, Nicola Galesi, Jochen Messner |
| 2002 | On the Construction of Reversible Automata for Reversible Languages. Sylvain Lombardy |
| 2002 | On the Theory of One-Step Rewriting in Trace Monoids. Dietrich Kuske, Markus Lohrey |
| 2002 | One-Probe Search. Anna Östlin, Rasmus Pagh |
| 2002 | Optimal Net Surface Problems with Applications. Xiaodong Wu, Danny Z. Chen |
| 2002 | Paths Problems in Symmetric Logarithmic Space. Andreas Jakoby, Maciej Liskiewicz |
| 2002 | Perfect Constant-Round Secure Computation via Perfect Randomizing Polynomials. Yuval Ishai, Eyal Kushilevitz |
| 2002 | Polynomial-Time Approximation Schemes for the Euclidean Survivable Network Design Problem. Artur Czumaj, Andrzej Lingas, Hairong Zhao |
| 2002 | Preemptive Scheduling in Overloaded Systems. Marek Chrobak, Leah Epstein, John Noga, Jirí Sgall, Rob van Stee, Tomás Tichý, Nodari Vakhania |
| 2002 | Priority Queues, Pairing, and Adaptive Sorting. Amr Elmasry |
| 2002 | Program Debugging and Validation Using Semantic Approximations and Partial Specifications. Manuel V. Hermenegildo, Germán Puebla, Francisco Bueno, Pedro López-García |
| 2002 | Quantum and Stochastic Branching Programs of Bounded Width. Farid M. Ablayev, Cristopher Moore, Chris Pollett |
| 2002 | Random Numbers and an Incomplete Immune Recursive Set. Vasco Brattka |
| 2002 | Random Sampling from Boltzmann Principles. Philippe Duchon, Philippe Flajolet, Guy Louchard, Gilles Schaeffer |
| 2002 | Randomized Pursuit-Evasion in Graphs. Micah Adler, Harald Räcke, Naveen Sivadasan, Christian Sohler, Berthold Vöcking |
| 2002 | Removable Online Knapsack Problems. Kazuo Iwama, Shiro Taketomi |
| 2002 | Scheduling Search Procedures. Peter Damaschke |
| 2002 | Seamless Integration of Parallelism and Memory Hierarchy. Carlo Fantozzi, Andrea Pietracaprina, Geppino Pucci |
| 2002 | Solving the String Statistics Problem in Time O(n log n). Gerth Stølting Brodal, Rune B. Lyngsø, Anna Östlin, Christian N. S. Pedersen |
| 2002 | Spanning Trees with Bounded Number of Branch Vertices. Luisa Gargano, Pavol Hell, Ladislav Stacho, Ugo Vaccaro |
| 2002 | Strong Bisimilarity and Regularity of Basic Process Algebra Is PSPACE-Hard. Jirí Srba |
| 2002 | Symbolic Strategy Synthesis for Games on Pushdown Graphs. Thierry Cachat |
| 2002 | Synthesis of Uninitialized Systems. Thomas A. Henzinger, Sriram C. Krishnan, Orna Kupferman, Freddy Y. C. Mang |
| 2002 | Testing Labelled Markov Processes. Franck van Breugel, Steven Shalit, James Worrell |
| 2002 | The Communication Complexity of Approximate Set Packing and Covering. Noam Nisan |
| 2002 | The Equivalence Problem of Finite Substitutions on ab Juhani Karhumäki, Leonid P. Lisovik |
| 2002 | The Essence of Principal Typings. J. B. Wells |
| 2002 | The Kolmogorov-Loveland Stochastic Sequences Are Not Closed under Selecting Subsequences. Wolfgang Merkle |
| 2002 | The Nondeterministic Constraint Logic Model of Computation: Reductions and Applications. Robert A. Hearn, Erik D. Demaine |
| 2002 | The Quest for Small Universal Cellular Automata. Nicolas Ollinger |
| 2002 | The Structure and Complexity of Nash Equilibria for a Selfish Routing Game. Dimitris Fotakis, Spyros C. Kontogiannis, Elias Koutsoupias, Marios Mavronicolas, Paul G. Spirakis |
| 2002 | Towards a Predictive Computational Complexity Theory. Madhav V. Marathe |
| 2002 | Two-Way Alternating Automata and Finite Models. Mikolaj Bojanczyk |
| 2002 | Universal Inherence of Cycle-Free Context-Free Ambiguity Functions. Klaus Wich |
| 2002 | Wagner's Theorem on Realizers. Nicolas Bonichon, Bertrand Le Saëc, Mohamed Mosbah |
| 2002 | Why Computational Complexity Requires Stricter Martingales. John M. Hitchcock, Jack H. Lutz |