Antoine El-Hayek

10 Publications

Mark all

[10]
2026 | Published | Conference Paper | IST-REx-ID: 22327 | OA
Ranking opinions with few states in population protocols
T.-L. Breitkopf, J. Dallot, A. El-Hayek, S. Schmid, in:, Proceedings of the ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2026, pp. 414–424.
[Published Version] View | Files available | DOI | arXiv
 
[9]
2026 | Published | Thesis | PhD | IST-REx-ID: 22281 | OA
Handling updates and failures: Dynamic graph algorithms and distributed computing on dynamic networks
A. El-Hayek, Handling Updates and Failures: Dynamic Graph Algorithms and Distributed Computing on Dynamic Networks, Institute of Science and Technology Austria, 2026.
[Published Version] View | Files available | DOI
 
[8]
2026 | Published | Conference Paper | IST-REx-ID: 21720 | OA
Deterministic and exact fully-dynamic minimum cut of superpolylogarithmic size in subpolynomial time
A. El-Hayek, M. Henzinger, J. Li, in:, Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2026, pp. 613–663.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[7]
2025 | Published | Conference Paper | IST-REx-ID: 19858 | OA
On b-matching and fully-dynamic maximum k-edge coloring
A. El-Hayek, K. Hanauer, M. Henzinger, in:, 4th Symposium on Algorithmic Foundations of Dynamic Networks, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[6]
2025 | Published | Conference Paper | IST-REx-ID: 20052 | OA
Brief announcement: Minimizing energy solves relative majority with a cubic number of states in population protocols
T.-L. Breitkopf, J. Dallot, A. El-Hayek, S. Schmid, in:, Proceedings of the ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2025, pp. 549–552.
[Published Version] View | Files available | DOI | WoS
 
[5]
2025 | Published | Conference Paper | IST-REx-ID: 20051 | OA
An almost tight lower bound for plurality consensus with undecided state dynamics in the population protocol model
A. El-Hayek, R. Elsässer, S. Schmid, in:, Proceedings of the ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2025.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[4]
2025 | Published | Conference Paper | IST-REx-ID: 19982 | OA
Fully dynamic approximate minimum cut in subpolynomial time per operation
A. El-Hayek, M. Henzinger, J. Li, in:, Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2025, pp. 750–784.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[3]
2024 | Published | Conference Paper | IST-REx-ID: 18557 | OA
Broadcast and Consensus in stochastic dynamic networks with Byzantine nodes and adversarial edges
A. El-Hayek, M. Henzinger, S. Schmid, in:, 38th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[2]
2023 | Published | Conference Paper | IST-REx-ID: 22373 | OA
Asymptotically tight bounds on the time complexity of broadcast and its variants in dynamic networks
A. El-Hayek, M. Henzinger, S. Schmid, in:, Y. Tauman Kalai (Ed.), 14th Innovations in Theoretical Computer Science Conference, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.
[Published Version] View | Files available | DOI | arXiv
 
[1]
2022 | Published | Conference Paper | IST-REx-ID: 22374 | OA
Brief announcement: Broadcasting time in dynamic rooted trees is linear
A. El-Hayek, M. Henzinger, S. Schmid, in:, Proceedings of the ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2022, pp. 54–56.
[Published Version] View | Files available | DOI | Download Published Version (ext.) | arXiv
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Export / Embed

Grants


10 Publications

Mark all

[10]
2026 | Published | Conference Paper | IST-REx-ID: 22327 | OA
Ranking opinions with few states in population protocols
T.-L. Breitkopf, J. Dallot, A. El-Hayek, S. Schmid, in:, Proceedings of the ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2026, pp. 414–424.
[Published Version] View | Files available | DOI | arXiv
 
[9]
2026 | Published | Thesis | PhD | IST-REx-ID: 22281 | OA
Handling updates and failures: Dynamic graph algorithms and distributed computing on dynamic networks
A. El-Hayek, Handling Updates and Failures: Dynamic Graph Algorithms and Distributed Computing on Dynamic Networks, Institute of Science and Technology Austria, 2026.
[Published Version] View | Files available | DOI
 
[8]
2026 | Published | Conference Paper | IST-REx-ID: 21720 | OA
Deterministic and exact fully-dynamic minimum cut of superpolylogarithmic size in subpolynomial time
A. El-Hayek, M. Henzinger, J. Li, in:, Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2026, pp. 613–663.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[7]
2025 | Published | Conference Paper | IST-REx-ID: 19858 | OA
On b-matching and fully-dynamic maximum k-edge coloring
A. El-Hayek, K. Hanauer, M. Henzinger, in:, 4th Symposium on Algorithmic Foundations of Dynamic Networks, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[6]
2025 | Published | Conference Paper | IST-REx-ID: 20052 | OA
Brief announcement: Minimizing energy solves relative majority with a cubic number of states in population protocols
T.-L. Breitkopf, J. Dallot, A. El-Hayek, S. Schmid, in:, Proceedings of the ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2025, pp. 549–552.
[Published Version] View | Files available | DOI | WoS
 
[5]
2025 | Published | Conference Paper | IST-REx-ID: 20051 | OA
An almost tight lower bound for plurality consensus with undecided state dynamics in the population protocol model
A. El-Hayek, R. Elsässer, S. Schmid, in:, Proceedings of the ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2025.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[4]
2025 | Published | Conference Paper | IST-REx-ID: 19982 | OA
Fully dynamic approximate minimum cut in subpolynomial time per operation
A. El-Hayek, M. Henzinger, J. Li, in:, Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2025, pp. 750–784.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[3]
2024 | Published | Conference Paper | IST-REx-ID: 18557 | OA
Broadcast and Consensus in stochastic dynamic networks with Byzantine nodes and adversarial edges
A. El-Hayek, M. Henzinger, S. Schmid, in:, 38th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[2]
2023 | Published | Conference Paper | IST-REx-ID: 22373 | OA
Asymptotically tight bounds on the time complexity of broadcast and its variants in dynamic networks
A. El-Hayek, M. Henzinger, S. Schmid, in:, Y. Tauman Kalai (Ed.), 14th Innovations in Theoretical Computer Science Conference, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.
[Published Version] View | Files available | DOI | arXiv
 
[1]
2022 | Published | Conference Paper | IST-REx-ID: 22374 | OA
Brief announcement: Broadcasting time in dynamic rooted trees is linear
A. El-Hayek, M. Henzinger, S. Schmid, in:, Proceedings of the ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2022, pp. 54–56.
[Published Version] View | Files available | DOI | Download Published Version (ext.) | arXiv
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Export / Embed