{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T09:13:36Z","timestamp":1775639616024,"version":"3.50.1"},"reference-count":17,"publisher":"EDP Sciences","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[1993]]},"DOI":"10.1051\/ita\/1993270403411","type":"journal-article","created":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T09:59:52Z","timestamp":1486029592000},"page":"341-348","source":"Crossref","is-referenced-by-count":12,"title":["An algorithm to compute the m\u00f6bius function of the rotation lattice of binary trees"],"prefix":"10.1051","volume":"27","author":[{"given":"J. M.","family":"Pallo","sequence":"first","affiliation":[]}],"member":"250","published-online":{"date-parts":[[2011,1,8]]},"reference":[{"key":"R1","unstructured":"1. BENNET M. K. and BIRKHOFF G., Two families of Newman lattices, to appear.12870190810.06006"},{"key":"R2","doi-asserted-by":"crossref","unstructured":"2. BONNIN A. et PALLO J. M., A-transformation dans les arbres n-aires, Discrete Math., 45, 1983, pp. 153-163.7042320504.68040","DOI":"10.1016\/0012-365X(83)90032-8"},{"key":"R3","doi-asserted-by":"crossref","unstructured":"3. CHAMENI-NEMBUA C. and MONJARDET B., Les treillis pseudocompl\u00e9ment\u00e9s finis, Europ. J. Combinatorics, 13, 1992, pp.89-107.11588030759.06010","DOI":"10.1016\/0195-6698(92)90041-W"},{"key":"R4","unstructured":"4. FELLER W., An introduction to probability theory and its applications, John Wiley, New-York, 1957.880810077.12201"},{"key":"R5","doi-asserted-by":"crossref","unstructured":"5. FRIEDMAN H. and TAMARI D., Probl\u00e8mes d'associativit\u00e9 : une structure de treillis fini induite par une loi demi-associative, J. Combinat. Theory, 2, 1967, pp. 215-242.2389840158.01904","DOI":"10.1016\/S0021-9800(67)80024-3"},{"key":"R6","doi-asserted-by":"crossref","unstructured":"6. GR\u00c4TZER G., General lattice theory, Academic Press, New-York, 1978.5092130436.06001","DOI":"10.1007\/978-3-0348-7633-9"},{"key":"R7","doi-asserted-by":"crossref","unstructured":"7. GREENE C., The M\u00f6bius function of a partially ordered set, in: Ordered sets, I. Rival \u00e9d., D. Reidel Publishing Company, 1982, pp. 555-581.6613060491.06004","DOI":"10.1007\/978-94-009-7798-3_18"},{"key":"R8","doi-asserted-by":"crossref","unstructured":"8. HALL P., The Eulerian functions of a group, Quart. J. Math. Oxford Ser., 1936, pp. 134-151.0014.1040262.0082.02","DOI":"10.1093\/qmath\/os-7.1.134"},{"key":"R9","doi-asserted-by":"crossref","unstructured":"9. HUANG S. and TAMARI D., Problems of associativity: a simple proof for the lattice property of systems ordered by a semi-associative law, J. Combinat, Theory, (A) 13, 1972, pp. 7-13.3060640248.06003","DOI":"10.1016\/0097-3165(72)90003-9"},{"key":"R10","doi-asserted-by":"crossref","unstructured":"10. MARKOWSKY G., The factorization and representation of lattices, Trans. Amer. Math. Soc., 203, 1975, pp. 185-200.3603860302.06011","DOI":"10.2307\/1997078"},{"key":"R11","doi-asserted-by":"crossref","unstructured":"11. PALLO J. M., Enumeration, ranking and unranking binary trees, Computer J., 29, 1986, pp. 171-175.8416780585.68066","DOI":"10.1093\/comjnl\/29.2.171"},{"key":"R12","doi-asserted-by":"crossref","unstructured":"12. PALLO J. M., On the rotation distance in the lattice of binary trees, Inform. Process. Lett., 25, 1987, pp. 369-373.905781","DOI":"10.1016\/0020-0190(87)90214-6"},{"key":"R13","doi-asserted-by":"crossref","unstructured":"13. PALLO J. M., Some properties of the rotation lattice of binary trees, Computer J., 31, 1988, pp. 564-565.9746560654.06008","DOI":"10.1093\/comjnl\/31.6.564"},{"key":"R14","doi-asserted-by":"crossref","unstructured":"14. PALLO J. M., A distance metric on binary trees using lattice-theoretic measures, Inform. Process. Lett., 34, 1990, pp. 113-116.10599740695.68017","DOI":"10.1016\/0020-0190(90)90088-F"},{"key":"R15","unstructured":"15. ROELANTS van BARONAIGIEN D. and RUSKEY F., A Hamilton path in the rotation lattice of binary trees, Congr. Numer., 59, 1987, pp. 313-318.9449710647.05038"},{"key":"R16","doi-asserted-by":"crossref","unstructured":"16. ROTA G. C., On the foundations of combinatorial theory I. Theory of M\u00f6bius functions, Z. Wahrscheinlichkeitstheorie, 2, 1964, pp. 340-3681744870121.02406","DOI":"10.1007\/BF00531932"},{"key":"R17","doi-asserted-by":"crossref","unstructured":"17. SLEATOR D. D., TARJAN R. E. and THURSTON W. P., Rotation distance, triangulations and hyperbolic geometry, Journal of the American Mathematical Society, 1988, pp. 647-681.9289040653.51017","DOI":"10.2307\/1990951"}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1993270403411\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T01:56:47Z","timestamp":1568771807000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1993270403411"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"references-count":17,"journal-issue":{"issue":"4"},"alternative-id":["ita1993270403411"],"URL":"https:\/\/doi.org\/10.1051\/ita\/1993270403411","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993]]}}}