Ilya Razenshteyn

Available identifiers

zbMath Open razenshteyn.ilya-pMaRDI QIDQ620965

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q6147324	2024-01-15	Paper
Maliciously secure matrix multiplication with applications to private deep learning	2023-03-29	Paper
Performance of Johnson--Lindenstrauss Transform for $k$-Means and $k$-Medians Clustering	2022-04-01	Paper
Non-adaptive adaptive sampling on turnstile streams	2021-01-19	Paper
APPROXIMATE NEAREST NEIGHBOR SEARCH IN HIGH DIMENSIONS	2020-09-22	Paper
Performance of Johnson-Lindenstrauss transform for k -means and k -medians clustering	2020-01-30	Paper
Exact Combinatorial Branch-and-Bound for Graph Bisection	2019-09-12	Paper
Data-dependent hashing via nonlinear spectral gaps	2019-08-22	Paper
Nonlinear dimension reduction via outer Bi-Lipschitz extensions	2019-08-22	Paper
Nearly-optimal bounds for sparse recovery in generic norms, with applications to k-median sketching	2018-07-16	Paper
Optimal Hashing-based Time-Space Trade-offs for Approximate Near Neighbors	2018-07-16	Paper
LSH Forest: Practical Algorithms Made Theoretical	2018-07-16	Paper
Sketching and Embedding are Equivalent for Norms	2018-07-04	Paper
Restricted Isometry Property for General p-Norms.	2017-10-10	Paper
Weighted low rank approximations with provable guarantees	2017-09-29	Paper
Robust Hierarchical k-Center Clustering	2017-05-19	Paper
Restricted Isometry Property for General p-Norms	2017-04-28	Paper
An exact combinatorial algorithm for minimum graph bisection	2015-10-19	Paper
Sketching and Embedding are Equivalent for Norms	2015-08-21	Paper
Optimal Data-Dependent Hashing for Approximate Near Neighbors	2015-08-21	Paper
Separating Hierarchical and General Hub Labelings	2013-09-20	Paper
On Model-Based RIP-1 Matrices	2013-08-06	Paper
On Epsilon-Nets, Distance Oracles, and Metric Embeddings	2012-06-19	Paper
TRIANGLE-FREE 2-MATCHINGS REVISITED	2011-03-25	Paper
Not every domain of a plain decompressor contains the domain of a prefix-free one	2011-02-02	Paper
Triangle-Free 2-Matchings Revisited	2010-07-20	Paper
A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks	2010-01-28	Paper

Research outcomes over time

This page was built for person: Ilya Razenshteyn