Home | english  | Impressum | Sitemap | KIT

LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations.

LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations.
Autor:

J. Barbay, J. Fischer, G. Navarro

Quelle:

Theoretical Computer Science 459 (1), 26–41, 2012