BibTeX record conf/stacs/Wegener91

download as .bib file

@inproceedings{DBLP:conf/stacs/Wegener91,
  author    = {Ingo Wegener},
  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},
  pages     = {137--147},
  year      = {1991},
  crossref  = {DBLP:conf/stacs/1991},
  url       = {https://doi.org/10.1007/BFb0020794},
  doi       = {10.1007/BFb0020794},
  timestamp = {Fri, 19 May 2017 13:10:45 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/stacs/Wegener91},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stacs/1991,
  editor    = {Christian Choffrut and
               Matthias Jantzen},
  title     = {{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},
  publisher = {Springer},
  year      = {1991},
  url       = {https://doi.org/10.1007/BFb0020782},
  doi       = {10.1007/BFb0020782},
  isbn      = {3-540-53709-0},
  timestamp = {Fri, 19 May 2017 13:10:45 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/stacs/1991},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
maintained by Schloss Dagstuhl LZI at University of Trier