A generalization of the trie data structure

DOI10.1017/S0960129500000803MaRDI QIDQ4862764zbMATH OpenOpenAlexFDO

Authors Richard H. Connelly, F. L. Morris

Publication date 27 June 1996

Published in Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0960129500000803

zbMATH Keywords

trie data structure

Mathematics Subject Classification ID

Data structures (68P05) Semantics in the theory of computing (68Q55)

Recommendations

• Generalizing generalized tries
• Towards a complete characterization of tries
• Sorting and searching by distribution: from generic discrimination to generic tries
• Profile of Tries
• scientific article; zbMATH DE number 3896283

Cites work

• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• Initial Algebra Semantics and Continuous Algebras
• The Category-Theoretic Solution of Recursive Domain Equations
• Using information systems to solve recursive domain equations

Cited in

(7)

• Type Fusion
• Generalizing generalized tries
• Computing runs on a trie
• Anatree
• A study of trie-like structures under the density model
• Sorting and searching by distribution: from generic discrimination to generic tries
• Nested session types

This page was built for publication: A generalization of the trie data structure

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