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

Authors

3.7K

  1. RE
    Robert E. Tarjan

    Princeton University, United States

    32 publications · 8.5K citations

    23

    h-index

  2. HS
    Hanan Samet

    University of Maryland, College Park, United States

    14 publications · 620 citations

    13

    h-index

  3. BS
    Bernhard Seeger

    Philipps University of Marburg, Germany

    12 publications · 8K citations

    12

    h-index

  4. HK
    Haim Kaplan

    Tel Aviv University, Israel

    12 publications · 536 citations

    12

    h-index

  5. DD
    Daniel D. Sleator

    Carnegie Mellon University, United States

    12 publications · 6.4K citations

    12

    h-index

1–5 of 3.7K

Venues

  1. Communications of the ACM

    59 publications · 17.1K citations

    38

    h-index

  2. ACM SIGMOD Record

    38 publications · 7.7K citations

    26

    h-index

  3. IEEE Transactions on Knowledge and Data Engineering

    TKDE · 39 publications · 3.1K citations

    25

    h-index

  4. SIAM Journal on Computing

    41 publications · 3.6K citations

    24

    h-index

  5. ACM Transactions on Database Systems

    TODS · 29 publications · 2.5K citations

    21

    h-index

1–5