Antoine El-Hayek

Orcid: 0000-0003-4268-7368

According to our database1, Antoine El-Hayek authored at least 10 papers between 2022 and 2026.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Deterministic and Exact Fully-dynamic Minimum Cut of Superpolylogarithmic Size in Subpolynomial Time.
Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 2026

Ranking Opinions with Few States in Population Protocols.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2026

2025
Fully Dynamic Approximate Minimum Cut in Subpolynomial Time per Operation.
Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

On b-Matching and Fully-Dynamic Maximum k-Edge Coloring.
Proceedings of the 4th Symposium on Algorithmic Foundations of Dynamic Networks, 2025

An Almost Tight Lower Bound for Plurality Consensus with Undecided State Dynamics in the Population Protocol Model.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2025

Brief Announcement: Minimizing Energy Solves Relative Majority with a Cubic Number of States in Population Protocols.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2025

2024
Broadcast and Consensus in Stochastic Dynamic Networks with Byzantine Nodes and Adversarial Edges.
Proceedings of the 38th International Symposium on Distributed Computing, 2024

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

Asymptotically Tight Bounds on the Time Complexity of Broadcast and Its Variants in Dynamic Networks.
Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

2022
Brief Announcement: Broadcasting Time in Dynamic Rooted Trees is Linear.
Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022


  Loading...