Harry Buhrman

Citata da

	Tutte	Dal 2020
Citazioni	12369	4343
Indice H	49	26
i10-index	129	58

1200

600

300

900

19931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202539 34 34 48 41 121 131 186 212 184 300 265 304 339 376 351 374 318 381 382 444 523 430 530 381 530 596 691 653 735 784 1197 279

Accesso pubblico

Visualizza tutto

18 articoli

0 articoli

Disponibili

Non disponibili

In base ai mandati di finanziamento

Coautori

Ronald de WolfCWI and University of AmsterdamEmail verificata su cwi.nl
Richard CleveInstitute for Quantum Computing, University of WaterlooEmail verificata su uwaterloo.ca
Lance FortnowIllinois Institute of TechnologyEmail verificata su iit.edu
Leen TorenvlietILLC University of Amsterdam (retired)Email verificata su uva.nl
Florian SpeelmanUniversity of Amsterdam, QuSoftEmail verificata su uva.nl
Michal KouckyCharles University, PragueEmail verificata su iuuk.mff.cuni.cz
Paul VitanyiCWI and University of AmsterdamEmail verificata su cwi.nl
Matthias ChristandlUniversity of CopenhagenEmail verificata su math.ku.dk
Bruno LoffLASIGE, Faculdade de Ciências da Universidade de LisboaEmail verificata su fc.up.pt
Christian SchaffnerUniversity of Amsterdam & QuSoftEmail verificata su uva.nl
Falk UngerEmail verificata su eecs.berkeley.edu
Jop BriëtCWIEmail verificata su cwi.nl
Serge MassarUniversité libre de BruxellesEmail verificata su ulb.ac.be
Serge FehrCWIEmail verificata su cwi.nl
Ilan NewmanProfessor of Computer Science, University of HaifaEmail verificata su cs.haifa.ac.il
Eric AllenderRutgers UniversityEmail verificata su cs.rutgers.edu
Alain TappDIRO, Université de MontréalEmail verificata su iro.umontreal.ca
Gilles BrassardProfessor of computer science, Université de MontréalEmail verificata su iro.umontreal.ca
Wim van DamMicrosoftEmail verificata su microsoft.com
John WatrousIBM QuantumEmail verificata su ibm.com

Segui

Harry Buhrman

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

Email verificata su quantinuum.com

Quantum Computing Complexity Theory Kolmogorov Complexity Computational Learning Theory


Titolo Ordina per citazioni Ordina per anno Ordina per titolo	Citata da Citata da	Anno
Quantum fingerprinting H Buhrman, R Cleve, J Watrous, R De Wolf Physical review letters 87 (16), 167902, 2001	1464	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	1019	2001
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	782	2018
Complexity measures and decision tree complexity: a survey H Buhrman, R De Wolf Theoretical Computer Science 288 (1), 21-43, 2002	770	2002
Nonlocality and communication complexity H Buhrman, R Cleve, S Massar, R De Wolf Reviews of modern physics 82 (1), 665-698, 2010	654	2010
Substituting quantum entanglement for communication R Cleve, H Buhrman Physical Review A 56 (2), 1201, 1997	572	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	518	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	235	2014
Quantum entanglement and communication complexity H Buhrman, R Cleve, W Van Dam SIAM Journal on Computing 30 (6), 1829-1841, 2001	222	2001
Power from random strings E Allender, H Buhrman, M Koucký, D Van Melkebeek, D Ronneburger SIAM Journal on Computing 35 (6), 1467-1493, 2006	197*	2006
Quantum verification of matrix products H Buhrman, R Spalek arXiv preprint quant-ph/0409035, 2004	191	2004
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	178	1999
Communication complexity lower bounds by polynomials H Buhrman, R de Wolf Proceedings 16th Annual IEEE Conference on Computational Complexity, 120-130, 2001	161	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	156	2000
Multiparty quantum communication complexity H Buhrman, W van Dam, P Høyer, A Tapp Physical Review A 60 (4), 2737, 1999	151	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	127	2007
Nonrelativizing separations H Buhrman, L Fortnow, T Thierauf Proceedings. Thirteenth Annual IEEE Conference on Computational Complexity …, 1998	126	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
Distributed quantum computing H Buhrman, H Röhrig International Symposium on Mathematical Foundations of Computer Science, 1-20, 2003	114	2003

Il sistema al momento non può eseguire l'operazione. Riprova più tardi.

Articoli 1–20

Citazioni per anno

Citazioni duplicate

Citazioni unite

Aggiungi coautoriCoautori

Segui

Citata da

Coautori