{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,6]],"date-time":"2025-10-06T09:24:06Z","timestamp":1759742646461,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,6,17]],"date-time":"2023-06-17T00:00:00Z","timestamp":1686960000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100002341","name":"Academy of Finland","doi-asserted-by":"publisher","award":["321901"],"award-info":[{"award-number":["321901"]}],"id":[{"id":"10.13039\/501100002341","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Academy of Finland","award":["334238"],"award-info":[{"award-number":["334238"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,6,17]]},"DOI":"10.1145\/3558481.3591098","type":"proceedings-article","created":{"date-parts":[[2023,5,31]],"date-time":"2023-05-31T22:22:03Z","timestamp":1685571723000},"page":"443-453","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Fast Dynamic Programming in Trees in the MPC Model"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0727-160X","authenticated-orcid":false,"given":"Chetan","family":"Gupta","sequence":"first","affiliation":[{"name":"Aalto University, Espoo, Finland"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7124-3067","authenticated-orcid":false,"given":"Rustam","family":"Latypov","sequence":"additional","affiliation":[{"name":"Aalto University, Espoo, Finland"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4062-6991","authenticated-orcid":false,"given":"Yannic","family":"Maus","sequence":"additional","affiliation":[{"name":"TU Graz, Graz, Finland"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2409-7807","authenticated-orcid":false,"given":"Shreyas","family":"Pai","sequence":"additional","affiliation":[{"name":"Aalto University, Espoo, Finland"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7031-9354","authenticated-orcid":false,"given":"Simo","family":"S\u00e4rkk\u00e4","sequence":"additional","affiliation":[{"name":"Aalto University, Espoo, Finland"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9887-5192","authenticated-orcid":false,"given":"Jan","family":"Studen\u00fd","sequence":"additional","affiliation":[{"name":"Aalto University, Espoo, Finland"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6117-8089","authenticated-orcid":false,"given":"Jukka","family":"Suomela","sequence":"additional","affiliation":[{"name":"Aalto University, Espoo, Finland"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5179-5056","authenticated-orcid":false,"given":"Jara","family":"Uitto","sequence":"additional","affiliation":[{"name":"Aalto University, Espoo, Finland"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0040-1213","authenticated-orcid":false,"given":"Hossein","family":"Vahidi","sequence":"additional","affiliation":[{"name":"Aalto University, Espoo, Finland"}]}],"member":"320","published-online":{"date-parts":[[2023,6,17]]},"reference":[{"key":"e_1_3_2_3_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00070"},{"key":"e_1_3_2_3_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331596"},{"key":"e_1_3_2_3_3_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.DISC.2022.9"},{"key":"e_1_3_2_3_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977554.ch99"},{"key":"e_1_3_2_3_5_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICALP.2018.162"},{"key":"e_1_3_2_3_6_1","volume-title":"Mirrokni","author":"Bateni MohammadHossein","year":"2018","unstructured":"MohammadHossein Bateni, Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, and Vahab S. Mirrokni. 2018b. Massively Parallel Dynamic Programming on Trees. CoRR, Vol. abs\/1809.03685 (2018). showeprint[arXiv]1809.03685 http:\/\/arxiv.org\/abs\/1809.03685"},{"key":"e_1_3_2_3_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00095"},{"key":"e_1_3_2_3_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3470631"},{"key":"e_1_3_2_3_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-19488-6_110"},{"key":"e_1_3_2_3_10_1","unstructured":"Tim Bray Jean Paoli C. M. Sperberg-McQueen Eve Maler and Fran\u00e7ois Yergeau (Eds.). 2008. Extensible Markup Language (XML) 1.0 (Fifth Edition). https:\/\/www.w3.org\/TR\/REC-xml\/"},{"key":"e_1_3_2_3_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519935.3520055"},{"key":"e_1_3_2_3_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3451992"},{"key":"e_1_3_2_3_13_1","volume-title":"Vazirani","author":"Dasgupta Sanjoy","year":"2008","unstructured":"Sanjoy Dasgupta, Christos H. Papadimitriou, and Umesh V. Vazirani. 2008. Algorithms. McGraw-Hill."},{"key":"e_1_3_2_3_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00097"},{"key":"e_1_3_2_3_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6423(94)00013-1"},{"key":"e_1_3_2_3_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795294141"},{"key":"e_1_3_2_3_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25591-5_39"},{"key":"e_1_3_2_3_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2021.3103338"},{"key":"e_1_3_2_3_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055460"},{"key":"e_1_3_2_3_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973075.76"},{"volume-title":"Probabilistic Graphical Models: Principles and Techniques","author":"Koller Daphne","key":"e_1_3_2_3_21_1","unstructured":"Daphne Koller and Nir Friedman. 2009. Probabilistic Graphical Models: Principles and Techniques. The MIT Press."},{"key":"e_1_3_2_3_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/322217.322232"},{"key":"e_1_3_2_3_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793254571"},{"key":"e_1_3_2_3_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3232536"},{"volume-title":"Bayesian Filtering and Smoothing","author":"S\u00e4rkk\u00e4 Simo","key":"e_1_3_2_3_25_1","unstructured":"Simo S\u00e4rkk\u00e4. 2013. Bayesian Filtering and Smoothing. Cambridge University Press."},{"key":"e_1_3_2_3_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2020.2976316"}],"event":{"name":"SPAA '23: 35th 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":"Orlando FL USA","acronym":"SPAA '23"},"container-title":["Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3558481.3591098","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3558481.3591098","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:47:06Z","timestamp":1750178826000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3558481.3591098"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,17]]},"references-count":26,"alternative-id":["10.1145\/3558481.3591098","10.1145\/3558481"],"URL":"https:\/\/doi.org\/10.1145\/3558481.3591098","relation":{},"subject":[],"published":{"date-parts":[[2023,6,17]]},"assertion":[{"value":"2023-06-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}