Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/toct/0001GR16,
  author       = {Andreas G{\"{o}}bel and
                  Leslie Ann Goldberg and
                  David Richerby},
  title        = {Counting Homomorphisms to Square-Free Graphs, Modulo 2},
  journal      = {{ACM} Trans. Comput. Theory},
  volume       = {8},
  number       = {3},
  pages        = {12:1--12:29},
  year         = {2016},
  url          = {https://doi.org/10.1145/2898441},
  doi          = {10.1145/2898441},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toct/0001GR16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toct/0001MS16,
  author       = {Mrinal Kumar and
                  Gaurav Maheshwari and
                  Jayalal Sarma},
  title        = {Arithmetic Circuit Lower Bounds via Maximum-Rank of Partial Derivative
                  Matrices},
  journal      = {{ACM} Trans. Comput. Theory},
  volume       = {8},
  number       = {3},
  pages        = {8:1--8:17},
  year         = {2016},
  url          = {https://doi.org/10.1145/2898437},
  doi          = {10.1145/2898437},
  timestamp    = {Mon, 08 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toct/0001MS16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toct/Ailon16,
  author       = {Nir Ailon},
  title        = {An Omega((n log n)/R) Lower Bound for Fourier Transform Computation
                  in the R-Well Conditioned Model},
  journal      = {{ACM} Trans. Comput. Theory},
  volume       = {8},
  number       = {1},
  pages        = {4:1--4:14},
  year         = {2016},
  url          = {https://doi.org/10.1145/2858785},
  doi          = {10.1145/2858785},
  timestamp    = {Mon, 08 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toct/Ailon16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toct/CaragiannisKK16,
  author       = {Ioannis Caragiannis and
                  Christos Kaklamanis and
                  Maria Kyropoulou},
  title        = {Limitations of Deterministic Auction Design for Correlated Bidders},
  journal      = {{ACM} Trans. Comput. Theory},
  volume       = {8},
  number       = {4},
  pages        = {13:1--13:18},
  year         = {2016},
  url          = {https://doi.org/10.1145/2934309},
  doi          = {10.1145/2934309},
  timestamp    = {Mon, 08 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toct/CaragiannisKK16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toct/FellowsHRS16,
  author       = {Michael R. Fellows and
                  Danny Hermelin and
                  Frances A. Rosamond and
                  Hadas Shachnai},
  title        = {Tractable Parameterizations for the Minimum Linear Arrangement Problem},
  journal      = {{ACM} Trans. Comput. Theory},
  volume       = {8},
  number       = {2},
  pages        = {6:1--6:12},
  year         = {2016},
  url          = {https://doi.org/10.1145/2898352},
  doi          = {10.1145/2898352},
  timestamp    = {Mon, 08 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toct/FellowsHRS16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toct/FischerGL16,
  author       = {Eldar Fischer and
                  Yonatan Goldhirsh and
                  Oded Lachish},
  title        = {Testing Read-Once Formula Satisfaction},
  journal      = {{ACM} Trans. Comput. Theory},
  volume       = {8},
  number       = {2},
  pages        = {5:1--5:26},
  year         = {2016},
  url          = {https://doi.org/10.1145/2897184},
  doi          = {10.1145/2897184},
  timestamp    = {Mon, 08 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toct/FischerGL16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toct/FullaZ16,
  author       = {Peter Fulla and
                  Stanislav Zivn{\'{y}}},
  title        = {A Galois Connection for Weighted (Relational) Clones of Infinite Size},
  journal      = {{ACM} Trans. Comput. Theory},
  volume       = {8},
  number       = {3},
  pages        = {9:1--9:21},
  year         = {2016},
  url          = {https://doi.org/10.1145/2898438},
  doi          = {10.1145/2898438},
  timestamp    = {Mon, 03 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toct/FullaZ16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toct/GalJLMS16,
  author       = {Anna G{\'{a}}l and
                  Jing{-}Tang Jang and
                  Nutan Limaye and
                  Meena Mahajan and
                  Karteek Sreenivasaiah},
  title        = {Space-Efficient Approximations for Subset Sum},
  journal      = {{ACM} Trans. Comput. Theory},
  volume       = {8},
  number       = {4},
  pages        = {16:1--16:28},
  year         = {2016},
  url          = {https://doi.org/10.1145/2894843},
  doi          = {10.1145/2894843},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toct/GalJLMS16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toct/GoldreichR16,
  author       = {Oded Goldreich and
                  Dana Ron},
  title        = {On Sample-Based Testers},
  journal      = {{ACM} Trans. Comput. Theory},
  volume       = {8},
  number       = {2},
  pages        = {7:1--7:54},
  year         = {2016},
  url          = {https://doi.org/10.1145/2898355},
  doi          = {10.1145/2898355},
  timestamp    = {Mon, 08 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toct/GoldreichR16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toct/GurjarKMST16,
  author       = {Rohit Gurjar and
                  Arpita Korwar and
                  Jochen Messner and
                  Simon Straub and
                  Thomas Thierauf},
  title        = {Planarizing Gadgets for Perfect Matching Do Not Exist},
  journal      = {{ACM} Trans. Comput. Theory},
  volume       = {8},
  number       = {4},
  pages        = {14:1--14:15},
  year         = {2016},
  url          = {https://doi.org/10.1145/2934310},
  doi          = {10.1145/2934310},
  timestamp    = {Mon, 08 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toct/GurjarKMST16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toct/HavivR16,
  author       = {Ishay Haviv and
                  Oded Regev},
  title        = {The List-Decoding Size of Fourier-Sparse Boolean Functions},
  journal      = {{ACM} Trans. Comput. Theory},
  volume       = {8},
  number       = {3},
  pages        = {10:1--10:14},
  year         = {2016},
  url          = {https://doi.org/10.1145/2898439},
  doi          = {10.1145/2898439},
  timestamp    = {Mon, 08 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toct/HavivR16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toct/KratschMW16,
  author       = {Stefan Kratsch and
                  D{\'{a}}niel Marx and
                  Magnus Wahlstr{\"{o}}m},
  title        = {Parameterized Complexity and Kernelizability of Max Ones and Exact
                  Ones Problems},
  journal      = {{ACM} Trans. Comput. Theory},
  volume       = {8},
  number       = {1},
  pages        = {1:1--1:28},
  year         = {2016},
  url          = {https://doi.org/10.1145/2858787},
  doi          = {10.1145/2858787},
  timestamp    = {Mon, 08 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toct/KratschMW16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toct/Lauria16,
  author       = {Massimo Lauria},
  title        = {A Rank Lower Bound for Cutting Planes Proofs of Ramsey's Theorem},
  journal      = {{ACM} Trans. Comput. Theory},
  volume       = {8},
  number       = {4},
  pages        = {17:1--17:13},
  year         = {2016},
  url          = {https://doi.org/10.1145/2903266},
  doi          = {10.1145/2903266},
  timestamp    = {Mon, 08 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toct/Lauria16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toct/NguyenS16,
  author       = {Dung T. Nguyen and
                  Alan L. Selman},
  title        = {Structural Properties of Nonautoreducible Sets},
  journal      = {{ACM} Trans. Comput. Theory},
  volume       = {8},
  number       = {3},
  pages        = {11:1--11:24},
  year         = {2016},
  url          = {https://doi.org/10.1145/2898440},
  doi          = {10.1145/2898440},
  timestamp    = {Mon, 08 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toct/NguyenS16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toct/RonT16,
  author       = {Dana Ron and
                  Gilad Tsur},
  title        = {The Power of an Example: Hidden Set Size Approximation Using Group
                  Queries and Conditional Sampling},
  journal      = {{ACM} Trans. Comput. Theory},
  volume       = {8},
  number       = {4},
  pages        = {15:1--15:19},
  year         = {2016},
  url          = {https://doi.org/10.1145/2930657},
  doi          = {10.1145/2930657},
  timestamp    = {Mon, 08 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toct/RonT16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toct/Schmitz16,
  author       = {Sylvain Schmitz},
  title        = {Complexity Hierarchies beyond Elementary},
  journal      = {{ACM} Trans. Comput. Theory},
  volume       = {8},
  number       = {1},
  pages        = {3:1--3:36},
  year         = {2016},
  url          = {https://doi.org/10.1145/2858784},
  doi          = {10.1145/2858784},
  timestamp    = {Mon, 08 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toct/Schmitz16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toct/Viola16,
  author       = {Emanuele Viola},
  title        = {Quadratic Maps Are Hard to Sample},
  journal      = {{ACM} Trans. Comput. Theory},
  volume       = {8},
  number       = {4},
  pages        = {18:1--18:4},
  year         = {2016},
  url          = {https://doi.org/10.1145/2934308},
  doi          = {10.1145/2934308},
  timestamp    = {Mon, 08 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toct/Viola16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toct/Volkovich16,
  author       = {Ilya Volkovich},
  title        = {Characterizing Arithmetic Read-Once Formulae},
  journal      = {{ACM} Trans. Comput. Theory},
  volume       = {8},
  number       = {1},
  pages        = {2:1--2:19},
  year         = {2016},
  url          = {https://doi.org/10.1145/2858783},
  doi          = {10.1145/2858783},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toct/Volkovich16.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.