default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRobert Spalek
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
[c13]Aleksandrs Belovs, Robert Spalek:
Adversary lower bound for the k-sum problem. ITCS 2013: 323-328- [i7]Robert Spalek:
Adversary Lower Bound for the Orthogonal Array Problem. CoRR abs/1304.0845 (2013) - 2012
- [j7]Ben Reichardt, Robert Spalek:
Span-Program-Based Quantum Algorithm for Evaluating Formulas. Theory Comput. 8(1): 291-319 (2012) - [i6]Aleksandrs Belovs, Robert Spalek:
Adversary Lower Bound for the k-sum Problem. CoRR abs/1206.6528 (2012) - 2011
- [c12]Troy Lee, Rajat Mittal, Ben W. Reichardt, Robert Spalek, Mario Szegedy:
Quantum Query Complexity of State Conversion. FOCS 2011: 344-353 - 2010
- [j6]Andris Ambainis, Andrew M. Childs
, Ben Reichardt, Robert Spalek, Shengyu Zhang:
Any AND-OR Formula of Size N Can Be Evaluated in Time N1/2+o(1) on a Quantum Computer. SIAM J. Comput. 39(6): 2513-2530 (2010)
2000 – 2009
- 2009
- [j5]Andris Ambainis, Robert Spalek, Ronald de Wolf:
A New Quantum Lower Bound Method, with Applications to Direct Product Theorems and Time-Space Tradeoffs. Algorithmica 55(3): 422-461 (2009) - 2008
- [c11]Troy Lee, Adi Shraibman, Robert Spalek:
A Direct Product Theorem for Discrepancy. CCC 2008: 71-80 - [c10]Robert Spalek:
The Multiplicative Quantum Adversary. CCC 2008: 237-248 - [c9]Ben Reichardt, Robert Spalek:
Span-program-based quantum algorithm for evaluating formulas. STOC 2008: 103-112 - [i5]Robert Spalek:
A Dual Polynomial for OR. CoRR abs/0803.4516 (2008) - 2007
- [j4]Hartmut Klauck, Robert Spalek, Ronald de Wolf:
Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs. SIAM J. Comput. 36(5): 1472-1493 (2007) - [c8]Andris Ambainis, Andrew M. Childs, Ben Reichardt, Robert Spalek, Shengyu Zhang:
Any AND-OR Formula of Size N can be Evaluated in time N1/2+o(1) on a Quantum Computer. FOCS 2007: 363-372 - [c7]Peter Høyer, Troy Lee, Robert Spalek:
Negative weights make adversaries stronger. STOC 2007: 526-535 - 2006
- [j3]Robert Spalek, Mario Szegedy:
All Quantum Adversary Methods are Equivalent. Theory Comput. 2(1): 1-18 (2006) - [c6]Harry Buhrman, Robert Spalek:
Quantum verification of matrix products. SODA 2006: 880-889 - [c5]Andris Ambainis, Robert Spalek:
Quantum Algorithms for Matching and Network Flows. STACS 2006: 172-183 - [c4]Andris Ambainis, Robert Spalek, Ronald de Wolf:
A new quantum lower bound method, : with applications to direct product theorems and time-space tradeoffs. STOC 2006: 618-633 - 2005
- [j2]Peter Høyer, Robert Spalek:
Lower Bounds on Quantum Query Complexity. Bull. EATCS 87: 78-103 (2005) - [j1]Peter Høyer, Robert Spalek:
Quantum Fan-out is Powerful. Theory Comput. 1(1): 81-103 (2005) - [c3]Robert Spalek, Mario Szegedy:
All Quantum Adversary Methods Are Equivalent. ICALP 2005: 1299-1311 - [i4]Andris Ambainis, Robert Spalek, Ronald de Wolf:
A New Quantum Lower Bound Method, with Applications to Direct Product Theorems and Time-Space Tradeoffs. CoRR abs/quant-ph/0511200 (2005) - 2004
- [c2]Hartmut Klauck, Robert Spalek, Ronald de Wolf:
Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs. FOCS 2004: 12-21 - [i3]Hartmut Klauck, Robert Spalek, Ronald de Wolf:
Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs. CoRR quant-ph/0402123 (2004) - [i2]Hartmut Klauck, Robert Spalek, Ronald de Wolf:
Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [c1]Peter Høyer, Robert Spalek:
Quantum Circuits with Unbounded Fan-out. STACS 2003: 234-246 - 2002
- [i1]Peter Høyer, Robert Spalek:
Quantum Circuits with Unbounded Fan-out. CoRR quant-ph/0208043 (2002)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:05 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
