{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T20:45:30Z","timestamp":1777581930329,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,7,11]],"date-time":"2016-07-11T00:00:00Z","timestamp":1468195200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"The Intel Science and Technology Center"},{"name":"NSF","award":["CCF-1533858"],"award-info":[{"award-number":["CCF-1533858"]}]},{"name":"NSF","award":["CCF-1314590"],"award-info":[{"award-number":["CCF-1314590"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,7,11]]},"DOI":"10.1145\/2935764.2935768","type":"proceedings-article","created":{"date-parts":[[2016,7,8]],"date-time":"2016-07-08T15:03:00Z","timestamp":1467990180000},"page":"253-264","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":32,"title":["Just Join for Parallel Ordered Sets"],"prefix":"10.1145","author":[{"given":"Guy E.","family":"Blelloch","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Ferizovic","sequence":"additional","affiliation":[{"name":"Karlsruhe Institute of Technology, Karlsruhe, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yihan","family":"Sun","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,7,11]]},"reference":[{"key":"e_1_3_2_1_2_1","volume-title":"Efficient sets--a balancing act. Journal of functional programming, 3(04):553--561","author":"Adams S.","year":"1993","unstructured":"S. Adams . Efficient sets--a balancing act. Journal of functional programming, 3(04):553--561 , 1993 . S. Adams. Efficient sets--a balancing act. Journal of functional programming, 3(04):553--561, 1993."},{"key":"e_1_3_2_1_3_1","first-page":"263","article-title":"An algorithm for the organization of information","volume":"145","author":"Adelson-Velsky G.","year":"1962","unstructured":"G. Adelson-Velsky and E. M. Landis . An algorithm for the organization of information . Proc. of the USSR Academy of Sciences , 145 : 263 -- 266 , 1962 . In Russian, English translation by Myron J. Ricci in Soviet Doklady, 3:1259--1263, 1962. G. Adelson-Velsky and E. M. Landis. An algorithm for the organization of information. Proc. of the USSR Academy of Sciences, 145:263--266, 1962. In Russian, English translation by Myron J. Ricci in Soviet Doklady, 3:1259--1263, 1962.","journal-title":"Proc. of the USSR Academy of Sciences"},{"key":"e_1_3_2_1_4_1","volume-title":"Fast parallel operations on search trees. arXiv preprint arXiv:1510.05433","author":"Akhremtsev Y.","year":"2015","unstructured":"Y. Akhremtsev and P. Sanders . Fast parallel operations on search trees. arXiv preprint arXiv:1510.05433 , 2015 . Y. Akhremtsev and P. Sanders. Fast parallel operations on search trees. arXiv preprint arXiv:1510.05433, 2015."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00289509"},{"key":"e_1_3_2_1_6_1","volume-title":"Parallel ordered sets using join. arXiv preprint arXiv:1602.02120","author":"Blelloch G.","year":"2016","unstructured":"G. Blelloch , D. Ferizovic , and Y. Sun . Parallel ordered sets using join. arXiv preprint arXiv:1602.02120 , 2016 . G. Blelloch, D. Ferizovic, and Y. Sun. Parallel ordered sets using join. arXiv preprint arXiv:1602.02120, 2016."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/277651.277660"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(80)90018-3"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793259471"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/321812.321815"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1693453.1693488"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/322123.322127"},{"key":"e_1_3_2_1_13_1","volume-title":"In Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"Demaine E. D.","year":"2000","unstructured":"E. D. Demaine , A. L\u00f3pez-Ortiz , and J. I. Munro . Adaptive set intersections, unions, and differences . In In Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , 2000 . E. D. Demaine, A. L\u00f3pez-Ortiz, and J. I. Munro. Adaptive set intersections, unions, and differences. In In Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2000."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-07959-2_10"},{"key":"e_1_3_2_1_15_1","first-page":"49","volume-title":"Euro-Par 2007 Workshops: Parallel Processing, HPPC 2007, UNICORE Summit 2007, and VHPC 2007","author":"Frias L.","year":"2007","unstructured":"L. Frias and J. Singler . Parallelization of bulk operations for STL dictionaries . In Euro-Par 2007 Workshops: Parallel Processing, HPPC 2007, UNICORE Summit 2007, and VHPC 2007 , pages 49 -- 58 , 2007 . L. Frias and J. Singler. Parallelization of bulk operations for STL dictionaries. In Euro-Par 2007 Workshops: Parallel Processing, HPPC 2007, UNICORE Summit 2007, and VHPC 2007, pages 49--58, 2007."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796811000104"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/0201004"},{"key":"e_1_3_2_1_18_1","volume-title":"Proceedings of the 17th Annual Computer Science Conference","author":"Katajainen J.","year":"1994","unstructured":"J. Katajainen . Efficient parallel algorithms for manipulating sorted sets . In Proceedings of the 17th Annual Computer Science Conference . University of Canterbury , 1994 . J. Katajainen. Efficient parallel algorithms for manipulating sorted sets. In Proceedings of the 17th Annual Computer Science Conference. University of Canterbury, 1994."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/320613.320619"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2000.1705"},{"key":"e_1_3_2_1_21_1","volume-title":"Haskell 2010 language report. Available online http:\/\/www. haskell. org\/(May","author":"Marlow S.","year":"2011","unstructured":"S. Marlow Haskell 2010 language report. Available online http:\/\/www. haskell. org\/(May 2011 ), 2010. S. Marlow et al. Haskell 2010 language report. Available online http:\/\/www. haskell. org\/(May 2011), 2010."},{"key":"e_1_3_2_1_22_1","unstructured":"D. R. Musser G. J. Derge and A. Saini. STL tutorial and reference guide: C  D. R. Musser G. J. Derge and A. Saini. STL tutorial and reference guide: C"},{"key":"e_1_3_2_1_23_1","volume-title":"Addison-Wesley Professional","year":"2009","unstructured":"programming with the standard template library . Addison-Wesley Professional , 2009 . programming with the standard template library. Addison-Wesley Professional, 2009."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2555243.2555256"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/0202005"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00287-5"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/646237.683018"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01940876"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3828.3835"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32037-8_9"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/3485"}],"event":{"name":"SPAA '16: 28th ACM Symposium on Parallelism in Algorithms and Architectures","location":"Pacific Grove California USA","acronym":"SPAA '16","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture"]},"container-title":["Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2935764.2935768","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2935764.2935768","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:39:56Z","timestamp":1750217996000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2935764.2935768"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,11]]},"references-count":30,"alternative-id":["10.1145\/2935764.2935768","10.1145\/2935764"],"URL":"https:\/\/doi.org\/10.1145\/2935764.2935768","relation":{},"subject":[],"published":{"date-parts":[[2016,7,11]]},"assertion":[{"value":"2016-07-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}