Antoine El-Hayek

10 Publications

Mark all

[10]
2026 | Published | Conference Paper | IST-REx-ID: 22327 | OA
Breitkopf T-L, Dallot J, El-Hayek A, Schmid S. Ranking opinions with few states in population protocols. In: Proceedings of the ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery; 2026:414-424. doi:10.1145/3796701.3815913
[Published Version] View | Files available | DOI | arXiv
 
[9]
2026 | Published | Thesis | PhD | IST-REx-ID: 22281 | OA
El-Hayek A. Handling updates and failures: Dynamic graph algorithms and distributed computing on dynamic networks. 2026. doi:10.15479/AT-ISTA-22281
[Published Version] View | Files available | DOI
 
[8]
2026 | Published | Conference Paper | IST-REx-ID: 21720 | OA
El-Hayek A, Henzinger M, Li J. Deterministic and exact fully-dynamic minimum cut of superpolylogarithmic size in subpolynomial time. In: Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms. Vol 2026. Society for Industrial and Applied Mathematics; 2026:613-663. doi:10.1137/1.9781611978971.25
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[7]
2025 | Published | Conference Paper | IST-REx-ID: 19858 | OA
El-Hayek A, Hanauer K, Henzinger M. 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. doi:10.4230/LIPIcs.SAND.2025.4
[Published Version] View | Files available | DOI | WoS | arXiv
 
[6]
2025 | Published | Conference Paper | IST-REx-ID: 20052 | OA
Breitkopf T-L, Dallot J, El-Hayek A, Schmid S. 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. Association for Computing Machinery; 2025:549-552. doi:10.1145/3732772.3733512
[Published Version] View | Files available | DOI | WoS
 
[5]
2025 | Published | Conference Paper | IST-REx-ID: 20051 | OA
El-Hayek A, Elsässer R, Schmid S. 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. doi:10.1145/3732772.3733505
[Published Version] View | Files available | DOI | WoS | arXiv
 
[4]
2025 | Published | Conference Paper | IST-REx-ID: 19982 | OA
El-Hayek A, Henzinger M, Li J. Fully dynamic approximate minimum cut in subpolynomial time per operation. In: Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics; 2025:750-784. doi:10.1137/1.9781611978322.22
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[3]
2024 | Published | Conference Paper | IST-REx-ID: 18557 | OA
El-Hayek A, Henzinger M, Schmid S. 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. doi:10.4230/LIPIcs.DISC.2024.21
[Published Version] View | Files available | DOI | WoS | arXiv
 
[2]
2023 | Published | Conference Paper | IST-REx-ID: 22373 | OA
El-Hayek A, Henzinger M, Schmid S. Asymptotically tight bounds on the time complexity of broadcast and its variants in dynamic networks. In: Tauman Kalai Y, ed. 14th Innovations in Theoretical Computer Science Conference. Vol 251. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023. doi:10.4230/LIPICS.ITCS.2023.47
[Published Version] View | Files available | DOI | arXiv
 
[1]
2022 | Published | Conference Paper | IST-REx-ID: 22374 | OA
El-Hayek A, Henzinger M, Schmid S. Brief announcement: Broadcasting time in dynamic rooted trees is linear. In: Proceedings of the ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery; 2022:54-56. doi:10.1145/3519270.3538460
[Published Version] View | Files available | DOI | Download Published Version (ext.) | arXiv
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: AMA

Export / Embed

Grants


10 Publications

Mark all

[10]
2026 | Published | Conference Paper | IST-REx-ID: 22327 | OA
Breitkopf T-L, Dallot J, El-Hayek A, Schmid S. Ranking opinions with few states in population protocols. In: Proceedings of the ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery; 2026:414-424. doi:10.1145/3796701.3815913
[Published Version] View | Files available | DOI | arXiv
 
[9]
2026 | Published | Thesis | PhD | IST-REx-ID: 22281 | OA
El-Hayek A. Handling updates and failures: Dynamic graph algorithms and distributed computing on dynamic networks. 2026. doi:10.15479/AT-ISTA-22281
[Published Version] View | Files available | DOI
 
[8]
2026 | Published | Conference Paper | IST-REx-ID: 21720 | OA
El-Hayek A, Henzinger M, Li J. Deterministic and exact fully-dynamic minimum cut of superpolylogarithmic size in subpolynomial time. In: Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms. Vol 2026. Society for Industrial and Applied Mathematics; 2026:613-663. doi:10.1137/1.9781611978971.25
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[7]
2025 | Published | Conference Paper | IST-REx-ID: 19858 | OA
El-Hayek A, Hanauer K, Henzinger M. 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. doi:10.4230/LIPIcs.SAND.2025.4
[Published Version] View | Files available | DOI | WoS | arXiv
 
[6]
2025 | Published | Conference Paper | IST-REx-ID: 20052 | OA
Breitkopf T-L, Dallot J, El-Hayek A, Schmid S. 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. Association for Computing Machinery; 2025:549-552. doi:10.1145/3732772.3733512
[Published Version] View | Files available | DOI | WoS
 
[5]
2025 | Published | Conference Paper | IST-REx-ID: 20051 | OA
El-Hayek A, Elsässer R, Schmid S. 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. doi:10.1145/3732772.3733505
[Published Version] View | Files available | DOI | WoS | arXiv
 
[4]
2025 | Published | Conference Paper | IST-REx-ID: 19982 | OA
El-Hayek A, Henzinger M, Li J. Fully dynamic approximate minimum cut in subpolynomial time per operation. In: Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics; 2025:750-784. doi:10.1137/1.9781611978322.22
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[3]
2024 | Published | Conference Paper | IST-REx-ID: 18557 | OA
El-Hayek A, Henzinger M, Schmid S. 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. doi:10.4230/LIPIcs.DISC.2024.21
[Published Version] View | Files available | DOI | WoS | arXiv
 
[2]
2023 | Published | Conference Paper | IST-REx-ID: 22373 | OA
El-Hayek A, Henzinger M, Schmid S. Asymptotically tight bounds on the time complexity of broadcast and its variants in dynamic networks. In: Tauman Kalai Y, ed. 14th Innovations in Theoretical Computer Science Conference. Vol 251. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023. doi:10.4230/LIPICS.ITCS.2023.47
[Published Version] View | Files available | DOI | arXiv
 
[1]
2022 | Published | Conference Paper | IST-REx-ID: 22374 | OA
El-Hayek A, Henzinger M, Schmid S. Brief announcement: Broadcasting time in dynamic rooted trees is linear. In: Proceedings of the ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery; 2022:54-56. doi:10.1145/3519270.3538460
[Published Version] View | Files available | DOI | Download Published Version (ext.) | arXiv
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: AMA

Export / Embed