A data structure for lattice representation

DOI10.1016/S0304-3975(96)00209-5zbMath0896.06006MaRDI QIDQ1392212

Paola Vocca, Maurizio Talamo

Publication date: 23 July 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

implicit data structurepartial lattice

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Lattices (06B99)

Related Items

A data structure for lattice representation ⋮ REACHABILITY ON SUFFIX TREE GRAPHS ⋮ Representing graphs implicitly using almost optimal space ⋮ Maximizing sharing of protected information

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Analysis of the Hilbert curve for representing two-dimensional space
• Dynamic reachability in planar digraphs with one source and one sink
• Partial match retrieval in implicit data structures
• A tradeoff between search and update time for the implicit dictionary problem
• The representation of posets and lattices by sets
• On the vector representation of the reachability in planar directed graphs
• The dimension of planar posets
• A data structure for lattice representation
• The Asymptotic Number of Lattices
• Fully Dynamic Point Location in a Monotone Subdivision
• Representations of Lattices by Sets