{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T02:07:50Z","timestamp":1776305270075,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540898115","type":"print"},{"value":"9783540898122","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-89812-2_7","type":"book-chapter","created":{"date-parts":[[2008,11,18]],"date-time":"2008-11-18T12:12:44Z","timestamp":1227010364000},"page":"91-108","source":"Crossref","is-referenced-by-count":3,"title":["Quasi-Linear-Time Algorithms by Generalisation of Union-Find in CHR"],"prefix":"10.1007","author":[{"given":"Thom","family":"Fr\u00fchwirth","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0020-0190(79)90002-4","volume":"8","author":"B. Aspvall","year":"1979","unstructured":"Aspvall, B., Plass, M.F., Tarjan, R.E.: A linear time algorithm for testing the truth of certain quantified Boolean formulas. Information Processing Letters\u00a08, 121\u2013123 (1979)","journal-title":"Information Processing Letters"},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0024-3795(80)90162-7","volume":"34","author":"B. Aspvall","year":"1980","unstructured":"Aspvall, B., Shiloach, Y.: A fast algorithm for solving systems of linear equations with two variables per equation. Linear Algebra and its Applications\u00a034, 117\u2013124 (1980)","journal-title":"Linear Algebra and its Applications"},{"issue":"1","key":"7_CR3","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1145\/320064.320066","volume":"4","author":"C. Beeri","year":"1979","unstructured":"Beeri, C., Bernstein, P.A.: Computational problems related to the design of normal form relational schemas. ACM Trans. Database Syst.\u00a04(1), 30\u201359 (1979)","journal-title":"ACM Trans. Database Syst."},{"issue":"3","key":"7_CR4","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0743-1066(84)90014-1","volume":"1","author":"W.F. Dowling","year":"1984","unstructured":"Dowling, W.F., Gallier, J.H.: Linear-time algorithms for testing the satisfiability of propositional horn formulae. J. Log. Program.\u00a01(3), 267\u2013284 (1984)","journal-title":"J. Log. Program."},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-540-27775-0_7","volume-title":"Logic Programming","author":"G.J. Duck","year":"2004","unstructured":"Duck, G.J., Stuckey, P.J., Garc\u00eda de la Banda, M., Holzbaur, C.: The Refined Operational Semantics of Constraint Handling Rules. In: Demoen, B., Lifschitz, V. (eds.) ICLP 2004. LNCS, vol.\u00a03132, pp. 90\u2013104. Springer, Heidelberg (2004)"},{"key":"7_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-05138-2","volume-title":"Essentials of Constraint Programming","author":"T. Fr\u00fchwirth","year":"2003","unstructured":"Fr\u00fchwirth, T., Abdennadher, S.: Essentials of Constraint Programming. Springer, Heidelberg (2003)"},{"issue":"1\u20133","key":"7_CR7","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/S0743-1066(98)10005-5","volume":"37","author":"T. Fr\u00fchwirth","year":"1998","unstructured":"Fr\u00fchwirth, T.: Theory and Practice of Constraint Handling Rules, Special Issue on Constraint Logic Programming. Journal of Logic Programming\u00a037(1\u20133), 95\u2013138 (1998)","journal-title":"Journal of Logic Programming"},{"key":"7_CR8","unstructured":"Fr\u00fchwirth, T.: Deriving linear-time algorithms from union-find in chr. In: Schrijvers, T., Fr\u00fchwirth, T. (eds.) Third Workshop on Constraint Handling Rules, Venice, Italy (July 2006)"},{"key":"7_CR9","volume-title":"Constraint Handling Rules","author":"T. Fr\u00fchwirth","year":"2008","unstructured":"Fr\u00fchwirth, T.: Constraint Handling Rules. Cambridge University Press, Cambridge (to appear, 2008)"},{"issue":"3","key":"7_CR10","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1145\/116873.116878","volume":"23","author":"Z. Galil","year":"1991","unstructured":"Galil, Z., Italiano, G.F.: Data Structures and Algorithms for Disjoint Set Union Problems. ACM Comp. Surveys\u00a023(3), 319ff (1991)","journal-title":"ACM Comp. Surveys"},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"B. Joseph","year":"1956","unstructured":"Joseph, B., Kruskal, J.B.: On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society\u00a07, 48\u201350 (1956)","journal-title":"Proceedings of the American Mathematical Society"},{"issue":"1","key":"7_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0020-0190(88)90124-X","volume":"29","author":"M. Minoux","year":"1988","unstructured":"Minoux, M.: LTUR: a simplified linear-time unit resolution algorithm for Horn formulae and computer implementation. Information Processing Letters\u00a029(1), 1\u201312 (1988)","journal-title":"Information Processing Letters"},{"key":"7_CR13","unstructured":"Schrijvers, T., Fr\u00fchwirth, T.: Analysing the CHR Implementation of Union-Find. In: 19th Workshop on (Constraint) Logic Programming (W(C)LP 2005), Ulmer Informatik-Berichte 2005-01, University of Ulm, Germany (February 2005)"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Schrijvers, T., Fr\u00fchwirth, T.: Optimal union-find in constraint handling rules, programming pearl. Theory and Practice of Logic Programming (TPLP)\u00a06(1) (2006)","DOI":"10.1017\/S1471068405002541"},{"key":"7_CR15","unstructured":"Sneyers, J., Schrijvers, T., Demoen, B.: The Computational Power and Complexity of Constraint Handling Rules. In: Second Workshop on Constraint Handling Rules, at ICLP 2005, Sitges, Spain (October 2005)"},{"issue":"2","key":"7_CR16","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1145\/62.2160","volume":"31","author":"R.E. Tarjan","year":"1984","unstructured":"Tarjan, R.E., van Leeuwen, J.: Worst-case Analysis of Set Union Algorithms. J. ACM\u00a031(2), 245\u2013281 (1984)","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Recent Advances in Constraints"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-89812-2_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T14:31:30Z","timestamp":1557930690000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-89812-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540898115","9783540898122"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89812-2_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}