Cache-oblivious string dictionaries
From MaRDI portal
Publication:3581547
DOI10.1145/1109557.1109621zbMath1192.68169MaRDI QIDQ3581547
Rolf Fagerberg, Gerth Stølting Brodal
Publication date: 16 August 2010
Published in: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1109557.1109621
Related Items
Non-Overlapping Indexing - Cache Obliviously, On the weak prefix-search problem, On Cartesian trees and range minimum queries, Cache-oblivious index for approximate string matching, Assembling approximately optimal binary search trees efficiently using arithmetics, I/O efficient dynamic data structures for longest prefix queries, I/O-efficient data structures for non-overlapping indexing, Sliding suffix tree, Succinct and I/O efficient data structures for traversal in trees, Fast Compressed Tries through Path Decompositions, On the Weak Prefix-Search Problem