List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| scientific article; zbMATH DE number 7788410 (Why is no real title available?) | 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 SIAM Journal on Computing | 2022-04-01 | Paper |
| Non-adaptive adaptive sampling on turnstile streams Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
| Approximate nearest neighbor search in high dimensions Proceedings of the International Congress of Mathematicians (ICM 2018) | 2020-09-22 | Paper |
| Performance of Johnson-Lindenstrauss transform for \(k\)-means and \(k\)-medians clustering Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
| Exact combinatorial branch-and-bound for graph bisection 2012 Proceedings of the Fourteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
| Data-dependent hashing via nonlinear spectral gaps Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
| Nonlinear dimension reduction via outer bi-Lipschitz extensions Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
| Optimal hashing-based time-space trade-offs for approximate near neighbors Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
| LSH Forest: Practical Algorithms Made Theoretical Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
| Nearly-optimal bounds for sparse recovery in generic norms, with applications to \(k\)-median sketching Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
| Sketching and embedding are equivalent for norms SIAM Journal on Computing | 2018-07-04 | Paper |
| Restricted isometry property for general \(p\)-norms | 2017-10-10 | Paper |
| Weighted low rank approximations with provable guarantees Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
| Robust hierarchical \(k\)-center clustering Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science | 2017-05-19 | Paper |
| Restricted Isometry Property for General p-Norms IEEE Transactions on Information Theory | 2017-04-28 | Paper |
| An exact combinatorial algorithm for minimum graph bisection Mathematical Programming. Series A. Series B | 2015-10-19 | Paper |
| Sketching and embedding are equivalent for norms Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
| Optimal data-dependent hashing for approximate near neighbors Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
| Separating Hierarchical and General Hub Labelings Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
| On model-based RIP-1 matrices Automata, Languages, and Programming | 2013-08-06 | Paper |
| On Epsilon-Nets, Distance Oracles, and Metric Embeddings | 2012-06-19 | Paper |
| Triangle-free 2-matchings revisited Discrete Mathematics, Algorithms and Applications | 2011-03-25 | Paper |
| Not every domain of a plain decompressor contains the domain of a prefix-free one Theoretical Computer Science | 2011-02-02 | Paper |
| Triangle-free 2-matchings revisited Lecture Notes in Computer Science | 2010-07-20 | Paper |
| A linear time algorithm for finding three edge-disjoint paths in Eulerian networks SOFSEM 2010: Theory and Practice of Computer Science | 2010-01-28 | Paper |
Research outcomes over time
This page was built for person: Ilya Razenshteyn
