Tree structure for distributive lattices and its applications

Theoretical Computer Science

Volumn 165, Issue 2, 1996, Pages 391-405

  Habib, Michel ^a   Nourine, Lhouari ^a  

^a LIRMM   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; MATHEMATICAL PROGRAMMING; PROGRAM DEBUGGING;

DISTRIBUTED PROGRAMMING; DISTRIBUTIVE LATTICES; SPACE COMPLEXITY; TIME COMPLEXITY;

TREES (MATHEMATICS);

EID: 0030257492     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(95)00232-4     Document Type: Article

References (25)

1. R. Agrawal, A. Bordiga and H.V. Jagadish, Efficient management of transitive relationship in large data bases, including IS-A hierarchies, presented at the 1989 ACM Sigmod Conf.
2. A.V. Aho, M.R. Garey and J.D. Ullman, The transitive reduction of a directed graph, SIAM J. Comput. 1 (2) (1972) 131-137.
3. H. Aït-Kaci, R. Boyer, P. Lincoln and R. Nasr, Efficient implementation of lattice operations, ACM Trans. Programming Languages Systems 11 (1989) 115-145.
4. G. Birkhoff, Lattice Theory, Coll. Publ., Vol. XXV (American Mathematical Society, Providence, RI, 3rd ed., 1967).
5. Y. Caseau, Efficient handling of multiple inheritance hierarchies, preprint 1993, in: Proc. OOPSLA'93 (ACM Press, New York, 1993) 271-287.
6. B. Charron-Bost, Mesures de la concurrence et du parallélisme des calculs répartis, Thèse de Doctorat, Université Paris VII, 1989.
7. B.A. Davey and H.A. Priestley, Introduction to Lattices and Order (Cambridge University Press, Cambridge, 1991).
8. R. Ducournau and M. Habib, Masking and conflicts or to inherit is not to own!, in: M. Lenzerini, D. Nardi and M. Simi, eds., Inheritance Hierarchies in Knowledge Representation and Programming Languages, Viareggio, février 1989 (Wiley, New York, 1991) 223-244.
9. A. Fall, private communication. Simon Fraser University, Canada.
10. A. Goralcikova and V. Koubek, A reduct-and-closure algorithm for graphs, in: Proc. MFCS 79 (Springer, Berlin, 1979) 301-307.
11. J.R. Griggs, J. Stahl and W.T. Trotter, A Sperner theorem on unrelated chains of subsets, J. Combin. Theory Ser. A 36 (1984) 124-127.
12. M. Habib, M. Huchard and L. Nourine, Embedding partially ordered sets into chain-products, in: Proc. KRUSE'95 (University of Santa-Cruz, 1995) 147-161.
13. M. Habib, R. Medina, L. Nourine and G. Steiner, Efficient algorithms on distributive lattices, preprint LIRMM 95-033.
14. M. Habib and L. Nourine, Linear time recognition algorithm for distributive lattices, R.R.LIRMM No93-013, Mars 1993; submitted.
15. M. Habib and L. Nourine, Bit-vector encoding for partially ordered sets, in: Proc. ORDAL'94, Lecture notes in Computer Science, Vol. 831 (Springer, Berlin, 1994) 1-12.
16. M. Habib, L. Nourine and G. Steiner, Gray codes for the ideals of interval orders, preprint LIRMM 94-017.
17. D. Harel and R.E. Tarjan, Fast algorithms for finding nearest common ancestors, SIAM J. Comput. 13 (1984) 338-355.
18. R. Jegou, R. Medina and L. Nourine, Linear space algorithm for on-line detection of global predicates, in: Proc. Workshop Structures in Concurrency Theory (Juin 1995).
19. L. Lamport, Time, clocks, and the ordering of events in a distributed system, Comm. ACM 21 (1978) 558-565.
20. G. Markowsky, Primes, irreducibles and extremal lattices, Order 9 (1992) 265-290.
21. F. Mattern, Virtual time and global states of distributed systems, in: M. Cosnard et al., eds., Parallel and Distributed Algorithms (Elsevier, Amsterdam, 1989) 215-226.
22. M. Morvan and L. Nourine, Simplicial elimination schemes, extremal lattices and maximal antichains lattice, preprint LIRMM 93; Order, to appear.
23. L. Nourine, Quelques Propriétés algorithmiques des Treillis, Thèse de Doctorat, Université de Montpellier II, Juin 1993.
24. D. Scott, Data types as lattices, SIAM J. Comput. (1976) 522-587.
25. G. Steiner, An Algorithm to generate the ideals of a partial order, Oper. Res. Lett. 5 (1986) 317-320.