"Refined Bounds on the Complexity of Sorting and Selection in D-Dimensional ..."

Thomas M. Fischer (1986)

> Home

Details and statistics

DOI: 10.1007/BFB0016255

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/mfcs/Fischer86
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/mfcs/Fischer86
Thomas M. Fischer:
Refined Bounds on the Complexity of Sorting and Selection in D-Dimensional Space. MFCS 1986: 308-314

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.