{"date_created":"2026-02-10T10:06:36Z","status":"public","_id":"64103","year":"2024","page":"65 - 75","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"user_id":"15578","language":[{"iso":"eng"}],"place":"PODC 2024: 65-75","type":"conference","date_updated":"2026-02-11T09:11:58Z","title":"Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter. ","citation":{"apa":"Scheideler, C., &#38; Padalkin, A. (2024). <i>Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter. </i>. 65–75.","ieee":"C. Scheideler and A. Padalkin, “Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter. ,” 2024, pp. 65–75.","mla":"Scheideler, Christian, and Andreas Padalkin. <i>Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter. </i>. 2024, pp. 65–75.","ama":"Scheideler C, Padalkin A. Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter. . In: ; 2024:65-75.","bibtex":"@inproceedings{Scheideler_Padalkin_2024, place={PODC 2024: 65-75}, title={Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter. }, author={Scheideler, Christian and Padalkin, Andreas}, year={2024}, pages={65–75} }","chicago":"Scheideler, Christian, and Andreas Padalkin. “Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter. ,” 65–75. PODC 2024: 65-75, 2024.","short":"C. Scheideler, A. Padalkin, in: PODC 2024: 65-75, 2024, pp. 65–75."},"author":[{"id":"20792","last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian"},{"id":"88238","full_name":"Padalkin, Andreas","first_name":"Andreas","last_name":"Padalkin"}]}