Tree structure for distributive lattices and its applications
Open Access
- 10 October 1996
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 165 (2) , 391-405
- https://doi.org/10.1016/0304-3975(95)00232-4
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Primes, irreducibles and extremal latticesOrder, 1992
- Efficient management of transitive relationships in large data and knowledge basesPublished by Association for Computing Machinery (ACM) ,1989
- Efficient implementation of lattice operationsACM Transactions on Programming Languages and Systems, 1989
- An algorithm to generate the ideals of a partial orderOperations Research Letters, 1986
- Fast Algorithms for Finding Nearest Common AncestorsSIAM Journal on Computing, 1984
- A Sperner theorem on unrelated chains of subsetsJournal of Combinatorial Theory, Series A, 1984
- Time, clocks, and the ordering of events in a distributed systemCommunications of the ACM, 1978
- Data Types as LatticesSIAM Journal on Computing, 1976
- The Transitive Reduction of a Directed GraphSIAM Journal on Computing, 1972