Antoine El-Hayek
5 Publications
2025 | Published | Conference Paper | IST-REx-ID: 19858 | 
El-Hayek, Antoine, Kathrin Hanauer, and Monika Henzinger. “On B-Matching and Fully-Dynamic Maximum k-Edge Coloring.” In 4th Symposium on Algorithmic Foundations of Dynamic Networks, Vol. 330. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. https://doi.org/10.4230/LIPIcs.SAND.2025.4.
[Published Version]
View
| Files available
| DOI
| arXiv
2025 | Published | Conference Paper | IST-REx-ID: 19982 |
El-Hayek, Antoine, Monika Henzinger, and Jason Li. “Fully Dynamic Approximate Minimum Cut in Subpolynomial Time per Operation.” In Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 750–84. Society for Industrial and Applied Mathematics, 2025. https://doi.org/10.1137/1.9781611978322.22.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2025 | Published | Conference Paper | IST-REx-ID: 20051 |
El-Hayek, Antoine, Robert Elsässer, and Stefan Schmid. “An Almost Tight Lower Bound for Plurality Consensus with Undecided State Dynamics in the Population Protocol Model.” In Proceedings of the ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery, 2025. https://doi.org/10.1145/3732772.3733505.
[Published Version]
View
| Files available
| DOI
| arXiv
2025 | Published | Conference Paper | IST-REx-ID: 20052 |
Breitkopf, Tom-Lukas, Julien Dallot, Antoine El-Hayek, and Stefan Schmid. “Brief Announcement: Minimizing Energy Solves Relative Majority with a Cubic Number of States in Population Protocols.” In Proceedings of the ACM Symposium on Principles of Distributed Computing, 549–52. ACM, 2025. https://doi.org/10.1145/3732772.3733512.
[Published Version]
View
| Files available
| DOI
2024 | Published | Conference Paper | IST-REx-ID: 18557 |
El-Hayek, Antoine, Monika Henzinger, and Stefan Schmid. “Broadcast and Consensus in Stochastic Dynamic Networks with Byzantine Nodes and Adversarial Edges.” In 38th International Symposium on Distributed Computing, Vol. 319. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPIcs.DISC.2024.21.
[Published Version]
View
| Files available
| DOI
| arXiv
Search
Filter Publications
Display / Sort
Export / Embed
Grants
5 Publications
2025 | Published | Conference Paper | IST-REx-ID: 19858 |
El-Hayek, Antoine, Kathrin Hanauer, and Monika Henzinger. “On B-Matching and Fully-Dynamic Maximum k-Edge Coloring.” In 4th Symposium on Algorithmic Foundations of Dynamic Networks, Vol. 330. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. https://doi.org/10.4230/LIPIcs.SAND.2025.4.
[Published Version]
View
| Files available
| DOI
| arXiv
2025 | Published | Conference Paper | IST-REx-ID: 19982 |
El-Hayek, Antoine, Monika Henzinger, and Jason Li. “Fully Dynamic Approximate Minimum Cut in Subpolynomial Time per Operation.” In Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 750–84. Society for Industrial and Applied Mathematics, 2025. https://doi.org/10.1137/1.9781611978322.22.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2025 | Published | Conference Paper | IST-REx-ID: 20051 |
El-Hayek, Antoine, Robert Elsässer, and Stefan Schmid. “An Almost Tight Lower Bound for Plurality Consensus with Undecided State Dynamics in the Population Protocol Model.” In Proceedings of the ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery, 2025. https://doi.org/10.1145/3732772.3733505.
[Published Version]
View
| Files available
| DOI
| arXiv
2025 | Published | Conference Paper | IST-REx-ID: 20052 |
Breitkopf, Tom-Lukas, Julien Dallot, Antoine El-Hayek, and Stefan Schmid. “Brief Announcement: Minimizing Energy Solves Relative Majority with a Cubic Number of States in Population Protocols.” In Proceedings of the ACM Symposium on Principles of Distributed Computing, 549–52. ACM, 2025. https://doi.org/10.1145/3732772.3733512.
[Published Version]
View
| Files available
| DOI
2024 | Published | Conference Paper | IST-REx-ID: 18557 |
El-Hayek, Antoine, Monika Henzinger, and Stefan Schmid. “Broadcast and Consensus in Stochastic Dynamic Networks with Byzantine Nodes and Adversarial Edges.” In 38th International Symposium on Distributed Computing, Vol. 319. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPIcs.DISC.2024.21.
[Published Version]
View
| Files available
| DOI
| arXiv