Brief Announcement: Efficient Distributed Algorithms for Shape Reduction via Reconfigurable Circuits
N. Almalki, S. Gupta, O. Michail, A. Padalkin, in: K. Meeks, C. Scheideler (Eds.), 4th Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2025, Liverpool, UK, June 9-11, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, p. 20:1–20:6.
Download
No fulltext has been uploaded.
Conference Paper
| English
Author
Almalki, Nada;
Gupta, Siddharth;
Michail, Othon;
Padalkin, Andreas
Editor
Meeks, Kitty;
Scheideler, Christian
Publishing Year
Proceedings Title
4th Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2025, Liverpool, UK, June 9-11, 2025
forms.conference.field.series_title_volume.label
LIPIcs
Volume
330
Page
20:1–20:6
LibreCat-ID
Cite this
Almalki N, Gupta S, Michail O, Padalkin A. Brief Announcement: Efficient Distributed Algorithms for Shape Reduction via Reconfigurable Circuits. In: Meeks K, Scheideler C, eds. 4th Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2025, Liverpool, UK, June 9-11, 2025. Vol 330. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2025:20:1–20:6. doi:10.4230/LIPICS.SAND.2025.20
Almalki, N., Gupta, S., Michail, O., & Padalkin, A. (2025). Brief Announcement: Efficient Distributed Algorithms for Shape Reduction via Reconfigurable Circuits. In K. Meeks & C. Scheideler (Eds.), 4th Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2025, Liverpool, UK, June 9-11, 2025 (Vol. 330, p. 20:1–20:6). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.SAND.2025.20
@inproceedings{Almalki_Gupta_Michail_Padalkin_2025, series={LIPIcs}, title={Brief Announcement: Efficient Distributed Algorithms for Shape Reduction via Reconfigurable Circuits}, volume={330}, DOI={10.4230/LIPICS.SAND.2025.20}, booktitle={4th Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2025, Liverpool, UK, June 9-11, 2025}, publisher={Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, author={Almalki, Nada and Gupta, Siddharth and Michail, Othon and Padalkin, Andreas}, editor={Meeks, Kitty and Scheideler, Christian}, year={2025}, pages={20:1–20:6}, collection={LIPIcs} }
Almalki, Nada, Siddharth Gupta, Othon Michail, and Andreas Padalkin. “Brief Announcement: Efficient Distributed Algorithms for Shape Reduction via Reconfigurable Circuits.” In 4th Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2025, Liverpool, UK, June 9-11, 2025, edited by Kitty Meeks and Christian Scheideler, 330:20:1–20:6. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. https://doi.org/10.4230/LIPICS.SAND.2025.20.
N. Almalki, S. Gupta, O. Michail, and A. Padalkin, “Brief Announcement: Efficient Distributed Algorithms for Shape Reduction via Reconfigurable Circuits,” in 4th Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2025, Liverpool, UK, June 9-11, 2025, 2025, vol. 330, p. 20:1–20:6, doi: 10.4230/LIPICS.SAND.2025.20.
Almalki, Nada, et al. “Brief Announcement: Efficient Distributed Algorithms for Shape Reduction via Reconfigurable Circuits.” 4th Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2025, Liverpool, UK, June 9-11, 2025, edited by Kitty Meeks and Christian Scheideler, vol. 330, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, p. 20:1–20:6, doi:10.4230/LIPICS.SAND.2025.20.
Google Scholar