Lower bounds for predecessor searching in the cell probe model (Q2475409)
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: Lower bounds for predecessor searching in the cell probe model |
scientific article; zbMATH DE number 5246770
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lower bounds for predecessor searching in the cell probe model |
scientific article; zbMATH DE number 5246770 |
Statements
Lower bounds for predecessor searching in the cell probe model (English)
0 references
11 March 2008
0 references
predecessor searching problem
0 references
cell probe model
0 references
data structures
0 references
lower bounds
0 references
0.8566139936447144
0 references
0.8454286456108093
0 references
0.8424453735351562
0 references
