A data structure for lattice representation

This publication has 11 references indexed in Scilit:

• Dynamic reachability in planar digraphs with one source and one sink
  Theoretical Computer Science, 1993
• Fully Dynamic Point Location in a Monotone Subdivision
  SIAM Journal on Computing, 1989
• Efficient implementation of lattice operations
  ACM Transactions on Programming Languages and Systems, 1989
• A tradeoff between search and update time for the implicit dictionary problem
  Theoretical Computer Science, 1988
• Partial match retrieval in implicit data structures
  Information Processing Letters, 1984
• The representation of posets and lattices by sets
  Algebra universalis, 1980
• The Asymptotic Number of Lattices
  Published by Elsevier ,1980
• On the vector representation of the reachability in planar directed graphs
  Information Processing Letters, 1975
• Representations of lattices by sets
  Transactions of the American Mathematical Society, 1948
• Partially Ordered Sets
  American Journal of Mathematics, 1941