{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T09:06:20Z","timestamp":1751879180003},"reference-count":25,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1996,10,1]],"date-time":"1996-10-01T00:00:00Z","timestamp":844128000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6133,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1996,10]]},"DOI":"10.1016\/0304-3975(95)00232-4","type":"journal-article","created":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T01:37:28Z","timestamp":1051753048000},"page":"391-405","source":"Crossref","is-referenced-by-count":16,"title":["Tree structure for distributive lattices and its applications"],"prefix":"10.1016","volume":"165","author":[{"given":"Michel","family":"Habib","sequence":"first","affiliation":[]},{"given":"Lhouari","family":"Nourine","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(95)00232-4_BIB1","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1145\/67544.66950"},{"issue":"2","key":"10.1016\/0304-3975(95)00232-4_BIB2","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1137\/0201008","article-title":"The transitive reduction of a directed graph","volume":"1","author":"Aho","year":"1972","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(95)00232-4_BIB3","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1145\/59287.59293","article-title":"Efficient implementation of lattice operations","volume":"11","author":"A\u00eft-Kaci","year":"1989","journal-title":"ACM Trans. Programming Languages Systems"},{"key":"10.1016\/0304-3975(95)00232-4_BIB4","article-title":"Lattice Theory","volume":"Vol. XXV","author":"Birkhoff","year":"1967"},{"key":"10.1016\/0304-3975(95)00232-4_BIB5","series-title":"Proc. OOPSLA'93","article-title":"Efficient handling of multiple inheritance hierarchies","author":"Caseau","year":"1993"},{"key":"10.1016\/0304-3975(95)00232-4_BIB6","article-title":"Mesures de la concurrence et du parall\u00e9lisme des calculs r\u00e9partis","author":"Charron-Bost","year":"1989"},{"key":"10.1016\/0304-3975(95)00232-4_BIB7","series-title":"Introduction to Lattices and Order","author":"Davey","year":"1991"},{"key":"10.1016\/0304-3975(95)00232-4_BIB8","series-title":"Inheritance Hierarchies in Knowledge Representation and Programming Languages","first-page":"223","article-title":"Masking and conflicts or to inherit is not to own!","author":"Ducournau","year":"1991"},{"key":"10.1016\/0304-3975(95)00232-4_BIB9","unstructured":"A. Fall, private communication. Simon Fraser University, Canada."},{"key":"10.1016\/0304-3975(95)00232-4_BIB10","series-title":"Proc. MFCS 79","first-page":"301","article-title":"A reduct-and-closure algorithm for graphs","author":"Goralcikova","year":"1979"},{"key":"10.1016\/0304-3975(95)00232-4_BIB11","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1016\/0097-3165(84)90085-2","article-title":"A Sperner theorem on unrelated chains of subsets","volume":"36","author":"Griggs","year":"1984","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/0304-3975(95)00232-4_BIB12","series-title":"Proc. KRUSE'95","first-page":"147","article-title":"Embedding partially ordered sets into chain-products","author":"Habib","year":"1995"},{"key":"10.1016\/0304-3975(95)00232-4_BIB13","unstructured":"M. Habib, R. Medina, L. Nourine and G. Steiner, Efficient algorithms on distributive lattices, preprint LIRMM 95-033."},{"key":"10.1016\/0304-3975(95)00232-4_BIB14","article-title":"Linear time recognition algorithm for distributive lattices","author":"Habib","year":"1993","journal-title":"R.R.LIRMM N\u00b0 93-013"},{"key":"10.1016\/0304-3975(95)00232-4_BIB15","series-title":"Proc. ORDAL'94","first-page":"1","article-title":"Bit-vector encoding for partially ordered sets","volume":"Vol. 831","author":"Habib","year":"1994"},{"key":"10.1016\/0304-3975(95)00232-4_BIB16","unstructured":"M. Habib, L. Nourine and G. Steiner, Gray codes for the ideals of interval orders, preprint LIRMM 94-017."},{"key":"10.1016\/0304-3975(95)00232-4_BIB17","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1137\/0213024","article-title":"Fast algorithms for finding nearest common ancestors","volume":"13","author":"Harel","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(95)00232-4_BIB18","series-title":"Proc. Workshop Structures in Concurrency Theory","article-title":"Linear space algorithm for on-line detection of global predicates","author":"Jegou","year":"1995"},{"key":"10.1016\/0304-3975(95)00232-4_BIB19","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1145\/359545.359563","article-title":"Time, clocks, and the ordering of events in a distributed system","volume":"21","author":"Lamport","year":"1978","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(95)00232-4_BIB20","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF00383950","article-title":"Primes, irreducibles and extremal lattices","volume":"9","author":"Markowsky","year":"1992","journal-title":"Order"},{"key":"10.1016\/0304-3975(95)00232-4_BIB21","series-title":"Parallel and Distributed Algorithms","first-page":"215","article-title":"Virtual time and global states of distributed systems","author":"Mattern","year":"1989"},{"key":"10.1016\/0304-3975(95)00232-4_BIB22","unstructured":"M. Morvan and L. Nourine, Simplicial elimination schemes, extremal lattices and maximal antichains lattice, preprint LIRMM 93; Order, to appear."},{"key":"10.1016\/0304-3975(95)00232-4_BIB23","article-title":"Quelques Propri\u00e9t\u00e9s algorithmiques des Treillis","author":"Nourine","year":"1993"},{"key":"10.1016\/0304-3975(95)00232-4_BIB24","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1137\/0205037","article-title":"Data types as lattices","author":"Scott","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(95)00232-4_BIB25","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0167-6377(86)90071-4","article-title":"An Algorithm to generate the ideals of a partial order","volume":"5","author":"Steiner","year":"1986","journal-title":"Oper. Res. Lett."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595002324?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595002324?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T17:20:43Z","timestamp":1578676843000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397595002324"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,10]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996,10]]}},"alternative-id":["0304397595002324"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(95)00232-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1996,10]]}}}