Abstract
article Free Access Share on Data Structures for Range Searching Authors: Jon Louis Bentley Departments of Computer Science and Mathematics, Carnegie-Mellon University, Pittsburgh, Pennsylvania Departments of Computer Science and Mathematics, Carnegie-Mellon University, Pittsburgh, PennsylvaniaView Profile , Jerome H. Friedman Computation Research Group, Stanford Linear Accelerator Center, Stanford, California Computation Research Group, Stanford Linear Accelerator Center, Stanford, CaliforniaView Profile Authors Info & Claims ACM Computing SurveysVolume 11Issue 4Dec. 1979 pp 397–409https://doi.org/10.1145/356789.356797Online:01 December 1979Publication History 430citation4,500DownloadsMetricsTotal Citations430Total Downloads4,500Last 12 Months172Last 6 weeks30 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
Keywords
Computer scienceCitationCenter (category theory)ComputationRange (aeronautics)Research centerLibrary scienceAlgorithm
Affiliated Institutions
Related Publications
Robust adaptive floating-point geometric predicates
Article Robust adaptive floating-point geometric predicates Share on Author: Johnathan Richard Shewchuk School of Computer Science, Carnegie Mellon University, Pittsburgh, Penns...
Distributional clustering of words for text classification
Article Free Access Share on Distributional clustering of words for text classification Authors: L. Douglas Baker School of Computer Science, Carnegie Mellon University, Pittsbu...
Summarizing text documents
Article Free Access Share on Summarizing text documents: sentence selection and evaluation metrics Authors: Jade Goldstein Language Technologies Institute, Carnegie Mellon Unive...
The Area-Time Complexity of Binary Multiplication
article Free AccessThe Area-Time Complexity of Binary Multiplication Authors: R. P. Brent The Australian National University, Canberra, ACT 2600, Australia The Australian Nation...
Accessing nearby copies of replicated objects in a distributed environment
Article Free Access Share on Accessing nearby copies of replicated objects in a distributed environment Authors: C. Greg Plaxton Department of Computer Science, University of Te...
Publication Info
- Year
- 1979
- Type
- review
- Volume
- 11
- Issue
- 4
- Pages
- 397-409
- Citations
- 620
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
620
OpenAlex
Cite This
Jon Bentley,
Jerome H. Friedman
(1979).
Data Structures for Range Searching.
ACM Computing Surveys
, 11
(4)
, 397-409.
https://doi.org/10.1145/356789.356797
Identifiers
- DOI
- 10.1145/356789.356797