Double Hashing

Double Hashing is a collision resolution technique in hash tables that uses a secondary hash function to determine the probe interval, thereby reducing clustering and improving distribution compared to fixed-interval probing methods.

25

Publications

984

Citations

72

Authors

45

Institutions

Publications per year

2017–2026

11

Authors

72

  1. CD
    Christophe de Maindreville

    Institut national de recherche en sciences et technologies du numérique, France

    2 publications · 38 citations

    2

    h-index

  2. GS
    George S. Lueker

    University of California, Irvine, United States

    2 publications · 45 citations

    2

    h-index

  3. MM
    Mariko Molodowitch

    University of California, Irvine, United States

    2 publications · 45 citations

    2

    h-index

  4. JC
    Jean-Pierre Cheiney

    Télécom Paris, France

    2 publications · 38 citations

    2

    h-index

  5. MT
    Mikkel Thorup

    AT&T (United States), United States

    1 publications · 32 citations

    1

    h-index

1–5 of 72

Venues

  1. Communications of the ACM

    2 publications · 126 citations

    2

    h-index

  2. Very Large Data Bases

    Conference · 1 publications · 27 citations

    1

    h-index

  3. Journal of Computer and System Sciences

    1 publications · 67 citations

    1

    h-index

  4. IEEE Transactions on Industrial Informatics

    1 publications · 11 citations

    1

    h-index

  5. Proceedings of the AAAI Conference on Artificial Intelligence

    Conference · 1 publications · 86 citations

    1

    h-index

1–5