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 this page instead for the normal view: Succinct data structures for searchable partial sums with optimal worst-case performance |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Succinct data structures for searchable partial sums with optimal worst-case performance |
scientific article |
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
