Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/toct/BeameIPS10,
  author       = {Paul Beame and
                  Russell Impagliazzo and
                  Toniann Pitassi and
                  Nathan Segerlind},
  title        = {Formula Caching in {DPLL}},
  journal      = {{ACM} Trans. Comput. Theory},
  volume       = {1},
  number       = {3},
  pages        = {9:1--9:33},
  year         = {2010},
  url          = {https://doi.org/10.1145/1714450.1714452},
  doi          = {10.1145/1714450.1714452},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toct/BeameIPS10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toct/DattaKLM10,
  author       = {Samir Datta and
                  Raghav Kulkarni and
                  Nutan Limaye and
                  Meena Mahajan},
  title        = {Planarity, Determinants, Permanents, and (Unique) Matchings},
  journal      = {{ACM} Trans. Comput. Theory},
  volume       = {1},
  number       = {3},
  pages        = {10:1--10:20},
  year         = {2010},
  url          = {https://doi.org/10.1145/1714450.1714453},
  doi          = {10.1145/1714450.1714453},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toct/DattaKLM10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toct/KynclV10,
  author       = {Jan Kyncl and
                  Tom{\'{a}}s Vyskocil},
  title        = {Logspace Reduction of Directed Reachability for Bounded Genus Graphs
                  to the Planar Case},
  journal      = {{ACM} Trans. Comput. Theory},
  volume       = {1},
  number       = {3},
  pages        = {8:1--8:11},
  year         = {2010},
  url          = {https://doi.org/10.1145/1714450.1714451},
  doi          = {10.1145/1714450.1714451},
  timestamp    = {Mon, 08 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toct/KynclV10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toct/AaronsonW09,
  author       = {Scott Aaronson and
                  Avi Wigderson},
  title        = {Algebrization: {A} New Barrier in Complexity Theory},
  journal      = {{ACM} Trans. Comput. Theory},
  volume       = {1},
  number       = {1},
  pages        = {2:1--2:54},
  year         = {2009},
  url          = {https://doi.org/10.1145/1490270.1490272},
  doi          = {10.1145/1490270.1490272},
  timestamp    = {Mon, 08 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toct/AaronsonW09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toct/Ben-SassonHLM09,
  author       = {Eli Ben{-}Sasson and
                  Prahladh Harsha and
                  Oded Lachish and
                  Arie Matsliah},
  title        = {Sound 3-Query PCPPs Are Long},
  journal      = {{ACM} Trans. Comput. Theory},
  volume       = {1},
  number       = {2},
  pages        = {7:1--7:49},
  year         = {2009},
  url          = {https://doi.org/10.1145/1595391.1595394},
  doi          = {10.1145/1595391.1595394},
  timestamp    = {Mon, 08 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toct/Ben-SassonHLM09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toct/BourkeTV09,
  author       = {Chris Bourke and
                  Raghunath Tewari and
                  N. V. Vinodchandran},
  title        = {Directed Planar Reachability Is in Unambiguous Log-Space},
  journal      = {{ACM} Trans. Comput. Theory},
  volume       = {1},
  number       = {1},
  pages        = {4:1--4:17},
  year         = {2009},
  url          = {https://doi.org/10.1145/1490270.1490274},
  doi          = {10.1145/1490270.1490274},
  timestamp    = {Mon, 08 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toct/BourkeTV09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toct/DavidPV09,
  author       = {Matei David and
                  Toniann Pitassi and
                  Emanuele Viola},
  title        = {Improved Separations between Nondeterministic and Randomized Multiparty
                  Communication},
  journal      = {{ACM} Trans. Comput. Theory},
  volume       = {1},
  number       = {2},
  pages        = {5:1--5:20},
  year         = {2009},
  url          = {https://doi.org/10.1145/1595391.1595392},
  doi          = {10.1145/1595391.1595392},
  timestamp    = {Mon, 08 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toct/DavidPV09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toct/Fortnow09,
  author       = {Lance Fortnow},
  title        = {Editor's Foreword},
  journal      = {{ACM} Trans. Comput. Theory},
  volume       = {1},
  number       = {1},
  pages        = {1:1--1:2},
  year         = {2009},
  url          = {https://doi.org/10.1145/1490270.1490271},
  doi          = {10.1145/1490270.1490271},
  timestamp    = {Mon, 08 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toct/Fortnow09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toct/GuruswamiR09,
  author       = {Venkatesan Guruswami and
                  Prasad Raghavendra},
  title        = {Hardness of Solving Sparse Overdetermined Linear Systems: {A} 3-Query
                  {PCP} over Integers},
  journal      = {{ACM} Trans. Comput. Theory},
  volume       = {1},
  number       = {2},
  pages        = {6:1--6:20},
  year         = {2009},
  url          = {https://doi.org/10.1145/1595391.1595393},
  doi          = {10.1145/1595391.1595393},
  timestamp    = {Mon, 08 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toct/GuruswamiR09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toct/Razborov09,
  author       = {Alexander A. Razborov},
  title        = {A Simple Proof of Bazzi's Theorem},
  journal      = {{ACM} Trans. Comput. Theory},
  volume       = {1},
  number       = {1},
  pages        = {3:1--3:5},
  year         = {2009},
  url          = {https://doi.org/10.1145/1490270.1490273},
  doi          = {10.1145/1490270.1490273},
  timestamp    = {Mon, 08 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toct/Razborov09.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.