"Randomized Sorting in O(n log log n) Time and Linear Space Using Addition, ..."

Mikkel Thorup (2002)

> Home

Details and statistics

DOI: 10.1006/JAGM.2002.1211

access: closed

type: Journal Article

metadata version: 2018-11-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jal/Thorup02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jal/Thorup02
Mikkel Thorup:
Randomized Sorting in O(n log log n) Time and Linear Space Using Addition, Shift, and Bit-wise Boolean Operations. J. Algorithms 42(2): 205-230 (2002)

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.