Antoine El-Hayek
5 Publications
2025 | Published | Conference Paper | IST-REx-ID: 19858 | 
El-Hayek, A., Hanauer, K., & Henzinger, M. (2025). On b-matching and fully-dynamic maximum k-edge coloring. In 4th Symposium on Algorithmic Foundations of Dynamic Networks (Vol. 330). Liverpool, United Kingdom: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 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, A., Henzinger, M., & Li, J. (2025). Fully dynamic approximate minimum cut in subpolynomial time per operation. In Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 750–784). New Orleans, LA, United States: Society for Industrial and Applied Mathematics. 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, A., Elsässer, R., & Schmid, S. (2025). 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. Huatulco, Mexico: Association for Computing Machinery. https://doi.org/10.1145/3732772.3733505
[Published Version]
View
| Files available
| DOI
| arXiv
2025 | Published | Conference Paper | IST-REx-ID: 20052 |
Breitkopf, T.-L., Dallot, J., El-Hayek, A., & Schmid, S. (2025). 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 (pp. 549–552). Huatulco, Mexico: ACM. https://doi.org/10.1145/3732772.3733512
[Published Version]
View
| Files available
| DOI
2024 | Published | Conference Paper | IST-REx-ID: 18557 |
El-Hayek, A., Henzinger, M., & Schmid, S. (2024). Broadcast and Consensus in stochastic dynamic networks with Byzantine nodes and adversarial edges. In 38th International Symposium on Distributed Computing (Vol. 319). Madrid, Spain: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.DISC.2024.21
[Published Version]
View
| Files available
| DOI
| arXiv
Grants
5 Publications
2025 | Published | Conference Paper | IST-REx-ID: 19858 |
El-Hayek, A., Hanauer, K., & Henzinger, M. (2025). On b-matching and fully-dynamic maximum k-edge coloring. In 4th Symposium on Algorithmic Foundations of Dynamic Networks (Vol. 330). Liverpool, United Kingdom: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 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, A., Henzinger, M., & Li, J. (2025). Fully dynamic approximate minimum cut in subpolynomial time per operation. In Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 750–784). New Orleans, LA, United States: Society for Industrial and Applied Mathematics. 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, A., Elsässer, R., & Schmid, S. (2025). 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. Huatulco, Mexico: Association for Computing Machinery. https://doi.org/10.1145/3732772.3733505
[Published Version]
View
| Files available
| DOI
| arXiv
2025 | Published | Conference Paper | IST-REx-ID: 20052 |
Breitkopf, T.-L., Dallot, J., El-Hayek, A., & Schmid, S. (2025). 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 (pp. 549–552). Huatulco, Mexico: ACM. https://doi.org/10.1145/3732772.3733512
[Published Version]
View
| Files available
| DOI
2024 | Published | Conference Paper | IST-REx-ID: 18557 |
El-Hayek, A., Henzinger, M., & Schmid, S. (2024). Broadcast and Consensus in stochastic dynamic networks with Byzantine nodes and adversarial edges. In 38th International Symposium on Distributed Computing (Vol. 319). Madrid, Spain: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.DISC.2024.21
[Published Version]
View
| Files available
| DOI
| arXiv