{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T00:10:18Z","timestamp":1758586218790,"version":"3.44.0"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032046994","type":"print"},{"value":"9783032047007","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T00:00:00Z","timestamp":1757548800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T00:00:00Z","timestamp":1757548800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-04700-7_28","type":"book-chapter","created":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T23:45:43Z","timestamp":1758498343000},"page":"376-390","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Shallow-Rotation Distance via\u00a0Forest Representations"],"prefix":"10.1007","author":[{"given":"Anoop","family":"S. K. M.","sequence":"first","affiliation":[]},{"given":"Jayalal","family":"Sarma","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,9,11]]},"reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"Belk, J.M., Brown, K.S.: Forest diagrams for elements of Thompson s group $$F$$. Int. J. Algebra Comput. 15(05n06), 815\u2013850 (2005)","DOI":"10.1142\/S021819670500261X"},{"issue":"1","key":"28_CR2","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1023\/A:1024971818319","volume":"99","author":"S Blake Fordham","year":"2003","unstructured":"Blake Fordham, S.: Minimal length elements of Thompson\u2019s group $$F$$. Geom. Dedicata. 99(1), 179\u2013220 (2003)","journal-title":"Geom. Dedicata."},{"key":"28_CR3","first-page":"215","volume":"42","author":"J Cannon","year":"1996","unstructured":"Cannon, J., Floyd, W., Parry, W.: Introductory notes on Richard Thompson s groups. Enseign. Math. 42, 215\u2013256 (1996)","journal-title":"Enseign. Math."},{"issue":"6","key":"28_CR4","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/S0020-0190(02)00315-0","volume":"84","author":"S Cleary","year":"2002","unstructured":"Cleary, S.: Restricted rotation distance between binary trees. Inf. Process. Lett. 84(6), 333\u2013338 (2002)","journal-title":"Inf. Process. Lett."},{"key":"28_CR5","doi-asserted-by":"publisher","first-page":"918","DOI":"10.1016\/j.ipl.2009.04.023","volume":"109","author":"S Cleary","year":"2009","unstructured":"Cleary, S., John, K.S.: Rotation distance is fixed-parameter tractable. Inf. Process. Lett. 109, 918\u2013922 (2009)","journal-title":"Inf. Process. Lett."},{"key":"28_CR6","doi-asserted-by":"publisher","unstructured":"Cleary, S., St. John, K.: A linear-time approximation algorithm for rotation distance. J. Graph Algorithms Appl. 14(2), 385\u2013390 (2010). https:\/\/doi.org\/10.7155\/jgaa.00212","DOI":"10.7155\/jgaa.00212"},{"issue":"1","key":"28_CR7","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0020-0190(82)90083-7","volume":"15","author":"K Culik","year":"1982","unstructured":"Culik, K., Wood, D.: A note on some tree similarity measures. Inf. Process. Lett. 15(1), 39\u201342 (1982)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"28_CR8","doi-asserted-by":"publisher","first-page":"1316","DOI":"10.1016\/j.aim.2009.09.016","volume":"223","author":"P Dehornoy","year":"2010","unstructured":"Dehornoy, P.: On the rotation distance between binary trees. Adv. Math. 223(4), 1316\u20131355 (2010)","journal-title":"Adv. Math."},{"key":"28_CR9","unstructured":"Knuth, D.E.: The art of Computer Programming, volume 3: (2nd ed.) Sorting and Searching. Addison Wesley Longman Publishing Inc., USA (1998)"},{"key":"28_CR10","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1093\/comjnl\/47.2.259","volume":"47","author":"JM Lucas","year":"2004","unstructured":"Lucas, J.M.: Untangling binary trees via rotations. Comput. J. 47, 259\u2013269 (2004)","journal-title":"Comput. J."},{"key":"28_CR11","unstructured":"Michaud, N.: A three-element generating set for Thompson\u2019s group $$F$$. Senior Projects 2007-2010 Archival Collection. 490 (2009)"},{"issue":"3","key":"28_CR12","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/S0020-0190(00)00008-9","volume":"73","author":"J Pallo","year":"2000","unstructured":"Pallo, J.: An efficient upper bound of the rotation distance of binary trees. Inf. Process. Lett. 73(3), 87\u201392 (2000)","journal-title":"Inf. Process. Lett."},{"key":"28_CR13","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.aim.2014.02.035","volume":"259","author":"L Pournin","year":"2014","unstructured":"Pournin, L.: The diameter of associahedra. Adv. Math. 259, 13\u201342 (2014)","journal-title":"Adv. Math."},{"key":"28_CR14","doi-asserted-by":"crossref","unstructured":"Anoop, S. K. M., Sarma, J.: On rotation distance of rank bounded trees. Fundamenta Informaticae 191(2), 79\u2013104 (2024)","DOI":"10.3233\/FI-242173"},{"key":"28_CR15","doi-asserted-by":"crossref","unstructured":"Sleator, D.D., Tarjan, R.E., Thurston, W.P.: Rotation distance, triangulations, and hyperbolic geometry. In: Proceedings of the 18th Symposium on Theory of Computing (STOC 86), pp. 122\u2013135 (1986)","DOI":"10.1145\/12130.12143"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-04700-7_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T23:45:44Z","timestamp":1758498344000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-04700-7_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,11]]},"ISBN":["9783032046994","9783032047007"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-04700-7_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,11]]},"assertion":[{"value":"11 September 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FCT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Fundamentals of Computation Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Wroc\u0142aw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fct2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/fct.ii.uni.wroc.pl","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}