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

Ingo Wegener (1991)

> Home

Details and statistics

DOI: 10.1007/BFB0020794

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/stacs/Wegener91
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stacs/Wegener91
Ingo Wegener:
The Worst Case Complexity of McDiarmid and Reed's Variant of Bottom-Up-Heap Sort is Less Than n log n + 1.1n. STACS 1991: 137-147

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.