default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheory of Computing, Volume 6
Volume 6, Number 1, 2010
- Andris Ambainis:
A New Quantum Lower Bound Method, with an Application to a Strong Direct Product Theorem for Quantum Search. 1-25 - Matthias Englert, Harald Räcke, Matthias Westermann:
Reordering Buffers for General Metric Spaces. 27-46 - Avraham Ben-Aroya, Oded Schwartz, Amnon Ta-Shma:
Quantum Expanders: Motivation and Construction. 47-79 - Homin K. Lee:
Decision Trees and Influence: an Inductive Proof of the OSSS Inequality. 81-84 - Dániel Marx:
Can You Beat Treewidth? 85-112 - Navin Goyal, Michael E. Saks:
Rounds vs. Queries Tradeoff in Noisy Computation. 113-134 - Ran Raz
:
Elusive Functions and Lower Bounds for Arithmetic Circuits. 135-177 - Avrim Blum, Eyal Even-Dar, Katrina Ligett:
Routing Without Regret: On Convergence to Nash Equilibria of Regret-Minimizing Algorithms in Routing Games. 179-199 - Paul Beame, Matei David, Toniann Pitassi, Philipp Woelfel:
Separating Deterministic from Randomized Multiparty Communication Complexity. 201-225 - Dmitry Gavinsky, Alexander A. Sherstov:
A Separation of NP and coNP in Multiparty Communication Complexity. 227-245 - Uriel Feige, Jan Vondrák:
The Submodular Welfare Problem with Demand Queries. 247-290 - Zeev Dvir, Avi Wigderson:
Monotone Expanders: Constructions and Applications. 291-308
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.
last updated on 2025-12-05 22:24 CET 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:
