dhr. prof. dr. H.M. (Harry) Buhrman
-
Faculteit der Natuurwetenschappen, Wiskunde en Informatica
ILLC
-
POSTBUS
94242
1090 GE Amsterdam
Kamernummer: C3.122
-
H.M.Buhrman@uva.nl
T: 0205958312
T: 0205256051
2014
- H.M. Buhrman, S. Fehr & C. Schaffner (2014). On the Parallel Repetition of Multi-Player Games: The No-Signaling Case. In Steven T. Flammia & Aram W. Harrow (Eds.), 9th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2014). Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik.
- H.M. Buhrman, N. Chandran, S. Fehr, R. Gelles, V. Goyal, R. Ostrovsky & C. Schaffner (2014). Position-based quantum cryptography: Impossibility and constructions. SIAM Journal on Computing, 43, 150-178. doi: 10.1137/130913687
2013
- H.M. Buhrman, S. Fehr, C. Schaffner & F. Speelman (2013). The Garden-Hose Model. In ITCS 2013 Proceedings of the 4th conference on Innovations in Theoretical Computer Science (pp. 145-158).
- H. Buhrman, P. van der Gulik, G.W. Klau, C. Schaffner, D. Speijer & L. Stougie (2013). A Realistic Model Under Which the Genetic Code is Optimal. Journal of molecular evolution. doi: 10.1007/s00239-013-9571-2
- H.M. Buhrman, A. Matsliah, R.M. de Wolf & D. García Soriano (2013). The non-adaptive query complexity of testing k-parities. Chicago Journal of Theoretical Computer Science, 2013:6. doi: 10.4086/cjtcs.2013.006
2012
- H.M. Buhrman, O. Regev, G. Scarpa & R.M. de Wolf (2012). Near-Optimal and Explicit Bell Inequality Violations. Theory of Computing, 8, 623-645.
- H. Buhrman, M. Christandl & C. Schaffner (2012). Complete insecurity of quantum protocols for classical two-party computation. Physical Review Letters, 109 (16), 160501. doi: 10.1103/PhysRevLett.109.160501[go to publisher's site]
- H. Buhrman, B. Loff & L. Torenvliet (2012). Hardness of approximation for Knapsack problems. Theory of Computing Systems, 56 (2), 372-393. doi: 10.1007/s00224-014-9550-z[go to publisher's site]
2011
- H.M. Buhrman, O. Regev, G. Scarpa & R.M. de Wolf (2011). Near-Optimal and Explicit Bell Inequality Violations. In 25th IEEE Conference on Computational Complexity (pp. 157-166).
- H. Buhrman, N. Chandran, S. Fehr, R. Gelles, V. Goyal, R. Ostrovsky & C. Schaffner (2011). Position-based quantum cryptography: impossibility and constructions. Lecture Notes in Computer Science, 6841, 429-446. doi: 10.1007/978-3-642-22792-9_24[go to publisher's site]
2010
- H. Buhrman, L. Fortnow, M. Koucký & B. Loff (2010). Derandomizing from random strings. In Proceedings of the 25th Annual IEEE Conference on Computational Complexity (CCC 2010) Proceedings - IEEE Conference on Computational Complexity (pp. 58-63). Los Alamitos, CA: IEEE Computer Society.
- H. Buhrman, L. Fortnow, M. Koucký, J.D. Rogers & N. Vereshchagin (2010). Does the polynomial hierarchy collapse if onto functions are invertible? Theory of Computing Systems, 46 (1), 143-156.[go to publisher's site]
- H. Buhrman, B. Hescott, S. Homer & L. Torenvliet (2010). Non-uniform reductions. Theory of Computing Systems, 47 (2), 317-341.[go to publisher's site]
2009
- H. Buhrman, L. Fortnow & R. Santhanam (2009). Unconditional lower bounds against advice. In S. Albers, A. Marchetti-Spaccamela, Y. Matias, S. Nikoletseas & W. Thomas (Eds.), Automata, Languages and Programming: 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009: Proceedings, part I Vol. 5555. Lecture Notes in Computer Science (pp. 195-209). Berlin: Springer.
- P. van der Gulik, S. Massar, D. Gilis, H. Buhrman & M. Rooman (2009). The first peptides: The evolutionary transition between prebiotic amino acids and early proteins. Journal of Theoretical Biology, 261 (4), 531-539.
- J. Allcock, H. Buhrman & N. Linden (2009). Arbitrarily little knowledge can give a quantum advantage for nonlocal tasks. Physical Review A, 80 (3), 032105.
2008
- H. Buhrman, L. Fortnow, I. Newman & H. Röhrig (2008). Quantum property testing. SIAM Journal on Computing, 37 (5), 1387-1400.[go to publisher's site]
- H. Buhrman & J.M. Hitchcock (2008). NP-hard sets are exponentially dense unless coNP C NP/poly. In CCC 2008: Twenty-third Annual IEEE Conference on Computational Complexity: Proceedings: 23-26 June 2008, College Park, Maryland (pp. 1-7). Los Alamitos, CA: IEEE Computer Society.
- H. Buhrman, M. Koucký & N. Vereshchagin (2008). Randomised individual communication complexity. In CCC 2008: Twenty-third Annual IEEE Conference on Computational Complexity: Proceedings: 23-26 June 2008, College Park, Maryland (pp. 321-331). Los Alamitos, CA: IEEE Computer Society.
2007
- H.M. Buhrman, M. Christandl, M. Koucký, Z. Lotker, B. Patt-Shamir & N.K. Vereshchagin (2007). High Entropy Random Selection Protocols. In APPROX-RANDOM (pp. 366-379).
- H.M. Buhrman, L. Fortnow, M. Koucký, J. Rogers & N.K. Vereshchagin (2007). Inverting Onto Functions and Polynomial Hierarchy. In Computer Science - Theory and Applications (Lecture Notes in Computer Science, 4649) (pp. 92-103). Berlin / Heidelberg: Springer.
- H.M. Buhrman, N.K. Vereshchagin & R.M. de Wolf (2007). On Computation and Communication with Small Bias. In Proceedings of the XXII Annual IEEE Conference of Computational Complexity (pp. 24-32).
- H.M. Buhrman, I. Newman, H.P. Röhrig & R.M. de Wolf (2007). Robust Polynomials and Quantum Algorithms. Journal of Computer and System Sciences, 40 (4), 379-395.
- H.M. Buhrman, H. Klauck, N.K. Vereshchagin & P.M.B. Vitanyi (2007). Individual communication complexity. Journal of Computer and System Sciences, 73, 973-985.
2006
- G. Brassard, H.M. Buhrman, N. Linden, A.A. Méthot, A. Tap & F.P. Unger (2006). Limit on Nonlocality in Any World in Which Communication Complexity Is Not Trivial. Physical Review Letters, 96, 250401.
- H.M. Buhrman, R. Cleve, M. Laurent, N. Linden, A. Schrijver & F.P. Unger (2006). New limits on fault-tolerant quantum computation. In 47th Annual IEEE Symposium on Foundations of Computer Science (pp. 411-419).
- H.M. Buhrman & R. Spalek (2006). Quantum Verification of Matrix Products. In Proceedings of 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'06) (pp. 880-889). Miami: ACM Press.
- H.M. Buhrman, L. Torenvliet & F.P. Unger (2006). Spare Self-reducible sets and polynomial size circuit lower bounds. In Proceedings of STACS 2006 (pp. 455-468). Marseille: Springer.
- E. Allender, H.M. Buhrman & M. Koucky (2006). What can be efficiently reduced to the kolmogorov-random strings? Annals of Pure and Applied Logic, 138 (1-3), 2-19.
- E. Allender, H.M. Buhrman, M. Koucky, D. van Melkebeek & D. Ronneburger (2006). Power from random strings. SIAM Journal on Computing, 35 (6), 1467-1493.
- R. Beigel, H.M. Buhrman, P. Feijer, L. Fortnow, P. Grabowski, L. Longpre, A. Muchnik, F. Stephan & L. Torenvliet (2006). Enumerations of the Kolmogorov Function. Journal of Symbolic Logic, 7, 501-528.
- H.M. Buhrman, M. Christandl, F.P. Unger, S.D.C. Wehner & A. WInter (2006). Implications of superstrong non-locality for cryptography. In Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences (pp. 1919-1932).
- H.M. Buhrman, A. Panconesi, R. Silvestri & P.M.B. Vitanyi (2006). On the importance of having an identity or, is consensus really universal? Distributed Computing, 18 (3), 167-176.
- H.M. Buhrman, M. Christandl, P. Hayden, Lo H.-K. & S.D.C. Wehner (2006). Security of quantum bit string commitment depends on the information measure. Physical Review Letters, 97, 250501.
2008
- H. Buhrman, M. Christandl, P. Hayden, H.-K. Lo & S. Wehner (2008). Possibility, impossibility, and cheat sensitivity of quantum-bit string commitment. Physical Review A, 78 (2), 022316.[go to publisher's site]
2006
- H.M. Buhrman (2006). Toveren met kwantum informatie. In B. Mols (Ed.), Het raadsel van informatie (7, 6) (pp. 95-113). Boom.
This page has been automatically generated by the UvA-Current Research Information System. If you have any questions about the content of this page, please contact the UBAcoach or the Metis staff of your faculty / institute. To edit your publications login to Personal Metis.