| 0 | -- | 0 | Gagan Aggarwal, Rina Panigrahy, Tomás Feder, Dilys Thomas, Krishnaram Kenthapadi, Samir Khuller, An Zhu. Achieving anonymity via clustering |
| 0 | -- | 0 | Shahar Fattal, Dana Ron. Approximating the distance to monotonicity in high dimensions |
| 0 | -- | 0 | Eyal Gordon, Adi Rosén. Competitive weighted throughput analysis of greedy protocols on DAGs |
| 0 | -- | 0 | Conrado Martínez, Daniel Panario, Alfredo Viola. Adaptive sampling strategies for quickselects |
| 0 | -- | 0 | Amit Chakrabarti, Graham Cormode, Andrew McGregor. A near-optimal algorithm for estimating the entropy of a stream |
| 0 | -- | 0 | Arturo Gonzalez-Gutierrez, Teofilo F. Gonzalez. Approximating corridors and tours via restriction and relaxation techniques |
| 0 | -- | 0 | Joseph Naor, Roy Schwartz. The directed circular arrangement problem |
| 0 | -- | 0 | Yossi Azar, Shay Kutten, Boaz Patt-Shamir. Distributed error confinement |
| 0 | -- | 0 | Don Coppersmith, Lisa Fleischer, Atri Rudra. Ordering by weighted number of wins gives a good ranking for weighted tournaments |
| 0 | -- | 0 | Noga Alon, Shai Gutner. Balanced families of perfect hash functions and their applications |
| 0 | -- | 0 | Virginia Vassilevska, Ryan Williams, Raphael Yuster. Finding heaviest ::::H::::-subgraphs in real weighted graphs, with applications |
| 0 | -- | 0 | Frank Ruskey, Aaron Williams. An explicit universal cycle for the (::::n::::-1)-permutations of an ::::n::::-set |
| 0 | -- | 0 | Matthew Drescher, Adrian Vetta. An approximation algorithm for the maximum leaf spanning arborescence problem |