{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:32:24Z","timestamp":1750221144650,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,7,11]],"date-time":"2018-07-11T00:00:00Z","timestamp":1531267200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Singapore MOE AcRF Tier 1","award":["T1 251RES1719"],"award-info":[{"award-number":["T1 251RES1719"]}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1150036","CCF-1733873","CCF-1725647"],"award-info":[{"award-number":["CCF-1150036","CCF-1733873","CCF-1725647"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,7,11]]},"DOI":"10.1145\/3210377.3210390","type":"proceedings-article","created":{"date-parts":[[2018,7,12]],"date-time":"2018-07-12T17:46:44Z","timestamp":1531417604000},"page":"321-332","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Parallel Working-Set Search Structures"],"prefix":"10.1145","author":[{"given":"Kunal","family":"Agrawal","sequence":"first","affiliation":[{"name":"Washington University in St. Louis, St. Louis, MO, USA"}]},{"given":"Seth","family":"Gilbert","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}]},{"given":"Wei Quan","family":"Lim","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}]}],"member":"320","published-online":{"date-parts":[[2018,7,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33651-5_1"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-014-0229-0"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2612669.2612688"},{"volume-title":"Fast Parallel Operations on Search Trees. In 23rd IEEE International Conference on High Performance Computing, HiPC 2016","year":"2016","author":"Akhremtsev Yaroslav","key":"e_1_3_2_1_4_1"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Nimar S Arora Robert D Blumofe and C Greg Plaxton. 2001. Thread scheduling for multiprogrammed multiprocessors. Theory of computing systems 34 2 (2001) 115--144.  Nimar S Arora Robert D Blumofe and C Greg Plaxton. 2001. Thread scheduling for multiprogrammed multiprocessors. Theory of computing systems 34 2 (2001) 115--144.","DOI":"10.1007\/s002240011004"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/0218035"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2935764.2935768"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/258492.258517"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/277651.277660"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/324133.324234"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/321812.321815"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1998.1425"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2555243.2555267"},{"key":"e_1_3_2_1_14_1","unstructured":"Thomas H. Cormen Charles E. Leiserson Ronald L. Rivest and Clifford Stein. 2009. Introduction to Algorithms (third ed.). The MIT Press.   Thomas H. Cormen Charles E. Leiserson Ronald L. Rivest and Clifford Stein. 2009. Introduction to Algorithms (third ed.). The MIT Press."},{"volume-title":"Proceedings of the International Symposium on Mathematical Foundations of Computer Science (MFCS). Springer, 722--731","author":"Crauser A.","key":"e_1_3_2_1_15_1"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/50087.50096"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/268999.269000"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2611462.2611486"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835698.1835736"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00236-013-0180-8"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-07959-2_10"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2145816.2145849"},{"key":"e_1_3_2_1_23_1","volume-title":"Parallelization of Bulk Operations for STL Dictionaries. In Euro-Par Workshops (LNCS)","volume":"4854","author":"Frias Leonor","year":"2007"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/277650.277725"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/S009753979427491"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/226643.226670"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","unstructured":"R. L. Graham. 1969. Bounds on Multiprocessing Anomalies. SIAM J. Appl. Math. (1969) 17(2):416--429.  R. L. Graham. 1969. Bounds on Multiprocessing Anomalies. SIAM J. Appl. Math. (1969) 17(2):416--429.","DOI":"10.1137\/0117039"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1810479.1810540"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/365411.365522"},{"key":"e_1_3_2_1_30_1","unstructured":"Intel Corporation 2013. Intel Cilk Plus Language Extension Specification Version 1.1. Intel Corporation. Document 324396-002US. Available from http:\/\/cilkplus. org\/sites\/default\/files\/open_specifications\/Intel_Cilk_plus_lang_spec_2.htm.  Intel Corporation 2013. Intel Cilk Plus Language Extension Specification Version 1.1. Intel Corporation. Document 324396-002US. Available from http:\/\/cilkplus. org\/sites\/default\/files\/open_specifications\/Intel_Cilk_plus_lang_spec_2.htm."},{"key":"e_1_3_2_1_31_1","unstructured":"OpenMP Architecture Review Board. 2013. OpenMP Application Program Interface Version 4.0. Available from http:\/\/www.openmp.org\/mp-documents\/ OpenMP4.0.0.pdf.  OpenMP Architecture Review Board. 2013. OpenMP Application Program Interface Version 4.0. Available from http:\/\/www.openmp.org\/mp-documents\/ OpenMP4.0.0.pdf."},{"volume-title":"Proceedings of the International Workshop on Parallel and Distributed Computing for Symbolic and Irregular Applications (PDSIA). 182--204","author":"Oyama Y.","key":"e_1_3_2_1_32_1"},{"volume-title":"Parallel Algorithms for Shortest Path Problems. In Int. Conference on Parallel Processing. 14--20","author":"Richard","key":"e_1_3_2_1_33_1"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"crossref","unstructured":"Wolfgang Paul Uzi Vishkin and Hubert Wagener. 1983. Parallel dictionaries on 2--3 trees. Automata Languages and Programming (1983) 597--609.   Wolfgang Paul Uzi Vishkin and Hubert Wagener. 1983. Parallel dictionaries on 2--3 trees. Automata Languages and Programming (1983) 597--609.","DOI":"10.1007\/BFb0036940"},{"key":"e_1_3_2_1_35_1","unstructured":"James Reinders. 2007. Intel Threading Building Blocks: Outfitting C++ for Multi-Core Processor Parallelism. O'Reilly.   James Reinders. 2007. Intel Threading Building Blocks: Outfitting C++ for Multi-Core Processor Parallelism. O'Reilly."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1998.1429"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3828.3835"},{"key":"e_1_3_2_1_38_1","unstructured":"tpl 2007. The Task Parallel Library. http:\/\/msdn.microsoft.com\/en-us\/magazine\/ cc163340.aspx. http:\/\/msdn.microsoft.com\/en-us\/magazine\/cc163340.as  tpl 2007. The Task Parallel Library. http:\/\/msdn.microsoft.com\/en-us\/magazine\/ cc163340.aspx. http:\/\/msdn.microsoft.com\/en-us\/magazine\/cc163340.as"}],"event":{"name":"SPAA '18: 30th ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"],"location":"Vienna Austria","acronym":"SPAA '18"},"container-title":["Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3210377.3210390","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3210377.3210390","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3210377.3210390","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:08:13Z","timestamp":1750208893000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3210377.3210390"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,11]]},"references-count":38,"alternative-id":["10.1145\/3210377.3210390","10.1145\/3210377"],"URL":"https:\/\/doi.org\/10.1145\/3210377.3210390","relation":{},"subject":[],"published":{"date-parts":[[2018,7,11]]},"assertion":[{"value":"2018-07-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}