A Linear Time Algorithm for Finding Minimal Perfect Hash Functions (Q3140119): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1093/comjnl/36.6.579 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2135619017 / rank | |||
Normal rank | |||
Latest revision as of 21:38, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Linear Time Algorithm for Finding Minimal Perfect Hash Functions |
scientific article |
Statements
A Linear Time Algorithm for Finding Minimal Perfect Hash Functions (English)
0 references
6 May 1994
0 references
perfect hash functions
0 references
pseudorandom functions
0 references
random bipartite graphs
0 references
