Entry Wegener:1993:BHS from tcs1990.bib

Last update: Wed Sep 26 02:11:46 MDT 2018                Valid HTML 4.0!

Index sections

Top | Symbols | Numbers | Math | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z

BibTeX entry

@Article{Wegener:1993:BHS,
  author =       "Ingo Wegener",
  title =        "{BOTTOM-UP-HEAP\-SORT}, a new variant of {HEAP\-SORT},
                 beating, on an average, {QUICK\-SORT} (if $n$ is not
                 very small)",
  journal =      j-THEOR-COMP-SCI,
  volume =       "118",
  number =       "1",
  pages =        "81--98",
  day =          "13",
  month =        sep,
  year =         "1993",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:17:32 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1993&volume=118&issue=1;
                 http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
  URL =          "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1993&volume=118&issue=1&aid=1352",
  acknowledgement = ack-nhfb,
  classification = "C6120 (File organisation); C6130 (Data handling
                 techniques)",
  corpsource =   "FB Inf., Dortmund Univ., Germany",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "bottom-up-heapsort; data structures; delete procedure;
                 heap data structure; heapsort; quicksort; randomly
                 chosen objects; reheap procedure; sequential sorting
                 algorithm; sorting",
  pubcountry =   "Netherlands",
  treatment =    "P Practical",
}

Related entries