| 2009 | On the power of two, three and four probes. | Noga Alon, Uriel Feige |
| 2009 | Approximate Euclidean shortest paths amid convex obstacles. | Pankaj K. Agarwal, R. Sharathkumar, Hai Yu |
| 2009 | Optimal halfspace range reporting in three dimensions. | Peyman Afshani, Timothy M. Chan |
| 2009 | Coresets and approximate clustering for Bregman divergences. | Marcel R. Ackermann, Johannes Blmer |
| 2009 | On low dimensional local embeddings. | Ittai Abraham, Yair Bartal, Ofer Neiman |
| 2008 | Algorithms for the coalitional manipulation problem. | Michael Zuckerman, Ariel D. Procaccia, Jeffrey S. Rosenschein |
| 2008 | Improved string reconstruction over insertion-deletion channels. | Krishnamurthy Viswanathan, Ram Swaminathan |
| 2008 | Nondecreasing paths in a weighted graph or: how to optimally read a train schedule. | Virginia Vassilevska |
| 2008 | Lower-bounded facility location. | Zoya Svitkina |
| 2008 | Improved algorithmic versions of the Lovsz Local Lemma. | Aravind Srinivasan |
| 2008 | The effect of induced subgraphs on quasi-randomness. | Asaf Shapira, Raphael Yuster |
| 2008 | Unconditionally reliable message transmission in directed networks. | Bhavani Shankar, Prasant Gopal, Kannan Srinathan, C. Pandu Rangan |
| 2008 | Parallel monotonicity reconstruction. | Michael E. Saks, C. Seshadhri |
| 2008 | Computing large matchings fast. | Ignaz Rutter, Alexander Wolff |
| 2008 | Non-clairvoyant scheduling with precedence constraints. | Julien Robert, Nicolas Schabanel |
| 2008 | Approximation algorithms for labeling hierarchical taxonomies. | Yuval Rabani, Leonard J. Schulman, Chaitanya Swamy |
| 2008 | Approximating general metric distances between a pattern and a text. | Ely Porat, Klim Efremenko |
| 2008 | Splay trees, Davenport-Schinzel sequences, and the deque conjecture. | Seth Pettie |
| 2008 | Maximum overhang. | Mike Paterson, Yuval Peres, Mikkel Thorup, Peter Winkler, Uri Zwick |
| 2008 | Finding an optimal tree searching strategy in linear time. | Shay Mozes, Krzysztof Onak, Oren Weimann |
| 2008 | Rapid mixing of Gibbs sampling on graphs that are sparse on average. | Elchanan Mossel, Allan Sly |
| 2008 | Why simple hash functions work: exploiting the entropy in a data stream. | Michael Mitzenmacher, Salil P. Vadhan |
| 2008 | Fast algorithms for finding proper strategies in game trees. | Peter Bro Miltersen, Troels Bjerre Srensen |
| 2008 | Efficient reductions among lattice problems. | Daniele Micciancio |
| 2008 | Adaptive local ratio. | Julin Mestre |