Dynamic Range Searching
Dynamic Range Searching is a computational framework within the domain of range searching that supports efficient querying of geometric or multidimensional data sets while allowing incremental insertions and deletions of data points.
29
Publications
1.3K
Citations
69
Authors
35
Institutions
Publications per year
2017–2026
3
Parents
29
Adding range restriction capability to dynamic data structures
Dan E. Willard, George S. Lueker · Journal of the ACM · 1985 · 184 citations · Full text
Dynamic algorithms in computational geometry
Yi‐Jen Chiang, Roberto Tamassia · Proceedings of the IEEE · 1992 · 163 citations
Optimal dynamic interval management in external memory
Lars Arge, Jeffrey Scott Vitter · 2002 · 139 citations
1–5 of 29
69
3
h-index
3
h-index
2
h-index
2
h-index
University at Albany, State University of New York, United States
2 publications · 220 citations
2
h-index
1–5 of 69
35
University of California, Irvine
Irvine, United States
4 h-index
4 publications
255 citations
Carnegie Mellon University
Pittsburgh, United States
3 h-index
8 publications
186 citations
Duke University
Durham, United States
2 h-index
4 publications
434 citations
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
2 h-index
4 publications
174 citations
Brown University
Providence, United States
2 h-index
4 publications
482 citations
Georgia Institute of Technology
Atlanta, United States
2 h-index
4 publications
174 citations
NEC (United States)
Irving, United States
2 h-index
5 publications
92 citations
University of Maryland, College Park
College Park, United States
1 h-index
1 publications
25 citations
1–8 of 35
TKDE · 2 publications · 67 citations
2
h-index
1 publications · 15 citations
1
h-index
DKE · 1 publications · 29 citations
1
h-index
1 publications · 25 citations
1
h-index
1 publications · 78 citations
1
h-index
1–5