A note on predecessor searching in the pointer machine model (Q989469)
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: A note on predecessor searching in the pointer machine model |
scientific article; zbMATH DE number 5773787
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on predecessor searching in the pointer machine model |
scientific article; zbMATH DE number 5773787 |
Statements
A note on predecessor searching in the pointer machine model (English)
0 references
20 August 2010
0 references
analysis of algorithms
0 references
data structures
0 references
predecessor searching
0 references
lower bound
0 references
pointer machine
0 references
0.8138917088508606
0 references
0.8048465847969055
0 references
0.8036575317382812
0 references
0.7962337732315063
0 references
0.784437894821167
0 references
