An optimal algorithm for generating minimal perfect hash functions (Q1199953): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3682518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Letter-oriented Minimal Perfect Hashing Scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4201415 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4038677 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Storing a Sparse Table with <i>0</i> (1) Worst Case Access Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692507 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algebraic approach to Cichelli's perfect hashing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reciprocal hashing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The expected linearity of a simple equivalence algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case Analysis of Set Union Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal perfect hashing in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Expected Performance of Path Compression Algorithms / rank
 
Normal rank

Revision as of 12:53, 17 May 2024

scientific article
Language Label Description Also known as
English
An optimal algorithm for generating minimal perfect hash functions
scientific article

    Statements

    An optimal algorithm for generating minimal perfect hash functions (English)
    0 references
    0 references
    0 references
    0 references
    17 January 1993
    0 references
    0 references
    0 references
    0 references
    0 references
    probabilistic algorithms
    0 references
    hashing
    0 references
    random graphs
    0 references