Ilya Razenshteyn is a postdoctoral research scientist in the Department of Computer Science at Columbia University. He received his B.S. in mathematics from Moscow State University and Ph.D. in computer science from the Massachusetts Institute of Technology under the supervision of Piotr Indyk.
Razenshteyn is interested in the theoretical aspects of algorithms for massive and/or high-dimensional data sets with the goal of understanding the inherent trade-off between computational efficiency and accuracy of the solution. Many such algorithms proceed through the so-called efficient representations of data: randomized hashing, sketching (succinct summarization), dimensionality reduction, metric embeddings and others. One of the goals is to study these and related algorithmic primitives systematically and find new applications for them.