| Publication | Date of Publication | Type |
|---|
| Certificate games | 2024-09-25 | Paper |
The communication complexity of functions with large outputs
Structural Information and Communication Complexity | 2024-01-11 | Paper |
| scientific article; zbMATH DE number 7559433 (Why is no real title available?) | 2022-07-18 | Paper |
Relative discrepancy does not separate information and communication complexity
ACM Transactions on Computation Theory | 2019-12-06 | Paper |
Key establishment à la Merkle in a quantum world
Journal of Cryptology | 2019-08-13 | Paper |
Provably secure key establishment against quantum adversaries
(available as arXiv preprint) | 2018-05-03 | Paper |
Robust Bell inequalities from communication complexity
(available as arXiv preprint) | 2017-07-19 | Paper |
Probabilistic abstraction for model checking: an approach based on property testing
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
Lower bounds on information complexity via zero-communication protocols and applications
SIAM Journal on Computing | 2015-11-04 | Paper |
Lower bounds on information complexity via zero-communication protocols and applications
SIAM Journal on Computing | 2015-11-04 | Paper |
Relative discrepancy does not separate information and communication complexity
Automata, Languages, and Programming | 2015-10-27 | Paper |
Classical and quantum partition bound and detector inefficiency
Automata, Languages, and Programming | 2013-08-12 | Paper |
| Non-local box complexity and secure function evaluation | 2012-10-24 | Paper |
| The communication complexity of non-signaling distributions | 2011-12-19 | Paper |
Non-local box complexity and secure function evaluation
(available as arXiv preprint) | 2011-10-05 | Paper |
Merkle puzzles in a quantum world
Advances in Cryptology – CRYPTO 2011 | 2011-08-12 | Paper |
Kolmogorov complexity and combinatorial methods in communication complexity
Theoretical Computer Science | 2011-05-18 | Paper |
The Communication Complexity of Non-signaling Distributions
Mathematical Foundations of Computer Science 2009 | 2009-10-16 | Paper |
Kolmogorov Complexity and Combinatorial Methods in Communication Complexity
Lecture Notes in Computer Science | 2009-06-03 | Paper |
Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments
SIAM Journal on Computing | 2009-03-16 | Paper |
The quantum adversary method and classical formula size power bounds
Computational Complexity | 2007-11-05 | Paper |
Logical Approaches to Computational Barriers
Lecture Notes in Computer Science | 2007-04-30 | Paper |
Circuit lower bounds à la Kolmogorov
Information and Computation | 2006-10-10 | Paper |
Resource-bounded Kolmogorov complexity revisited
SIAM Journal on Computing | 2002-04-23 | Paper |
Quantum Kolmogorov complexity
Journal of Computer and System Sciences | 2002-02-19 | Paper |
Quantum Kolmogorov complexity
Journal of Computer and System Sciences | 2002-02-19 | Paper |
On coherence, random-self-reducibility, and self-correction
Computational Complexity | 1999-01-03 | Paper |
| scientific article; zbMATH DE number 1136072 (Why is no real title available?) | 1998-05-12 | Paper |
| scientific article; zbMATH DE number 176509 (Why is no real title available?) | 1993-05-18 | Paper |
