↧
Answer by jbapple for Simple and cache-oblivious tries on fixed-length strings
Update: An idea very similar to this one is described in "Digital Access to Comparison-Based Tree Data Structures and Algorithms".Here's an idea for a structure that might meet these bounds.It uses an...
View ArticleSimple and cache-oblivious tries on fixed-length strings
Is there a simple and cache-oblivious data structure that solves the dynamic predecessor problem for strings of length exactly $k$ over an alphabet $A$ in worst-case $O((k\log A)/B + \log n)$ memory...
View Article
More Pages to Explore .....