Concepedia

Persistent Binary Search Trees

Persistent Binary Search Trees is a type of binary search tree data structure that preserves all previous versions of itself after modifications, enabling efficient access and updates while maintaining historical states.

2

Publications

580

Citations

6

Authors

4

Institutions

Publications per year

2017–2026

1

Parents

Publications

2

1–2 of 2

Authors

6

  1. NS
    Neil Sarnak

    Princeton University, United States

    1 publications · 487 citations

    1

    h-index

  2. DH
    Deukyeon Hwang

    Ulsan National Institute of Science and Technology, South Korea

    1 publications · 93 citations

    1

    h-index

  3. BN
    Beomseok Nam

    Ulsan National Institute of Science and Technology, South Korea

    1 publications · 93 citations

    1

    h-index

  4. RE
    Robert E. Tarjan

    Princeton University, United States

    1 publications · 487 citations

    1

    h-index

  5. YW
    Youjip Won

    Hanyang University, South Korea

    1 publications · 93 citations

    1

    h-index

1–5 of 6

Institutions

4

  1. IBM Research - Thomas J. Watson Research Center

    Yorktown Heights, United States

    1 h-index

    1 publications

    487 citations

  2. Ulsan National Institute of Science and Technology

    Ulsan, South Korea

    1 h-index

    3 publications

    279 citations

  3. Hanyang University

    Seoul, South Korea

    1 h-index

    1 publications

    93 citations

  4. Princeton University

    Princeton, United States

    1 h-index

    1 publications

    487 citations

1–4 of 4

Venues

  1. Communications of the ACM

    1 publications · 487 citations

    1

    h-index

  2. 1

    h-index

1–2