\(E=I+T\): the internal extent formula for compacted tries

DOI10.1016/j.ipl.2010.12.012zbMath1260.68123arXiv1510.03675OpenAlexW1555405596MaRDI QIDQ1944889

Paolo Boldi, Sebastiano Vigna

Publication date: 28 March 2013

Published in: Information Processing Letters, Order (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1510.03675

zbMATH Keywords

information retrievaldata structuresdistributive latticeantichainsbinary treescompacted triesinternal path formulaAlexandrov completion

Mathematics Subject Classification ID

Partial orders, general (06A06) Trees (05C05) Transversal (matching) theory (05D15) Data structures (68P05) Ramsey theory (05D10) Total orders (06A05) Algebraic aspects of posets (06A11)

Related Items (3)

Efficient optimally lazy algorithms for minimal-interval semantics ⋮ A practical approach to testing random number generators in computer algebra systems ⋮ A modular extension for a computer algebra system

Uses Software

• OEIS

Cites Work

• Efficient optimally lazy algorithms for minimal-interval semantics
• Ordering the set of antichains of an ordered set
• Compressed data structures: Dictionaries and data-aware measures
• On closed elements in closure algebras
• Two Notes on Notation
• Catalan Numbers
• Meet-Irreducible Elements in Implicative Lattices
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: \(E=I+T\): the internal extent formula for compacted tries