| 11 | -- | 0 | Yevgen Voronenko, Markus Püschel. Multiplierless multiple constant multiplication |
| 12 | -- | 0 | Hua-Huai Chern, Michael Fuchs, Hsien-Kuei Hwang. Phase changes in random point quadtrees |
| 13 | -- | 0 | Erik D. Demaine, John Iacono, Stefan Langerman. Retroactive data structures |
| 14 | -- | 0 | Ryan B. Hayward, Jeremy Spinrad, R. Sritharan. Improved algorithms for weakly chordal graphs |
| 15 | -- | 0 | Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch. Strongly stable matchings in time ::::O::::(::::nm::::) and extension to the hospitals-residents problem |
| 16 | -- | 0 | Amitabha Bagchi, Amitabh Chaudhary, David Eppstein, Michael T. Goodrich. Deterministic sampling and range counting in geometric data streams |
| 17 | -- | 0 | Sunil Arya, Theocharis Malamatos, David M. Mount. A simple entropy-based algorithm for planar point location |
| 18 | -- | 0 | Manuel Kauers. An algorithm for deciding zero equivalence of nested polynomially recurrent sequences |
| 19 | -- | 0 | Amihood Amir, Gad M. Landau, Moshe Lewenstein, Dina Sokol. Dynamic text and static pattern matching |
| 20 | -- | 0 | Paolo Ferragina, Giovanni Manzini, Veli Mäkinen, Gonzalo Navarro. Compressed representations of sequences and full-text indexes |
| 21 | -- | 0 | Ho-Leung Chan, Wing-Kai Hon, Tak Wah Lam, Kunihiko Sadakane. Compressed indexes for dynamic text collections |
| 22 | -- | 0 | Joan Boyar, Lene M. Favrholdt. The relative worst order ratio for online algorithms |
| 23 | -- | 0 | Luca Becchetti, Jochen Könemann, Stefano Leonardi, Martin Pal. Sharing the cost more efficiently: Improved approximation for multicommodity rent-or-buy |
| 24 | -- | 0 | David S. Johnson. The NP-completeness column: Finding needles in haystacks |