<?xml version="1.0" encoding="UTF-8"?><rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcq="http://purl.org/dc/terms/"><records count="1" morepages="false" start="1" end="1"><record rownumber="1"><dc:product_type>Conference Paper</dc:product_type><dc:title>When Are Cache-Oblivious Algorithms Cache Adaptive? A Case Study of Matrix Multiplication and Sorting</dc:title><dc:creator>Bhattacharya, Arghya; Chowdhury, Abiyaz; Xu, Helen; Das, Rathish; Chowdhury, Rezaul Alam; Johnson, Rob; Nithyanand, Rishab; Bender, Michael A.</dc:creator><dc:corporate_author/><dc:editor/><dc:description/><dc:publisher/><dc:date>2022-09-05</dc:date><dc:nsf_par_id>10366723</dc:nsf_par_id><dc:journal_name>ESA</dc:journal_name><dc:journal_volume/><dc:journal_issue/><dc:page_range_or_elocation>16:1-16:17</dc:page_range_or_elocation><dc:issn/><dc:isbn/><dc:doi>https://doi.org/</dc:doi><dcq:identifierAwardId>2118830; 1938709; 1725543; 2106827; 1763680; 1716252</dcq:identifierAwardId><dc:subject/><dc:version_number/><dc:location/><dc:rights/><dc:institution/><dc:sponsoring_org>National Science Foundation</dc:sponsoring_org></record></records></rdf:RDF>