Succinct data structures for searchable partial sums with optimal worst-case performance (Q719256): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2011.05.023 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2055070832 / rank | |||
Normal rank | |||
Revision as of 01:32, 20 March 2024
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
