BibTeX record conf/waoa/BorodinBLP18

download as .bib file

@inproceedings{DBLP:conf/waoa/BorodinBLP18,
  author       = {Allan Borodin and
                  Joan Boyar and
                  Kim S. Larsen and
                  Denis Pankratov},
  editor       = {Leah Epstein and
                  Thomas Erlebach},
  title        = {Advice Complexity of Priority Algorithms},
  booktitle    = {Approximation and Online Algorithms - 16th International Workshop,
                  {WAOA} 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected
                  Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {11312},
  pages        = {69--86},
  publisher    = {Springer},
  year         = {2018},
  url          = {https://doi.org/10.1007/978-3-030-04693-4\_5},
  doi          = {10.1007/978-3-030-04693-4\_5},
  timestamp    = {Wed, 25 Sep 2019 18:23:13 +0200},
  biburl       = {https://dblp.org/rec/conf/waoa/BorodinBLP18.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.