| Publication | Date of Publication | Type |
|---|
| Query complexity of search problems | 2024-12-03 | Paper |
| Lifting to parity decision trees via stifling | 2024-09-25 | Paper |
| Robustly separating the arithmetic monotone hierarchy via graph inner-product | 2024-09-12 | Paper |
| Randomized versus deterministic decision tree size | 2024-05-08 | Paper |
| Symmetry and quantum query-to-communication simulation | 2024-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6126270 | 2024-04-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6187026 | 2024-02-05 | Paper |
| Lower bounds for monotone arithmetic circuits via communication complexity | 2023-11-14 | Paper |
| Equality alone does not simulate randomness | 2022-07-27 | Paper |
| Query-To-Communication Lifting for BPP Using Inner Product | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5092483 | 2022-07-21 | Paper |
| A Short List of Equalities Induces Large Sign-Rank | 2022-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4988300 | 2021-05-14 | Paper |
| Query-to-Communication Lifting Using Low-Discrepancy Gadgets | 2021-03-24 | Paper |
| Computing the multilinear factors of lacunary polynomials without heights | 2021-02-18 | Paper |
| A Lifting Theorem with Applications to Symmetric Functions | 2020-11-25 | Paper |
| The Log-Approximate-Rank Conjecture Is False | 2020-11-11 | Paper |
| The log-approximate-rank conjecture is false | 2020-01-30 | Paper |
| Simulation theorems via pseudo-random properties | 2019-12-19 | Paper |
| Simulation beats richness: new data-structure lower bounds | 2019-08-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743425 | 2019-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4612486 | 2019-01-31 | Paper |
| Tight Network Topology Dependent Bounds on Rounds of Communication | 2018-07-16 | Paper |
| Lower Bounds for Elimination via Weak Regularity | 2018-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2969648 | 2017-03-22 | Paper |
| Factoring bivariate lacunary polynomials without heights | 2017-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2954998 | 2017-01-24 | Paper |
| Upper and Lower Bounds on the Power of Advice | 2016-08-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3187179 | 2016-08-16 | Paper |
| The Range of Topological Effects on Communication | 2015-11-04 | Paper |
| Graph Isomorphism is Not AC0-Reducible to Group Isomorphism | 2015-09-24 | Paper |
| The Hardness of Being Private | 2015-09-07 | Paper |
| Learning read-constant polynomials of constant degree modulo composites | 2015-02-05 | Paper |
| Linear Systems over Composite Moduli | 2014-07-25 | Paper |
| Graph Isomorphism is not AC 0 reducible to Group Isomorphism | 2012-08-29 | Paper |
| Learning Read-Constant Polynomials of Constant Degree Modulo Composites | 2011-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3568106 | 2010-06-17 | Paper |
| Properly 2-Colouring Linear Hypergraphs | 2009-02-17 | Paper |
| Languages with Bounded Multiparty Communication Complexity | 2007-09-03 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449235 | 2004-02-08 | Paper |
