| Publication | Date of Publication | Type |
|---|
| Loss minimization through the Lens of outcome indistinguishability | 2024-09-25 | Paper |
| A unifying theory of distance from calibration | 2024-05-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6126320 | 2024-04-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875792 | 2023-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5857609 | 2021-04-01 | Paper |
| Finding Skewed Subcubes Under a Distribution | 2019-11-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633849 | 2019-05-06 | Paper |
| Pseudorandomness via the Discrete Fourier Transform | 2018-12-19 | Paper |
| Maximally Recoverable Codes for Grid-like Topologies | 2018-07-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5368747 | 2017-10-10 | Paper |
| On the Locality of Codeword Symbols | 2017-06-08 | Paper |
| A Fourier-Analytic Approach to Reed–Muller Decoding | 2017-06-08 | Paper |
| Locally testable codes and cayley graphs | 2017-05-19 | Paper |
| Explicit Maximally Recoverable Codes With Locality | 2017-05-16 | Paper |
| Smooth Boolean functions are easy: efficient algorithms for low-sensitivity functions | 2016-04-15 | Paper |
| Making the Long Code Shorter | 2015-11-04 | Paper |
| List Decoding Tensor Products and Interleaved Codes | 2015-02-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934610 | 2014-12-18 | Paper |
| Constructing Ramsey graphs from Boolean function representations | 2014-08-14 | Paper |
| An FPTAS for #Knapsack and Related Counting Problems | 2014-07-30 | Paper |
| Bounded Independence Fools Halfspaces | 2014-07-25 | Paper |
| Pseudorandom generators for combinatorial shapes | 2014-06-05 | Paper |
| Pseudorandom generators for combinatorial shapes | 2013-09-25 | Paper |
| DNF sparsification and a faster deterministic counting algorithm | 2013-07-19 | Paper |
| List Decoding Tensor Products and Interleaved Codes | 2012-02-11 | Paper |
| Testing Fourier Dimensionality and Sparsity | 2011-11-07 | Paper |
| Matching Vector Codes | 2011-11-07 | Paper |
| Bounded Independence Fools Halfspaces | 2011-04-04 | Paper |
| Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence | 2011-04-04 | Paper |
| The complexity of Boolean functions in different characteristics | 2011-02-18 | Paper |
| Hardness amplification within NP against deterministic algorithms | 2011-01-18 | Paper |
| Hardness of Reconstructing Multivariate Polynomials over Finite Fields | 2011-01-17 | Paper |
| Learning and Lower Bounds for AC 0 with Threshold Gates | 2010-09-10 | Paper |
| Query-efficient algorithms for polynomial interpolation over composites | 2010-08-16 | Paper |
| On agnostic learning of parities, monomials, and halfspaces | 2010-04-29 | Paper |
| The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies | 2010-01-06 | Paper |
| FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science | 2009-08-06 | Paper |
| Testing Fourier Dimensionality and Sparsity | 2009-07-14 | Paper |
| Query-Efficient Algorithms for Polynomial Interpolation over Composites | 2009-06-22 | Paper |
| Polynomials that sign represent parity and Descartes' rule of signs | 2009-06-17 | Paper |
| The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies | 2009-03-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5302076 | 2009-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549710 | 2009-01-05 | Paper |
| Algorithms for Modular Counting of Roots of Multivariate Polynomials | 2008-09-18 | Paper |
| Algorithms for modular counting of roots of multivariate polynomials | 2008-04-23 | Paper |
| Caching with Expiration Times for Internet Applications | 2006-05-09 | Paper |
| Symmetric polynomials over \(\mathbb Z_{m}\) and simultaneous communication protocols | 2006-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828981 | 2004-11-29 | Paper |
