Collision Resolution
Collision Resolution is a method in hash table design that specifies how conflicting entries, arising when distinct keys map to the same index, are stored and retrieved to maintain data integrity and efficient access.
280
Publications
12.1K
Citations
728
Authors
303
Institutions
Publications per year
2017–2026
83
Parents
280
A perspective on multiaccess channels
Robert G. Gallager · IEEE Transactions on Information Theory · 1985 · 621 citations · Full text
1–5 of 280
728
5
h-index
5
h-index
5
h-index
4
h-index
4
h-index
1–5 of 728
303
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
8 h-index
15 publications
940 citations
Tsinghua University
Beijing, China
8 h-index
24 publications
892 citations
Technion – Israel Institute of Technology
Haifa, Israel
8 h-index
13 publications
489 citations

Hong Kong University of Science and Technology
Hong Kong, Hong Kong
6 h-index
11 publications
904 citations
University of Maryland, College Park
College Park, United States
5 h-index
7 publications
319 citations
University of Southern California
Los Angeles, United States
5 h-index
10 publications
1.5K citations
Massachusetts Institute of Technology
Cambridge, United States
5 h-index
11 publications
1.9K citations
Georgia Institute of Technology
Atlanta, United States
5 h-index
10 publications
297 citations
1–8 of 303
11 publications · 376 citations
11
h-index
11 publications · 443 citations
11
h-index
9 publications · 489 citations
9
h-index
9 publications · 1.1K citations
9
h-index
7 publications · 247 citations
8
h-index
1–5