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
Parents
346
Collisions for Hash Functions MD4, MD5, HAVAL-128 and RIPEMD
Xiaoyun Wang, Dengguo Feng, Xuejia Lai et al. · IACR Cryptology ePrint Archive · 2004 · 458 citations
CARA: Collision-Aware Rate Adaptation for IEEE 802.11 WLANs
J. Kim, S. Kim, Sunghyun Choi et al. · 2006 · 441 citations
Engineering, Computer Engineering, Electrical Engineering +9
1–5 of 346
1K
Nanjing University of Information Science and Technology, China
5 publications · 104 citations
5
h-index
4
h-index
4
h-index
4
h-index
3
h-index
1–5 of 1K
397

Peking University
Beijing, China
10 h-index
40 publications
1.1K citations
Seoul National University
Seoul, South Korea
7 h-index
18 publications
2.1K citations
Korea Advanced Institute of Science and Technology
Daejeon, South Korea
7 h-index
16 publications
908 citations

Zhejiang University
Hangzhou, China
6 h-index
16 publications
446 citations

Beijing University of Posts and Telecommunications
Beijing, China
5 h-index
12 publications
179 citations
Stanford University
Stanford, United States
5 h-index
8 publications
606 citations

Hong Kong University of Science and Technology
Hong Kong, Hong Kong
5 h-index
10 publications
806 citations
University of Southern California
Los Angeles, United States
5 h-index
12 publications
190 citations
1–8 of 397
Repository · 11 publications · 817 citations
11
h-index
6 publications · 452 citations
6
h-index
6 publications · 276 citations
6
h-index
6 publications · 406 citations
6
h-index
5 publications · 268 citations
5
h-index
1–5