"Nearly-Optimal Mergesorts: Fast, Practical Sorting Methods That Optimally ..."

J. Ian Munro, Sebastian Wild (2018)

> Home

Details and statistics

DOI: 10.4230/LIPICS.ESA.2018.63

access: open

type: Conference or Workshop Paper

metadata version: 2019-09-25

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/esa/MunroW18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/esa/MunroW18
J. Ian Munro, Sebastian Wild:
Nearly-Optimal Mergesorts: Fast, Practical Sorting Methods That Optimally Adapt to Existing Runs. ESA 2018: 63:1-63:16

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.