Growing Fast without Colliding: Polylogarithmic Time Step Construction of Geometric Shapes. - Nada Almalki 002; Siddharth Gupta 002; Othon Michail (CoRR, 2023)

Brief Announcement: On the Exponential Growth of Geometric Shapes. - Nada Almalki 002; Siddharth Gupta 002; Othon Michail (SAND, 2024)

On geometric shape construction via growth operations. - Nada Almalki 002; Othon Michail (Theor. Comput. Sci., 2024)

Brief Announcement: Efficient Distributed Algorithms for Shape Reduction via Reconfigurable Circuits. - Nada Almalki 002; Siddharth Gupta 002; Othon Michail; Andreas Padalkin (SAND, 2025)

On the exponential growth of geometric shapes. - Nada Almalki 002; Siddharth Gupta 002; Othon Michail (Theor. Comput. Sci., 2025)

Efficient Distributed Algorithms for Shape Reduction via Reconfigurable Circuits. - Nada Almalki 002; Siddharth Gupta 002; Othon Michail; Andreas Padalkin (CoRR, 2025)