Robert Špalek

Google (United States) — United States

Computer Science · Physical Sciences

20h-index1.5kcitations40works0.02yr avg
OpenAlex↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Quantum Computing Algorithms and Architecture(34), Quantum Information and Cryptography(27), Quantum-Dot Cellular Automata(9), Complexity and Algorithms in Graphs(8), Computability, Logic, AI Algorithms(6)

Publications40 total

Adversary Lower Bound for the Orthogonal Array Problem
arXiv (Cornell University)·2013· 4 citedOpen Access
Adversary lower bound for the k-sum problem
2013· 37 cited
Adversary Lower Bound for the k-sum Problem
arXiv (Cornell University)·2012· 7 citedOpen Access
Untitled
Theory of Computing·2012· 40 citedOpen Access
An adversary for algorithms
2010· 6 cited
Any AND-OR Formula of Size <i>N</i> Can Be Evaluated in Time $N^{1/2+o(1)}$ on a Quantum Computer
SIAM Journal on Computing·2010· 118 cited
The Multiplicative Quantum Adversary
2008· 23 cited
A Direct Product Theorem for Discrepancy
2008· 76 cited
Span-program-based quantum algorithm for evaluating formulas
2008· 99 cited
A Dual Polynomial for OR
arXiv (Cornell University)·2008· 24 citedOpen Access
Any AND-OR Formula of Size N can be Evaluated in time N^{1/2 + o(1)} on a Quantum Computer
Annual Symposium on Foundations of Computer Science·2007· 19 cited
Any AND-OR Formula of Size N can be Evaluated in time N^{1/2 + o(1)} on a Quantum Computer
2007· 131 citedOpen Access
A New Quantum Lower Bound Method, with Applications to Direct Product Theorems and Time-Space Tradeoffs
Algorithmica·2007· 36 cited
Negative weights make adversaries stronger
2007· 212 citedOpen Access
The Multiplicative Quantum Adversary
arXiv (Cornell University)·2007· 2 citedOpen Access
Every NAND formula on N variables can be evaluated in time O(N^{1/2+eps})
arXiv (Cornell University)·2007· 7 citedOpen Access
Every NAND formula of size N can be evaluated in time N^{1/2+o(1)} on a quantum computer
arXiv (Cornell University)·2007· 23 citedOpen Access
Quantum and Classical Strong Direct Product Theorems and Optimal Time‐Space Tradeoffs
SIAM Journal on Computing·2007· 93 cited
Quantum Algorithms, Lower Bounds, and Time-Space Tradeoffs
CWI's Institutional Repository (Centrum Wiskunde & Informatica)·2006· 4 citedOpen Access
A new quantum lower bound method,
2006· 8 cited
page 1 of 2Next →

Frequent Co-authors

Peter Høyer(9), Andris Ambainis(9), Ben W. Reichardt(7), Ronald de Wolf(6), Andrew M. Childs(5), Troy Lee(3), Shengyu Zhang(3), Márió Szegedy(3), Hartmut Klauck(3), Harry Buhrman(2), Aleksandrs Belovs(2), Ben W. Reichardt(1), S. Zhang(1), Troy Lee(1), Adi Shraibman(1), Shengyu Zhang(1), Rajat Mittal(1), Ruben Wolf(1)