"Disk scheduling revisited: can O(n2) algorithms ..."

Robert Geist, Robert Ross (1997)

> Home

Details and statistics

DOI: 10.1145/2817460.2817473

access: closed

type: Conference or Workshop Paper

metadata version: 2018-11-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/ACMse/GeistR97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ACMse/GeistR97
Robert Geist, Robert Ross:
Disk scheduling revisited: can O(n²) algorithms compete? ACM Southeast Regional Conference 1997: 51-56

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.