{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T13:29:09Z","timestamp":1765546149893,"version":"3.41.0"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319436586"},{"type":"electronic","value":"9783319436593"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-43659-3_41","type":"book-chapter","created":{"date-parts":[[2016,8,8]],"date-time":"2016-08-08T02:54:01Z","timestamp":1470624841000},"page":"561-573","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Work-Efficient Parallel Union-Find with Applications to Incremental Graph Connectivity"],"prefix":"10.1007","author":[{"given":"Natcha","family":"Simsiri","sequence":"first","affiliation":[]},{"given":"Kanat","family":"Tangwongsan","sequence":"additional","affiliation":[]},{"given":"Srikanta","family":"Tirthapura","sequence":"additional","affiliation":[]},{"given":"Kun-Lung","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,8,9]]},"reference":[{"unstructured":"IBM Corporation: IBM Streams. http:\/\/www-03.ibm.com\/software\/products\/en\/ibm-streams . Accessed Feb 2016","key":"41_CR1"},{"doi-asserted-by":"crossref","unstructured":"Zaharia, M., Das, T., Li, H., Hunter, T., Shenker, S., Stoica, I.: Discretized streams: fault-tolerant streaming computation at scale. In: Proceedings of ACM Symposium on Operating Systems Principles (SOSP), pp. 423\u2013438 (2013)","key":"41_CR2","DOI":"10.1145\/2517349.2522737"},{"doi-asserted-by":"crossref","unstructured":"Simsiri, N., Tangwongsan, K., Tirthapura, S., Wu, K.L.: Work-efficient parallel and incremental graph connectivity. Technical report, arXiv (2016). https:\/\/arxiv.org\/","key":"41_CR3","DOI":"10.1002\/cpe.4333"},{"key":"41_CR4","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press, Cambridge (2009)","edition":"3"},{"issue":"2","key":"41_CR5","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1145\/321879.321884","volume":"22","author":"RE Tarjan","year":"1975","unstructured":"Tarjan, R.E.: Efficiency of a good but not linear set union algorithm. J. ACM 22(2), 215\u2013225 (1975)","journal-title":"J. ACM"},{"issue":"3","key":"41_CR6","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1137\/S0097539703439088","volume":"34","author":"R Seidel","year":"2005","unstructured":"Seidel, R., Sharir, M.: Top-down analysis of path compression. SIAM J. Comput. 34(3), 515\u2013525 (2005)","journal-title":"SIAM J. Comput."},{"issue":"2\u20133","key":"41_CR7","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/j.tcs.2005.09.013","volume":"348","author":"J Feigenbaum","year":"2005","unstructured":"Feigenbaum, J., Kannan, S., McGregor, A., Suri, S., Zhang, J.: On graph problems in a semi-streaming model. Theor. Comput. Sci. 348(2\u20133), 207\u2013216 (2005)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"41_CR8","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1145\/1644015.1644021","volume":"6","author":"C Demetrescu","year":"2009","unstructured":"Demetrescu, C., Finocchi, I., Ribichini, A.: Trading off space for passes in graph streaming problems. ACM Trans. Algorithms 6(1), 6 (2009)","journal-title":"ACM Trans. Algorithms"},{"issue":"44\u201346","key":"41_CR9","doi-asserted-by":"publisher","first-page":"3994","DOI":"10.1016\/j.tcs.2010.08.030","volume":"411","author":"C Demetrescu","year":"2010","unstructured":"Demetrescu, C., Escoffier, B., Moruz, G., Ribichini, A.: Adapting parallel algorithms to the W-stream model, withapplications to graph problems. Theor. Comput. Sci. 411(44\u201346), 3994\u20134004 (2010)","journal-title":"Theor. Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"McColl, R., Green, O., Bader, D.A.: A new parallel algorithm for connected components in dynamic graphs. In: 20th Annual International Conference on High PerformanceComputing, HiPC 2013, Bengaluru (Bangalore), Karnataka, India, 18\u201321 December 2013, pp. 246\u2013255 (2013)","key":"41_CR10","DOI":"10.1109\/HiPC.2013.6799108"},{"key":"41_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/978-3-642-14390-8_20","volume-title":"Parallel Processing and Applied Mathematics","author":"F Manne","year":"2010","unstructured":"Manne, F., Patwary, M.M.A.: A scalable parallel union-find algorithm for distributed memory computers. In: Wyrzykowski, R., Dongarra, J., Karczewski, K., Wasniewski, J. (eds.) PPAM 2009, Part I. LNCS, vol. 6067, pp. 186\u2013195. Springer, Heidelberg (2010)"},{"doi-asserted-by":"crossref","unstructured":"Berry, J., Oster, M., Phillips, C.A., Plimpton, S., Shead, T.M.: Maintaining connected components for infinite graph streams. In: Proceedings of 2nd International Workshop on Big Data, Streams and Heterogeneous Source Mining: Algorithms, Systems, Programming Models and Applications (BigMine), pp. 95\u2013102 (2013)","key":"41_CR12","DOI":"10.1145\/2501221.2501234"},{"doi-asserted-by":"crossref","unstructured":"Shun, J., Dhulipala, L., Blelloch, G.E.: A simple and practical linear-work parallel algorithm for connectivity. In: 26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2014, Prague, Czech Republic, pp. 143\u2013153 (2014)","key":"41_CR13","DOI":"10.1145\/2612669.2612692"},{"issue":"6","key":"41_CR14","doi-asserted-by":"publisher","first-page":"1046","DOI":"10.1137\/0220066","volume":"20","author":"H Gazit","year":"1991","unstructured":"Gazit, H.: An optimal randomized parallel algorithm for finding connected components in a graph. SIAM J. Comput. 20(6), 1046\u20131067 (1991)","journal-title":"SIAM J. Comput."},{"key":"41_CR15","volume-title":"An Introduction to Parallel Algorithms","author":"J J\u00e1J\u00e1","year":"1992","unstructured":"J\u00e1J\u00e1, J.: An Introduction to Parallel Algorithms. Addison-Wesley, Redwood City (1992)"},{"doi-asserted-by":"crossref","unstructured":"Anderson, R.J., Woll, H.: Wait-free parallel algorithms for the union-find problem. In: Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 5\u20138 May 1991, New Orleans, Louisiana, USA, pp. 370\u2013380 (1991)","key":"41_CR16","DOI":"10.1145\/103418.103458"},{"doi-asserted-by":"crossref","unstructured":"Kapron, B.M., King, V., Mountjoy, B.: Dynamic graph connectivity in polylogarithmic worst case time. In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, Louisiana, USA, 6\u20138 January 2013, pp. 1131\u20131142 (2013)","key":"41_CR17","DOI":"10.1137\/1.9781611973105.81"},{"issue":"3","key":"41_CR18","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1137\/0218041","volume":"18","author":"S Rajasekaran","year":"1989","unstructured":"Rajasekaran, S., Reif, J.H.: Optimal and sublogarithmic time randomized parallel sorting algorithms. SIAM J. Comput. 18(3), 594\u2013607 (1989)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2016: Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-43659-3_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,4]],"date-time":"2025-06-04T15:57:57Z","timestamp":1749052677000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-43659-3_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319436586","9783319436593"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-43659-3_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"9 August 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Euro-Par","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Grenoble","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 August 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"europar2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/europar2016.inria.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}