| Publication | Date of Publication | Type |
|---|
| Arithmetic circuits, structured matrices and (not so) deep learning | 2023-07-26 | Paper |
| General Strong Polarization | 2022-03-31 | Paper |
| Joins via Geometric Resolutions | 2021-11-25 | Paper |
| General Strong Polarization | 2019-08-22 | Paper |
| Worst-case Optimal Join Algorithms | 2018-12-06 | Paper |
| Tight Network Topology Dependent Bounds on Rounds of Communication | 2018-07-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4607923 | 2018-03-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4607956 | 2018-03-15 | Paper |
| Better Binary List Decodable Codes Via Multilevel Concatenation | 2017-08-08 | Paper |
| Limits to List Decoding of Random Codes | 2017-07-27 | Paper |
| Soft Decoding, Dual BCH Codes, and Better List-Decodable $\varepsilon$-Biased Codes | 2017-07-27 | Paper |
| The Existence of Concatenated Codes List-Decodable up to the Hamming Bound | 2017-07-27 | Paper |
| It'll Probably Work Out | 2017-05-19 | Paper |
| An energy complexity model for algorithms | 2017-05-16 | Paper |
| The Range of Topological Effects on Communication | 2015-11-04 | Paper |
| Every list-decodable code for high noise has abundant near-optimal rate puncturings | 2015-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934659 | 2014-12-18 | Paper |
| Explicit capacity-achieving list-decodable codes | 2014-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417695 | 2014-05-22 | Paper |
| ℓ2/ℓ2-Foreach Sparse Recovery with Low Risk | 2013-08-06 | Paper |
| Improved approximation algorithms for the spanning star forest problem | 2013-08-05 | Paper |
| Flexible coloring | 2013-03-28 | Paper |
| When LP is the cure for your matching woes: improved bounds for stochastic matchings | 2012-12-06 | Paper |
| Efficiently decodable compressed sensing by list-recoverable codes and recursion | 2012-08-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3113708 | 2012-01-23 | Paper |
| Symmetric Functions Capture General Functions | 2011-08-17 | Paper |
| Efficiently Decodable Error-Correcting List Disjunct Matrices and Applications | 2011-07-06 | Paper |
| Pricing commodities | 2011-02-21 | Paper |
| Testing low-degree polynomials over prime fields | 2010-11-09 | Paper |
| Two Theorems on List Decoding | 2010-09-10 | Paper |
| Data Stream Algorithms for Codeword Testing | 2010-09-07 | Paper |
| When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings | 2010-09-06 | Paper |
| Ordering by weighted number of wins gives a good ranking for weighted tournaments | 2010-08-16 | Paper |
| Limits to list decoding Reed-Solomon codes | 2010-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579474 | 2010-08-06 | Paper |
| Floodlight illumination of infinite wedges | 2009-10-16 | Paper |
| Limits to List Decoding Random Codes | 2009-07-23 | Paper |
| Approximating Matches Made in Heaven | 2009-07-14 | Paper |
| Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy | 2009-02-24 | Paper |
| Improved Approximation Algorithms for the Spanning Star Forest Problem | 2009-02-17 | Paper |
| Better Binary List-Decodable Codes Via Multilevel Concatenation | 2009-02-17 | Paper |
| Lower bounds for randomized read/write stream algorithms | 2009-01-05 | Paper |
| Limits to List Decoding Reed–Solomon Codes | 2008-12-21 | Paper |
| Walrasian equilibrium: Hardness, approximations and tractable instances | 2008-09-12 | Paper |
| Efficient List Decoding of Explicit Codes with Optimal Redundancy | 2008-04-17 | Paper |
| Pricing Commodities, or How to Sell When Buyers Have Restricted Valuations | 2008-02-20 | Paper |
| Paper Retraction: On the Hardness of Embeddings Between Two Finite Metrics | 2007-11-28 | Paper |
| Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques | 2006-07-07 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
