The effect of table expansion on the program complexity of perfect hash functions (Q1198971): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Collections of Functions for Perfect Hashing / 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: Inequalities: theory of majorization and its applications / rank | |||
Normal rank | |||
Latest revision as of 15:08, 16 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The effect of table expansion on the program complexity of perfect hash functions |
scientific article |
Statements
The effect of table expansion on the program complexity of perfect hash functions (English)
0 references
16 January 1993
0 references
perfect hashing
0 references
hash function complexity
0 references
