{"date_updated":"2024-07-24T14:26:23Z","type":"conference","year":"2024","date_created":"2024-07-24T14:26:10Z","language":[{"iso":"eng"}],"user_id":"88238","_id":"55377","doi":"10.1145/3662158.3662776","status":"public","citation":{"short":"A. Padalkin, C. Scheideler, in: Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, ACM, 2024.","apa":"Padalkin, A., &#38; Scheideler, C. (2024). Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter. <i>Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing</i>. <a href=\"https://doi.org/10.1145/3662158.3662776\">https://doi.org/10.1145/3662158.3662776</a>","mla":"Padalkin, Andreas, and Christian Scheideler. “Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter.” <i>Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing</i>, ACM, 2024, doi:<a href=\"https://doi.org/10.1145/3662158.3662776\">10.1145/3662158.3662776</a>.","ieee":"A. Padalkin and C. Scheideler, “Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter,” 2024, doi: <a href=\"https://doi.org/10.1145/3662158.3662776\">10.1145/3662158.3662776</a>.","chicago":"Padalkin, Andreas, and Christian Scheideler. “Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter.” In <i>Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing</i>. ACM, 2024. <a href=\"https://doi.org/10.1145/3662158.3662776\">https://doi.org/10.1145/3662158.3662776</a>.","ama":"Padalkin A, Scheideler C. Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter. In: <i>Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing</i>. ACM; 2024. doi:<a href=\"https://doi.org/10.1145/3662158.3662776\">10.1145/3662158.3662776</a>","bibtex":"@inproceedings{Padalkin_Scheideler_2024, title={Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter}, DOI={<a href=\"https://doi.org/10.1145/3662158.3662776\">10.1145/3662158.3662776</a>}, booktitle={Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing}, publisher={ACM}, author={Padalkin, Andreas and Scheideler, Christian}, year={2024} }"},"title":"Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter","author":[{"first_name":"Andreas","full_name":"Padalkin, Andreas","id":"88238","last_name":"Padalkin"},{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"}],"publication":"Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing","publication_status":"published","publisher":"ACM"}