Alexandr Andoni

RESEARCHER
.
1065 La Avenida st, 6/1171
Mountain View, CA 94043
Email: <lastname>@microsoft.com
I am a researcher at Microsoft Research Silicon Valley.
My research interests include: sublinear algorithms, streaming, algorithms for massive data sets, high-dimensional computational geometry, metric embeddings, theoretical machine learning.
I graduated from MIT in 2009, under the supervision of Prof. Piotr Indyk. My PhD thesis is on the "Nearest Neighbor Search: the Old, the New, and the Impossible" [.pdf, .ps]. In 2009--2010, I was a postdoc at the Center for Computational Intractability at Princeton, and a visitor at NYU and IAS.
Publications
- Alexandr Andoni, Robert Krauthgamer, and Krzysztof Onak, Streaming Algorithms via Precision Sampling, in Symposium on Foundations of Computer Science (FOCS), IEEE, 2011
- Alexandr Andoni, Moses S. Charikar, Ofer Neiman, and Huy L. Nguyen, Near Linear Lower Bound for Dimension Reduction in L_1, in Symposium on Foundations of Computer Science (FOCS), IEEE, 2011
- Alexandr Andoni, Robert Krauthgamer, and Krzysztof Onak, Polylogarithmic Approximation for Edit Distance and the Asymmetric Query Complexity, in Symposium on Foundations of Computer Science (FOCS), IEEE, 2010
