Data Structure Algorithms
Data Structure Algorithms is a singular academic concept denoting the systematic study and design of algorithms that implement, manipulate, and optimize data structures to efficiently organize, store, retrieve, and manage data in computational processes.
2K
Publications
175.4K
Citations
3.7K
Authors
1.1K
Institutions
Publications per year
2017–2026
188
2K
Multidimensional binary search trees used for associative searching
Jon Bentley · Communications of the ACM · 1975 · 7.5K citations · Full text
The R*-tree: an efficient and robust access method for points and rectangles
Norbert Beckmann, Hans‐Peter Kriegel, Ralf Schneider et al. · 1990 · 4.2K citations · Full text
Tian Zhang, Raghu Ramakrishnan, Miron Livny · 1996 · 3.9K citations
A Nonlinear Mapping for Data Structure Analysis
John W. Sammon · IEEE Transactions on Computers · 1969 · 3.4K citations
1–5 of 2K
3.7K
23
h-index
13
h-index
12
h-index
12
h-index
12
h-index
1–5 of 3.7K
1.1K
IBM (United States)
Armonk, United States
34 h-index
93 publications
9.5K citations
Stanford University
Stanford, United States
32 h-index
80 publications
19.9K citations
AT&T (United States)
Bedminster, United States
29 h-index
72 publications
14.4K citations
Carnegie Mellon University
Pittsburgh, United States
26 h-index
77 publications
11K citations
University of Maryland, College Park
College Park, United States
22 h-index
56 publications
4.2K citations

Hong Kong University of Science and Technology
Hong Kong, Hong Kong
22 h-index
39 publications
6K citations
Princeton University
Princeton, United States
21 h-index
34 publications
3.8K citations
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
20 h-index
34 publications
3.3K citations
1–8 of 1.1K
59 publications · 17.1K citations
38
h-index
38 publications · 7.7K citations
26
h-index
TKDE · 39 publications · 3.1K citations
25
h-index
41 publications · 3.6K citations
24
h-index
TODS · 29 publications · 2.5K citations
21
h-index
1–5