BibTeX record conf/alenex/VialDEGJ18

download as .bib file

@inproceedings{DBLP:conf/alenex/VialDEGJ18,
  author    = {Juan Jos{\'{e}} Besa Vial and
               William E. Devanny and
               David Eppstein and
               Michael T. Goodrich and
               Timothy Johnson},
  title     = {Quadratic Time Algorithms Appear to be Optimal for Sorting Evolving
               Data},
  booktitle = {Proceedings of the Twentieth Workshop on Algorithm Engineering and
               Experiments, {ALENEX} 2018, New Orleans, LA, USA, January 7-8, 2018.},
  pages     = {87--96},
  year      = {2018},
  crossref  = {DBLP:conf/alenex/2018},
  url       = {https://doi.org/10.1137/1.9781611975055.8},
  doi       = {10.1137/1.9781611975055.8},
  timestamp = {Thu, 04 Jan 2018 14:03:02 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/alenex/VialDEGJ18},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/alenex/2018,
  editor    = {Rasmus Pagh and
               Suresh Venkatasubramanian},
  title     = {Proceedings of the Twentieth Workshop on Algorithm Engineering and
               Experiments, {ALENEX} 2018, New Orleans, LA, USA, January 7-8, 2018},
  publisher = {{SIAM}},
  year      = {2018},
  url       = {https://doi.org/10.1137/1.9781611975055},
  doi       = {10.1137/1.9781611975055},
  isbn      = {978-1-61197-505-5},
  timestamp = {Thu, 04 Jan 2018 14:01:44 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/alenex/2018},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of Schloss Dagstuhl - Leibniz Center for Informatics