Resizable Hash Tables

Resizable Hash Tables is a dynamic data structure that, unlike fixed-size hash tables, automatically expands or contracts its capacity in response to changes in the number of stored elements to maintain efficient load factors and performance guarantees.

10

Publications

254

Citations

28

Authors

23

Institutions

Publications per year

2017–2026

4

Variants

Resizable Hash Table

Authors

28

  1. JS
    Jianling Sun

    Zhejiang University, China

    1 publications · 27 citations

    1

    h-index

  2. MA
    Maya Arbel

    Technion – Israel Institute of Technology, Israel

    1 publications · 23 citations

    1

    h-index

  3. JW
    Jonathan Walpole

    Oregon Museum of Science and Industry, United States

    1 publications · 67 citations

    1

    h-index

  4. GM
    Gregg M. Townsend

    University of Arizona, United States

    1 publications · 11 citations

    1

    h-index

  5. YH
    Yu Hua

    Huazhong University of Science and Technology, China

    1 publications · 16 citations

    1

    h-index

1–5 of 28

Venues

  1. Infoscience (Ecole Polytechnique Fédérale de Lausanne)

    Repository · 1 publications · 14 citations

    1

    h-index

  2. USENIX Annual Technical Conference

    Conference · 1 publications · 67 citations

    1

    h-index

  3. Journal of the ACM

    JACM · 1 publications · 20 citations

    1

    h-index

  4. ACM Transactions on Storage

    TOS · 1 publications · 16 citations

    1

    h-index

  5. Software Practice and Experience

    1 publications · 11 citations

    1

    h-index

1–5