Antoine El-Hayek

16 papers A* 5A 2Journal 8Unranked 1
YearRankTypeTitle / Venue / Authors
2026 A* conf
Deterministic and Exact Fully-dynamic Minimum Cut of Superpolylogarithmic Size in Subpolynomial Time.
SODA
Antoine El-Hayek, Monika Henzinger, Jason Li
2025 A* conf
An Almost Tight Lower Bound for Plurality Consensus with Undecided State Dynamics in the Population Protocol Model.
PODC
Antoine El-Hayek, Robert Elsässer, Stefan Schmid
2025 J jnl
An Almost Tight Lower Bound for Plurality Consensus with Undecided State Dynamics in the Population Protocol Model.
CoRR
Antoine El-Hayek, Robert Elsässer, Stefan Schmid
2025 A* conf
Brief Announcement: Minimizing Energy Solves Relative Majority with a Cubic Number of States in Population Protocols.
PODC
Tom-Lukas Breitkopf, Julien Dallot, Antoine El-Hayek, Stefan Schmid
2025 J jnl
Brief Announcement: Minimizing Energy Solves Relative Majority with a Cubic Number of States in Population Protocols.
CoRR
Tom-Lukas Breitkopf, Julien Dallot, Antoine El-Hayek, Stefan Schmid
2025 J jnl
Deterministic and Exact Fully-dynamic Minimum Cut of Superpolylogarithmic Size in Subpolynomial Time.
CoRR
Antoine El-Hayek, Monika Henzinger, Jason Li
2025 A* conf
Fully Dynamic Approximate Minimum Cut in Subpolynomial Time per Operation.
SODA
Antoine El-Hayek, Monika Henzinger, Jason Li
2025 — conf
On b-Matching and Fully-Dynamic Maximum k-Edge Coloring.
SAND
Antoine El-Hayek, Kathrin Hanauer, Monika Henzinger
2024 A conf
Broadcast and Consensus in Stochastic Dynamic Networks with Byzantine Nodes and Adversarial Edges.
DISC
Antoine El-Hayek, Monika Henzinger, Stefan Schmid
2024 J jnl
Fully Dynamic Approximate Minimum Cut in Subpolynomial Time per Operation.
CoRR
Antoine El-Hayek, Monika Henzinger, Jason Li
2023 A conf
Asymptotically Tight Bounds on the Time Complexity of Broadcast and Its Variants in Dynamic Networks.
ITCS
Antoine El-Hayek, Monika Henzinger, Stefan Schmid
2023 J jnl
On b-Matching and Fully-Dynamic Maximum k-Edge Coloring.
CoRR
Antoine El-Hayek, Kathrin Hanauer, Monika Henzinger
2023 J jnl
Time Complexity of Broadcast and Consensus for Randomized Oblivious Message Adversaries.
CoRR
Antoine El-Hayek, Monika Henzinger, Stefan Schmid
2022 J jnl
Asymptotically Tight Bounds on the Time Complexity of Broadcast and its Variants in Dynamic Networks.
CoRR
Antoine El-Hayek, Monika Henzinger, Stefan Schmid
2022 A* conf
Brief Announcement: Broadcasting Time in Dynamic Rooted Trees is Linear.
PODC
Antoine El-Hayek, Monika Henzinger, Stefan Schmid
2022 J jnl
Brief Announcement: Broadcasting Time in Dynamic Rooted Trees is Linear.
CoRR
Antoine El-Hayek, Monika Henzinger, Stefan Schmid