scientific article; zbMATH DE number 7286744
From MaRDI portal
Publication:5140782
DOI10.4230/LIPIcs.CPM.2018.18zbMath1497.68138arXiv1804.04263MaRDI QIDQ5140782
Alexander Schönhuth, Rayan Chikhi
Publication date: 16 December 2020
Full work available at URL: https://arxiv.org/abs/1804.04263
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Space-efficient data-analysis queries on grids
- Representing trees of higher degree
- On succinct representations of binary trees
- Improved range minimum queries
- Compressed suffix trees with full functionality
- Succinct Representation of Balanced Parentheses and Static Trees
- Fully Functional Static and Dynamic Succinct Trees
- Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
- Universal Succinct Representations of Trees?
- A unifying look at data structures
- Recursive Star-Tree Parallel Data Structure
- Engineering the LOUDS Succinct Tree Representation
This page was built for publication:
