{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:21:34Z","timestamp":1725549694783},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540281016"},{"type":"electronic","value":"9783540317111"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11534273_2","type":"book-chapter","created":{"date-parts":[[2010,3,12]],"date-time":"2010-03-12T13:31:47Z","timestamp":1268400707000},"page":"2-13","source":"Crossref","is-referenced-by-count":1,"title":["k-Restricted Rotation with an Application to Search Tree Rebalancing"],"prefix":"10.1007","author":[{"given":"Alejandro Almeida","family":"Ruiz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabrizio","family":"Luccio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonio Mesa","family":"Enriquez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Linda","family":"Pagli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","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. Information Processing Letters\u00a084, 333\u2013338 (2002)","journal-title":"Information Processing Letters"},{"issue":"5","key":"2_CR2","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/j.ipl.2003.08.004","volume":"88","author":"S. Cleary","year":"2003","unstructured":"Cleary, S., Taback, J.: Bounding restricted rotation distance. Information Processing Letters\u00a088(5), 251\u2013256 (2003)","journal-title":"Information Processing Letters"},{"key":"2_CR3","volume-title":"The Art of Computer Algorithms: Sorting and Searching","author":"D.E. Knuth","year":"1973","unstructured":"Knuth, D.E.: The Art of Computer Algorithms: Sorting and Searching, vol.\u00a03. Addison-Wesley, Reading (1973)"},{"issue":"2","key":"2_CR4","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0020-0190(89)90069-0","volume":"31","author":"F. Luccio","year":"1989","unstructured":"Luccio, F., Pagli, L.: On the upper bound on the rotation distance of binary trees. Information Processing Letters\u00a031(2), 57\u201360 (1989)","journal-title":"Information Processing Letters"},{"key":"2_CR5","unstructured":"Luccio, F., Pagli, L.: General restricted rotation distance, Universit\u2018a di Pisa, Dipartimento di Informatic\u00e0, Tech. Rep. TR-04-22 (2004)"},{"issue":"5","key":"2_CR6","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/0020-0190(88)90153-6","volume":"26","author":"E. M\u00e4kinen","year":"1988","unstructured":"M\u00e4kinen, E.: On the rotation distance of binary trees. Information Processing Letters\u00a026(5), 271\u2013272 (1988)","journal-title":"Information Processing Letters"},{"issue":"3-4","key":"2_CR7","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. Information Processing Letters\u00a073(3-4), 87\u201392 (2000)","journal-title":"Information Processing Letters"},{"key":"2_CR8","unstructured":"Rogers, R.: On finding shortest paths in the rotation graph of binary trees. In: Proc. Southeastern Internat. Conf. on Combinatorics, Graph Theory, and Computing, vol.\u00a0137, pp. 77\u201395 (1999)"},{"issue":"3","key":"2_CR9","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1090\/S0894-0347-1988-0928904-4","volume":"1","author":"D.D. Sleator","year":"1988","unstructured":"Sleator, D.D., Tarjan, R.E., Thurston, W.R.: Rotation distance, triangulations, and hyperbolic geometry. J. Amer. Math. Soc.\u00a01(3), 647\u2013681 (1988)","journal-title":"J. Amer. Math. Soc."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11534273_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:09:54Z","timestamp":1605643794000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11534273_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540281016","9783540317111"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/11534273_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}