Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/toc/AaronsonA14,
  author       = {Scott Aaronson and
                  Andris Ambainis},
  title        = {The Need for Structure in Quantum Speedups},
  journal      = {Theory Comput.},
  volume       = {10},
  pages        = {133--166},
  year         = {2014},
  url          = {https://doi.org/10.4086/toc.2014.v010a006},
  doi          = {10.4086/TOC.2014.V010A006},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/AaronsonA14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toc/AllenderCLPT14,
  author       = {Eric Allender and
                  Shiteng Chen and
                  Tiancheng Lou and
                  Periklis A. Papakonstantinou and
                  Bangsheng Tang},
  title        = {Width-Parametrized {SAT:} Time--Space Tradeoffs},
  journal      = {Theory Comput.},
  volume       = {10},
  pages        = {297--339},
  year         = {2014},
  url          = {https://doi.org/10.4086/toc.2014.v010a012},
  doi          = {10.4086/TOC.2014.V010A012},
  timestamp    = {Fri, 09 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/AllenderCLPT14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toc/AllenderL14,
  author       = {Eric Allender and
                  Klaus{-}J{\"{o}}rn Lange},
  title        = {Symmetry Coincides with Nondeterminism for Time-Bounded Auxiliary
                  Pushdown Automata},
  journal      = {Theory Comput.},
  volume       = {10},
  pages        = {199--215},
  year         = {2014},
  url          = {https://doi.org/10.4086/toc.2014.v010a008},
  doi          = {10.4086/TOC.2014.V010A008},
  timestamp    = {Fri, 09 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/AllenderL14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toc/BrietFV14,
  author       = {Jop Bri{\"{e}}t and
                  Fernando M{\'{a}}rio de Oliveira Filho and
                  Frank Vallentin},
  title        = {Grothendieck Inequalities for Semidefinite Programs with Rank Constraint},
  journal      = {Theory Comput.},
  volume       = {10},
  pages        = {77--105},
  year         = {2014},
  url          = {https://doi.org/10.4086/toc.2014.v010a004},
  doi          = {10.4086/TOC.2014.V010A004},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/BrietFV14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toc/BrunschGRR14,
  author       = {Tobias Brunsch and
                  Navin Goyal and
                  Luis Rademacher and
                  Heiko R{\"{o}}glin},
  title        = {Lower Bounds for the Average and Smoothed Number of Pareto-Optima},
  journal      = {Theory Comput.},
  volume       = {10},
  pages        = {237--256},
  year         = {2014},
  url          = {https://doi.org/10.4086/toc.2014.v010a010},
  doi          = {10.4086/TOC.2014.V010A010},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/BrunschGRR14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toc/CaiG14,
  author       = {Jin{-}Yi Cai and
                  Aaron Gorenstein},
  title        = {Matchgates Revisited},
  journal      = {Theory Comput.},
  volume       = {10},
  pages        = {167--197},
  year         = {2014},
  url          = {https://doi.org/10.4086/toc.2014.v010a007},
  doi          = {10.4086/TOC.2014.V010A007},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/CaiG14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toc/ChakrabartyS14,
  author       = {Deeparnab Chakrabarty and
                  C. Seshadhri},
  title        = {An Optimal Lower Bound for Monotonicity Testing over Hypergrids},
  journal      = {Theory Comput.},
  volume       = {10},
  pages        = {453--464},
  year         = {2014},
  url          = {https://doi.org/10.4086/toc.2014.v010a017},
  doi          = {10.4086/TOC.2014.V010A017},
  timestamp    = {Thu, 07 Jul 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/ChakrabartyS14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toc/ChakrabortyFM14,
  author       = {Sourav Chakraborty and
                  Eldar Fischer and
                  Arie Matsliah},
  title        = {Query Complexity Lower Bounds for Reconstruction of Codes},
  journal      = {Theory Comput.},
  volume       = {10},
  pages        = {515--533},
  year         = {2014},
  url          = {https://doi.org/10.4086/toc.2014.v010a019},
  doi          = {10.4086/TOC.2014.V010A019},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/ChakrabortyFM14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toc/ChanP14,
  author       = {Siu Man Chan and
                  Aaron Potechin},
  title        = {Tight Bounds for Monotone Switching Networks via Fourier Analysis},
  journal      = {Theory Comput.},
  volume       = {10},
  pages        = {389--419},
  year         = {2014},
  url          = {https://doi.org/10.4086/toc.2014.v010a015},
  doi          = {10.4086/TOC.2014.V010A015},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/ChanP14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toc/Chazelle14,
  author       = {Bernard Chazelle},
  title        = {How Many Bits Can a Flock of Birds Compute?},
  journal      = {Theory Comput.},
  volume       = {10},
  pages        = {421--451},
  year         = {2014},
  url          = {https://doi.org/10.4086/toc.2014.v010a016},
  doi          = {10.4086/TOC.2014.V010A016},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/Chazelle14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toc/DaskalakisDS14,
  author       = {Constantinos Daskalakis and
                  Ilias Diakonikolas and
                  Rocco A. Servedio},
  title        = {Learning \emph{k}-Modal Distributions via Testing},
  journal      = {Theory Comput.},
  volume       = {10},
  pages        = {535--570},
  year         = {2014},
  url          = {https://doi.org/10.4086/toc.2014.v010a020},
  doi          = {10.4086/TOC.2014.V010A020},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/DaskalakisDS14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toc/DiakonikolasSTW14,
  author       = {Ilias Diakonikolas and
                  Rocco A. Servedio and
                  Li{-}Yang Tan and
                  Andrew Wan},
  title        = {A Regularity Lemma and Low-Weight Approximators for Low-Degree Polynomial
                  Threshold Functions},
  journal      = {Theory Comput.},
  volume       = {10},
  pages        = {27--53},
  year         = {2014},
  url          = {https://doi.org/10.4086/toc.2014.v010a002},
  doi          = {10.4086/TOC.2014.V010A002},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/DiakonikolasSTW14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toc/HarrowKS14,
  author       = {Aram W. Harrow and
                  Alexandra Kolla and
                  Leonard J. Schulman},
  title        = {Dimension-Free L\({}_{\mbox{2}}\) Maximal Inequality for Spherical
                  Means in the Hypercube},
  journal      = {Theory Comput.},
  volume       = {10},
  pages        = {55--75},
  year         = {2014},
  url          = {https://doi.org/10.4086/toc.2014.v010a003},
  doi          = {10.4086/TOC.2014.V010A003},
  timestamp    = {Tue, 21 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/toc/HarrowKS14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toc/HarshaKM14,
  author       = {Prahladh Harsha and
                  Adam R. Klivans and
                  Raghu Meka},
  title        = {Bounding the Sensitivity of Polynomial Threshold Functions},
  journal      = {Theory Comput.},
  volume       = {10},
  pages        = {1--26},
  year         = {2014},
  url          = {https://doi.org/10.4086/toc.2014.v010a001},
  doi          = {10.4086/TOC.2014.V010A001},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/HarshaKM14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toc/Huang14,
  author       = {Sangxia Huang},
  title        = {Approximation Resistance on Satisfiable Instances for Sparse Predicates},
  journal      = {Theory Comput.},
  volume       = {10},
  pages        = {359--388},
  year         = {2014},
  url          = {https://doi.org/10.4086/toc.2014.v010a014},
  doi          = {10.4086/TOC.2014.V010A014},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/Huang14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toc/KolR14,
  author       = {Gillat Kol and
                  Ran Raz},
  title        = {Competing-Provers Protocols for Circuit Evaluation},
  journal      = {Theory Comput.},
  volume       = {10},
  pages        = {107--131},
  year         = {2014},
  url          = {https://doi.org/10.4086/toc.2014.v010a005},
  doi          = {10.4086/TOC.2014.V010A005},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/KolR14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toc/Lampis14,
  author       = {Michael Lampis},
  title        = {Improved Inapproximability for {TSP}},
  journal      = {Theory Comput.},
  volume       = {10},
  pages        = {217--236},
  year         = {2014},
  url          = {https://doi.org/10.4086/toc.2014.v010a009},
  doi          = {10.4086/TOC.2014.V010A009},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/Lampis14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toc/MakarychevM14,
  author       = {Konstantin Makarychev and
                  Yury Makarychev},
  title        = {Approximation Algorithm for Non-Boolean Max-\emph{k}-CSP},
  journal      = {Theory Comput.},
  volume       = {10},
  pages        = {341--358},
  year         = {2014},
  url          = {https://doi.org/10.4086/toc.2014.v010a013},
  doi          = {10.4086/TOC.2014.V010A013},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/MakarychevM14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toc/NaorRV14,
  author       = {Assaf Naor and
                  Oded Regev and
                  Thomas Vidick},
  title        = {Efficient Rounding for the Noncommutative Grothendieck Inequality},
  journal      = {Theory Comput.},
  volume       = {10},
  pages        = {257--295},
  year         = {2014},
  url          = {https://doi.org/10.4086/toc.2014.v010a011},
  doi          = {10.4086/TOC.2014.V010A011},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/NaorRV14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toc/ShpilkaV14,
  author       = {Amir Shpilka and
                  Ilya Volkovich},
  title        = {On Reconstruction and Testing of Read-Once Formulas},
  journal      = {Theory Comput.},
  volume       = {10},
  pages        = {465--514},
  year         = {2014},
  url          = {https://doi.org/10.4086/toc.2014.v010a018},
  doi          = {10.4086/TOC.2014.V010A018},
  timestamp    = {Mon, 26 Jun 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/ShpilkaV14.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.