| Publication | Date of Publication | Type |
|---|
| Frequency estimation with one-sided error | 2024-07-19 | Paper |
| Dimension-accuracy tradeoffs in contrastive embeddings for triplets, terminals \& top-\(k\) nearest neighbors | 2024-05-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6126297 | 2024-04-09 | Paper |
| Efficient parallel computing with memory faults | 2022-12-09 | Paper |
| Optimal (Euclidean) Metric Compression | 2022-05-31 | Paper |
| Fractional set cover in the streaming model | 2021-07-28 | Paper |
| Approximate sparse linear regression | 2021-07-28 | Paper |
| Randomized Dimensionality Reduction for Facility Location and Single-Linkage Clustering | 2021-07-05 | Paper |
| Composable Core-sets for Determinant Maximization Problems via Spectral Spanners | 2021-02-02 | Paper |
| Approximate nearest neighbor search in high dimensions | 2020-09-22 | Paper |
| Fast algorithms for structured sparsity (ICALP 2015 invited tutorial) | 2019-07-03 | Paper |
| (Nearly) sample-optimal sparse Fourier transform | 2019-06-20 | Paper |
| Approximation-tolerant model-based compressive sensing | 2019-06-20 | Paper |
| Shift finding in sub-linear time | 2019-05-15 | Paper |
| Euclidean spanners in high dimensions | 2019-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743468 | 2019-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633899 | 2019-05-06 | Paper |
| Approximation algorithms for low-distortion embeddings into low-dimensional spaces | 2019-03-12 | Paper |
| Approximate nearest neighbor algorithms for Frechet distance via product metrics | 2018-11-23 | Paper |
| Nearly optimal deterministic algorithm for sparse Walsh-Hadamard transform | 2018-11-05 | Paper |
| Near-optimal (Euclidean) metric compression | 2018-07-16 | Paper |
| Nearly optimal deterministic algorithm for sparse Walsh-Hadamard transform | 2018-07-16 | Paper |
| Better approximations for tree sparsity in nearly-linear time | 2018-07-16 | Paper |
| Nearly-optimal bounds for sparse recovery in generic norms, with applications to \(k\)-median sketching | 2018-07-16 | Paper |
| Edit distance cannot be computed in strongly subquadratic time (unless SETH is false) | 2018-07-04 | Paper |
| Better embeddings for planar earth-mover distance over sparse sets | 2018-04-23 | Paper |
| Set cover in sub-linear time | 2018-03-15 | Paper |
| Simultaneous nearest neighbor search | 2018-01-30 | Paper |
| Optimal simulation of automata by neural nets | 2017-12-04 | Paper |
| On word-level parallelism in fault-tolerant computing | 2017-11-16 | Paper |
| Sampling in dynamic data streams and applications | 2017-10-20 | Paper |
| When crossings count — approximating the minimum spanning tree | 2017-09-29 | Paper |
| Locality-sensitive hashing scheme based on \(p\)-stable distributions | 2017-09-29 | Paper |
| Low-dimensional embedding with extra information | 2017-09-29 | Paper |
| Approximation Algorithms for Model-Based Compressive Sensing | 2017-04-28 | Paper |
| Sublinear time algorithms for metric space problems | 2016-09-29 | Paper |
| Interpolation of symmetric functions and a new type of combinatorial design | 2016-09-29 | Paper |
| Stable distributions, pseudorandom generators, embeddings, and data stream computation | 2015-12-04 | Paper |
| Edit distance cannot be computed in strongly subquadratic time (unless SETH is false) | 2015-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501781 | 2015-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501321 | 2015-08-03 | Paper |
| Approximate nearest neighbor under edit distance via product metrics | 2015-08-03 | Paper |
| Efficiently decodable codes meeting Gilbert-Varshamov bound for low rates | 2015-08-03 | Paper |
| Compressive sensing using locality-preserving matrices | 2015-02-17 | Paper |
| Diverse near neighbor problem | 2015-02-17 | Paper |
| Approximation algorithms for embedding general metrics into trees | 2014-12-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934580 | 2014-12-18 | Paper |
| On the Power of Adaptivity in Sparse Recovery | 2014-07-30 | Paper |
| Efficient Sketches for Earth-Mover Distance, with Applications | 2014-07-25 | Paper |
| Nearly linear-time model-based compressive sensing | 2014-07-01 | Paper |
| K-median clustering, model-based compressive sensing, and sparse recovery for earth mover distance | 2014-06-05 | Paper |
| Lower bounds for sparse recovery | 2014-05-22 | Paper |
| Efficiently decodable non-adaptive group testing | 2014-05-22 | Paper |
| Nearly optimal sparse Fourier transform | 2014-05-13 | Paper |
| Compressive sensing with local geometric features | 2014-03-24 | Paper |
| On model-based RIP-1 matrices | 2013-08-06 | Paper |
| Approximate nearest neighbor: towards removing the curse of dimensionality | 2012-09-27 | Paper |
| Learning approximate sequential patterns for classification | 2012-04-17 | Paper |
| Sparse recovery with partial support knowledge | 2011-08-17 | Paper |
| Sublinear algorithms in the external memory model | 2010-10-12 | Paper |
| Almost-Euclidean subspaces of \(\ell_1^N\) via tensor products: a simple approach to randomness reduction | 2010-09-10 | Paper |
| Online embeddings | 2010-09-10 | Paper |
| Optimal approximations of the frequency moments of data streams | 2010-08-16 | Paper |
| Low-distortion embeddings of general metrics into the line | 2010-08-16 | Paper |
| Linear time encodable and list decodable codes | 2010-08-16 | Paper |
| Efficient algorithms for substring near neighbor problem | 2010-08-16 | Paper |
| Algorithms for dynamic geometric problems over data streams | 2010-08-15 | Paper |
| Nearest-neighbor-preserving embeddings | 2010-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579398 | 2010-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579464 | 2010-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579407 | 2010-08-06 | Paper |
| Approximate clustering via core-sets | 2010-08-05 | Paper |
| Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets | 2010-08-05 | Paper |
| Efficient computations of \(\ell _1\) and \(\ell _{\infty }\) rearrangement distances | 2009-10-09 | Paper |
| External Sampling | 2009-07-14 | Paper |
| Sketching information divergences | 2009-03-31 | Paper |
| Probabilistic embeddings of bounded genus graphs into planar graphs | 2009-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601539 | 2009-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549663 | 2009-01-05 | Paper |
| Linear-Time Encodable/Decodable Codes With Near-Optimal Rate | 2008-12-21 | Paper |
| SAMPLING IN DYNAMIC DATA STREAMS AND APPLICATIONS | 2008-08-26 | Paper |
| Sketching Information Divergences | 2008-01-03 | Paper |
| Theory of Cryptography | 2007-02-12 | Paper |
| Low-dimensional embedding with extra information | 2006-12-06 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science | 2005-08-12 | Paper |
| Pattern matching for sets of segments | 2005-02-11 | Paper |
| Combinatorial and experimental methods for approximate point pattern matching | 2004-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4829004 | 2004-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828995 | 2004-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4829005 | 2004-11-29 | Paper |
| PROBABILISTIC ANALYSIS FOR DISCRETE ATTRIBUTES OF MOVING POINTS | 2004-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4818868 | 2004-09-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737179 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471341 | 2004-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471339 | 2004-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471342 | 2004-07-28 | Paper |
| Approximate congruence in nearly linear time | 2003-04-28 | Paper |
| Maintaining Stream Statistics over Sliding Windows | 2003-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542583 | 2002-08-01 | Paper |
| On approximate nearest neighbors under \(l_\infty\) norm | 2002-07-04 | Paper |
| Reductions among high dimensional proximity problems | 2002-03-24 | Paper |
| On page migration and other relaxed task systems | 2002-03-03 | Paper |
| Efficient regular data structures and algorithms for dilation, location, and proximity problems | 2002-02-19 | Paper |
| Pattern matching for sets of segments | 2002-01-30 | Paper |
| A small approximately min-wise independent family of hash functions | 2001-04-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4527029 | 2001-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952640 | 2001-02-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252294 | 2000-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952638 | 2000-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252321 | 2000-04-25 | Paper |
| Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication) | 1999-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252320 | 1999-06-17 | Paper |
