Antoine El-Hayek

Orcid: 0000-0003-4268-7368

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

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

Timeline

2022
2023
2024
2025
0
1
2
3
4
2
1
1
1
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Fully Dynamic Approximate Minimum Cut in Subpolynomial Time per Operation.
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.
Proceedings of the 38th International Symposium on Distributed Computing, 2024

2023
On b-Matching and Fully-Dynamic Maximum k-Edge Coloring.
CoRR, 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...