The Complexity of Trie Index Construction

DOI10.1145/322017.322023zbMath0362.68136OpenAlexW2055858190MaRDI QIDQ4136634

Ravi Sethi, Douglas Comer

Publication date: 1977

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/322017.322023

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Information storage and retrieval of data (68P20) Algorithms in computer science (68W99)

Related Items (7)

Building efficient and compact data structures for simplicial complexes ⋮ A unifying framework for trie design heuristics ⋮ Effects of updates on optimality in tries ⋮ Unnamed Item ⋮ Adaptive pattern matching ⋮ Maximally permissive deadlock avoidance for resource allocation systems with R/W-locks ⋮ Universal retrieval trees

This page was built for publication: The Complexity of Trie Index Construction