BibTeX record conf/stacs/Wegener91

• > Home > conf/stacs/Wegener91

@inproceedings{DBLP:conf/stacs/Wegener91,
  author       = {Ingo Wegener},
  editor       = {Christian Choffrut and
                  Matthias Jantzen},
  title        = {The Worst Case Complexity of McDiarmid and Reed's Variant of Bottom-Up-Heap
                  Sort is Less Than n log n + 1.1n},
  booktitle    = {{STACS} 91, 8th Annual Symposium on Theoretical Aspects of Computer
                  Science, Hamburg, Germany, February 14-16, 1991, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {480},
  pages        = {137--147},
  publisher    = {Springer},
  year         = {1991},
  url          = {https://doi.org/10.1007/BFb0020794},
  doi          = {10.1007/BFB0020794},
  timestamp    = {Tue, 14 May 2019 10:00:48 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/Wegener91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}