Faster Searching in Tries and Quadtrees - An Analysis of Level Compression

Authors:
Arne Andersson;Stefan Nilsson
Affiliations:
-;-
Venue:
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
Year:
1994

Citing 0
Cited 4

Scalable high-speed prefix matching

ACM Transactions on Computer Systems (TOCS)
On the average depth of asymmetric LC-tries

Information Processing Letters
On the average depth of asymmetric LC-tries

Information Processing Letters
Analysis of a class of tries with adaptive multi-digit branching

WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures

Quantified Score

Hi-index	0.00

Visualization

Abstract