{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:47:55Z","timestamp":1725662875026},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540108283"},{"type":"electronic","value":"9783540387169"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1981]]},"DOI":"10.1007\/3-540-10828-9_67","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:25:58Z","timestamp":1330190758000},"page":"255-267","source":"Crossref","is-referenced-by-count":0,"title":["A class of tree-like UNION-FIND data structures and the nonlinearity"],"prefix":"10.1007","author":[{"given":"Marek J.","family":"Lao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"17_CR1","unstructured":"A.V. Aho, J.E. Hopcroft, J.D. Ullman, \"The design and analysis of computer algorithms\", Addison-Wesley, Reading, MA, 2-nd printing, 1975, 124\u2013139"},{"issue":"7","key":"17_CR2","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1145\/366622.366626","volume":"4","author":"B.W. Arden","year":"1961","unstructured":"B.W. Arden, B.A. Galler, R.M. Graham, An algorithm for equivalence declarations, Comm. ACM 4 (7) (1961) 310\u2013344","journal-title":"Comm. ACM"},{"key":"17_CR3","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1137\/0202024","volume":"2","author":"J.E. Hopcroft","year":"1973","unstructured":"J.E. Hopcroft, J.D. Ullman, Set merging algorithms, SIAM J. Comput. 2 (1973) 294\u2013303","journal-title":"SIAM J. Comput."},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"A. Kirschenbaum, R. van Slyke, Computing minimum spanning trees efficiently, Proc. 25th Annual Conf. of the ACM (1972) 518\u2013527","DOI":"10.1145\/800193.569966"},{"issue":"3","key":"17_CR5","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0304-3975(78)90009-9","volume":"6","author":"D.E. Knuth","year":"1978","unstructured":"D.E. Knuth, A. Sch\u00f6nhage, The expected linearity of a simple equivalence algorithm, Theoret. Comput. Sci. 6 (3) (1978) 281\u2013315","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR6","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0020-0190(79)90106-6","volume":"9","author":"M.J. Lao","year":"1979","unstructured":"M.J. Lao, A new data structure for the UNION-FIND problem, Inform. Processing Lett. 9 (1979) 39\u201345","journal-title":"Inform. Processing Lett."},{"issue":"2","key":"17_CR7","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 set union algorithm, J. ACM 22 (2) (1975) 215\u2013225","journal-title":"J. ACM"},{"key":"17_CR8","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1016\/0022-0000(79)90042-4","volume":"2","author":"R.E. Tarjan","year":"1979","unstructured":"R.E. Tarjan, A class of algorithms which require nonlinear time to maintain disjoint sets, J. Comp. System Sci. 2 (1979) 110\u2013127","journal-title":"J. Comp. System Sci."}],"container-title":["Lecture Notes in Computer Science","CAAP '81"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-10828-9_67.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T20:39:05Z","timestamp":1619555945000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-10828-9_67"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981]]},"ISBN":["9783540108283","9783540387169"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-10828-9_67","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1981]]}}}