When Hamming Meets Euclid: The Approximability of Geometric TSP and Steiner Tree
When Hamming meets Euclid
Three theorems regarding testing graph properties
Pseudorandom Generators without the XOR Lemma
Journal of Computer and System Sciences
Random Structures and Algorithms
Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC ’97
SIAM Journal on Computing
Salil Vadhan
Oded Goldreich
Madhu Sudan
The geometric maximum traveling salesman problem
Bypassing the embedding
Guest column
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems