AutumnOLYMPIAD
COLLECTION
RESEARCHED WITH AUTUMN
AA

Alexandr Andoni

Associate Professor of Computer Science, Columbia University
Columbia University · New York, New York, United States · academic
Associate Professor Of Computer Science At Columbia University (since 2015)MIT PhD Under Piotr Indyk, Thesis On Nearest Neighbor SearchThree IOI Medals For Moldova (bronze 1997, Silver 1998, Silver 1999)Researcher At Microsoft Research Silicon Valley 2010-2014Developer Of Practical Locality-sensitive Hashing (FALCONN, LSH Forest)

Associate Professor of Computer Science at Columbia University working on algorithmic foundations of massive, high-dimensional data: sublinear algorithms, high-dimensional geometry, similarity search and theoretical machine learning. MIT PhD under Piotr Indyk (2009); previously Microsoft Research Silicon Valley, Princeton and the Simons Institute.

Alexandr (Alex) Andoni is an Associate Professor of Computer Science at Columbia University, a member of the Columbia Core AI Lab and the university's Foundations of Data Science initiative. His research concerns the algorithmic foundations of large-scale, high-dimensional data, including sublinear algorithms, high-dimensional geometry, metric embeddings, similarity search and theoretical machine learning. Born and educated in Moldova/Romania, he represented Moldova at the International Olympiad in Informatics in 1997, 1998 and 1999 (bronze, silver, silver) before earning BS, MEng and PhD degrees at MIT under Piotr Indyk. He spent 2010-2014 as a researcher at Microsoft Research Silicon Valley, and now advises a group of PhD students at Columbia. He remains involved with Moldova's IOI program as a coach.

LinkedIn followers835
Details
LocationNew York, New York, United States
Company sitecolumbia.edu
UniversityMassachusetts Institute of Technology
AlgorithmsSublinear algorithmsHigh-dimensional geometryLocality-sensitive hashingMetric embeddingsTheoretical machine learningStreaming algorithmsSimilarity searchAlgorithmic foundations of massive dataEfficient machine learning
Notes
  • Represented Moldova at the International Olympiad in Informatics three times: bronze 1997, silver 1998, silver 1999 - Moldova's first-ever IOI silver medals.Oct 16, 1999
  • Research focus is algorithmic foundations of massive, high-dimensional data - sublinear algorithms, high-dimensional geometry, metric embeddings, theoretical ML - with practical impact via similarity-search/hashing (FALCONN).2026
  • PhD thesis 'Nearest Neighbor Search: the Old, the New, and the Impossible' under Piotr Indyk; the work seeded locality-sensitive hashing research he continues today.2009
  • Immigrated trajectory: studied at Politehnica University of Bucharest 1999-2001 before transferring to MIT, where he earned a BS (2004), MEng (2005) and PhD (2009) under Piotr Indyk.
  • Industry research career before academia: Microsoft Research Silicon Valley (2010-2014), after postdoc at Princeton's Center for Computational Intractability (2009-2010) and a visiting year at the Simons Institute (2014-2015).
  • Coaches Moldova's national team for the International Olympiad in Informatics, giving back to the program that launched his own career.
  • Leads Columbia's Core AI Lab and is a member of the university's Foundations of Data Science initiative.
  • Maintains an active advising group at Columbia (students Hantao Yu, Jingwen Liu, Styopa Zharkov; former students incl. Jaroslaw Blasiok, Peilin Zhong, Sepideh Mahabadi).

Competition record

Moldova · IOI

1997 · Bronze · Rank 611998 · Silver · Rank 591999 · Silver · Rank 23