Nada Almalki

According to our database, Nada Almalki authored at least 6 papers between 2023 and 2025.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2025

Efficient Distributed Algorithms for Shape Reduction via Reconfigurable Circuits.

Nada Almalki, Siddharth Gupta, Othon Michail, Andreas Padalkin

CoRR, March, 2025

On the exponential growth of geometric shapes.

Nada Almalki, Siddharth Gupta, Othon Michail

Theor. Comput. Sci., 2025

Brief Announcement: Efficient Distributed Algorithms for Shape Reduction via Reconfigurable Circuits.

Nada Almalki, Siddharth Gupta, Othon Michail, Andreas Padalkin

Proceedings of the 4th Symposium on Algorithmic Foundations of Dynamic Networks, 2025

2024

On geometric shape construction via growth operations.

Nada Almalki, Othon Michail

Theor. Comput. Sci., February, 2024

Brief Announcement: On the Exponential Growth of Geometric Shapes.

Nada Almalki, Siddharth Gupta, Othon Michail

Proceedings of the 3rd Symposium on Algorithmic Foundations of Dynamic Networks, 2024

2023

Growing Fast without Colliding: Polylogarithmic Time Step Construction of Geometric Shapes.

Nada Almalki, Siddharth Gupta, Othon Michail

CoRR, 2023