Search dblp for Publications

export results for "toc:db/journals/toct/toct6.bht:"

 download as .bib file

@article{DBLP:journals/toct/0001GR14,
  author       = {Andreas G{\"{o}}bel and
                  Leslie Ann Goldberg and
                  David Richerby},
  title        = {The complexity of counting homomorphisms to cactus graphs modulo 2},
  journal      = {{ACM} Trans. Comput. Theory},
  volume       = {6},
  number       = {4},
  pages        = {17:1--17:29},
  year         = {2014},
  url          = {https://doi.org/10.1145/2635825},
  doi          = {10.1145/2635825},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toct/0001GR14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toct/AdaCCFKP14,
  author       = {Anil Ada and
                  Arkadev Chattopadhyay and
                  Stephen A. Cook and
                  Lila Fontes and
                  Michal Kouck{\'{y}} and
                  Toniann Pitassi},
  title        = {The Hardness of Being Private},
  journal      = {{ACM} Trans. Comput. Theory},
  volume       = {6},
  number       = {1},
  pages        = {1:1--1:24},
  year         = {2014},
  url          = {https://doi.org/10.1145/2567671},
  doi          = {10.1145/2567671},
  timestamp    = {Thu, 02 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toct/AdaCCFKP14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toct/AllenderG14,
  author       = {Eric Allender and
                  Shafi Goldwasser},
  title        = {Introduction to the Special Issue on Innovations in Theoretical Computer
                  Science 2012 - Part {II}},
  journal      = {{ACM} Trans. Comput. Theory},
  volume       = {6},
  number       = {3},
  pages        = {10:1},
  year         = {2014},
  url          = {https://doi.org/10.1145/2638595},
  doi          = {10.1145/2638595},
  timestamp    = {Fri, 09 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toct/AllenderG14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toct/AustrinOTW14,
  author       = {Per Austrin and
                  Ryan O'Donnell and
                  Li{-}Yang Tan and
                  John Wright},
  title        = {New NP-Hardness Results for 3-Coloring and 2-to-1 Label Cover},
  journal      = {{ACM} Trans. Comput. Theory},
  volume       = {6},
  number       = {1},
  pages        = {2:1--2:20},
  year         = {2014},
  url          = {https://doi.org/10.1145/2537800},
  doi          = {10.1145/2537800},
  timestamp    = {Mon, 08 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toct/AustrinOTW14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toct/BrakerskiGV14,
  author       = {Zvika Brakerski and
                  Craig Gentry and
                  Vinod Vaikuntanathan},
  title        = {(Leveled) Fully Homomorphic Encryption without Bootstrapping},
  journal      = {{ACM} Trans. Comput. Theory},
  volume       = {6},
  number       = {3},
  pages        = {13:1--13:36},
  year         = {2014},
  url          = {https://doi.org/10.1145/2633600},
  doi          = {10.1145/2633600},
  timestamp    = {Mon, 08 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toct/BrakerskiGV14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toct/ChenFM14,
  author       = {Yijia Chen and
                  J{\"{o}}rg Flum and
                  Moritz M{\"{u}}ller},
  title        = {Hard Instances of Algorithms and Proof Systems},
  journal      = {{ACM} Trans. Comput. Theory},
  volume       = {6},
  number       = {2},
  pages        = {7:1--7:25},
  year         = {2014},
  url          = {https://doi.org/10.1145/2601336},
  doi          = {10.1145/2601336},
  timestamp    = {Mon, 08 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toct/ChenFM14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toct/CookEMT14,
  author       = {James Cook and
                  Omid Etesami and
                  Rachel Miller and
                  Luca Trevisan},
  title        = {On the One-Way Function Candidate Proposed by Goldreich},
  journal      = {{ACM} Trans. Comput. Theory},
  volume       = {6},
  number       = {3},
  pages        = {14:1--14:35},
  year         = {2014},
  url          = {https://doi.org/10.1145/2633602},
  doi          = {10.1145/2633602},
  timestamp    = {Mon, 08 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toct/CookEMT14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toct/CookFL14,
  author       = {Stephen A. Cook and
                  Yuval Filmus and
                  Dai Tri Man Le},
  title        = {The complexity of the comparator circuit value problem},
  journal      = {{ACM} Trans. Comput. Theory},
  volume       = {6},
  number       = {4},
  pages        = {15:1--15:44},
  year         = {2014},
  url          = {https://doi.org/10.1145/2635822},
  doi          = {10.1145/2635822},
  timestamp    = {Mon, 08 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toct/CookFL14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toct/CyganKPPW14,
  author       = {Marek Cygan and
                  Stefan Kratsch and
                  Marcin Pilipczuk and
                  Michal Pilipczuk and
                  Magnus Wahlstr{\"{o}}m},
  title        = {Clique Cover and Graph Separation: New Incompressibility Results},
  journal      = {{ACM} Trans. Comput. Theory},
  volume       = {6},
  number       = {2},
  pages        = {6:1--6:19},
  year         = {2014},
  url          = {https://doi.org/10.1145/2594439},
  doi          = {10.1145/2594439},
  timestamp    = {Sun, 25 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toct/CyganKPPW14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toct/EtessamiSY14,
  author       = {Kousha Etessami and
                  Alistair Stewart and
                  Mihalis Yannakakis},
  title        = {A Note on the Complexity of Comparing Succinctly Represented Integers,
                  with an Application to Maximum Probability Parsing},
  journal      = {{ACM} Trans. Comput. Theory},
  volume       = {6},
  number       = {2},
  pages        = {9:1--9:23},
  year         = {2014},
  url          = {https://doi.org/10.1145/2601327},
  doi          = {10.1145/2601327},
  timestamp    = {Mon, 08 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toct/EtessamiSY14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toct/FellowsJ14,
  author       = {Michael R. Fellows and
                  Bart M. P. Jansen},
  title        = {{FPT} is characterized by useful obstruction sets: Connecting algorithms,
                  kernels, and quasi-orders},
  journal      = {{ACM} Trans. Comput. Theory},
  volume       = {6},
  number       = {4},
  pages        = {16:1--16:26},
  year         = {2014},
  url          = {https://doi.org/10.1145/2635820},
  doi          = {10.1145/2635820},
  timestamp    = {Mon, 08 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toct/FellowsJ14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toct/GlasserHPT14,
  author       = {Christian Gla{\ss}er and
                  John M. Hitchcock and
                  Aduri Pavan and
                  Stephen D. Travers},
  title        = {Unions of Disjoint NP-Complete Sets},
  journal      = {{ACM} Trans. Comput. Theory},
  volume       = {6},
  number       = {1},
  pages        = {3:1--3:10},
  year         = {2014},
  url          = {https://doi.org/10.1145/2591508},
  doi          = {10.1145/2591508},
  timestamp    = {Tue, 07 May 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toct/GlasserHPT14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toct/GoldbergJ14,
  author       = {Leslie Ann Goldberg and
                  Mark Jerrum},
  title        = {The Complexity of Approximately Counting Tree Homomorphisms},
  journal      = {{ACM} Trans. Comput. Theory},
  volume       = {6},
  number       = {2},
  pages        = {8:1--8:31},
  year         = {2014},
  url          = {https://doi.org/10.1145/2600917},
  doi          = {10.1145/2600917},
  timestamp    = {Mon, 08 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toct/GoldbergJ14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toct/KanadeS14,
  author       = {Varun Kanade and
                  Thomas Steinke},
  title        = {Learning Hurdles for Sleeping Experts},
  journal      = {{ACM} Trans. Comput. Theory},
  volume       = {6},
  number       = {3},
  pages        = {11:1--11:16},
  year         = {2014},
  url          = {https://doi.org/10.1145/2505983},
  doi          = {10.1145/2505983},
  timestamp    = {Sun, 14 Mar 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/toct/KanadeS14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toct/ODonnellWZ14,
  author       = {Ryan O'Donnell and
                  Yi Wu and
                  Yuan Zhou},
  title        = {Optimal Lower Bounds for Locality-Sensitive Hashing (Except When q
                  is Tiny)},
  journal      = {{ACM} Trans. Comput. Theory},
  volume       = {6},
  number       = {1},
  pages        = {5:1--5:13},
  year         = {2014},
  url          = {https://doi.org/10.1145/2578221},
  doi          = {10.1145/2578221},
  timestamp    = {Mon, 08 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toct/ODonnellWZ14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toct/SunZ14,
  author       = {Shu{-}Ming Sun and
                  Ning Zhong},
  title        = {On Effective Convergence of Numerical Solutions for Differential Equations},
  journal      = {{ACM} Trans. Comput. Theory},
  volume       = {6},
  number       = {1},
  pages        = {4:1--4:25},
  year         = {2014},
  url          = {https://doi.org/10.1145/2578219},
  doi          = {10.1145/2578219},
  timestamp    = {Mon, 08 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toct/SunZ14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toct/Valiant14,
  author       = {Paul Valiant},
  title        = {Evolvability of Real Functions},
  journal      = {{ACM} Trans. Comput. Theory},
  volume       = {6},
  number       = {3},
  pages        = {12:1--12:19},
  year         = {2014},
  url          = {https://doi.org/10.1145/2633598},
  doi          = {10.1145/2633598},
  timestamp    = {Mon, 08 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toct/Valiant14.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.