An Efficient Data Structure for Lattice Operations

DOI10.1137/S0097539794274404MaRDI QIDQ4268817zbMATH OpenOpenAlexFDO

Authors Maurizio Talamo, Paola Vocca

Publication date 28 October 1999

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0097539794274404

zbMATH Keywords

data structuregraph decompositionlatticesleast common ancestorsreachability

Mathematics Subject Classification ID

Lattices (06B99) Data structures (68P05) Data encryption (aspects in computer science) (68P25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• A data structure for lattice representation
• scientific article; zbMATH DE number 1554940
• Time and space efficient representations of distributive lattices
• An efficient implicit data structure for relation testing and searching in partially ordered sets

Cited in

(13)

• A data structure for lattice representation
• An efficient implicit data structure for relation testing and searching in partially ordered sets
• Fast algorithm for transformation of lattices
• Succinct posets
• Generalized Polychotomic Encoding: A Very Short Bit-Vector Encoding of Tree Hierarchies
• scientific article; zbMATH DE number 1554928 (Why is no real title available?)
• scientific article; zbMATH DE number 1554940 (Why is no real title available?)
• Efficient representation scheme for multidimensional array operations
• Time and space efficient representations of distributive lattices
• Representing graphs implicitly using almost optimal space
• Partial order bounding: A new approach to evaluation in game tree search
• The complexity of embedding orders into small products of chains
• Computing efficiently the lattice width in any dimension

This page was built for publication: An Efficient Data Structure for Lattice Operations

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