| 2008 | Ultra-low-dimensional embeddings for doubling metrics. | T.-H. Hubert Chan, Anupam Gupta, Kunal Talwar |
| 2008 | Broadcast scheduling: algorithms and complexity. | Jessica Chang, Thomas Erlebach, Renars Gailis, Samir Khuller |
| 2008 | Approximating TSP on metrics with bounded global growth. | T.-H. Hubert Chan, Anupam Gupta |
| 2008 | In-place 2-d nearest neighbor search. | Timothy M. Chan, Eric Y. Chen |
| 2008 | On the bichromatic | Timothy M. Chan |
| 2008 | Tight lower bounds for selection in randomly ordered streams. | Amit Chakrabarti, T. S. Jayram, Mihai Patrascu |
| 2008 | Auctions for structured procurement. | Matthew Cary, Abraham D. Flaxman, Jason D. Hartline, Anna R. Karlin |
| 2008 | Better bounds for online load balancing on unrelated machines. | Ioannis Caragiannis |
| 2008 | Holographic algorithms with unsymmetric signatures. | Jin-yi Cai, Pinyan Lu |
| 2008 | Geometric clustering: fixed-parameter tractability and lower bounds with respect to the dimension. | Sergio Cabello, Panos Giannopoulos, Christian Knauer, Gnter Rote |
| 2008 | Finding one tight cycle. | Sergio Cabello, Matt DeVos, Jeff Erickson, Bojan Mohar |
| 2008 | Online make-to-order joint replenishment model: primal dual competitive algorithms. | Niv Buchbinder, Tracy Kimbrel, Retsef Levi, Konstantin Makarychev, Maxim Sviridenko |
| 2008 | The hiring problem and Lake Wobegon strategies. | Andrei Z. Broder, Adam Kirsch, Ravi Kumar, Michael Mitzenmacher, Eli Upfal, Sergei Vassilvitskii |
| 2008 | Computational advertising. | Andrei Z. Broder |
| 2008 | Noisy sorting without resampling. | Mark Braverman, Elchanan Mossel |
| 2008 | Dynamic optimality for skip lists and B-trees. | Prosenjit Bose, Karim Doueb, Stefan Langerman |
| 2008 | Provably good multicore cache performance for divide-and-conquer algorithms. | Guy E. Blelloch, Rezaul Alam Chowdhury, Phillip B. Gibbons, Vijaya Ramachandran, Shimin Chen, Michael Kozuch |
| 2008 | Space-efficient dynamic orthogonal point location, segment intersection, and range reporting. | Guy E. Blelloch |
| 2008 | Ascending auctions for integral (poly)matroids with concave nondecreasing separable values. | Sushil Bikhchandani, Sven de Vries, James Schummer, Rakesh V. Vohra |
| 2008 | Sampling stable marriages: why spouse-swapping won't work. | Nayantara Bhatnagar, Sam Greenberg, Dana Randall |
| 2008 | Fast edge splitting and Edmonds' arborescence construction for unweighted graphs. | Anand Bhalgat, Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi |
| 2008 | Improved distance sensitivity oracles via random sampling. | Aaron Bernstein, David R. Karger |
| 2008 | On properties of random dissections and triangulations. | Nicla Bernasconi, Konstantinos Panagiotou, Angelika Steger |
| 2008 | Graph algorithms for biological systems analysis. | Bonnie Berger, Rohit Singh, Jinbo Xu |
| 2008 | Comparing the strength of query types in property testing: the case of testing | Ido Ben-Eliezer, Tali Kaufman, Michael Krivelevich, Dana Ron |