| 2002 | Selfish traffic allocation for server farms. | Artur Czumaj, Piotr Krysta, Berthold Vcking |
| 2002 | A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant. | Mary Cryan, Martin E. Dyer |
| 2002 | Secure multi-party quantum computation. | Claude Crpeau, Daniel Gottesman, Adam D. Smith |
| 2002 | Crawling on web graphs. | Colin Cooper, Alan M. Frieze |
| 2002 | Verifying candidate matches in sparse and wildcard matching. | Richard Cole, Ramesh Hariharan |
| 2002 | Clifford algebras and approximating the permanent. | Steve Chien, Lars Eilstrup Rasmussen, Alistair Sinclair |
| 2002 | Approximation algorithms for minimum-cost k-vertex connected subgraphs. | Joseph Cheriyan, Santosh S. Vempala, Adrian Vetta |
| 2002 | Approximation schemes for preemptive weighted flow time. | Chandra Chekuri, Sanjeev Khanna |
| 2002 | Approximating the smallest grammar: Kolmogorov complexity in natural models. | Moses Charikar, Eric P. Lehman, Ding Liu, Rina Panigrahy, Manoj Prabhakaran, April Rasala, Amit Sahai, Abhi Shelat |
| 2002 | Similarity estimation techniques from rounding algorithms. | Moses Charikar |
| 2002 | A unified analysis of hot video schedulers. | Wun-Tat Chan, Tak Wah Lam, Hing-Fung Ting, Prudence W. H. Wong |
| 2002 | Dynamic subgraph connectivity with geometric applications. | Timothy M. Chan |
| 2002 | Randomness conductors and constant-degree lossless expanders. | Michael R. Capalbo, Omer Reingold, Salil P. Vadhan, Avi Wigderson |
| 2002 | Universally composable two-party and multi-party secure computation. | Ran Canetti, Yehuda Lindell, Rafail Ostrovsky, Amit Sahai |
| 2002 | Optimal finger search trees in the pointer machine. | Gerth Stlting Brodal, George Lagogiannis, Christos Makris, Athanasios K. Tsakalidis, Kostas Tsichlas |
| 2002 | Solving convex programs by random walks. | Dimitris Bertsimas, Santosh S. Vempala |
| 2002 | Hard examples for bounded depth frege. | Eli Ben-Sasson |
| 2002 | Size space tradeoffs for resolution. | Eli Ben-Sasson |
| 2002 | Time-space tradeoffs, multiparty communication complexity, and nearest-neighbor problems. | Paul Beame, Erik Vee |
| 2002 | The complexity of approximating entropy. | Tugkan Batu, Sanjoy Dasgupta, Ravi Kumar, Ronitt Rubinfeld |
| 2002 | Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths. | Surender Baswana, Ramesh Hariharan, Sandeep Sen |
| 2002 | Computing the betti numbers of arrangements. | Saugata Basu |
| 2002 | Strict polynomial-time in simulation and extraction. | Boaz Barak, Yehuda Lindell |
| 2002 | Approximate clustering via core-sets. | Mihai Badoiu, Sariel Har-Peled, Piotr Indyk |
| 2002 | Average case analysis for batched disk scheduling and increasing subsequences. | Eitan Bachmat |