Linear Probing

Linear Probing is a collision resolution technique in hash tables that belongs to the class of open-addressing methods, distinguished by its strategy of sequentially searching the next available slot in the table by incrementing the index by one until an empty position is found.

38

Publications

2.7K

Citations

125

Authors

41

Institutions

Publications per year

2017–2026

14

Authors

125

  1. MT
    Mikkel Thorup

    AT&T (United States), United States

    3 publications · 58 citations

    3

    h-index

  2. MR
    Milan Ružić

    IT University of Copenhagen, Denmark

    3 publications · 96 citations

    3

    h-index

  3. RP
    Rasmus Pagh

    IT University of Copenhagen, Denmark

    3 publications · 96 citations

    3

    h-index

  4. AP
    Anna Pagh

    IT University of Copenhagen, Denmark

    3 publications · 96 citations

    3

    h-index

  5. CS
    Christoph Schuhmann

    Ludwig-Maximilians-Universität München, Germany

    2 publications · 525 citations

    2

    h-index

1–5 of 125

Venues

  1. arXiv (Cornell University)

    Repository · 7 publications · 447 citations

    7

    h-index

  2. ACM Transactions on Algorithms

    TALG · 3 publications · 58 citations

    3

    h-index

  3. Journal of Algorithms

    2 publications · 70 citations

    2

    h-index

  4. 2

    h-index

  5. Algorithmica

    2 publications · 200 citations

    2

    h-index

1–5