Robert Spalek - RankMe

27 papers A* 8A 5Journal 14

Year	Rank	Type	Title / Venue / Authors
2013	J	`jnl`	Adversary Lower Bound for the Orthogonal Array Problem CoRR Robert Spalek
2013	A	`conf`	Adversary lower bound for the k-sum problem. ITCS Aleksandrs Belovs, Robert Spalek
2012	J	`jnl`	Adversary Lower Bound for the k-sum Problem CoRR Aleksandrs Belovs, Robert Spalek
2012	J	`jnl`	Span-Program-Based Quantum Algorithm for Evaluating Formulas. Theory Comput. Ben Reichardt, Robert Spalek
2011	A*	`conf`	Quantum Query Complexity of State Conversion. FOCS Troy Lee, Rajat Mittal, Ben W. Reichardt, Robert Spalek, Mario Szegedy
2010	J	`jnl`	Any AND-OR Formula of Size N Can Be Evaluated in Time N SIAM J. Comput. Andris Ambainis, Andrew M. Childs, Ben Reichardt, Robert Spalek, Shengyu Zhang
2009	J	`jnl`	A New Quantum Lower Bound Method, with Applications to Direct Product Theorems and Time-Space Tradeoffs. Algorithmica Andris Ambainis, Robert Spalek, Ronald de Wolf
2008	A	`conf`	A Direct Product Theorem for Discrepancy. CCC Troy Lee, Adi Shraibman, Robert Spalek
2008	J	`jnl`	A Dual Polynomial for OR CoRR Robert Spalek
2008	A*	`conf`	Span-program-based quantum algorithm for evaluating formulas. STOC Ben Reichardt, Robert Spalek
2008	A	`conf`	The Multiplicative Quantum Adversary. CCC Robert Spalek
2007	A*	`conf`	Any AND-OR Formula of Size N can be Evaluated in time N FOCS Andris Ambainis, Andrew M. Childs, Ben Reichardt, Robert Spalek, Shengyu Zhang
2007	A*	`conf`	Negative weights make adversaries stronger. STOC Peter Høyer, Troy Lee, Robert Spalek
2007	J	`jnl`	Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs. SIAM J. Comput. Hartmut Klauck, Robert Spalek, Ronald de Wolf
2006	A*	`conf`	A new quantum lower bound method, : with applications to direct product theorems and time-space tradeoffs. STOC Andris Ambainis, Robert Spalek, Ronald de Wolf
2006	J	`jnl`	All Quantum Adversary Methods are Equivalent. Theory Comput. Robert Spalek, Mario Szegedy
2006	A	`conf`	Quantum Algorithms for Matching and Network Flows. STACS Andris Ambainis, Robert Spalek
2006	A*	`conf`	Quantum verification of matrix products. SODA Harry Buhrman, Robert Spalek
2005	J	`jnl`	A New Quantum Lower Bound Method, with Applications to Direct Product Theorems and Time-Space Tradeoffs CoRR Andris Ambainis, Robert Spalek, Ronald de Wolf
2005	A*	`conf`	All Quantum Adversary Methods Are Equivalent. ICALP Robert Spalek, Mario Szegedy
2005	J	`jnl`	Lower Bounds on Quantum Query Complexity. Bull. EATCS Peter Høyer, Robert Spalek
2005	J	`jnl`	Quantum Fan-out is Powerful. Theory Comput. Peter Høyer, Robert Spalek
2004	J	`jnl`	Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs CoRR Hartmut Klauck, Robert Spalek, Ronald de Wolf
2004	J	`jnl`	Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs Electron. Colloquium Comput. Complex. Hartmut Klauck, Robert Spalek, Ronald de Wolf
2004	A*	`conf`	Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs. FOCS Hartmut Klauck, Robert Spalek, Ronald de Wolf
2003	A	`conf`	Quantum Circuits with Unbounded Fan-out. STACS Peter Høyer, Robert Spalek
2002	J	`jnl`	Quantum Circuits with Unbounded Fan-out CoRR Peter Høyer, Robert Spalek