Search dblp for Publications

export results for "toc:db/journals/toc/toc6.bht:"

 download as .bib file

@article{DBLP:journals/toc/Ambainis10,
  author       = {Andris Ambainis},
  title        = {A New Quantum Lower Bound Method, with an Application to a Strong
                  Direct Product Theorem for Quantum Search},
  journal      = {Theory Comput.},
  volume       = {6},
  number       = {1},
  pages        = {1--25},
  year         = {2010},
  url          = {https://doi.org/10.4086/toc.2010.v006a001},
  doi          = {10.4086/TOC.2010.V006A001},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/Ambainis10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toc/BeameDPW10,
  author       = {Paul Beame and
                  Matei David and
                  Toniann Pitassi and
                  Philipp Woelfel},
  title        = {Separating Deterministic from Randomized Multiparty Communication
                  Complexity},
  journal      = {Theory Comput.},
  volume       = {6},
  number       = {1},
  pages        = {201--225},
  year         = {2010},
  url          = {https://doi.org/10.4086/toc.2010.v006a009},
  doi          = {10.4086/TOC.2010.V006A009},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/BeameDPW10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toc/Ben-AroyaST10,
  author       = {Avraham Ben{-}Aroya and
                  Oded Schwartz and
                  Amnon Ta{-}Shma},
  title        = {Quantum Expanders: Motivation and Construction},
  journal      = {Theory Comput.},
  volume       = {6},
  number       = {1},
  pages        = {47--79},
  year         = {2010},
  url          = {https://doi.org/10.4086/toc.2010.v006a003},
  doi          = {10.4086/TOC.2010.V006A003},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/Ben-AroyaST10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toc/BlumEL10,
  author       = {Avrim Blum and
                  Eyal Even{-}Dar and
                  Katrina Ligett},
  title        = {Routing Without Regret: On Convergence to Nash Equilibria of Regret-Minimizing
                  Algorithms in Routing Games},
  journal      = {Theory Comput.},
  volume       = {6},
  number       = {1},
  pages        = {179--199},
  year         = {2010},
  url          = {https://doi.org/10.4086/toc.2010.v006a008},
  doi          = {10.4086/TOC.2010.V006A008},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/BlumEL10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toc/DvirW10,
  author       = {Zeev Dvir and
                  Avi Wigderson},
  title        = {Monotone Expanders: Constructions and Applications},
  journal      = {Theory Comput.},
  volume       = {6},
  number       = {1},
  pages        = {291--308},
  year         = {2010},
  url          = {https://doi.org/10.4086/toc.2010.v006a012},
  doi          = {10.4086/TOC.2010.V006A012},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/DvirW10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toc/EnglertRW10,
  author       = {Matthias Englert and
                  Harald R{\"{a}}cke and
                  Matthias Westermann},
  title        = {Reordering Buffers for General Metric Spaces},
  journal      = {Theory Comput.},
  volume       = {6},
  number       = {1},
  pages        = {27--46},
  year         = {2010},
  url          = {https://doi.org/10.4086/toc.2010.v006a002},
  doi          = {10.4086/TOC.2010.V006A002},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/EnglertRW10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toc/FeigeV10,
  author       = {Uriel Feige and
                  Jan Vondr{\'{a}}k},
  title        = {The Submodular Welfare Problem with Demand Queries},
  journal      = {Theory Comput.},
  volume       = {6},
  number       = {1},
  pages        = {247--290},
  year         = {2010},
  url          = {https://doi.org/10.4086/toc.2010.v006a011},
  doi          = {10.4086/TOC.2010.V006A011},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/FeigeV10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toc/GavinskyS10,
  author       = {Dmitry Gavinsky and
                  Alexander A. Sherstov},
  title        = {A Separation of {NP} and coNP in Multiparty Communication Complexity},
  journal      = {Theory Comput.},
  volume       = {6},
  number       = {1},
  pages        = {227--245},
  year         = {2010},
  url          = {https://doi.org/10.4086/toc.2010.v006a010},
  doi          = {10.4086/TOC.2010.V006A010},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/GavinskyS10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toc/GoyalS10,
  author       = {Navin Goyal and
                  Michael E. Saks},
  title        = {Rounds vs. Queries Tradeoff in Noisy Computation},
  journal      = {Theory Comput.},
  volume       = {6},
  number       = {1},
  pages        = {113--134},
  year         = {2010},
  url          = {https://doi.org/10.4086/toc.2010.v006a006},
  doi          = {10.4086/TOC.2010.V006A006},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/GoyalS10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toc/Lee10,
  author       = {Homin K. Lee},
  title        = {Decision Trees and Influence: an Inductive Proof of the {OSSS} Inequality},
  journal      = {Theory Comput.},
  volume       = {6},
  number       = {1},
  pages        = {81--84},
  year         = {2010},
  url          = {https://doi.org/10.4086/toc.2010.v006a004},
  doi          = {10.4086/TOC.2010.V006A004},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/Lee10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toc/Marx10,
  author       = {D{\'{a}}niel Marx},
  title        = {Can You Beat Treewidth?},
  journal      = {Theory Comput.},
  volume       = {6},
  number       = {1},
  pages        = {85--112},
  year         = {2010},
  url          = {https://doi.org/10.4086/toc.2010.v006a005},
  doi          = {10.4086/TOC.2010.V006A005},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/Marx10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toc/Raz10,
  author       = {Ran Raz},
  title        = {Elusive Functions and Lower Bounds for Arithmetic Circuits},
  journal      = {Theory Comput.},
  volume       = {6},
  number       = {1},
  pages        = {135--177},
  year         = {2010},
  url          = {https://doi.org/10.4086/toc.2010.v006a007},
  doi          = {10.4086/TOC.2010.V006A007},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/Raz10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.