Result 1 to 20 of 37 total
The communication complexity of non-signaling distributions. (English)
Quantum Inf. Comput. 11, No. 7-8, 649-676 (2011).
1
Non-local box complexity and secure function evaluation. (English)
Quantum Inf. Comput. 11, No. 1-2, 40-69 (2011).
2
Merkle puzzles in a quantum world. (English)
Rogaway, Phillip (ed.), Advances in cryptology ‒ CRYPTO 2011. 31st annual cryptology conference, Santa Barbara, CA, USA, August 14‒18, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22791-2/pbk). Lecture Notes in Computer Science 6841, 391-410 (2011).
3
Kolmogorov complexity and combinatorial methods in communication complexity. (English)
Theor. Comput. Sci. 412, No. 23, 2524-2535 (2011).
4
The communication complexity of non-signaling distributions (English)
Quantum Information & Computation 11, No. 7-8, 649-676 (2011).
5
Non-local box complexity and secure function evaluation (English)
Quantum Information & Computation 11, No. 1-2, 40-69 (2011).
6
Merkle puzzles in a quantum world (English)
CRYPTO, 391-410 (2011).
7
Non-local box complexity and secure function evaluation. (English)
Kannan, Ravi (ed.) et al., IARCS annual conference on foundations of software technology and theoretical computer science (FSTTCS 2009), December 15‒17, 2009, Kanpur, India. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-13-2). LIPICS ‒ Leibniz International Proceedings in Informatics 4, 239-250, electronic only (2009).
8
Cryptographic security of individual instances. (English)
Desmedt, Yvo (ed.), Information theoretic security. Second international conference, ICITS 2007, Madrid, Spain, May 25‒29, 2007. Revised selected papers. Berlin: Springer (ISBN 978-3-642-10229-5/pbk). Lecture Notes in Computer Science 4883, 195-210 (2009).
9
The communication complexity of non-signaling distributions. (English)
Královič, Rastislav (ed.) et al., Mathematical foundations of computer science 2009. 34th international symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24‒28, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03815-0/pbk). Lecture Notes in Computer Science 5734, 270-281 (2009).
10
Kolmogorov complexity and combinatorial methods in communication complexity. (English)
Chen, Jianer (ed.) et al., Theory and applications of models of computation. 6th annual conference, TAMC 2009, Changsha, China, May 18‒22, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-02016-2/pbk). Lecture Notes in Computer Science 5532, 261-270 (2009).
11
Kolmogorov complexity and combinatorial methods in communication complexity (English)
TAMC, 261-270 (2009).
12
The communication complexity of non-signaling distributions (English)
MFCS, 270-281 (2009).
13
Non-local box complexity and secure function evaluation (English)
FSTTCS, 239-250 (2009).
14
Lower bounds for randomized and quantum query complexity using Kolmogorov arguments. (English)
SIAM J. Comput. 38, No. 1, 46-62 (2008).
15
Kolmogorov complexity and combinatorial methods in communication complexity. (English)
Electron. Colloq. Comput. Complex. 15, No. 109 (2008).
16
Probabilistic abstraction for model checking: An approach based on property testing. (English)
ACM Trans. Comput. Log. 8, No. 4 (2007).
17
The quantum adversary method and classical formula size power bounds. (English)
Comput. Complexity 15, No. 2, 163-196 (2006).
18
Lower bounds using Kolmogorov complexity. (English)
Beckmann, Arnold (ed.) et al., Logical approaches to computational barriers. Second conference on computability in Europe, CiE 2006, Swansea, UK, June 30‒July 5, 2006. Proceedings. Berlin: Springer (ISBN 3-540-35466-2/pbk). Lecture Notes in Computer Science 3988, 297-306 (2006).
19
Lower bounds using Kolmogorov complexity (English)
CiE, 297-306 (2006).
20
Result 1 to 20 of 37 total
Start
Contact
Print
General Help
