| Publication | Date of Publication | Type |
|---|
Generalized BUC plane partitions
Physica D | 2026-07-07 | Paper |
Contextual combinatorial conservative bandits
Theoretical Computer Science | 2026-06-15 | Paper |
| Fourier sparsity, spectral norm, and the log-rank conjecture | 2025-05-20 | Paper |
A quantum algorithm framework for discrete probability distributions with applications to Rényi entropy estimation
IEEE Transactions on Information Theory | 2024-07-22 | Paper |
scientific article; zbMATH DE number 7788397 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
On the cut dimension of a graph
(available as arXiv preprint) | 2023-07-12 | Paper |
Sensitivity conjecture and log-rank conjecture for functions with small alternating numbers
(available as arXiv preprint) | 2020-05-27 | Paper |
Efficient quantum protocols for XOR functions
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Efficient protocols for generating bipartite classical distributions and quantum states
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
| scientific article; zbMATH DE number 7051199 (Why is no real title available?) | 2019-05-06 | Paper |
| Contextual dependent click bandit algorithm for web recommendation | 2018-10-04 | Paper |
Measurement-device-independent semiquantum key distribution
International Journal of Quantum Information | 2018-09-03 | Paper |
Linear-Time Algorithm for Quantum 2SAT
Theory of Computing | 2018-06-15 | Paper |
On the complexity of probabilistic trials for hidden satisfiability problems
(available as arXiv preprint) | 2018-03-21 | Paper |
Linear time algorithm for quantum 2SAT
(available as arXiv preprint) | 2017-12-19 | Paper |
Quantum game players can have advantage without discord
Information and Computation | 2017-09-28 | Paper |
Multipartite quantum correlation and communication complexities
Computational Complexity | 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
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Quantum strategic game theory
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference | 2016-10-07 | Paper |
Fourier sparsity of \(\mathrm{GF}(2)\) polynomials
Computer Science – Theory and Applications | 2016-07-25 | Paper |
A quantum protocol for sampling correlated equilibria unconditionally and without a mediator
Theory of Quantum Computation, Communication, and Cryptography | 2015-12-03 | Paper |
Social models and algorithms for optimization of contact immunity of oral polio vaccine
Frontiers in Algorithmics | 2015-11-12 | Paper |
Solving linear programming with constraints unknown
Automata, Languages, and Programming | 2015-10-27 | Paper |
Quantum game players can have advantage without discord
Lecture Notes in Computer Science | 2015-09-30 | Paper |
Semiquantum key distribution without invoking the classical party's measurement capability
Quantum Information Processing | 2015-09-23 | Paper |
New upper and lower bounds for randomized and quantum local search
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
On the complexity of trial and error
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
The influence lower bound via query elimination
Theory of Computing | 2012-09-27 | Paper |
On the power of a unique quantum witness
Theory of Computing | 2012-09-27 | Paper |
On the Power of Lower Bound Methods for One-Way Quantum Communication Complexity
Automata, Languages and Programming | 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
SIAM Journal on Computing | 2011-01-17 | Paper |
Composition theorems in communication complexity
Automata, Languages and Programming | 2010-09-07 | Paper |
Depth-independent lower bounds on the communication complexity of read-once Boolean formulas
Lecture Notes in Computer Science | 2010-07-20 | Paper |
Tight bounds for randomized and quantum local search
SIAM Journal on Computing | 2010-07-07 | Paper |
The communication complexity of the Hamming distance problem
Information Processing Letters | 2010-01-29 | Paper |
On the tightness of the Buhrman-Cleve-Wigderson simulation
Algorithms and Computation | 2009-12-17 | Paper |
New bounds on classical and quantum one-way communication complexity
Theoretical Computer Science | 2009-07-10 | Paper |
Streaming Algorithms Measured in Terms of the Computed Quantity
Lecture Notes in Computer Science | 2009-03-06 | Paper |
Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks
Automata, Languages and Programming | 2008-08-19 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
On the power of Ambainis lower bounds
Theoretical Computer Science | 2005-06-30 | Paper |
Universal and original-preserving quantum copying is impossible
Physics Letters. A | 2002-05-14 | Paper |
