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 the normal view instead:
scientific article; zbMATH DE number 4024809
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Storing a Sparse Table with <i>0</i> (1) Worst Case Access Time |
scientific article; zbMATH DE number 4024809 |
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
0.8187531232833862
0 references
0.7799707055091858
0 references
0.7609453797340393
0 references
0.7576441168785095
0 references
0.7571122050285339
0 references
