Harry Buhrman

Citirano

	Sve	Od 2019.
Citati	12000	4596
H-indeks	49	27
i10-indeks	124	59

1100

550

275

825

1993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202439 34 34 48 42 118 130 188 206 183 299 260 293 348 381 354 363 315 385 377 443 520 430 526 379 528 601 692 645 762 811 1079

Javni pristup

Prikaži sve

15 članaka

1 članak

dostupno

nije dostupno

Na temelju uvjeta financiranja

Suautori

Ronald de WolfCWI and University of AmsterdamPotvrđena adresa e-pošte na cwi.nl
Richard CleveInstitute for Quantum Computing, University of WaterlooPotvrđena adresa e-pošte na uwaterloo.ca
Lance FortnowIllinois Institute of TechnologyPotvrđena adresa e-pošte na iit.edu
Leen TorenvlietILLC University of Amsterdam (retired)Potvrđena adresa e-pošte na uva.nl
Florian SpeelmanUniversity of Amsterdam, QuSoftPotvrđena adresa e-pošte na uva.nl
Michal KouckyCharles University, PraguePotvrđena adresa e-pošte na iuuk.mff.cuni.cz
Paul VitanyiCWI and University of AmsterdamPotvrđena adresa e-pošte na cwi.nl
Matthias ChristandlUniversity of CopenhagenPotvrđena adresa e-pošte na math.ku.dk
Bruno LoffLASIGE, Faculdade de Ciências da Universidade de LisboaPotvrđena adresa e-pošte na fc.up.pt
Falk UngerPotvrđena adresa e-pošte na eecs.berkeley.edu
Christian SchaffnerUniversity of Amsterdam & QuSoftPotvrđena adresa e-pošte na uva.nl
Jop BriëtCWIPotvrđena adresa e-pošte na cwi.nl
Serge MassarUniversité libre de BruxellesPotvrđena adresa e-pošte na ulb.ac.be
Serge FehrCWIPotvrđena adresa e-pošte na cwi.nl
Ilan NewmanProfessor of Computer Science, University of HaifaPotvrđena adresa e-pošte na cs.haifa.ac.il
Eric AllenderRutgers UniversityPotvrđena adresa e-pošte na cs.rutgers.edu
Alain TappDIRO, Université de MontréalPotvrđena adresa e-pošte na iro.umontreal.ca
Wim van DamMicrosoftPotvrđena adresa e-pošte na microsoft.com
Jaap-Henk HoepmanAssociate Professor of Computer Science, Radboud University NijmegenPotvrđena adresa e-pošte na cs.ru.nl
John WatrousIBM QuantumPotvrđena adresa e-pošte na ibm.com

Prati

Harry Buhrman

Chief Scientist Q Algorithms @ Quantinuum, Professor Univ. of Amsterdam & Founding Director QuSoft

Potvrđena adresa e-pošte na quantinuum.com

Quantum Computing Complexity Theory Kolmogorov Complexity Computational Learning Theory


Naslov Poredaj po navodima Poredaj po godini Poredaj po naslovu	Citirano Citirano	Godina
Quantum fingerprinting H Buhrman, R Cleve, J Watrous, R De Wolf Physical review letters 87 (16), 167902, 2001	1388	2001
Quantum lower bounds by polynomials R Beals, H Buhrman, R Cleve, M Mosca, R De Wolf Journal of the ACM (JACM) 48 (4), 778-797, 2001	996	2001
Complexity measures and decision tree complexity: a survey H Buhrman, R De Wolf Theoretical Computer Science 288 (1), 21-43, 2002	755	2002
The quantum technologies roadmap: a European community view A Acín, I Bloch, H Buhrman, T Calarco, C Eichler, J Eisert, D Esteve, ... New Journal of Physics 20 (8), 080201, 2018	739	2018
Nonlocality and communication complexity H Buhrman, R Cleve, S Massar, R De Wolf Reviews of modern physics 82 (1), 665-698, 2010	636	2010
Substituting quantum entanglement for communication R Cleve, H Buhrman Physical Review A 56 (2), 1201, 1997	561	1997
Quantum vs. classical communication and computation H Buhrman, R Cleve, A Wigderson Proceedings of the thirtieth annual ACM symposium on Theory of computing, 63-68, 1998	514	1998
Limit on nonlocality in any world in which communication complexity is not trivial G Brassard, H Buhrman, N Linden, AA Méthot, A Tapp, F Unger Physical Review Letters 96 (25), 250401, 2006	416	2006
Position-based quantum cryptography: Impossibility and constructions H Buhrman, N Chandran, S Fehr, R Gelles, V Goyal, R Ostrovsky, ... SIAM Journal on Computing 43 (1), 150-178, 2014	229	2014
Quantum entanglement and communication complexity H Buhrman, R Cleve, W Van Dam SIAM Journal on Computing 30 (6), 1829-1841, 2001	218	2001
Quantum verification of matrix products H Buhrman, R Spalek arXiv preprint quant-ph/0409035, 2004	192	2004
Power from random strings E Allender, H Buhrman, M Koucký, D Van Melkebeek, D Ronneburger SIAM Journal on Computing 35 (6), 1467-1493, 2006	191*	2006
Bounds for small-error and zero-error quantum algorithms H Buhrman, R Cleve, R De Wolf, C Zalka 40th Annual Symposium on Foundations of Computer Science (Cat. No. 99CB37039 …, 1999	176	1999
Communication complexity lower bounds by polynomials H Buhrman, R de Wolf Proceedings 16th Annual IEEE Conference on Computational Complexity, 120-130, 2001	160	2001
Are bitvectors optimal? H Buhrman, PB Miltersen, J Radhakrishnan, S Venkatesh Proceedings of the thirty-second annual ACM symposium on Theory of computing …, 2000	153	2000
Multiparty quantum communication complexity H Buhrman, W van Dam, P Høyer, A Tapp Physical Review A 60 (4), 2737, 1999	152	1999
On computation and communication with small bias H Buhrman, N Vereshchagin, R de Wolf Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07), 24-32, 2007	126	2007
Nonrelativizing separations H Buhrman, L Fortnow, T Thierauf Proceedings. Thirteenth Annual IEEE Conference on Computational Complexity …, 1998	121	1998
Quantum algorithms for element distinctness H Buhrman, C Durr, M Heiligman, P Hoyer, F Magniez, M Santha, ... Proceedings 16th Annual IEEE Conference on Computational Complexity, 131-137, 2001	115	2001
Robust polynomials and quantum algorithms H Buhrman, I Newman, H Rohrig, R de Wolf Theory of Computing Systems 40, 379-395, 2007	104*	2007

Sustav trenutno ne može provesti ovu radnju. Pokušajte ponovo kasnije.

Članci 1–20

Godišnji broj citata

Dvostruki navodi

Spojeni navodi

Dodavanje suautoraSuautori

Prati

Citirano

Suautori