{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T06:00:36Z","timestamp":1783576836971,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":65,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,7,6]],"date-time":"2020-07-06T00:00:00Z","timestamp":1593993600000},"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":["CCF-1439084, CCF-1725543, CSR-1763680, CCF-1716252, CCF-1617618, CNS-1938709, CNS-1553510"],"award-info":[{"award-number":["CCF-1439084, CCF-1725543, CSR-1763680, CCF-1716252, CCF-1617618, CNS-1938709, CNS-1553510"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006602","name":"Air Force Research Laboratory","doi-asserted-by":"publisher","award":["FA8750-19-2-1000"],"award-info":[{"award-number":["FA8750-19-2-1000"]}],"id":[{"id":"10.13039\/100006602","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,7,6]]},"DOI":"10.1145\/3350755.3400274","type":"proceedings-article","created":{"date-parts":[[2020,7,9]],"date-time":"2020-07-09T15:56:12Z","timestamp":1594310172000},"page":"63-73","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Closing the Gap Between Cache-oblivious and Cache-adaptive Analysis"],"prefix":"10.1145","author":[{"given":"Michael A.","family":"Bender","sequence":"first","affiliation":[{"name":"Stony Brook University, Stony Brook, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rezaul A.","family":"Chowdhury","sequence":"additional","affiliation":[{"name":"Stony Brook University, Stony Brook, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rathish","family":"Das","sequence":"additional","affiliation":[{"name":"Stony Brook University, Stony Brook, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rob","family":"Johnson","sequence":"additional","affiliation":[{"name":"VMware Research, Palo Alto, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"William","family":"Kuszmaul","sequence":"additional","affiliation":[{"name":"Massachusetts of Institute of Technology, Cambridge, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andrea","family":"Lincoln","sequence":"additional","affiliation":[{"name":"Massachusetts of Institute of Technology, Cambridge, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Quanquan C.","family":"Liu","sequence":"additional","affiliation":[{"name":"Massachusetts of Institute of Technology, Cambridge, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jayson","family":"Lynch","sequence":"additional","affiliation":[{"name":"Massachusetts of Institute of Technology, Cambridge, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Helen","family":"Xu","sequence":"additional","affiliation":[{"name":"Massachusetts of Institute of Technology, Cambridge, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2020,7,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/48529.48535"},{"key":"e_1_3_2_1_2_1","volume-title":"Vitter","author":"Barve Rakesh","year":"1998","unstructured":"Rakesh Barve and Jeffrey S . Vitter . 1998 . External memory algorithms with dynamically changing memory allocations. Technical Report. Duke University . Rakesh Barve and Jeffrey S. Vitter. 1998. External memory algorithms with dynamically changing memory allocations. Technical Report. Duke University."},{"key":"e_1_3_2_1_3_1","volume-title":"Proc. 40th Annual Symposium on the Foundations of Computer Science (FOCS). 273--284","author":"Rakesh","unstructured":"Rakesh D. Barve and Jeffrey Scott Vitter. 1999. A Theoretical Framework for Memory-Adaptive Algorithms . In Proc. 40th Annual Symposium on the Foundations of Computer Science (FOCS). 273--284 . Rakesh D. Barve and Jeffrey Scott Vitter. 1999. A Theoretical Framework for Memory-Adaptive Algorithms. In Proc. 40th Annual Symposium on the Foundations of Computer Science (FOCS). 273--284."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-010-9394-0"},{"key":"e_1_3_2_1_5_1","volume-title":"Cache-Adaptive Analysis. In Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 135--144","author":"Bender Michael A.","year":"2016","unstructured":"Michael A. Bender , Erik D. Demaine , Roozbeh Ebrahimi , Jeremy T. Fineman , Rob Johnson , Andrea Lincoln , Jayson Lynch , and Samuel McCauley . 2016 . Cache-Adaptive Analysis. In Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 135--144 . https:\/\/doi.org\/10.1145\/2935764.2935798 10.1145\/2935764.2935798 Michael A. Bender, Erik D. Demaine, Roozbeh Ebrahimi, Jeremy T. Fineman, Rob Johnson, Andrea Lincoln, Jayson Lynch, and Samuel McCauley. 2016. Cache-Adaptive Analysis. In Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 135--144. https:\/\/doi.org\/10.1145\/2935764.2935798"},{"key":"e_1_3_2_1_6_1","volume-title":"Cache-adaptive Algorithms. In Proc. 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 958--971","author":"Bender Michael A.","year":"2014","unstructured":"Michael A. Bender , Roozbeh Ebrahimi , Jeremy T. Fineman , Golnaz Ghasemiesfeh , Rob Johnson , and Samuel McCauley . 2014 . Cache-adaptive Algorithms. In Proc. 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 958--971 . Michael A. Bender, Roozbeh Ebrahimi, Jeremy T. Fineman, Golnaz Ghasemiesfeh, Rob Johnson, and Samuel McCauley. 2014. Cache-adaptive Algorithms. In Proc. 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 958--971."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1248377.1248393"},{"key":"e_1_3_2_1_8_1","volume-title":"Proc. 25th Annual ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS). 233--242","author":"Bender Michael A.","unstructured":"Michael A. Bender , Martin Farach-Colton , and Bradley C. Kuszmaul . 2006. Cache-oblivious string B-trees . In Proc. 25th Annual ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS). 233--242 . Michael A. Bender, Martin Farach-Colton, and Bradley C. Kuszmaul. 2006. Cache-oblivious string B-trees. In Proc. 25th Annual ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS). 233--242."},{"key":"e_1_3_2_1_9_1","volume-title":"Virginia Vassilevska Williams, and Uri Zwick","author":"Bj\u00f6rklund Andreas","year":"2014","unstructured":"Andreas Bj\u00f6rklund , Rasmus Pagh , Virginia Vassilevska Williams, and Uri Zwick . 2014 . Listing triangles. In International Colloquium on Automata, Languages, and Programming. Springer , 223--234. Andreas Bj\u00f6rklund, Rasmus Pagh, Virginia Vassilevska Williams, and Uri Zwick. 2014. Listing triangles. In International Colloquium on Automata, Languages, and Programming. Springer, 223--234."},{"key":"e_1_3_2_1_10_1","volume-title":"Proc. 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Society for Industrial and Applied Mathematics, 501--510","author":"Blelloch Guy E","year":"2008","unstructured":"Guy E Blelloch , Rezaul A Chowdhury , Phillip B Gibbons , Vijaya Ramachandran , Shimin Chen , and Michael Kozuch . 2008 . Provably good multicore cache performance for divide-and-conquer algorithms . In Proc. 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Society for Industrial and Applied Mathematics, 501--510 . Guy E Blelloch, Rezaul A Chowdhury, Phillip B Gibbons, Vijaya Ramachandran, Shimin Chen, and Michael Kozuch. 2008. Provably good multicore cache performance for divide-and-conquer algorithms. In Proc. 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Society for Industrial and Applied Mathematics, 501--510."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780589"},{"key":"e_1_3_2_1_12_1","volume-title":"ACM Journal of Experimental Algorithmics","volume":"12","author":"Brodal Gerth St\u00f8lting","year":"2007","unstructured":"Gerth St\u00f8lting Brodal , Rolf Fagerberg , and Kristoffer Vinther . 2007 . Engineering a cache-oblivious sorting algorithm . ACM Journal of Experimental Algorithmics , Vol. 12 (2007). Gerth St\u00f8lting Brodal, Rolf Fagerberg, and Kristoffer Vinther. 2007. Engineering a cache-oblivious sorting algorithm. ACM Journal of Experimental Algorithmics, Vol. 12 (2007)."},{"key":"e_1_3_2_1_13_1","volume-title":"Proc. 19th International Conference on Very Large Data Bases (VLDB). Institute of Electrical & Electronics Engineers (IEEE), 328--328","author":"Brown Kurt P","year":"1993","unstructured":"Kurt P Brown , Michael James Carey , and Miron Livny . 1993 . Managing memory to meet multiclass workload response time goals . In Proc. 19th International Conference on Very Large Data Bases (VLDB). Institute of Electrical & Electronics Engineers (IEEE), 328--328 . Kurt P Brown, Michael James Carey, and Miron Livny. 1993. Managing memory to meet multiclass workload response time goals. In Proc. 19th International Conference on Very Large Data Bases (VLDB). Institute of Electrical & Electronics Engineers (IEEE), 328--328."},{"key":"e_1_3_2_1_14_1","volume-title":"Cooperative caching for chip multiprocessors","author":"Chang Jichuan","unstructured":"Jichuan Chang and Gurindar S Sohi . 2006. Cooperative caching for chip multiprocessors . Vol. 34 . Jichuan Chang and Gurindar S Sohi. 2006. Cooperative caching for chip multiprocessors. Vol. 34."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0051307"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2008.94"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1109557.1109622"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-010-9273-8"},{"key":"e_1_3_2_1_19_1","unstructured":"R Cole and V Ramachandran. 2010. Efficient resource oblivious scheduling of multicore algorithms. manuscript.  R Cole and V Ramachandran. 2010. Efficient resource oblivious scheduling of multicore algorithms. manuscript."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(08)80013-2"},{"key":"e_1_3_2_1_21_1","series-title":"Lecture Notes from the EEF Summer School on Massive Data Sets","volume-title":"Cache-Oblivious Algorithms and Data Structures. (2002)","author":"Demaine Erik D.","unstructured":"Erik D. Demaine . 2002. Cache-Oblivious Algorithms and Data Structures. (2002) . Lecture Notes from the EEF Summer School on Massive Data Sets . Erik D. Demaine. 2002. Cache-Oblivious Algorithms and Data Structures. (2002). Lecture Notes from the EEF Summer School on Massive Data Sets."},{"key":"e_1_3_2_1_22_1","volume-title":"9th Innovations in Theoretical Computer Science Conference, ITCS 2018","author":"Demaine Erik D.","year":"2018","unstructured":"Erik D. Demaine , Andrea Lincoln , Quanquan C. Liu , Jayson Lynch , and Virginia Vassilevska Williams . 2018 . Fine-grained I\/O Complexity via Reductions: New Lower Bounds, Faster Algorithms, and a Time Hierarchy . In 9th Innovations in Theoretical Computer Science Conference, ITCS 2018 , January 11 --14 , 2018, Cambridge, MA, USA. 34:1--34:23. https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2018.34 10.4230\/LIPIcs.ITCS.2018.34 Erik D. Demaine, Andrea Lincoln, Quanquan C. Liu, Jayson Lynch, and Virginia Vassilevska Williams. 2018. Fine-grained I\/O Complexity via Reductions: New Lower Bounds, Faster Algorithms, and a Time Hierarchy. In 9th Innovations in Theoretical Computer Science Conference, ITCS 2018, January 11--14, 2018, Cambridge, MA, USA. 34:1--34:23. https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2018.34"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1476589.1476705"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1980.230464"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2612669.2612703"},{"key":"e_1_3_2_1_26_1","volume-title":"Rao","author":"Durfee David","year":"2017","unstructured":"David Durfee , John Peebles , Richard Peng , and Anup B . Rao . 2017 . Determinant-Preserving Sparsification of SDDM Matrices with Applications to Counting and Sampling Spanning Trees. In FOCS. IEEE Computer Society , 926--937. David Durfee, John Peebles, Richard Peng, and Anup B. Rao. 2017. Determinant-Preserving Sparsification of SDDM Matrices with Applications to Counting and Sampling Spanning Trees. In FOCS. IEEE Computer Society, 926--937."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2004.840301"},{"key":"e_1_3_2_1_28_1","volume-title":"Cache-Oblivious Algorithms. In Proc. 40th Annual Symposium on the Foundations of Computer Science (FOCS). 285--298","author":"Frigo Matteo","year":"1999","unstructured":"Matteo Frigo , Charles E. Leiserson , Harald Prokop , and Sridhar Ramachandran . 1999 . Cache-Oblivious Algorithms. In Proc. 40th Annual Symposium on the Foundations of Computer Science (FOCS). 285--298 . Matteo Frigo, Charles E. Leiserson, Harald Prokop, and Sridhar Ramachandran. 1999. Cache-Oblivious Algorithms. In Proc. 40th Annual Symposium on the Foundations of Computer Science (FOCS). 285--298."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2071379.2071383"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"crossref","unstructured":"Matteo Frigo and Volker Strumpen. 2005. Cache-oblivious stencil computations. Citeseer.  Matteo Frigo and Volker Strumpen. 2005. Cache-oblivious stencil computations. Citeseer.","DOI":"10.1145\/1088149.1088197"},{"key":"e_1_3_2_1_31_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_32_1","volume-title":"Proc. 1st Annual Symposium on Innovations in Computer Science (ICS). 501--509","author":"Hassidim Avinatan","year":"2010","unstructured":"Avinatan Hassidim . 2010 . Cache Replacement Policies for Multicore Processors . In Proc. 1st Annual Symposium on Innovations in Computer Science (ICS). 501--509 . Avinatan Hassidim. 2010. Cache Replacement Policies for Multicore Processors. In Proc. 1st Annual Symposium on Innovations in Computer Science (ICS). 501--509."},{"key":"e_1_3_2_1_33_1","volume-title":"Proc. 13th Annual ACM Symposium on the Theory of Computation (STOC). 326--333","author":"Hong Jia-Wei","unstructured":"Jia-Wei Hong and H. T. Kung . 1981. I\/O complexity: The red-blue pebble game . In Proc. 13th Annual ACM Symposium on the Theory of Computation (STOC). 326--333 . Jia-Wei Hong and H. T. Kung. 1981. I\/O complexity: The red-blue pebble game. In Proc. 13th Annual ACM Symposium on the Theory of Computation (STOC). 326--333."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258666"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2012.29"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"crossref","unstructured":"P. Kumar. 2003. Cache Oblivious Algorithms. (2003) 193--212. http:\/\/link.springer.de\/link\/service\/series\/0558\/tocs\/t2625.htm  P. Kumar. 2003. Cache Oblivious Algorithms. (2003) 193--212. http:\/\/link.springer.de\/link\/service\/series\/0558\/tocs\/t2625.htm","DOI":"10.1007\/3-540-36574-5_9"},{"key":"e_1_3_2_1_37_1","volume-title":"Approximate Gaussian Elimination for Laplacians - Fast, Sparse, and Simple","author":"Kyng Rasmus","unstructured":"Rasmus Kyng and Sushant Sachdeva . 2016. Approximate Gaussian Elimination for Laplacians - Fast, Sparse, and Simple . In FOCS. IEEE Computer Society , 573--582. Rasmus Kyng and Sushant Sachdeva. 2016. Approximate Gaussian Elimination for Laplacians - Fast, Sparse, and Simple. In FOCS. IEEE Computer Society, 573--582."},{"key":"e_1_3_2_1_38_1","volume-title":"A Comparison of Cache Aware and Cache Oblivious Static Search Trees Using Program Instrumentation. Experimental Algorithmics","author":"Ladner R.E.","year":"2002","unstructured":"R.E. Ladner , R. Fortna , and B.-H. Nguyen . 2002. A Comparison of Cache Aware and Cache Oblivious Static Search Trees Using Program Instrumentation. Experimental Algorithmics ( 2002 ), 78--92. R.E. Ladner, R. Fortna, and B.-H. Nguyen. 2002. A Comparison of Cache Aware and Cache Oblivious Static Search Trees Using Program Instrumentation. Experimental Algorithmics (2002), 78--92."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2608628.2608664"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3210377.3210382"},{"key":"e_1_3_2_1_41_1","volume-title":"Proc. 10th Workshop on Approximation and Online Algorithms (WAOA) .","author":"L\u00f3pez-Ortiz Alejandro","year":"2012","unstructured":"Alejandro L\u00f3pez-Ortiz and Alejandro Salinger . 2012 a. Minimizing Cache Usage in Paging . In Proc. 10th Workshop on Approximation and Online Algorithms (WAOA) . Alejandro L\u00f3pez-Ortiz and Alejandro Salinger. 2012a. Minimizing Cache Usage in Paging. In Proc. 10th Workshop on Approximation and Online Algorithms (WAOA) ."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090246"},{"key":"e_1_3_2_1_43_1","unstructured":"Paul Menage. [n. d.]. CGROUPS. https:\/\/www.kernel.org\/doc\/Documentation\/cgroup-v1\/cgroups.txt  Paul Menage. [n. d.]. CGROUPS. https:\/\/www.kernel.org\/doc\/Documentation\/cgroup-v1\/cgroups.txt"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2004.1303002"},{"key":"e_1_3_2_1_46_1","unstructured":"Khang T Nguyen. [n. d.]. Introduction to Cache Allocation Technology in the Intel\u00ae Xeon\u00ae Processor E5 v4 Family. https:\/\/software.intel.com\/en-us\/articles\/introduction-to-cache-allocation-technology  Khang T Nguyen. [n. d.]. Introduction to Cache Allocation Technology in the Intel\u00ae Xeon\u00ae Processor E5 v4 Family. https:\/\/software.intel.com\/en-us\/articles\/introduction-to-cache-allocation-technology"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.5555\/645919.672817"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/170035.170051"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2004.44"},{"key":"e_1_3_2_1_50_1","volume-title":"Paging with dynamic memory capacity. CoRR","author":"Peserico Enoch","year":"2013","unstructured":"Enoch Peserico . 2013. Paging with dynamic memory capacity. CoRR , Vol. abs\/ 1304 .6007 ( 2013 ). Enoch Peserico. 2013. Paging with dynamic memory capacity. CoRR, Vol. abs\/1304.6007 (2013)."},{"key":"e_1_3_2_1_51_1","unstructured":"H. Prokop. 1999. Cache Oblivious Algorithms. Master's thesis. Department of Electrical Engineering and Computer Science Mass\u00ada\u00adchu\u00adsetts Insti\u00adtute of Tech\u00adno\u00adlogy.  H. Prokop. 1999. Cache Oblivious Algorithms. Master's thesis. Department of Electrical Engineering and Computer Science Mass\u00ada\u00adchu\u00adsetts Insti\u00adtute of Tech\u00adno\u00adlogy."},{"key":"e_1_3_2_1_52_1","volume-title":"Localization of Electrical Flows","author":"Schild Aaron","unstructured":"Aaron Schild , Satish Rao , and Nikhil Srivastava . 2018. Localization of Electrical Flows . In SODA. SIAM , 1577--1584. Aaron Schild, Satish Rao, and Nikhil Srivastava. 2018. Localization of Electrical Flows. In SODA. SIAM, 1577--1584."},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1995.1078"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFFCS.1999.814635"},{"key":"e_1_3_2_1_55_1","volume-title":"Gaussian elimination is not optimal. Numerische mathematik","author":"Strassen Volker","year":"1969","unstructured":"Volker Strassen . 1969. Gaussian elimination is not optimal. Numerische mathematik , Vol. 13 , 4 ( 1969 ), 354--356. Volker Strassen. 1969. Gaussian elimination is not optimal. Numerische mathematik, Vol. 13, 4 (1969), 354--356."},{"key":"e_1_3_2_1_56_1","volume-title":"Bradley C. Kuszmaul, Chi-Keung Luk, and Charles E. Leiserson.","author":"Tang Yuan","year":"2011","unstructured":"Yuan Tang , Rezaul Alam Chowdhury , Bradley C. Kuszmaul, Chi-Keung Luk, and Charles E. Leiserson. 2011 . The pochoir stencil compiler. In SPAA. 117--128. Yuan Tang, Rezaul Alam Chowdhury, Bradley C. Kuszmaul, Chi-Keung Luk, and Charles E. Leiserson. 2011. The pochoir stencil compiler. In SPAA. 117--128."},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/2579671"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214056"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.67"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/1186822.1073278"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/1248377.1248394"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-001-0124-5"},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.5555\/645916.672136"},{"key":"e_1_3_2_1_64_1","volume-title":"Proc. 6th International Conference of the Centre for Advanced Studies on Collaborative research (CASCON). IBM Press, 41--.","author":"Zhang Weiye","year":"1996","unstructured":"Weiye Zhang and Per-\u00c4ke Larson . 1996 . A memory-adaptive sort (MASORT) for database systems . In Proc. 6th International Conference of the Centre for Advanced Studies on Collaborative research (CASCON). IBM Press, 41--. Weiye Zhang and Per-\u00c4ke Larson. 1996. A memory-adaptive sort (MASORT) for database systems. In Proc. 6th International Conference of the Centre for Advanced Studies on Collaborative research (CASCON). IBM Press, 41--."},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.5555\/645923.671006"},{"key":"e_1_3_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.5555\/795664.796456"}],"event":{"name":"SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures","location":"Virtual Event USA","acronym":"SPAA '20","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"]},"container-title":["Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3350755.3400274","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3350755.3400274","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3350755.3400274","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:41:21Z","timestamp":1750200081000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3350755.3400274"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,6]]},"references-count":65,"alternative-id":["10.1145\/3350755.3400274","10.1145\/3350755"],"URL":"https:\/\/doi.org\/10.1145\/3350755.3400274","relation":{},"subject":[],"published":{"date-parts":[[2020,7,6]]},"assertion":[{"value":"2020-07-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}