Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/toc/AaronsonBDFS09,
  author       = {Scott Aaronson and
                  Salman Beigi and
                  Andrew Drucker and
                  Bill Fefferman and
                  Peter W. Shor},
  title        = {The Power of Unentanglement},
  journal      = {Theory Comput.},
  volume       = {5},
  number       = {1},
  pages        = {1--42},
  year         = {2009},
  url          = {https://doi.org/10.4086/toc.2009.v005a001},
  doi          = {10.4086/TOC.2009.V005A001},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/AaronsonBDFS09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toc/Ben-SassonV09,
  author       = {Eli Ben{-}Sasson and
                  Michael Viderman},
  title        = {Tensor Products of Weakly Smooth Codes are Robust},
  journal      = {Theory Comput.},
  volume       = {5},
  number       = {1},
  pages        = {239--255},
  year         = {2009},
  url          = {https://doi.org/10.4086/toc.2009.v005a012},
  doi          = {10.4086/TOC.2009.V005A012},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/Ben-SassonV09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toc/ChildsCJY09,
  author       = {Andrew M. Childs and
                  Richard Cleve and
                  Stephen P. Jordan and
                  David L. Yonge{-}Mallo},
  title        = {Discrete-Query Quantum Algorithm for {NAND} Trees},
  journal      = {Theory Comput.},
  volume       = {5},
  number       = {1},
  pages        = {119--123},
  year         = {2009},
  url          = {https://doi.org/10.4086/toc.2009.v005a005},
  doi          = {10.4086/TOC.2009.V005A005},
  timestamp    = {Tue, 21 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/toc/ChildsCJY09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toc/Dachman-SoledLMSWW09,
  author       = {Dana Dachman{-}Soled and
                  Homin K. Lee and
                  Tal Malkin and
                  Rocco A. Servedio and
                  Andrew Wan and
                  Hoeteck Wee},
  title        = {Optimal Cryptographic Hardness of Learning Monotone Functions},
  journal      = {Theory Comput.},
  volume       = {5},
  number       = {1},
  pages        = {257--282},
  year         = {2009},
  url          = {https://doi.org/10.4086/toc.2009.v005a013},
  doi          = {10.4086/TOC.2009.V005A013},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/Dachman-SoledLMSWW09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toc/Fortnow09,
  author       = {Lance Fortnow},
  title        = {A Simple Proof of Toda's Theorem},
  journal      = {Theory Comput.},
  volume       = {5},
  number       = {1},
  pages        = {135--140},
  year         = {2009},
  url          = {https://doi.org/10.4086/toc.2009.v005a007},
  doi          = {10.4086/TOC.2009.V005A007},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/Fortnow09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toc/GlasnerS09,
  author       = {Dana Glasner and
                  Rocco A. Servedio},
  title        = {Distribution-Free Testing Lower Bound for Basic Boolean Functions},
  journal      = {Theory Comput.},
  volume       = {5},
  number       = {1},
  pages        = {191--216},
  year         = {2009},
  url          = {https://doi.org/10.4086/toc.2009.v005a010},
  doi          = {10.4086/TOC.2009.V005A010},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/GlasnerS09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toc/Holenstein09,
  author       = {Thomas Holenstein},
  title        = {Parallel Repetition: Simplification and the No-Signaling Case},
  journal      = {Theory Comput.},
  volume       = {5},
  number       = {1},
  pages        = {141--172},
  year         = {2009},
  url          = {https://doi.org/10.4086/toc.2009.v005a008},
  doi          = {10.4086/TOC.2009.V005A008},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/Holenstein09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toc/KhotO09,
  author       = {Subhash Khot and
                  Ryan O'Donnell},
  title        = {{SDP} Gaps and UGC-hardness for Max-Cut-Gain},
  journal      = {Theory Comput.},
  volume       = {5},
  number       = {1},
  pages        = {83--117},
  year         = {2009},
  url          = {https://doi.org/10.4086/toc.2009.v005a004},
  doi          = {10.4086/TOC.2009.V005A004},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/KhotO09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toc/Lovett09,
  author       = {Shachar Lovett},
  title        = {Unconditional Pseudorandom Generators for Low Degree Polynomials},
  journal      = {Theory Comput.},
  volume       = {5},
  number       = {1},
  pages        = {69--82},
  year         = {2009},
  url          = {https://doi.org/10.4086/toc.2009.v005a003},
  doi          = {10.4086/TOC.2009.V005A003},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/Lovett09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toc/MoranNS09,
  author       = {Tal Moran and
                  Moni Naor and
                  Gil Segev},
  title        = {Deterministic History-Independent Strategies for Storing Information
                  on Write-Once Memories},
  journal      = {Theory Comput.},
  volume       = {5},
  number       = {1},
  pages        = {43--67},
  year         = {2009},
  url          = {https://doi.org/10.4086/toc.2009.v005a002},
  doi          = {10.4086/TOC.2009.V005A002},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/MoranNS09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toc/NewmanR09,
  author       = {Ilan Newman and
                  Yuri Rabinovich},
  title        = {Hard Metrics from Cayley Graphs of Abelian Groups},
  journal      = {Theory Comput.},
  volume       = {5},
  number       = {1},
  pages        = {125--134},
  year         = {2009},
  url          = {https://doi.org/10.4086/toc.2009.v005a006},
  doi          = {10.4086/TOC.2009.V005A006},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/NewmanR09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toc/VassilevskaWY09,
  author       = {Virginia Vassilevska and
                  Ryan Williams and
                  Raphael Yuster},
  title        = {All Pairs Bottleneck Paths and Max-Min Matrix Products in Truly Subcubic
                  Time},
  journal      = {Theory Comput.},
  volume       = {5},
  number       = {1},
  pages        = {173--189},
  year         = {2009},
  url          = {https://doi.org/10.4086/toc.2009.v005a009},
  doi          = {10.4086/TOC.2009.V005A009},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/VassilevskaWY09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toc/Watrous09,
  author       = {John Watrous},
  title        = {Semidefinite Programs for Completely Bounded Norms},
  journal      = {Theory Comput.},
  volume       = {5},
  number       = {1},
  pages        = {217--238},
  year         = {2009},
  url          = {https://doi.org/10.4086/toc.2009.v005a011},
  doi          = {10.4086/TOC.2009.V005A011},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/Watrous09.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.