Hash Table Search Algorithms

Hash Table Search Algorithms is a computational method that determines the location of a specific key within a hash table by applying a hash function to map the key to an index and resolving collisions through probing or chaining techniques.

122

Publications

7.5K

Citations

268

Authors

128

Institutions

Publications per year

2017–2026

16

Authors

268

  1. HD
    Huichen Dai

    Tsinghua University, China

    4 publications · 106 citations

    4

    h-index

  2. JI
    J. Ian Munro

    University of Waterloo, Canada

    4 publications · 165 citations

    4

    h-index

  3. AV
    Alfredo Viola

    Universidad de la República de Uruguay, Uruguay

    3 publications · 50 citations

    3

    h-index

  4. RP
    Rasmus Pagh

    IT University of Copenhagen, Denmark

    3 publications · 313 citations

    3

    h-index

  5. JL
    Jianyuan Lu

    Tsinghua University, China

    3 publications · 95 citations

    3

    h-index

1–5 of 268

Venues

  1. Communications of the ACM

    8 publications · 444 citations

    8

    h-index

  2. SIAM Journal on Computing

    7 publications · 157 citations

    7

    h-index

  3. The Computer Journal

    5 publications · 158 citations

    5

    h-index

  4. IEEE/ACM Transactions on Networking

    TON · 3 publications · 107 citations

    3

    h-index

  5. ACM Transactions on Algorithms

    TALG · 2 publications · 54 citations

    2

    h-index

1–5