Skip to search formSkip to main contentSkip to account menu

Engineering Predecessor Data Structures for Dynamic Integer Sets

This work engineer a simple implementation of the idea of universe reduction, similar to van-Emde-Boas trees, and three B-trees with different strategies for organizing the keys contained in the nodes, including an implementation of dynamic fusion nodes.
arXiv (opens in a new tab)

Practical Performance of Space Efficient Data Structures for Longest Common Extensions

This article presents well-engineered implementations of two new solutions to string synchronizing sets and shows that both perform extremely well in practice, with space consumption of only around 10% of the input size for string synchronizing sets and around 20% for highly repetitive texts.
Publisher (opens in a new tab)
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)