The cell probe complexity of succinct data structures (Q2373728)
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: The cell probe complexity of succinct data structures |
scientific article; zbMATH DE number 5171348
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The cell probe complexity of succinct data structures |
scientific article; zbMATH DE number 5171348 |
Statements
The cell probe complexity of succinct data structures (English)
0 references
16 July 2007
0 references
succinct data structures
0 references
cell probe complexity
0 references
polynomial evaluation with preprocessing
0 references
0 references
0 references
0 references
0 references
0.8622754216194153
0 references
0.8438361883163452
0 references
0.834658145904541
0 references
0.8313570618629456
0 references
0.7968489527702332
0 references
