The Complexity of Trie Index Construction

DOI10.1145/322017.322023MaRDI QIDQ4136634zbMATH OpenOpenAlexFDO

Authors Douglas Comer, Ravi Sethi

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

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

Cited in

(7)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4136634)