Compressed tries

DOI10.1145/360248.360258zbMATH Open0329.68037OpenAlexW2340098382MaRDI QIDQ4095864FDOQ4095864

Authors: Kurt Maly 

Publication date: 1976

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

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

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Information storage and retrieval of data (68P20) Algorithms in computer science (68W99)

Cited In (5)

• An Efficient Trie Construction for Natural Language Dictionaries
• A practical method for implementing string pattern matching machines
• An algorithm for dynamic processing of dawg's
• How to squeeze a lexicon
• A fast retrieval technique for large graph structures

This page was built for publication: Compressed tries

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