Succinct data structures for searchable partial sums with optimal worst-case performance (Q719256)
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 5955878
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Succinct data structures for searchable partial sums with optimal worst-case performance |
scientific article; zbMATH DE number 5955878 |
Statements
Succinct data structures for searchable partial sums with optimal worst-case performance (English)
0 references
10 October 2011
0 references
succinctness
0 references
succinct indexing scheme
0 references
0 references
0.9289225339889526
0 references
0.885588526725769
0 references
0.8347023725509644
0 references
0.8219994902610779
0 references
