Concepedia

Persistent Search Trees

Persistent Search Trees is a type of search tree data structure that preserves all previous versions after modifications, enabling efficient access and updates across different versions while maintaining the ordering and search properties of the underlying tree.

2

Publications

500

Citations

6

Authors

4

Institutions

Publications per year

2017–2026

0

Parents

Publications

2

1–2 of 2

Authors

6

  1. MM
    Minoru Maruyama

    Shinshu University, Japan

    1 publications · 13 citations

    1

    h-index

  2. RE
    Robert E. Tarjan

    Princeton University, United States

    1 publications · 487 citations

    1

    h-index

  3. NS
    Neil Sarnak

    Princeton University, United States

    1 publications · 487 citations

    1

    h-index

  4. SN
    S. Nishida

    The University of Osaka, Japan

    1 publications · 13 citations

    1

    h-index

  5. YN
    Yuichi Nakamura

    IBM Research - Tokyo, Japan

    1 publications · 13 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. Princeton University

    Princeton, United States

    1 h-index

    1 publications

    487 citations

  3. Mitsubishi Electric (Japan)

    Tokyo, Japan

    1 h-index

    4 publications

    52 citations

  4. Mitsubishi Group (Japan)

    Tokyo, Japan

    1 h-index

    4 publications

    52 citations

1–4 of 4

Venues

  1. Communications of the ACM

    1 publications · 487 citations

    1

    h-index

1–1