Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter
A. Padalkin, C. Scheideler, in: Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, ACM, 2024.
Download
No fulltext has been uploaded.
Conference Paper
| Published
| English
Publishing Year
Proceedings Title
Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing
LibreCat-ID
Cite this
Padalkin A, Scheideler C. Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter. In: Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing. ACM; 2024. doi:10.1145/3662158.3662776
Padalkin, A., & Scheideler, C. (2024). Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter. Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing. https://doi.org/10.1145/3662158.3662776
@inproceedings{Padalkin_Scheideler_2024, title={Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter}, DOI={10.1145/3662158.3662776}, booktitle={Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing}, publisher={ACM}, author={Padalkin, Andreas and Scheideler, Christian}, year={2024} }
Padalkin, Andreas, and Christian Scheideler. “Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter.” In Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing. ACM, 2024. https://doi.org/10.1145/3662158.3662776.
A. Padalkin and C. Scheideler, “Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter,” 2024, doi: 10.1145/3662158.3662776.
Padalkin, Andreas, and Christian Scheideler. “Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter.” Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, ACM, 2024, doi:10.1145/3662158.3662776.
Google Scholar