External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Bottom-Up-Heap Sort, a New Variant of Heap Sort Beating on Average Quick Sort (if n is not very small)

Ingo Wegener. Bottom-Up-Heap Sort, a New Variant of Heap Sort Beating on Average Quick Sort (if n is not very small). In Branislav Rovan, editor, Mathematical Foundations of Computer Science 1990, MFCS 90, Banská Bystrica, Czechoslovakia, August 27-31, 1990, Proceedings. Volume 452 of Lecture Notes in Computer Science, pages 516-522, Springer, 1990.

Abstract

Abstract is missing.

runs on