The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Robert Spalek" ( http://dblp.L3S.de/Authors/Robert_Spalek )

  Author page on DBLP  Author page in RDF  Community of Robert Spalek in ASPL-2

Publication years (Num. hits)
2002-2007 (16) 2008-2011 (7)
Publication types (Num. hits)
article(11) inproceedings(12)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 18 occurrences of 10 keywords

Results
Found 23 publication records. Showing 23 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Troy Lee, Rajat Mittal, Ben W. Reichardt, Robert Spalek, Mario Szegedy Quantum Query Complexity of State Conversion. Search on Bibsonomy FOCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Andris 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. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Andris Ambainis, Robert Spalek, Ronald de Wolf A New Quantum Lower Bound Method, with Applications to Direct Product Theorems and Time-Space Tradeoffs. Search on Bibsonomy Algorithmica The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Quantum lower bounds, Boolean functions, Quantum computing, Quantum algorithms, Time-space tradeoffs
1Robert Spalek A Dual Polynomial for OR Search on Bibsonomy CoRR The full citation details ... 2008 DBLP  BibTeX  RDF
1Robert Spalek The Multiplicative Quantum Adversary. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2008 DBLP  DOI  BibTeX  RDF quantum query lower bounds, quantum adversary method, multiplicative adversary, combinatorial matrices, direct product theorems
1Troy Lee, Adi Shraibman, Robert Spalek A Direct Product Theorem for Discrepancy. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2008 DBLP  DOI  BibTeX  RDF direct sum theorems, factorization norms, communication complexity, discrepancy, direct product theorems
1Ben Reichardt, Robert Spalek Span-program-based quantum algorithm for evaluating formulas. Search on Bibsonomy STOC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF balanced ternary majority formula, formula evaluation, gadget graphs, quantum adversary bound, quantum phase estimation, span programs, quantum computing, spectral analysis, quantum algorithms, quantum walks
1Hartmut Klauck, Robert Spalek, Ronald de Wolf Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Andris 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. Search on Bibsonomy FOCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Peter Høyer, Troy Lee, Robert Spalek Negative weights make adversaries stronger. Search on Bibsonomy STOC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF adversary method, certificate complexity barrier, formula size, quantum query complexity, lower bounds, quantum computing
1Robert Spalek, Mario Szegedy All Quantum Adversary Methods are Equivalent. Search on Bibsonomy Theory of Computing The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Harry Buhrman, Robert Spalek Quantum verification of matrix products. Search on Bibsonomy SODA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Andris Ambainis, Robert Spalek Quantum Algorithms for Matching and Network Flows. Search on Bibsonomy STACS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Andris Ambainis, Robert Spalek, Ronald de Wolf A new quantum lower bound method, : with applications to direct product theorems and time-space tradeoffs. Search on Bibsonomy STOC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF lower bounds, quantum computing, time-space tradeoffs, direct product theorems
1Peter Høyer, Robert Spalek Quantum Fan-out is Powerful. Search on Bibsonomy Theory of Computing The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Andris Ambainis, Robert Spalek, Ronald de Wolf A New Quantum Lower Bound Method, with Applications to Direct Product Theorems and Time-Space Tradeoffs Search on Bibsonomy CoRR The full citation details ... 2005 DBLP  BibTeX  RDF
1Peter Høyer, Robert Spalek Lower Bounds on Quantum Query Complexity. Search on Bibsonomy Bulletin of the EATCS The full citation details ... 2005 DBLP  BibTeX  RDF
1Robert Spalek, Mario Szegedy All Quantum Adversary Methods Are Equivalent. Search on Bibsonomy ICALP The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Hartmut Klauck, Robert Spalek, Ronald de Wolf Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2004 DBLP  BibTeX  RDF
1Hartmut Klauck, Robert Spalek, Ronald de Wolf Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs Search on Bibsonomy CoRR The full citation details ... 2004 DBLP  BibTeX  RDF
1Hartmut Klauck, Robert Spalek, Ronald de Wolf Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs. Search on Bibsonomy FOCS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Peter Høyer, Robert Spalek Quantum Circuits with Unbounded Fan-out. Search on Bibsonomy STACS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Peter Høyer, Robert Spalek Quantum Circuits with Unbounded Fan-out Search on Bibsonomy CoRR The full citation details ... 2002 DBLP  BibTeX  RDF
Displaying result #1 - #23 of 23 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.