Dolev, Shlomi, et al. “Logarithmic Time MIMO Based Self-Stabilizing Clock Synchronization.”10.1145/3477206.3477471__NANOCOM ’21: The Eighth Annual ACM International Conference on Nanoscale Computing and Communication, Virtual Event, Italy, September 7 - 9, 2021, edited by Laura Galluccio et al., ACM, 2021, p. 30:1-30:2, doi:10.1145/3477206.3477471.
LibreCat: /record/25105
DOI: 10.1145/3477206.3477471

Feldmann, Michael, et al. “Coordinating Amoebots via Reconfigurable Circuits.”10.1007/978-3-030-91081-5‑34__Stabilization, Safety, and Security of Distributed Systems - 23rd International Symposium, (SSS) 2021, Virtual Event, November 17-20, 2021, Proceedings, edited by Colette Johnen et al., vol. 13046, Springer, 2021, pp. 484–88, doi:10.1007/978-3-030-91081-5‑34.
LibreCat: /record/28917
DOI: 10.1007/978-3-030-91081-5‑34

Dolev, Shlomi, et al. “Logarithmic Time MIMO Based Self-Stabilizing Clock Synchronization.”10.1145/3477206.3477471__NANOCOM ’21: The Eighth Annual ACM International Conference on Nanoscale Computing and Communication, Virtual Event, Italy, September 7 - 9, 2021, edited by Laura Galluccio et al., ACM, 2021, p. 30:1-30:2, doi:10.1145/3477206.3477471.
LibreCat: /record/27048
DOI: 10.1145/3477206.3477471

J. Daymude, Joshua, et al. “The Canonical Amoebot Model: Algorithms and Concurrency Control.”10.4230/LIPIcs.DISC.2021.20__35th International Symposium on Distributed Computing, DISC 2021, October 4-8, 2021, Freiburg, Germany (Virtual Conference), edited by Seth Gilbert, vol. 209, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, p. 20:1-20:19, doi:10.4230/LIPIcs.DISC.2021.20.
LibreCat: /record/27050
DOI: 10.4230/LIPIcs.DISC.2021.20

Götte, Thorsten, et al. “Time-Optimal Construction of Overlays.”10.1145/3465084.3467932__Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21), edited by Keren Censor-Hillel, ACM, doi:10.1145/3465084.3467932.
LibreCat: /record/22283
DOI: 10.1145/3465084.3467932

Coy, Sam, et al. “Near-Shortest Path Routing in Hybrid Communication Networks.”10.4230/LIPIcs.OPODIS.2021.11__25th International Conference on Principles of Distributed Systems, OPODIS 2021, December 13-15, 2021, Strasbourg, France, edited by Quentin Bramas et al., vol. 217, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, p. 11:1–11:23, doi:10.4230/LIPIcs.OPODIS.2021.11.
LibreCat: /record/30217
DOI: 10.4230/LIPIcs.OPODIS.2021.11

Götte, Thorsten, et al. “Beep-And-Sleep: Message and Energy Efficient Set Cover.”10.1007/978-3-030-89240-1_7__Algorithms for Sensor Systems (ALGOSENSORS ’21), 2021, doi:10.1007/978-3-030-89240-1_7.
LibreCat: /record/26888
DOI: 10.1007/978-3-030-89240-1_7

Augustine, John, et al. “Shortest Paths in a Hybrid Network Model.”10.1137/1.9781611975994.78__Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020, edited by Shuchi Chawla, SIAM, 2020, pp. 1280–99, doi:10.1137/1.9781611975994.78.
LibreCat: /record/27051
DOI: 10.1137/1.9781611975994.78

Gmyr, Robert, et al. “Forming Tile Shapes with Simple Robots.”10.1007/s11047-019-09774-2__Nat. Comput., vol. 19, no. 2, 2020, pp. 375–90, doi:10.1007/s11047-019-09774-2.
LibreCat: /record/17808
DOI: 10.1007/s11047-019-09774-2

Werneck Richa, Andrea, and Christian Scheideler, editors. Structural Information and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn, Germany, June 29 - July 1, 2020, Proceedings. Vol. 12156, Springer, 2020, doi:10.1007/978-3-030-54921-3.
LibreCat: /record/17836
DOI: 10.1007/978-3-030-54921-3

Scheideler, Christian, and Michael Spear, editors. SPAA ’20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020. ACM, 2020, doi:10.1145/3350755.
LibreCat: /record/17839
DOI: 10.1145/3350755

Feldmann, Michael, et al. “Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs.”10.4230/LIPIcs.OPODIS.2020.31__Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.OPODIS.2020.31.
LibreCat: /record/20755
DOI: 10.4230/LIPIcs.OPODIS.2020.31
arXiv: 2007.01191

Feldmann, Michael, et al. “Survey on Algorithms for Self-Stabilizing Overlay Networks.”10.1145/3397190__ACM Computing Surveys, ACM, 2020, doi:10.1145/3397190.
LibreCat: /record/16902
DOI: 10.1145/3397190

Feldmann, Michael, et al. “Time- and Space-Optimal Discrete Clock Synchronization in the Beeping Model.”10.1145/3350755.3400246__Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM, 2020, doi:10.1145/3350755.3400246.
LibreCat: /record/16903
DOI: 10.1145/3350755.3400246
arXiv: 2005.07388

Castenow, Jannik, et al. “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks.” Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN), ACM.
LibreCat: /record/15169

Daymude, Joshua J., et al. “Convex Hull Formation for Programmable Matter.”10.1145/3369740.3372916__Proceedings of the 21st International Conference on Distributed Computing and Networking, 2020, doi:10.1145/3369740.3372916.
LibreCat: /record/16346
DOI: 10.1145/3369740.3372916

Luo, Linghui, et al. “MultiSkipGraph: A Self-Stabilizing Overlay Network That Maintains Monotonic Searchability.” Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS ’19), 2019.
LibreCat: /record/7636

Feldmann, Michael, and Christian Scheideler. “Skeap &; Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities.”10.1145/3323165.3323193__Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM, 2019, pp. 287--296, doi:10.1145/3323165.3323193.
LibreCat: /record/8534
DOI: 10.1145/3323165.3323193
arXiv: 1805.03472

Augustine, John, et al. “Distributed Computation in Node-Capacitated Networks.”10.1145/3323165.3323195__Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures, ACM, 2019, pp. 69--79, doi:10.1145/3323165.3323195.
LibreCat: /record/8871
DOI: 10.1145/3323165.3323195

Daymude, Joshua J., et al. “Computing by Programmable Particles.”https://doi.org/10.1007/978-3-030-11072-7_22__Distributed Computing by Mobile Entities, Current Research in Moving and Computing., Springer, Cham, 2019, pp. 615–81, doi:https://doi.org/10.1007/978-3-030-11072-7_22.
LibreCat: /record/9599
DOI: https://doi.org/10.1007/978-3-030-11072-7_22