{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,20]],"date-time":"2025-06-20T22:25:02Z","timestamp":1750458302528},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540292081"},{"type":"electronic","value":"9783540319474"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11562931_11","type":"book-chapter","created":{"date-parts":[[2005,10,8]],"date-time":"2005-10-08T13:28:42Z","timestamp":1128778122000},"page":"113-127","source":"Crossref","is-referenced-by-count":15,"title":["Parallelizing Union-Find in Constraint Handling Rules Using Confluence Analysis"],"prefix":"10.1007","author":[{"given":"Thom","family":"Fr\u00fchwirth","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0017444","volume-title":"Principles and Practice of Constraint Programming - CP97","author":"S. Abdennadher","year":"1997","unstructured":"Abdennadher, S.: Operational Semantics and Confluence of Constraint Propagation Rules. In: Smolka, G. (ed.) CP 1997. LNCS, vol.\u00a01330. Springer, Heidelberg (1997)"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Abdennadher, S., Fr\u00fchwirth, T., Holzbauz, C. (eds.): Special Issue on Constraint Handling Rules, Journal of Theory and Practice of Logic Programming (TPLP). Cambridge University Press (2005) (to appear)","DOI":"10.1017\/S1471068405002346"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Abdennadher, S., Fr\u00fchwirth, T., Meuss, H.: Confluence and Semantics of Constraint Simplification Rules. Constraints Journal\u00a04(2) (1999)","DOI":"10.1023\/A:1009842826135"},{"key":"11_CR4","first-page":"370","volume-title":"STOC 1991: Proceedings of the twenty-third annual ACM symposium on Theory of computing","author":"R.J. Anderson","year":"1994","unstructured":"Anderson, R.J., Woll, H.: Wait-free parallel algorithms for the union-find problem. In: STOC 1991: Proceedings of the twenty-third annual ACM symposium on Theory of computing, Revision of November 1994, pp. 370\u2013380. ACM Press, New York (1994)"},{"issue":"6","key":"11_CR5","doi-asserted-by":"publisher","first-page":"1049","DOI":"10.1145\/195613.195617","volume":"41","author":"M.J. Atallah","year":"1994","unstructured":"Atallah, M.J., Goodrich, M.T., Kosaraju, S.R.: Parallel algorithms for evaluating sequences of set-manipulation operations. J. ACM\u00a041(6), 1049\u20131088 (1994)","journal-title":"J. ACM"},{"key":"11_CR6","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., de la Banda, M.G., 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":"11_CR7","doi-asserted-by":"crossref","unstructured":"Fr\u00fchwirth, T.: Theory and Practice of Constraint Handling Rules, Special Issue on Constraint Logic Programming. Journal of Logic Programming, 95\u2013138 (October 1998)","DOI":"10.1016\/S0743-1066(98)10005-5"},{"key":"11_CR8","doi-asserted-by":"crossref","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":"3","key":"11_CR9","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), 319 (1991)","journal-title":"ACM Comp. Surveys"},{"key":"11_CR10","first-page":"182","volume-title":"IPPS 1996: Proceedings of the 10th International Parallel Processing Symposium","author":"M.C. Pinotti","year":"1996","unstructured":"Pinotti, M.C., Crupi, V.A., Das, S.K.: A parallel solution to the extended set union problem with unlimited backtracking. In: IPPS 1996: Proceedings of the 10th International Parallel Processing Symposium, Washington, DC, USA, pp. 182\u2013186. IEEE Computer Society, Los Alamitos (1996)"},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1145\/96709.96733","volume-title":"POPL 1990: Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages","author":"V.A. Saraswat","year":"1990","unstructured":"Saraswat, V.A., Rinard, M.: Concurrent constraint programming. In: POPL 1990: Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pp. 232\u2013245. ACM Press, New York (1990)"},{"key":"11_CR12","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1145\/99583.99627","volume-title":"POPL 1991: Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages","author":"V.A. Saraswat","year":"1991","unstructured":"Saraswat, V.A., Rinard, M., Panangaden, P.: The semantic foundations of concurrent constraint programming. In: POPL 1991: Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pp. 333\u2013352. ACM Press, New York (1991)"},{"key":"11_CR13","unstructured":"Schrijvers, T., Fr\u00fchwirth, T.: Union-Find in CHR. Technical Report CW389, Department of Computer Science, K.U.Leuven, Belgium (July 2004)"},{"key":"11_CR14","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":"11_CR15","unstructured":"Schrijvers, T., Fr\u00fchwirth, T.: CHR Website (May 2005), www.cs.kuleuven.ac.be\/~dtai\/projects\/CHR\/"},{"key":"11_CR16","unstructured":"Schrijvers, T., Fr\u00fchwirth, T.: Optimal Union-Find in Constraint Handling Rules, Programming Pearl. Journal of Theory and Practice of Logic Programming (TPLP) ( to appear)"},{"issue":"2","key":"11_CR17","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","Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11562931_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:52:04Z","timestamp":1605642724000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11562931_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540292081","9783540319474"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11562931_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}