Collision Handling

Collision Handling is a computational strategy within hash table design that resolves the occurrence of multiple keys mapping to the same index by specifying a deterministic method for storing and retrieving such keys.

346

Publications

16.5K

Citations

1K

Authors

397

Institutions

Publications per year

2017–2026

88

Authors

1K

  1. JS
    Jian Su

    Nanjing University of Information Science and Technology, China

    5 publications · 104 citations

    5

    h-index

  2. ZS
    Zhengguo Sheng

    University of Sussex, United Kingdom

    4 publications · 92 citations

    4

    h-index

  3. XL
    Xiulong Liu

    Hong Kong Polytechnic University, Hong Kong SAR China

    4 publications · 152 citations

    4

    h-index

  4. AX
    Alex X. Liu

    Michigan State University, United States

    4 publications · 142 citations

    4

    h-index

  5. DF
    Dengguo Feng

    Institute of Software, China

    3 publications · 486 citations

    3

    h-index

1–5 of 1K

Venues

  1. IACR Cryptology ePrint Archive

    Repository · 11 publications · 817 citations

    11

    h-index

  2. IEEE Access

    6 publications · 452 citations

    6

    h-index

  3. IEEE Transactions on Wireless Communications

    6 publications · 276 citations

    6

    h-index

  4. IEEE Communications Letters

    6 publications · 406 citations

    6

    h-index

  5. Computer Graphics Forum

    5 publications · 268 citations

    5

    h-index

1–5