Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
2 Publications
2026 | Journal Article | LibreCat-ID: 65733
A. Padalkin and C. Scheideler, “Polylogarithmic time algorithms for shortest path forests in programmable matter,” Distributed Computing, vol. 39, no. 2, Art. no. 15, 2026, doi: 10.1007/s00446-026-00505-2.
LibreCat
| DOI