Minimal perfect hashing in polynomial time (Q911304): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4091421 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fast modular transforms / 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: Q5586854 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Reciprocal hashing / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3231253 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Perfect hashing functions / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf02017345 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2040532663 / rank | |||
Normal rank |
Latest revision as of 09:37, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Minimal perfect hashing in polynomial time |
scientific article |
Statements
Minimal perfect hashing in polynomial time (English)
0 references
1990
0 references
searching
0 references
minimal perfect hashing
0 references
complexity
0 references