Hash Table Performance Analysis

Hash Table Performance Analysis is a methodological framework within algorithmic analysis that characterizes the efficiency and behavior of hash table operations in terms of time complexity, space usage, and collision management under varying input distributions and design parameters.

125

Publications

7.1K

Citations

269

Authors

127

Institutions

Publications per year

2017–2026

10

Authors

269

  1. RP
    Rasmus Pagh

    IT University of Copenhagen, Denmark

    7 publications · 1.5K citations

    7

    h-index

  2. MM
    Michael Mitzenmacher

    Harvard University Press, United States

    6 publications · 394 citations

    6

    h-index

  3. PL
    Per-Åke Larson

    University of Waterloo, Canada

    5 publications · 337 citations

    5

    h-index

  4. AK
    Adam Kirsch

    Harvard University, United States

    4 publications · 296 citations

    4

    h-index

  5. JP
    Jeanette P. Schmidt

    Stanford University, United States

    4 publications · 73 citations

    4

    h-index

1–5 of 269

Venues

  1. SIAM Journal on Computing

    8 publications · 334 citations

    8

    h-index

  2. Communications of the ACM

    5 publications · 505 citations

    5

    h-index

  3. The Computer Journal

    5 publications · 87 citations

    5

    h-index

  4. IACR Cryptology ePrint Archive

    Repository · 4 publications · 138 citations

    4

    h-index

  5. Proceedings of the VLDB Endowment

    PVLDB · 3 publications · 165 citations

    3

    h-index

1–5