Search dblp for Publications

• > Home > Search

@article{DBLP:journals/iandc/BremerF12,
  author       = {Joachim Bremer and
                  Dominik D. Freydenberger},
  title        = {Inclusion problems for patterns with a bounded number of variables},
  journal      = {Inf. Comput.},
  volume       = {220},
  pages        = {15--43},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.ic.2012.10.003},
  doi          = {10.1016/J.IC.2012.10.003},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/BremerF12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/CaseK12,
  author       = {John Case and
                  Timo K{\"{o}}tzing},
  title        = {Learning secrets interactively. Dynamic modeling in inductive inference},
  journal      = {Inf. Comput.},
  volume       = {220},
  pages        = {60--73},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.ic.2012.10.002},
  doi          = {10.1016/J.IC.2012.10.002},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/CaseK12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/DrosteM12,
  author       = {Manfred Droste and
                  Ingmar Meinecke},
  title        = {Weighted automata and weighted {MSO} logics for average and long-time
                  behaviors},
  journal      = {Inf. Comput.},
  volume       = {220},
  pages        = {44--59},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.ic.2012.10.001},
  doi          = {10.1016/J.IC.2012.10.001},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/DrosteM12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/DyerGJR12,
  author       = {Martin E. Dyer and
                  Leslie Ann Goldberg and
                  Markus Jalsenius and
                  David Richerby},
  title        = {The complexity of approximating bounded-degree Boolean {\#}CSP},
  journal      = {Inf. Comput.},
  volume       = {220},
  pages        = {1--14},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.ic.2011.12.007},
  doi          = {10.1016/J.IC.2011.12.007},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/iandc/DyerGJR12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}