Latent Semantic Indexing: A Probabilistic Analysis
The Complexity of the Lin–Kernighan Heuristic for the Traveling Salesman Problem
How easy is local search?
The 1-steiner tree problem
Latent semantic indexing
On complexity as bounded rationality (extended abstract)
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC ’94
Journal of Algorithms
ACM Transactions on Database Systems
Mathematics of Operations Research
Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems - PODS ’98
Journal of Complexity
Mihalis Yannakakis
Hisao Tamaki
Santosh Vempala
Prabhakar Raghavan
Robert Kleinberg
Moshe Babaioff
Beyond nash equilibrium
Very sparse stable random projections for dimension reduction in l? (0 <? ? 2) norm
Some new cooperative coverage facility location games
Fast monte-carlo algorithms for finding low-rank approximations
The geometric maximum traveling salesman problem
Algorithm 848