LRM-trees: compressed indices, adaptive sorting, and compressed permutations (Q1758161)
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: LRM-trees: compressed indices, adaptive sorting, and compressed permutations |
scientific article; zbMATH DE number 6103620
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | LRM-trees: compressed indices, adaptive sorting, and compressed permutations |
scientific article; zbMATH DE number 6103620 |
Statements
LRM-trees: compressed indices, adaptive sorting, and compressed permutations (English)
0 references
8 November 2012
0 references
compressed data structures
0 references
range minimum queries
0 references
adaptive sorting algorithms
0 references
data structures for permutations
0 references
0 references
0.9963961839675904
0 references
0.7796791195869446
0 references
0.7453987002372742
0 references
0.7387072443962097
0 references
0.7357094287872314
0 references
