| 2001 | Towards understanding the predictability of stock markets from the perspective of computational complexity. | James Aspnes, David F. Fischer, Michael J. Fischer, Ming-Yang Kao, Alok Kumar |
| 2001 | A simple entropy-based algorithm for planar point location. | Sunil Arya, Theocharis Malamatos, David M. Mount |
| 2001 | Entropy-preserving cuttings and space-efficient planar point location. | Sunil Arya, Theocharis Malamatos, David M. Mount |
| 2001 | Optimal covering tours with turn costs. | Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Sndor P. Fekete, Joseph S. B. Mitchell, Saurabh Sethia |
| 2001 | Dynamic string searching. | Arne Andersson, Mikkel Thorup |
| 2001 | The inverse nearest neighbor problem with astrophysical applications. | Richard J. Anderson, Brian Tjaden |
| 2001 | Random lifts of graphs. | Alon Amit, Nathan Linial, Jir Matousek, Eyal Rozenman |
| 2001 | Approximate subset matching with Don't Cares. | Amihood Amir, Ely Porat, Moshe Lewenstein |
| 2001 | Overlap matching. | Amihood Amir, Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat |
| 2001 | An efficient algorithm for the configuration problem of dominance graphs. | Ernst Althaus, Denys Duchier, Alexander Koller, Kurt Mehlhorn, Joachim Niehren, Sven Thiel |
| 2001 | A cell probe lower bound for dynamic nearest-neighbor searching. | Stephen Alstrup, Thore Husfeldt, Theis Rauhe |
| 2001 | Constructing worst case instances for semidefinite programming based approximation algorithms. | Noga Alon, Benny Sudakov, Uri Zwick |
| 2001 | Maintaining approximate extent measures of moving points. | Pankaj K. Agarwal, Sariel Har-Peled |
| 2001 | The phase transition in 1-in-k SAT and NAE 3-SAT. | Dimitris Achlioptas, Arthur D. Chtcherba, Gabriel Istrate, Cristopher Moore |
| 2001 | Compact labeling schemes for ancestor queries. | Serge Abiteboul, Haim Kaplan, Tova Milo |
| 2000 | Algorithms for minimum volume enclosing simplex in R | Yunhong Zhou, Subhash Suri |
| 2000 | Untitled record | Neal E. Young |
| 2000 | Locally lifting the curse of dimensionality for nearest neighbor search (extended abstract). | Peter N. Yianilos |
| 2000 | An approximation algorithm for finding a long path in Hamiltonian graphs. | Sundar Vishwanathan |
| 2000 | Even strongly universal hashing is pretty fast. | Mikkel Thorup |
| 2000 | Digraph minors and algorithms (abstract only). | Robin Thomas |
| 2000 | The rectilinear Steiner arborescence problem is NP-complete. | Weiping Shi, Chen Su |
| 2000 | Towards a theory of cache-efficient algorithms. | Sandeep Sen, Siddhartha Chatterjee |
| 2000 | Scheduling a pipelined operator graph. | Petra Schuurman, Gerhard J. Woeginger |
| 2000 | Fast concurrent access to parallel disks. | Peter Sanders, Sebastian Egner, Jan H. M. Korst |