Time-space trade-offs for predecessor search (Q2931388)
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: Time-space trade-offs for predecessor search |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Time-space trade-offs for predecessor search |
scientific article |
Statements
Time-space trade-offs for predecessor search (English)
0 references
25 November 2014
0 references
cell-probe complexity
0 references
lower bounds
0 references
predecessor search
0 references
0.8968530893325806
0 references
0.8926840424537659
0 references
0.8675729632377625
0 references
0.8566139936447144
0 references
