Concepedia

Randomized Algorithms For Hashing

Randomized Algorithms for Hashing is a computational method that belongs to the class of randomized algorithms and specifically employs randomness in the design or execution of hash functions to achieve probabilistic guarantees on performance, collision resistance, or distributional uniformity in data organization and retrieval.

52

Publications

3.3K

Citations

100

Authors

71

Institutions

Publications per year

2017–2026

5

Parents

Publications

52

Robust image hashing

Ramarathnam Venkatesan, S.-M. Koon, Mariusz Jakubowski et al. · 2002 · 494 citations

, , +16

Locality-Sensitive Hashing for Finding Nearest Neighbors [Lecture Notes]

Malcolm Slaney, Michael A. Casey · IEEE Signal Processing Magazine · 2008 · 343 citations

, , +15

How asymmetry helps load balancing

Berthold Vöcking · Journal of the ACM · 2003 · 203 citations

, , +16

A Small Approximately Min-Wise Independent Family of Hash Functions

Piotr Indyk · Journal of Algorithms · 2001 · 180 citations

, , +12

A Clustering Based Approach to Perceptual Image Hashing

Vishal Monga, Amit Banerjee, Brian L. Evans · IEEE Transactions on Information Forensics and Security · 2006 · 121 citations

, , +12

1–5 of 52

Authors

100

  1. MT
    Mikkel Thorup

    AT&T (United States), United States

    6 publications · 260 citations

    6

    h-index

  2. MP
    Mihai Pǎtraşcu

    AT&T (United States), United States

    3 publications · 163 citations

    3

    h-index

  3. MD
    Martin Dietzfelbinger

    Technische Universität Ilmenau, Germany

    3 publications · 131 citations

    3

    h-index

  4. DR
    Douglas R. Stinson

    University of Waterloo, Canada

    3 publications · 132 citations

    3

    h-index

  5. RP
    Rasmus Pagh

    IT University of Copenhagen, Denmark

    3 publications · 93 citations

    3

    h-index

1–5 of 100

Institutions

71

  1. TU Dortmund University

    Dortmund, Germany

    5 h-index

    5 publications

    433 citations

  2. Stanford University

    Stanford, United States

    5 h-index

    5 publications

    606 citations

  3. AT&T (United States)

    Bedminster, United States

    4 h-index

    7 publications

    388 citations

  4. University of Waterloo

    Waterloo, Canada

    3 h-index

    4 publications

    125 citations

  5. Max Planck Society

    Munich, Germany

    2 h-index

    7 publications

    196 citations

  6. University of Copenhagen

    Copenhagen, Denmark

    2 h-index

    3 publications

    54 citations

  7. Technische Universität Ilmenau

    Ilmenau, Germany

    2 h-index

    2 publications

    103 citations

  8. The University of Texas at Austin

    Austin, United States

    2 h-index

    4 publications

    280 citations

1–8 of 71

Venues

  1. Designs Codes and Cryptography

    2 publications · 79 citations

    2

    h-index

  2. Journal of the ACM

    JACM · 2 publications · 298 citations

    2

    h-index

  3. arXiv (Cornell University)

    Repository · 2 publications · 89 citations

    2

    h-index

  4. SIAM Journal on Computing

    2 publications · 44 citations

    2

    h-index

  5. IACR Cryptology ePrint Archive

    Repository · 1 publications · 13 citations

    1

    h-index

1–5