Concepedia

Minimal Perfect Hashing

Minimal Perfect Hashing is a type of perfect hash function that maps a given set of n keys to a range of exactly n consecutive integers, thereby achieving both collision-free hashing and minimal space usage.

51

Publications

2.3K

Citations

86

Authors

64

Institutions

Publications per year

2017–2026

7

Variants

Minimal Perfect Hash Function

Parents

Publications

51

Perfect hashing functions

Renzo Sprugnoli · Communications of the ACM · 1977 · 151 citations · Full text

, , +10

Minimal perfect hash functions made simple

Richard J. Cichelli · Communications of the ACM · 1980 · 136 citations · Full text

, , +16

An optimal algorithm for generating minimal perfect hash functions

Zbigniew J. Czech, George Havas, Bohdan S. Majewski · Information Processing Letters · 1992 · 111 citations

, , +14

A Family of Perfect Hashing Methods

Bohdan S. Majewski · The Computer Journal · 1996 · 109 citations

, , +13

Practical minimal perfect hash functions for large databases

Edward A. Fox, Lenwood S. Heath, Qi Fan Chen et al. · Communications of the ACM · 1992 · 107 citations · Full text

, , +12

1–5 of 51

Authors

86

  1. DB
    Djamal Belazzougui

    University of Helsinki, Finland

    6 publications · 257 citations

    6

    h-index

  2. RP
    Rasmus Pagh

    IT University of Copenhagen, Denmark

    5 publications · 285 citations

    5

    h-index

  3. EA
    Edward A. Fox

    Virginia Tech, United States

    5 publications · 233 citations

    5

    h-index

  4. LS
    Lenwood S. Heath

    Virginia Tech, United States

    5 publications · 233 citations

    5

    h-index

  5. PB
    Paolo Boldi

    University of Milan, Italy

    4 publications · 202 citations

    4

    h-index

1–5 of 86

Institutions

64

  1. Virginia Tech

    Blacksburg, United States

    4 h-index

    14 publications

    735 citations

  2. Istituto di Scienza e Tecnologie dell'Informazione "Alessandro Faedo"

    Pisa, Italy

    4 h-index

    5 publications

    249 citations

  3. IT University of Copenhagen

    Copenhagen, Denmark

    3 h-index

    3 publications

    188 citations

  4. University of California, Santa Cruz

    Santa Cruz, United States

    3 h-index

    5 publications

    147 citations

  5. University of Milan

    Milan, Italy

    3 h-index

    6 publications

    320 citations

  6. University of Kentucky

    Lexington, United States

    3 h-index

    3 publications

    94 citations

  7. Missouri University of Science and Technology

    Rolla, United States

    2 h-index

    2 publications

    74 citations

  8. Oregon State University

    Corvallis, United States

    2 h-index

    3 publications

    107 citations

1–8 of 64

Venues

  1. Communications of the ACM

    7 publications · 595 citations

    7

    h-index

  2. Journal of Combinatorial Designs

    JCD · 3 publications · 169 citations

    3

    h-index

  3. The Computer Journal

    2 publications · 126 citations

    2

    h-index

  4. ACM Journal of Experimental Algorithmics

    JEA · 2 publications · 88 citations

    2

    h-index

  5. Journal of Combinatorial Theory Series A

    2 publications · 99 citations

    2

    h-index

1–5