{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:50:58Z","timestamp":1725663058238},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540167617"},{"type":"electronic","value":"9783540398592"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1986]]},"DOI":"10.1007\/3-540-16761-7_73","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:51:56Z","timestamp":1330195916000},"page":"236-243","source":"Crossref","is-referenced-by-count":13,"title":["The set union problem with backtracking"],"prefix":"10.1007","author":[{"given":"Heikki","family":"Mannila","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Esko","family":"Ukkonen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"H.N.Gabow and R.E.Tarjan: A linear-time algorithm for a special case of disjoint set union. Proceedings of the 15th ACM Symposium on Theory of Computing (1983), 246\u2013251.","DOI":"10.1145\/800061.808753"},{"key":"25_CR2","unstructured":"C.J.Hogger: Introduction to Logic Programming. Academic Press, 1984."},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"H.Mannila and E.Ukkonen: On the complexity of unification sequences. Third International Conference on Logic Programming, London, July 14\u201318, 1986, to appear.","DOI":"10.1007\/3-540-16492-8_69"},{"issue":"2","key":"25_CR4","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1145\/321879.321884","volume":"22","author":"R.E. Tarjan","year":"1975","unstructured":"R.E. Tarjan: Efficiency of a good but not linear disjoint set union algorithm. J.ACM 22, 2 (April 1975), 215\u2013225.","journal-title":"J.ACM"},{"key":"25_CR5","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1016\/0022-0000(79)90042-4","volume":"18","author":"R.E. Tarjan","year":"1979","unstructured":"R.E. Tarjan: A class of algorithms which require nonlinear time to maintain disjoint sets. J. Computer and System Sciences 18 (1979), 110\u2013127.","journal-title":"J. Computer and System Sciences"},{"key":"25_CR6","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1137\/0606031","volume":"6","author":"R.E. Tarjan","year":"1985","unstructured":"R.E. Tarjan: Amortized computational complexity. SIAM J. Alg. Disc. Meth. 6 (1985), 306\u2013318.","journal-title":"SIAM J. Alg. Disc. Meth."},{"issue":"2","key":"25_CR7","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1145\/62.2160","volume":"31","author":"R.E. Tarjan","year":"1984","unstructured":"R.E. Tarjan and J. van Leeuwen: Worst-case analysis of set union algorithms. J.ACM 31, 2 (April 1984), 245\u2013281.","journal-title":"J.ACM"},{"key":"25_CR8","unstructured":"J. van Leeuwen and T. van der Weide: Alternative path compression techniques. Techn. Rep. RUU-CS-77-3, Rijksuniversiteit Utrecht, Utrecht, The Netherlands."},{"issue":"3","key":"25_CR9","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1145\/872734.806939","volume":"12","author":"D.H.D. Warren","year":"1977","unstructured":"D.H.D. Warren and L.M. Pereira: Prolog \u2014 the language and its implementation compared with LISP. ACM SIGPLAN Notices 12, 3 (August 1977), 109\u2013115.","journal-title":"ACM SIGPLAN Notices"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-16761-7_73.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:05:11Z","timestamp":1619557511000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-16761-7_73"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"ISBN":["9783540167617","9783540398592"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-16761-7_73","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1986]]}}}