{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:32:23Z","timestamp":1750221143930,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":29,"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":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1514339, 1122374, 1314547, 1417238, 1533644, 1528078,"],"award-info":[{"award-number":["1514339, 1122374, 1314547, 1417238, 1533644, 1528078,"]}],"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.3210382","type":"proceedings-article","created":{"date-parts":[[2018,7,12]],"date-time":"2018-07-12T17:46:44Z","timestamp":1531417604000},"page":"213-222","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Cache-Adaptive Exploration"],"prefix":"10.1145","author":[{"given":"Andrea","family":"Lincoln","sequence":"first","affiliation":[{"name":"MIT, Cambridge, MA, USA"}]},{"given":"Quanquan C.","family":"Liu","sequence":"additional","affiliation":[{"name":"MIT, Cambridge, MA, USA"}]},{"given":"Jayson","family":"Lynch","sequence":"additional","affiliation":[{"name":"MIT, Cambridge, MA, USA"}]},{"given":"Helen","family":"Xu","sequence":"additional","affiliation":[{"name":"MIT, Cambridge, MA, USA"}]}],"member":"320","published-online":{"date-parts":[[2018,7,11]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"{n. d.}. GMP FFT Multiplication. https:\/\/gmplib.org\/manual\/FFT-Multiplication. html. Accessed: 2018-02-01.  {n. d.}. GMP FFT Multiplication. https:\/\/gmplib.org\/manual\/FFT-Multiplication. html. Accessed: 2018-02-01."},{"key":"e_1_3_2_1_2_1","unstructured":"{n. d.}. JAVA BigInteger Class. https:\/\/raw.githubusercontent.com\/tbuktu\/bigint\/ master\/src\/main\/java\/java\/math\/BigInteger.java. Accessed: 2018-02-01.  {n. d.}. JAVA BigInteger Class. https:\/\/raw.githubusercontent.com\/tbuktu\/bigint\/ master\/src\/main\/java\/java\/math\/BigInteger.java. Accessed: 2018-02-01."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/48529.48535"},{"key":"e_1_3_2_1_4_1","unstructured":"Rakesh D. Barve and Jeffrey S. Vitter. 1998. External Memory Algorithms with Dynamically Changing Memory Allocations. Technical Report. Duke University.  Rakesh D. Barve and Jeffrey S. Vitter. 1998. External Memory Algorithms with Dynamically Changing Memory Allocations. Technical Report. Duke University."},{"volume-title":"Proc. 40th Annual Symposium on the Foundations of Computer Science (FOCS). 273--284","author":"Rakesh","key":"e_1_3_2_1_5_1"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1147\/sj.52.0078"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2935764.2935798"},{"volume-title":"Cache-adaptive Algorithms. In Proc. 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 958--971","year":"2014","author":"Bender Michael A.","key":"e_1_3_2_1_8_1"},{"volume-title":"Proc. 29th International Colloquium on Automata, Languages and Programming (ICALP). Springer-Verlag, 426--438","author":"Gerth","key":"e_1_3_2_1_9_1"},{"volume-title":"Proc. 19th International Conference on Very Large Data Bases (VLDB). Institute of Electrical & Electronics Engineers (IEEE), 328--328","year":"1993","author":"Brown Kurt P.","key":"e_1_3_2_1_10_1"},{"key":"e_1_3_2_1_11_1","unstructured":"Erik D. Demaine. 2002. Cache-Oblivious Algorithms and Data Structures. Lecture Notes from the EEF Summer School on Massive Data Sets 8 4 (2002) 1--249.  Erik D. Demaine. 2002. Cache-Oblivious Algorithms and Data Structures. Lecture Notes from the EEF Summer School on Massive Data Sets 8 4 (2002) 1--249."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2612669.2612703"},{"volume-title":"Cache-Oblivious Algorithms. In Proc. 40th Annual Symposium on the Foundations of Computer Science (FOCS). 285--298","year":"1999","author":"Frigo Matteo","key":"e_1_3_2_1_13_1"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2071379.2071383"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2013.06.001"},{"key":"e_1_3_2_1_16_1","unstructured":"Goetz Graefe. 2013. A New Memory-Adaptive External Merge Sort. Private communication.  Goetz Graefe. 2013. A New Memory-Adaptive External Merge Sort. Private communication."},{"key":"e_1_3_2_1_17_1","unstructured":"Richard T. Mills. 2004. Dynamic Adaptation to CPU and Memory Load in Scientific Applications. Ph.D. Dissertation. The College of William and Mary.   Richard T. Mills. 2004. Dynamic Adaptation to CPU and Memory Load in Scientific Applications. Ph.D. Dissertation. The College of William and Mary."},{"volume-title":"Proc. 8th International Parallel and Distributed Processing Symposium (IPDPS). 71","author":"Mills Richard T.","key":"e_1_3_2_1_18_1"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10723-007-9075-7"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/645919.672817"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/170035.170051"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2786.2793"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02165411"},{"volume-title":"Proceedings of 1994 International Conference on Parallel and Distributed Systems. 622--627","author":"Strumpen Volker","key":"e_1_3_2_1_24_1"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/384192.384193"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000014"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/645916.672136"},{"volume-title":"Proc. 6th International Conference of the Centre for Advanced Studies on Collaborative research (CASCON). IBM Press, 41--.","year":"1996","author":"Zhang Weiye","key":"e_1_3_2_1_28_1"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/645923.671006"}],"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.3210382","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3210377.3210382","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3210377.3210382","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.3210382"}},"subtitle":["Experimental Results and Scan-Hiding for Adaptivity"],"short-title":[],"issued":{"date-parts":[[2018,7,11]]},"references-count":29,"alternative-id":["10.1145\/3210377.3210382","10.1145\/3210377"],"URL":"https:\/\/doi.org\/10.1145\/3210377.3210382","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"}}]}}