Antoine El-Hayek

According to our database, Antoine El-Hayek authored at least 6 papers between 2022 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2025

Fully Dynamic Approximate Minimum Cut in Subpolynomial Time per Operation.

Antoine El-Hayek, Monika Henzinger, Jason Li

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

2024

Broadcast and Consensus in Stochastic Dynamic Networks with Byzantine Nodes and Adversarial Edges.

Antoine El-Hayek, Monika Henzinger, Stefan Schmid

Proceedings of the 38th International Symposium on Distributed Computing, 2024

2023

On b-Matching and Fully-Dynamic Maximum k-Edge Coloring.

Antoine El-Hayek, Kathrin Hanauer, Monika Henzinger

CoRR, 2023

Time Complexity of Broadcast and Consensus for Randomized Oblivious Message Adversaries.

Antoine El-Hayek, Monika Henzinger, Stefan Schmid

CoRR, 2023

Asymptotically Tight Bounds on the Time Complexity of Broadcast and Its Variants in Dynamic Networks.

Antoine El-Hayek, Monika Henzinger, Stefan Schmid

Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

2022

Brief Announcement: Broadcasting Time in Dynamic Rooted Trees is Linear.

Antoine El-Hayek, Monika Henzinger, Stefan Schmid

Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022