Searching for "Burst tries a fast, efficient data structure for string keys." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

Burst Tries: A Fast, Efficient Data Structure for String Keys
by Steffen Heinz, Justin Zobel, Hugh E. Williams — 2002 — ACM Transactions on Information Systems
…Burst Tries: A Fast, Efficient Data Structure for String Keys Steffen Heinz Justin Zobel ∗ Hugh E…
Cited by 15 (7 self) – Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB