| Publication | Date of Publication | Type |
|---|
| Convergence Results for Neural Networks via Electrodynamics | 2021-06-15 | Paper |
| On the Learnability of Random Deep Networks | 2021-02-02 | Paper |
| Learning Sparse Polynomial Functions | 2019-06-20 | Paper |
| Error-Correcting Codes for Ternary Content Addressable Memories | 2017-08-08 | Paper |
| Fractal Structures in Adversarial Prediction | 2017-05-19 | Paper |
| Spectral sparsification via random spanners | 2016-10-07 | Paper |
| A note on optical routing on trees | 2016-05-26 | Paper |
| Querying priced information in databases | 2015-09-02 | Paper |
| Clustering to minimize the sum of cluster diameters | 2015-02-27 | Paper |
| Achieving anonymity via clustering | 2014-11-18 | Paper |
| Efficient hashing with lookups in two memory accesses | 2014-10-13 | Paper |
| Computing the median with uncertainty | 2014-09-26 | Paper |
| On the decidability of accessibility problems (extended abstract) | 2014-09-26 | Paper |
| NNS Lower Bounds via Metric Expansion for l ∞ and EMD | 2013-08-12 | Paper |
| Multiplicative Approximations of Random Walk Transition Probabilities | 2011-08-17 | Paper |
| Estimating PageRank on graph streams | 2011-07-14 | Paper |
| Balanced allocation on graphs | 2010-08-16 | Paper |
| Analyzing BitTorrent and related peer-to-peer networks | 2010-08-16 | Paper |
| Better streaming algorithms for clustering problems | 2010-08-16 | Paper |
| Entropy based nearest neighbor search in high dimensions | 2010-08-16 | Paper |
| The Oil Searching Problem | 2009-10-29 | Paper |
| Sparse Cut Projections in Graph Streams | 2009-10-29 | Paper |
| 3.5-Way Cuckoo Hashing for the Price of 2-and-a-Bit | 2009-10-29 | Paper |
| Deterministic Approximation Algorithms for the Nearest Codeword Problem | 2009-10-28 | Paper |
| A combinatorial algorithm for MAX CSP | 2009-03-23 | Paper |
| On Finding Frequent Elements in a Data Stream | 2009-02-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601534 | 2009-02-10 | Paper |
| The Smallest Grammar Problem | 2008-12-21 | Paper |
| Lower Bounds on Locality Sensitive Hashing | 2008-12-05 | Paper |
| Finding Frequent Elements in Non-bursty Streams | 2008-09-25 | Paper |
| An Improved Algorithm Finding Nearest Neighbor Using Kd-trees | 2008-04-15 | Paper |
| Using Bloom Filters to Speed Up HITS-Like Ranking Algorithms | 2008-04-11 | Paper |
| An Improved Construction for Counting Bloom Filters | 2008-03-11 | Paper |
| Estimating Sum by Weighted Sampling | 2007-11-28 | Paper |
| Fractional Matching Via Balls-and-Bins | 2007-08-28 | Paper |
| Computing shortest paths with uncertainty | 2007-05-14 | Paper |
| Database Theory - ICDT 2005 | 2005-09-13 | Paper |
| Database Theory - ICDT 2005 | 2005-09-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828920 | 2004-11-29 | Paper |
| Combining request scheduling with web caching | 2004-11-23 | Paper |
| Clustering to minimize the sum of cluster diameters | 2004-11-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737179 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418665 | 2003-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418664 | 2003-08-11 | Paper |
| Computing the Median with Uncertainty | 2003-06-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4527033 | 2001-03-01 | Paper |
| AnO(log*n) Approximation Algorithm for the Asymmetricp-Center Problem | 1998-12-02 | Paper |
