"The Worst Case Complexity of McDiarmid and Reed's Variant of BOTTOM-UP ..."

Ingo Wegener (1992)

> Home

Details and statistics

DOI: 10.1016/0890-5401(92)90005-Z

access: open

type: Journal Article

metadata version: 2021-02-12

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/iandc/Wegener92
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iandc/Wegener92
Ingo Wegener:
The Worst Case Complexity of McDiarmid and Reed's Variant of BOTTOM-UP HEAPSORT is less than nlog n + 1.1n. Inf. Comput. 97(1): 86-96 (1992)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.