Parallel construction of succinct trees
item.contributor.advisor
ORCID:
Journal Title
Journal ISSN
Volume Title
Publisher
item.page.isbn
item.page.issn
item.page.issne
item.page.doiurl
item.page.extent
22 p.
item.page.accessRights
item.page.other
item.page.references
Abstract
Succinct representations of trees are an elegant solution to make large trees fit in main memory while still supporting navigational operations in constant time. However, their construction time remai...
Description
item.page.coverage.spatial
item.page.sponsorship
Citation
Fuentes-Sepúlveda, José; Ferres, Leo; He, Meng; Zeh, Norbert (2017).
Parallel construction of succinct trees,.Theoretical Computer Science Volume 700, 14 November 2017, Pages 1-22
item.page.dc.rights
item.page.dc.rights.url
Estadísticas de uso
1 0,8 0,5 0,3 0
Agosto 2025Septiembre 2025Octubre 2025Noviembre 2025Diciembre 2025Enero 2026Febrero 2026