"Measuring Data Locality in Internal Sorting Algorithms."

Seth D. Bergmann (1990)

> Home

Details and statistics

DOI: 10.1145/100348.100394

access: closed

type: Conference or Workshop Paper

metadata version: 2025-05-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/acm/Bergmann90
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/acm/Bergmann90
Seth D. Bergmann:
Measuring Data Locality in Internal Sorting Algorithms. ACM Conference on Computer Science 1990: 293-297

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.