Fast Compressed Tries through Path Decompositions (Q2828185): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: succinct / rank | |||
Normal rank | |||
Revision as of 11:09, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast Compressed Tries through Path Decompositions |
scientific article |
Statements
Fast Compressed Tries through Path Decompositions (English)
0 references
24 October 2016
0 references
succinct data structures
0 references
monotone perfect hash functions
0 references
string dictionaries
0 references
tries
0 references
