| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6126321 | 2024-04-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6126362 | 2024-04-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6070398 | 2023-11-20 | Paper |
| Approximate Degree, Weight, and Indistinguishability | 2022-09-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5093396 | 2022-07-26 | Paper |
| Quasirandom groups enjoy interleaved mixing | 2022-06-19 | Paper |
| Average-case rigidity lower bounds | 2022-03-21 | Paper |
| AC0 Unpredictability | 2022-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5002695 | 2021-07-28 | Paper |
| How to Store a Random Walk | 2021-02-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5140841 | 2020-12-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111144 | 2020-05-26 | Paper |
| Sampling Lower Bounds: Boolean Average-Case and Permutations | 2020-02-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5215665 | 2020-02-12 | Paper |
| Constant-Error Pseudorandomness Proofs from Hardness Require Majority | 2019-12-16 | Paper |
| Bounded Independence versus Symmetric Tests | 2019-12-16 | Paper |
| Quadratic Maps Are Hard to Sample | 2019-12-06 | Paper |
| The Coin Problem for Product Tests | 2019-12-06 | Paper |
| The communication complexity of addition | 2019-05-15 | Paper |
| On the Complexity of Information Spreading in Dynamic Networks | 2019-05-15 | Paper |
| Interleaved Group Products | 2019-05-07 | Paper |
| Local expanders | 2018-08-03 | Paper |
| Substitution-Permutation Networks, Pseudorandom Functions, and Natural Proofs | 2018-08-02 | Paper |
| Local reduction | 2018-06-14 | Paper |
| Bounded Independence Plus Noise Fools Products | 2018-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636457 | 2018-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4601849 | 2018-01-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4602401 | 2018-01-10 | Paper |
| Block-symmetric polynomials correlate with parity better than symmetric | 2017-10-18 | Paper |
| Tight Bounds on Computing Error-Correcting Codes by Bounded-Depth Circuits With Arbitrary Gates | 2017-06-08 | Paper |
| The communication complexity of addition | 2017-03-31 | Paper |
| Bounded Indistinguishability and the Complexity of Recovering Secrets | 2016-11-09 | Paper |
| On beating the hybrid argument | 2016-10-07 | Paper |
| 3SUM, 3XOR, triangles | 2016-03-23 | Paper |
| Local Reductions | 2015-10-27 | Paper |
| Real Advantage | 2015-09-24 | Paper |
| Improved Separations between Nondeterministic and Randomized Multiparty Communication | 2015-09-24 | Paper |
| The communication complexity of interleaved group products | 2015-08-21 | Paper |
| On the complexity of constructing pseudorandom functions (especially when they don't exist) | 2015-08-03 | Paper |
| Bit-probe lower bounds for succinct data structures | 2015-02-04 | Paper |
| Randomness buys depth for approximate counting | 2014-12-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3191596 | 2014-10-06 | Paper |
| Shielding circuits with groups | 2014-08-07 | Paper |
| Extractors for Circuit Sources | 2014-07-30 | Paper |
| Extractors for Circuit Sources | 2014-07-30 | Paper |
| Randomness Buys Depth for Approximate Counting | 2014-07-30 | Paper |
| Bounded Independence Fools Halfspaces | 2014-07-25 | Paper |
| Short PCPs with Projection Queries | 2014-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417611 | 2014-05-22 | Paper |
| Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates | 2014-05-13 | Paper |
| Bit-Probe Lower Bounds for Succinct Data Structures | 2013-03-19 | Paper |
| Bounded-depth circuits cannot sample good codes | 2012-12-07 | Paper |
| Extractors for Turing-Machine Sources | 2012-11-02 | Paper |
| Substitution-Permutation Networks, Pseudorandom Functions, and Natural Proofs | 2012-09-25 | Paper |
| The Complexity of Distributions | 2012-05-30 | Paper |
| A computational view of market efficiency | 2011-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3002796 | 2011-05-24 | Paper |
| On the Complexity of Non-adaptively Increasing the Stretch of Pseudorandom Generators | 2011-05-19 | Paper |
| One-way multiparty communication lower bound for pointer jumping with applications | 2011-04-26 | Paper |
| Hardness Amplification Proofs Require Majority | 2011-04-04 | Paper |
| Bounded Independence Fools Halfspaces | 2011-04-04 | Paper |
| The sum of \(D\) small-bias generators fools polynomials of degree \(D\) | 2011-02-18 | Paper |
| On approximate majority and probabilistic time | 2011-02-18 | Paper |
| Pseudorandom Bits for Polynomials | 2011-01-17 | Paper |
| Using nondeterminism to amplify hardness | 2010-08-15 | Paper |
| On the Power of Small-Depth Computation | 2010-01-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5302083 | 2009-01-05 | Paper |
| Improved Separations between Nondeterministic and Randomized Multiparty Communication | 2008-11-27 | Paper |
| Constant-Depth Circuits for Arithmetic in Finite Fields of Characteristic Two | 2008-03-19 | Paper |
| Pseudorandom Bits for Constant‐Depth Circuits with Few Arbitrary Symmetric Gates | 2007-10-22 | Paper |
| Using Nondeterminism to Amplify Hardness | 2006-06-01 | Paper |
| Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2005-08-25 | Paper |
| The complexity of constructing pseudorandom generators from hard functions | 2005-03-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4448380 | 2004-02-18 | Paper |
