Bit-probe lower bounds for succinct data structures (Q4910576)
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 6146317
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bit-probe lower bounds for succinct data structures |
scientific article; zbMATH DE number 6146317 |
Statements
Bit-Probe Lower Bounds for Succinct Data Structures (English)
0 references
19 March 2013
0 references
succinct data structure
0 references
nonbinary array
0 references
membership
0 references
lower bound
0 references
bit-probe
0 references
cell-probe
0 references
logarithmic forms
0 references
0.9967222809791564
0 references
0.8530465364456177
0 references
0.8494571447372437
0 references
0.8313570618629456
0 references
0.8235731720924377
0 references
