An Efficient Data Structure for Lattice Operations
From MaRDI portal
Publication:4268817
DOI10.1137/S0097539794274404zbMath0927.06005MaRDI QIDQ4268817
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
68R10: Graph theory (including graph drawing) in computer science
68P25: Data encryption (aspects in computer science)
68P05: Data structures
06B99: Lattices
Related Items
Representing graphs implicitly using almost optimal space, Partial order bounding: A new approach to evaluation in game tree search, Succinct posets, The complexity of embedding orders into small products of chains, Join-reachability problems in directed graphs, Generalized Polychotomic Encoding: A Very Short Bit-Vector Encoding of Tree Hierarchies