| Publication | Date of Publication | Type |
|---|
| A quantum algorithm framework for discrete probability distributions with applications to Rényi entropy estimation | 2024-07-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147309 | 2024-01-15 | Paper |
| On the cut dimension of a graph | 2023-07-12 | Paper |
| Sensitivity conjecture and log-rank conjecture for functions with small alternating numbers | 2020-05-27 | Paper |
| Efficient quantum protocols for XOR functions | 2019-06-20 | Paper |
| Efficient protocols for generating bipartite classical distributions and quantum states | 2019-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633839 | 2019-05-06 | Paper |
| Contextual dependent click bandit algorithm for web recommendation | 2018-10-04 | Paper |
| Measurement-device-independent semiquantum key distribution | 2018-09-03 | Paper |
| Linear-Time Algorithm for Quantum 2SAT | 2018-06-15 | Paper |
| On the complexity of probabilistic trials for hidden satisfiability problems | 2018-03-21 | Paper |
| Linear time algorithm for quantum 2SAT | 2017-12-19 | Paper |
| Quantum game players can have advantage without discord | 2017-09-28 | Paper |
| Multipartite quantum correlation and communication complexities | 2017-07-28 | Paper |
| On the I/O complexity of dynamic distinct counting | 2017-06-13 | Paper |
| Efficient Protocols for Generating Bipartite Classical Distributions and Quantum States | 2017-06-08 | Paper |
| Quantum strategic game theory | 2016-10-07 | Paper |
| Fourier sparsity of \(\mathrm{GF}(2)\) polynomials | 2016-07-25 | Paper |
| A quantum protocol for sampling correlated equilibria unconditionally and without a mediator | 2015-12-03 | Paper |
| Social models and algorithms for optimization of contact immunity of oral polio vaccine | 2015-11-12 | Paper |
| Solving linear programming with constraints unknown | 2015-10-27 | Paper |
| Quantum game players can have advantage without discord | 2015-09-30 | Paper |
| Semiquantum key distribution without invoking the classical party's measurement capability | 2015-09-23 | Paper |
| New upper and lower bounds for randomized and quantum local search | 2014-11-25 | Paper |
| On the complexity of trial and error | 2014-08-07 | Paper |
| On the power of a unique quantum witness | 2012-09-27 | Paper |
| The influence lower bound via query elimination | 2012-09-27 | Paper |
| On the Power of Lower Bound Methods for One-Way Quantum Communication Complexity | 2011-07-06 | Paper |
| Any AND-OR formula of size \(N\) can be evaluated in time \(N^{1/2+o(1)}\) on a quantum computer | 2011-01-17 | Paper |
| Composition theorems in communication complexity | 2010-09-07 | Paper |
| Depth-independent lower bounds on the communication complexity of read-once Boolean formulas | 2010-07-20 | Paper |
| Tight bounds for randomized and quantum local search | 2010-07-07 | Paper |
| The communication complexity of the Hamming distance problem | 2010-01-29 | Paper |
| On the tightness of the Buhrman-Cleve-Wigderson simulation | 2009-12-17 | Paper |
| New bounds on classical and quantum one-way communication complexity | 2009-07-10 | Paper |
| Streaming Algorithms Measured in Terms of the Computed Quantity | 2009-03-06 | Paper |
| Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks | 2008-08-19 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| On the power of Ambainis lower bounds | 2005-06-30 | Paper |
| Universal and original-preserving quantum copying is impossible | 2002-05-14 | Paper |
