Succinct and I/O Efficient Data Structures for Traversal in Trees (Q3596711)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5500004
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Succinct and I/O Efficient Data Structures for Traversal in Trees |
scientific article; zbMATH DE number 5500004 |
Statements
Succinct and I/O Efficient Data Structures for Traversal in Trees (English)
0 references
29 January 2009
0 references
0.9873628616333008
0 references
0.7827795743942261
0 references
0.7811300754547119
0 references
0.7745810747146606
0 references
0.7745809555053711
0 references
