{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T16:48:20Z","timestamp":1782924500364,"version":"3.54.5"},"reference-count":20,"publisher":"IEEE","license":[{"start":{"date-parts":[[2026,5,25]],"date-time":"2026-05-25T00:00:00Z","timestamp":1779667200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,5,25]],"date-time":"2026-05-25T00:00:00Z","timestamp":1779667200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100006192","name":"Advanced Scientific Computing Research","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006192","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006132","name":"Office of Science","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006132","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006192","name":"Advanced Scientific Computing Research","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006192","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026,5,25]]},"DOI":"10.1109\/ipdps65963.2026.00036","type":"proceedings-article","created":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T20:55:16Z","timestamp":1782852916000},"page":"307-320","source":"Crossref","is-referenced-by-count":0,"title":["Fast Algorithms for Scheduling Many-body Correlation Functions on Accelerators"],"prefix":"10.1109","author":[{"given":"Oguz","family":"Selvitopi","sequence":"first","affiliation":[{"name":"Lawrence Berkeley National Lab,USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Emin","family":"Ozturk","sequence":"additional","affiliation":[{"name":"University of Utah,USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jie","family":"Chen","sequence":"additional","affiliation":[{"name":"Jefferson Lab,USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ponnuswamy","family":"Sadayappan","sequence":"additional","affiliation":[{"name":"University of Utah,USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Robert G.","family":"Edwards","sequence":"additional","affiliation":[{"name":"Jefferson Lab,USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ayd\u0131n","family":"Bulu\u00e7","sequence":"additional","affiliation":[{"name":"Lawrence Berkeley National Lab,USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevD.80.054506"},{"key":"ref2","first-page":"108","article-title":"High-performance tensor contractions for gpus","volume-title":"Procedia Computer Science","volume":"80","author":"Abdelfattah","year":"2016"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24644-2_7"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3205289.3205296"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3447818.3460355"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/HiPC.2016.031"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3592979.3593409"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS53621.2022.00022"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3506705"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/800125.804049"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/800135.804418"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-09118-1_12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/800076.802486"},{"issue":"2","key":"ref14","first-page":"63","article-title":"Memory-optimal evaluation of expression trees involving large objects","volume-title":"Computer Languages, Systems Structures","volume":"37","author":"Lam","year":"2011"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/0608031"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/130938505"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2779052"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3589610.3596280"},{"key":"ref19","first-page":"1","article-title":"Scheduling series-parallel task graphs to minimize peak memory","volume-title":"Theoretical Computer Science","volume":"707","author":"Kayaaslan","year":"2018"},{"key":"ref20","first-page":"30","article-title":"Limiting the memory footprint when dynamically scheduling dags on shared-memory platforms","volume-title":"Journal of Parallel and Distributed Computing","volume":"128","author":"Marchal","year":"2019"}],"event":{"name":"2026 IEEE International Parallel and Distributed Processing Symposium (IPDPS)","location":"New Orleans, LA, USA","start":{"date-parts":[[2026,5,25]]},"end":{"date-parts":[[2026,5,29]]}},"container-title":["2026 IEEE International Parallel and Distributed Processing Symposium (IPDPS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11575315\/11575316\/11575425.pdf?arnumber=11575425","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T15:52:52Z","timestamp":1782921172000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11575425\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,25]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/ipdps65963.2026.00036","relation":{},"subject":[],"published":{"date-parts":[[2026,5,25]]}}}