History


Please fill in your query. A complete syntax description you will find on the General Help page.
first | previous | 1 21 | next | last

Result 1 to 20 of 30 total

Classical and quantum partition bound and detector inefficiency. (English)
Czumaj, Artur (ed.) et al., Automata, languages, and programming. 39th international colloquium, ICALP 2012, Warwick, UK, July 9‒13, 2012. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-31593-0/pbk). Lecture Notes in Computer Science 7391, 617-628 (2012).
WorldCat.org
1
Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications. (English)
FOCS, 500-509(2012)
WorldCat.org
2
The communication complexity of non-signaling distributions. (English)
Quantum Inf. Comput. 11, No. 7-8, 649-676 (2011).
WorldCat.org
3
Non-local box complexity and secure function evaluation. (English)
Quantum Inf. Comput. 11, No. 1-2, 40-69 (2011).
WorldCat.org
4
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).
WorldCat.org
5
Kolmogorov complexity and combinatorial methods in communication complexity. (English)
Theor. Comput. Sci. 412, No. 23, 2524-2535 (2011).
WorldCat.org
6
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).
WorldCat.org
7
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).
WorldCat.org
8
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).
WorldCat.org
9
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).
WorldCat.org
10
Lower bounds for randomized and quantum query complexity using Kolmogorov arguments. (English)
SIAM J. Comput. 38, No. 1, 46-62 (2008).
WorldCat.org
11
Kolmogorov complexity and combinatorial methods in communication complexity. (English)
Electron. Colloq. Comput. Complex. 15, No. 109 (2008).
WorldCat.org
12
Probabilistic abstraction for model checking: An approach based on property testing. (English)
ACM Trans. Comput. Log. 8, No. 4 (2007).
WorldCat.org
13
The quantum adversary method and classical formula size power bounds. (English)
Comput. Complexity 15, No. 2, 163-196 (2006).
WorldCat.org
14
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).
WorldCat.org
15
The Quantum Adversary Method and Classical Formula Size Lower Bounds. (English)
IEEE Conference on Computational Complexity, 76-90(2005)
WorldCat.org
16
Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments. (English)
IEEE Conference on Computational Complexity, 294-304(2004)
WorldCat.org
17
Resource-bounded Kolmogorov complexity revisited. (English)
SIAM J. Comput. 31, No.3, 887-905 (2002).
Classification: F.1.3 H.1.1
WorldCat.org
18
Probabilistic Abstraction for Model Checking: An Approach Based on Property Testing. (English)
LICS, 30-39(2002)
WorldCat.org
19
Probabilistic abstraction for model checking: An approach based on property testing. (English)
Electron. Colloq. Comput. Complex. 8, No. 51 (2001).
WorldCat.org
20
first | previous | 1 21 | next | last

Result 1 to 20 of 30 total

Valid XHTML 1.0 Transitional Valid CSS!