{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:18:46Z","timestamp":1750220326474,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":6,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,11]],"date-time":"2022-07-11T00:00:00Z","timestamp":1657497600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DE210100263,DP200103494"],"award-info":[{"award-number":["DE210100263,DP200103494"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,11]]},"DOI":"10.1145\/3490148.3538557","type":"proceedings-article","created":{"date-parts":[[2022,7,10]],"date-time":"2022-07-10T22:10:15Z","timestamp":1657491015000},"page":"385-388","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Brief Announcement"],"prefix":"10.1145","author":[{"given":"Tianming","family":"Zhao","sequence":"first","affiliation":[{"name":"The University of Sydney, Sydney, NSW, Australia"}]},{"given":"Chunhao","family":"Li","sequence":"additional","affiliation":[{"name":"The University of Sydney, Sydney, NSW, Australia"}]},{"given":"Wei","family":"Li","sequence":"additional","affiliation":[{"name":"The University of Sydney, Sydney, NSW, Australia"}]},{"given":"Albert Y.","family":"Zomaya","sequence":"additional","affiliation":[{"name":"The University of Sydney, Sydney, NSW, Australia"}]}],"member":"320","published-online":{"date-parts":[[2022,7,11]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Yossi Azar Stefano Leonardi and Noam Touitou. 2021 a. Distortion-oblivious algorithms for minimizing flow time. https:\/\/arxiv.org\/abs\/2109.08424  Yossi Azar Stefano Leonardi and Noam Touitou. 2021 a. Distortion-oblivious algorithms for minimizing flow time. https:\/\/arxiv.org\/abs\/2109.08424"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451023"},{"volume-title":"Online Computation and Competitive Analysis","author":"Borodin Allan","key":"e_1_3_2_1_3_1","unstructured":"Allan Borodin and Ran El-Yaniv . 1998. Online Computation and Competitive Analysis . Cambridge University Press , USA. Allan Borodin and Ran El-Yaniv. 1998. Online Computation and Competitive Analysis .Cambridge University Press, USA."},{"volume-title":"Discrete Optimization II","author":"Graham R.L.","key":"e_1_3_2_1_4_1","unstructured":"R.L. Graham , E.L. Lawler , J.K. Lenstra , and A.H.G. Rinnooy Kan . 1979. Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey . In Discrete Optimization II , , P.L. Hammer, E.L. Johnson, and B.H. Korte (Eds.). Annals of Discrete Mathematics, Vol . 5. Elsevier , 287--326. R.L. Graham, E.L. Lawler, J.K. Lenstra, and A.H.G.Rinnooy Kan. 1979. Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey. In Discrete Optimization II , , P.L. Hammer, E.L. Johnson, and B.H. Korte (Eds.). Annals of Discrete Mathematics, Vol. 5. Elsevier, 287--326."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)90151-1"},{"key":"e_1_3_2_1_6_1","volume-title":"Garnett (Eds.)","volume":"31","author":"Purohit Manish","year":"2018","unstructured":"Manish Purohit , Zoya Svitkina , and Ravi Kumar . 2018 . Improving Online Algorithms via ML Predictions. In Advances in Neural Information Processing Systems, S. Bengio, H. Wallach, H. Larochelle, K. Grauman, N. Cesa-Bianchi, and R . Garnett (Eds.) , Vol. 31 . Curran Associates, Inc. Manish Purohit, Zoya Svitkina, and Ravi Kumar. 2018. Improving Online Algorithms via ML Predictions. In Advances in Neural Information Processing Systems, S. Bengio, H. Wallach, H. Larochelle, K. Grauman, N. Cesa-Bianchi, and R. Garnett (Eds.), Vol. 31. Curran Associates, Inc."}],"event":{"name":"SPAA '22: 34th 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":"Philadelphia PA USA","acronym":"SPAA '22"},"container-title":["Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3490148.3538557","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3490148.3538557","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:12:08Z","timestamp":1750191128000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3490148.3538557"}},"subtitle":["Towards a More Robust Algorithm for Flow Time Scheduling with Predictions"],"short-title":[],"issued":{"date-parts":[[2022,7,11]]},"references-count":6,"alternative-id":["10.1145\/3490148.3538557","10.1145\/3490148"],"URL":"https:\/\/doi.org\/10.1145\/3490148.3538557","relation":{},"subject":[],"published":{"date-parts":[[2022,7,11]]},"assertion":[{"value":"2022-07-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}