"A Lower Bound on the Complexity of Orthogonal Range Queries."

Michael L. Fredman (1981)

> Home

Details and statistics

DOI: 10.1145/322276.322281

access: closed

type: Journal Article

metadata version: 2018-11-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jacm/Fredman81
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jacm/Fredman81
Michael L. Fredman:
A Lower Bound on the Complexity of Orthogonal Range Queries. J. ACM 28(4): 696-705 (1981)

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.