BibTeX record journals/cogsci/KrahmerKT12

download as .bib file

@article{DBLP:journals/cogsci/KrahmerKT12,
  author       = {Emiel Krahmer and
                  Ruud Koolen and
                  Mari{\"{e}}t Theune},
  title        = {Is It That Difficult to Find a Good Preference Order for the Incremental
                  Algorithm?},
  journal      = {Cogn. Sci.},
  volume       = {36},
  number       = {5},
  pages        = {837--841},
  year         = {2012},
  url          = {https://doi.org/10.1111/j.1551-6709.2012.01258.x},
  doi          = {10.1111/J.1551-6709.2012.01258.X},
  timestamp    = {Mon, 26 Oct 2020 08:38:28 +0100},
  biburl       = {https://dblp.org/rec/journals/cogsci/KrahmerKT12.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.