Storing a Sparse Table with <i>0</i> (1) Worst Case Access Time (Q3766870)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Storing a Sparse Table with 0 (1) Worst Case Access Time |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Storing a Sparse Table with <i>0</i> (1) Worst Case Access Time |
scientific article |
Statements
Storing a Sparse Table with <i>0</i> (1) Worst Case Access Time (English)
0 references
1984
0 references
Hashing
0 references
sparse tables
0 references
searching
0 references
data structure
0 references
query algorithm
0 references
