A generalization of the trie data structure

DOI10.1017/S0960129500000803zbMATH Open0840.68029OpenAlexW1989110026MaRDI QIDQ4862764FDOQ4862764

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

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

zbMATH Keywords

trie data structure

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• The Category-Theoretic Solution of Recursive Domain Equations
• Initial Algebra Semantics and Continuous Algebras
• Using information systems to solve recursive domain equations

Cited In (7)

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

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)