| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6204005 | 2024-04-08 | Paper |
| Quantum Speedup for Graph Sparsification, Cut Approximation, and Laplacian Solving | 2023-04-04 | Paper |
| Improved Bounds on Fourier Entropy and Min-Entropy | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874395 | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091164 | 2022-07-21 | Paper |
| Improved Bounds on Fourier Entropy and Min-entropy | 2022-03-29 | Paper |
| Influence in Completely Bounded Block-multilinear Forms and Classical Simulation of Quantum Algorithms | 2022-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111155 | 2020-05-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4614114 | 2019-01-30 | Paper |
| Efficient Quantum Algorithms for (Gapped) Group Testing and Junta Testing | 2018-07-16 | Paper |
| Attacks on the AJPS Mersenne based cryptosystem | 2018-06-22 | Paper |
| Optimal parallel quantum query algorithms | 2017-10-10 | Paper |
| On the sum-of-squares degree of symmetric quadratic functions | 2017-10-10 | Paper |
| Some upper and lower bounds on PSD-rank | 2017-03-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2957903 | 2017-01-30 | Paper |
| Optimal quantum query bounds for almost all Boolean functions. | 2017-01-30 | Paper |
| New bounds on the classical and quantum communication complexity of some graph properties | 2017-01-26 | Paper |
| Exponential Lower Bounds for Polytopes in Combinatorial Optimization | 2016-03-24 | Paper |
| Query Complexity in Expectation | 2015-10-27 | Paper |
| How low can approximate degree and quantum query complexity be for total Boolean functions? | 2015-01-23 | Paper |
| Bounded-error quantum state identification and exponential separations in communication complexity | 2014-11-25 | Paper |
| A new quantum lower bound method, | 2014-11-25 | Paper |
| Optimal parallel quantum query algorithms | 2014-10-08 | Paper |
| Near-Optimal and Explicit Bell Inequality Violations | 2014-10-06 | Paper |
| Linear vs. semidefinite extended formulations | 2014-05-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5414625 | 2014-05-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5414570 | 2014-05-06 | Paper |
| Error-Correcting Data Structures | 2013-07-04 | Paper |
| New Results on Quantum Property Testing | 2012-08-29 | Paper |
| Locally Decodable Quantum Codes | 2012-04-24 | Paper |
| Error-Correcting Data Structures. | 2012-04-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3113749 | 2012-01-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3171599 | 2011-10-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3171708 | 2011-10-05 | Paper |
| Bell Inequalities: What Do We Know about Them and Why Should Cryptographers Care? | 2011-05-19 | Paper |
| Better Gap-Hamming Lower Bounds via Better Round Elimination | 2010-09-10 | Paper |
| Exponential lower bound for 2-query locally decodable codes via a quantum argument | 2010-08-16 | Paper |
| Bounded-Error Quantum State Identification and Exponential Separations in Communication Complexity | 2010-03-17 | Paper |
| Exponential Separation for One-Way Quantum Communication Complexity, with Applications to Cryptography | 2009-11-06 | Paper |
| A new quantum lower bound method, with applications to direct product theorems and time-space tradeoffs | 2009-08-31 | Paper |
| Quantum symmetrically-private information retrieval | 2009-07-21 | Paper |
| Quantum zero-error algorithms cannot be composed | 2009-04-28 | Paper |
| Lower Bounds on Matrix Rigidity Via a Quantum Argument | 2009-03-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3604066 | 2009-02-24 | Paper |
| Upper Bounds on the Noise Threshold for Fault-Tolerant Quantum Computing | 2008-08-28 | Paper |
| Quantum lower bounds by polynomials | 2008-02-11 | Paper |
| Quantum and Classical Strong Direct Product Theorems and Optimal Time‐Space Tradeoffs | 2007-10-22 | Paper |
| Robust polynomials and quantum algorithms | 2007-08-23 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| STACS 2005 | 2005-12-02 | Paper |
| Quantum Algorithms for Element Distinctness | 2005-09-16 | Paper |
| Exponential lower bound for 2-query locally decodable codes via a quantum argument | 2004-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736848 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736853 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449183 | 2004-02-08 | Paper |
| Nondeterministic Quantum Query and Communication Complexities | 2003-06-19 | Paper |
| Quantum communication and complexity. | 2003-01-21 | Paper |
| Complexity measures and decision tree complexity: a survey. | 2003-01-21 | Paper |
| A lower bound for quantum search of an ordered list | 2002-07-25 | Paper |
| Average-case quantum query complexity | 2002-01-27 | Paper |
| Marked PCP is decidable | 2001-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501528 | 2000-09-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4251052 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4386949 | 1998-05-11 | Paper |
| Foundations of inductive logic programming | 1997-06-04 | Paper |
