Antoine El-Hayek

10 Publications

Mark all

[10]
2026 | Published | Conference Paper | IST-REx-ID: 22327 | OA
Breitkopf, Tom-Lukas, Julien Dallot, Antoine El-Hayek, and Stefan Schmid. “Ranking Opinions with Few States in Population Protocols.” In Proceedings of the ACM Symposium on Principles of Distributed Computing, 414–24. Association for Computing Machinery, 2026. https://doi.org/10.1145/3796701.3815913.
[Published Version] View | Files available | DOI | arXiv
 
[9]
2026 | Published | Thesis | PhD | IST-REx-ID: 22281 | OA
El-Hayek, Antoine. “Handling Updates and Failures: Dynamic Graph Algorithms and Distributed Computing on Dynamic Networks.” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-22281.
[Published Version] View | Files available | DOI
 
[8]
2026 | Published | Conference Paper | IST-REx-ID: 21720 | OA
El-Hayek, Antoine, Monika Henzinger, and Jason Li. “Deterministic and Exact Fully-Dynamic Minimum Cut of Superpolylogarithmic Size in Subpolynomial Time.” In Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms, 2026:613–63. Society for Industrial and Applied Mathematics, 2026. https://doi.org/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, 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 | WoS | arXiv
 
[6]
2025 | Published | Conference Paper | IST-REx-ID: 20052 | OA
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. Association for Computing Machinery, 2025. https://doi.org/10.1145/3732772.3733512.
[Published Version] View | Files available | DOI | WoS
 
[5]
2025 | Published | Conference Paper | IST-REx-ID: 20051 | OA
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 | WoS | arXiv
 
[4]
2025 | Published | Conference Paper | IST-REx-ID: 19982 | OA
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 | Files available | DOI | Download Preprint (ext.) | arXiv
 
[3]
2024 | Published | Conference Paper | IST-REx-ID: 18557 | OA
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 | WoS | arXiv
 
[2]
2023 | Published | Conference Paper | IST-REx-ID: 22373 | OA
El-Hayek, Antoine, Monika Henzinger, and Stefan Schmid. “Asymptotically Tight Bounds on the Time Complexity of Broadcast and Its Variants in Dynamic Networks.” In 14th Innovations in Theoretical Computer Science Conference, edited by Yael Tauman Kalai, Vol. 251. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. https://doi.org/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, Antoine, Monika Henzinger, and Stefan Schmid. “Brief Announcement: Broadcasting Time in Dynamic Rooted Trees Is Linear.” In Proceedings of the ACM Symposium on Principles of Distributed Computing, 54–56. Association for Computing Machinery, 2022. https://doi.org/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: Chicago

Export / Embed

Grants


10 Publications

Mark all

[10]
2026 | Published | Conference Paper | IST-REx-ID: 22327 | OA
Breitkopf, Tom-Lukas, Julien Dallot, Antoine El-Hayek, and Stefan Schmid. “Ranking Opinions with Few States in Population Protocols.” In Proceedings of the ACM Symposium on Principles of Distributed Computing, 414–24. Association for Computing Machinery, 2026. https://doi.org/10.1145/3796701.3815913.
[Published Version] View | Files available | DOI | arXiv
 
[9]
2026 | Published | Thesis | PhD | IST-REx-ID: 22281 | OA
El-Hayek, Antoine. “Handling Updates and Failures: Dynamic Graph Algorithms and Distributed Computing on Dynamic Networks.” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-22281.
[Published Version] View | Files available | DOI
 
[8]
2026 | Published | Conference Paper | IST-REx-ID: 21720 | OA
El-Hayek, Antoine, Monika Henzinger, and Jason Li. “Deterministic and Exact Fully-Dynamic Minimum Cut of Superpolylogarithmic Size in Subpolynomial Time.” In Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms, 2026:613–63. Society for Industrial and Applied Mathematics, 2026. https://doi.org/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, 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 | WoS | arXiv
 
[6]
2025 | Published | Conference Paper | IST-REx-ID: 20052 | OA
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. Association for Computing Machinery, 2025. https://doi.org/10.1145/3732772.3733512.
[Published Version] View | Files available | DOI | WoS
 
[5]
2025 | Published | Conference Paper | IST-REx-ID: 20051 | OA
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 | WoS | arXiv
 
[4]
2025 | Published | Conference Paper | IST-REx-ID: 19982 | OA
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 | Files available | DOI | Download Preprint (ext.) | arXiv
 
[3]
2024 | Published | Conference Paper | IST-REx-ID: 18557 | OA
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 | WoS | arXiv
 
[2]
2023 | Published | Conference Paper | IST-REx-ID: 22373 | OA
El-Hayek, Antoine, Monika Henzinger, and Stefan Schmid. “Asymptotically Tight Bounds on the Time Complexity of Broadcast and Its Variants in Dynamic Networks.” In 14th Innovations in Theoretical Computer Science Conference, edited by Yael Tauman Kalai, Vol. 251. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. https://doi.org/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, Antoine, Monika Henzinger, and Stefan Schmid. “Brief Announcement: Broadcasting Time in Dynamic Rooted Trees Is Linear.” In Proceedings of the ACM Symposium on Principles of Distributed Computing, 54–56. Association for Computing Machinery, 2022. https://doi.org/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: Chicago

Export / Embed