{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T22:19:09Z","timestamp":1759961949494},"reference-count":20,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[2001,6,1]],"date-time":"2001-06-01T00:00:00Z","timestamp":991353600000},"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":4429,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2001,6]]},"DOI":"10.1016\/s0166-218x(00)00258-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:59:10Z","timestamp":1027619950000},"page":"169-187","source":"Crossref","is-referenced-by-count":20,"title":["Efficient algorithms on distributive lattices"],"prefix":"10.1016","volume":"110","author":[{"given":"Michel","family":"Habib","sequence":"first","affiliation":[]},{"given":"Raoul","family":"Medina","sequence":"additional","affiliation":[]},{"given":"Lhouari","family":"Nourine","sequence":"additional","affiliation":[]},{"given":"George","family":"Steiner","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(00)00258-4_BIB1","series-title":"Lattice Theory, Coll. Publ. XXV, Vol. 25","author":"Birkhoff","year":"1967"},{"key":"10.1016\/S0166-218X(00)00258-4_BIB2","first-page":"1512","article-title":"Extensions et stratifications d'ensembles dispers\u00e9s","volume":"268","author":"Bonnet","year":"1969","journal-title":"C.R. Acad. Sci. S\u00e9r. A"},{"issue":"4","key":"10.1016\/S0166-218X(00)00258-4_BIB3","first-page":"265","article-title":"Calcul des id\u00e9aux d'un ordonn\u00e9 fini","volume":"25","author":"Bordat","year":"1991","journal-title":"Rech, Op\u00e9r.\/Oper. Res."},{"key":"10.1016\/S0166-218X(00)00258-4_BIB4","doi-asserted-by":"crossref","unstructured":"R. Cooper, K. Marzullo, Consistent detection of global predicates, Proceedings ACM\/ONR Workshop on Parallel and Distributed Debugging, Santa Cruz, California, May 1991, pp. 163\u2013173.","DOI":"10.1145\/122759.122774"},{"key":"10.1016\/S0166-218X(00)00258-4_BIB5","series-title":"Computing on-line the covering graph of the ideal lattice of posets, Technical Report","author":"Diehl","year":"1993"},{"key":"10.1016\/S0166-218X(00)00258-4_BIB6","doi-asserted-by":"crossref","unstructured":"C. Diehl, C. Jard, JX Rampon, Reachability analysis on distributed executions, in: Jouannaud Gaudel (Ed.), TAPSOFT, Lecture Notes in Computer Science, Vol. 688, Orsay, Springer, Berlin, April 1993, pp. 629\u2013643.","DOI":"10.1007\/3-540-56610-4_94"},{"key":"10.1016\/S0166-218X(00)00258-4_BIB7","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/BF00383449","article-title":"Finding all closed sets: a general approach","volume":"8","author":"Ganter","year":"1991","journal-title":"Order"},{"key":"10.1016\/S0166-218X(00)00258-4_BIB8","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/S0166-218X(00)00258-4_BIB9","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1016\/0304-3975(95)00232-4","article-title":"Tree structure for distributive lattices and its applications","volume":"165","author":"Habib","year":"1996","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0166-218X(00)00258-4_BIB10","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1006\/jagm.1997.0863","article-title":"Gray codes for the ideals of interval orders","volume":"25","author":"Habib","year":"1997","journal-title":"J. Algorithms"},{"key":"10.1016\/S0166-218X(00)00258-4_BIB11","series-title":"Structures in Concurrency Theory","first-page":"175","article-title":"Linear space algorithm for on-line detection of global predicates","author":"J\u00e9gou","year":"1995"},{"key":"10.1016\/S0166-218X(00)00258-4_BIB12","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1006\/jagm.1993.1044","article-title":"A gray code for the ideals of a forest poset","volume":"15","author":"Koda","year":"1993","journal-title":"J. Algorithms"},{"key":"10.1016\/S0166-218X(00)00258-4_BIB13","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\/S0166-218X(00)00258-4_BIB14","series-title":"Combinatorial Optimization, Algorithms and Complexity","author":"Papadimitriou","year":"1982"},{"key":"10.1016\/S0166-218X(00)00258-4_BIB15","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/BF01110545","article-title":"Gray codes from antimatroids","volume":"10","author":"Pruesse","year":"1993","journal-title":"Order"},{"key":"10.1016\/S0166-218X(00)00258-4_BIB16","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1137\/S0097539791202647","article-title":"Generating linear extensions fast","volume":"23","author":"Pruesse","year":"1994","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(00)00258-4_BIB17","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1137\/0210011","article-title":"Listing and counting subtrees of a tree","volume":"10","author":"Ruskey","year":"1981","journal-title":"SIAM. J. Comput."},{"key":"10.1016\/S0166-218X(00)00258-4_BIB18","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1137\/S0036144595295272","article-title":"A survey of combinatorial gray codes","volume":"39","author":"Savage","year":"1997","journal-title":"SIAM Rev."},{"key":"10.1016\/S0166-218X(00)00258-4_BIB19","unstructured":"M.B. Squire, Enumerating the ideals of a poset, preprint, North Carolina State University, 1995."},{"key":"10.1016\/S0166-218X(00)00258-4_BIB20","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0167-6377(86)90071-4","article-title":"An algorithm for generating the ideals of a partial order","volume":"5","author":"Steiner","year":"1986","journal-title":"Oper. Res. Lett."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00002584?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00002584?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T14:50:11Z","timestamp":1555685411000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X00002584"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,6]]},"references-count":20,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2001,6]]}},"alternative-id":["S0166218X00002584"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(00)00258-4","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2001,6]]}}}