Multi-dimensional Range Searching
Multi-Dimensional Range Searching is a computational problem in computational geometry and database theory that involves retrieving all points in a multi-dimensional space satisfying a given range query, distinguished from one-dimensional range searching by its handling of simultaneous constraints across two or more dimensions.
83
Publications
6.7K
Citations
225
Authors
114
Institutions
Publications per year
2017–2026
11
Parents
83
John T. Robinson · 1981 · 888 citations · Full text
Multidimensional divide-and-conquer
Jon Bentley · Communications of the ACM · 1980 · 676 citations · Full text
Multi-Dimensional Range Query over Encrypted Data
Elaine Shi, John Bethencourt, T-H. Hubert Chan et al. · 2007 · 550 citations · Full text
Multi-dimensional range queries in sensor networks
Xin Li, Young Jin Kim, Ramesh Govindan et al. · 2003 · 386 citations
1–5 of 83
225
4
h-index
3
h-index
3
h-index
3
h-index
2
h-index
1–5 of 225
114
Carnegie Mellon University
Pittsburgh, United States
4 h-index
8 publications
4.5K citations
National University of Singapore
Singapore, Singapore
4 h-index
10 publications
589 citations
Intel (United States)
Santa Clara, United States
4 h-index
4 publications
479 citations
Purdue University West Lafayette
West Lafayette, United States
3 h-index
4 publications
402 citations
University of Southern California
Los Angeles, United States
3 h-index
10 publications
1.3K citations
University of Maryland, College Park
College Park, United States
3 h-index
5 publications
260 citations
AT&T (United States)
Bedminster, United States
3 h-index
3 publications
122 citations

University of Hong Kong
Pok Fu Lam, Hong Kong
3 h-index
7 publications
619 citations
1–8 of 114
TKDE · 4 publications · 104 citations
4
h-index
TODS · 3 publications · 510 citations
3
h-index
JACM · 2 publications · 196 citations
2
h-index
2 publications · 36 citations
2
h-index
FGCS · 2 publications · 43 citations
2
h-index
1–5