Robert Špalek - Concepedia

Author

Robert Špalek

University of California, Berkeley

Also Known As

Lee, Troy, R. Spalek, R. Špalek, Robert Spalek, Robert Špalek, Robert ˇ Spalek, Spalek, Robert

Publications

1.5K

Citations

H-Index

Concepts

All Affiliations

University of California, Berkeley California Institute of Technology University of Latvia Centrum Wiskunde & Informatica University of Waterloo

RŠ

About

Robert Špalek is an author at University of California, Berkeley specializing in engineering, quantum computing, and computational complexity.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	14	14	819
2	Computer Science	11	11	723
3	Physics	4	4	291
4	Natural Sciences	1	1	23
5	Combinatorial Optimization	1	1	37

Robert Špalek

Publications

1.2K

Citations

H-Index

Page 1

	Year	Citations
Negative weights make adversaries stronger Troy Lee, Robert Špalek	2007	212
Any AND-OR Formula of Size N can be Evaluated in time N^{1/2 + o(1)} on a Quantum Computer Andris Ambainis, Andrew M. Childs, Ben W. Reichardt, Computational Complexity TheoryEngineeringComputational ComplexityTime N^Size N	2007	131
Any AND-OR Formula of Size <i>N</i> Can Be Evaluated in Time $N^{1/2+o(1)}$ on a Quantum Computer Andris Ambainis, Andrew M. Childs, Ben W. Reichardt, SIAM Journal on Computing Quantum ScienceWeighted TreeEngineeringQuantum ComputingPhysics	2010	118
Span-program-based quantum algorithm for evaluating formulas Ben W. Reichardt, Robert Špalek Quantum ScienceQuantum LogicEngineeringQuantum ComputingExtended Gate	2008	99
Quantum and Classical Strong Direct Product Theorems and Optimal Time‐Space Tradeoffs Hartmut Klauck, Robert Špalek, Ronald de Wolf SIAM Journal on Computing EngineeringComputational ComplexityCommunication ComplexityQuantum ComputingQuantum Optimization Algorithm	2007	93
Quantum verification of matrix products Harry Buhrman, Robert Špalek Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 Quantum ScienceQuantum VerificationQuantum ComputingEngineeringQuantum Optimization Algorithm	2006	93
A Direct Product Theorem for Discrepancy Troy Lee, Adi Shraibman, Robert Špalek Theory Of ComputingComputational Complexity TheoryEngineeringLower BoundDiscrepancy Method	2008	76
Quantum Fanout is Powerful Peter Høyer, Robert Špalek CWI's Institutional Repository (Centrum Wiskunde & Informatica)	2005	55
Lower Bounds on Quantum Query Complexity Peter Høyer, Robert Špalek Data Archiving and Networked Services (DANS)	2005	49
Adversary lower bound for the k-sum problem Aleksandrs Belovs, Robert Špalek Adversary Lower BoundK NumbersEngineeringQuantum ComputingPrescribed Number	2013	37

Page 1