{"id":8,"date":"2011-03-16T16:22:01","date_gmt":"2011-03-16T16:22:01","guid":{"rendered":"http:\/\/antoineelhayek.wordpress.com\/?page_id=2"},"modified":"2026-02-21T08:33:00","modified_gmt":"2026-02-21T08:33:00","slug":"8-2","status":"publish","type":"page","link":"https:\/\/el-hayek.eu\/","title":{"rendered":""},"content":{"rendered":"\n<p><\/p>\n\n\n\n<h2 class=\"wp-block-heading\">About me<\/h2>\n\n\n\n<div class=\"wp-block-columns is-layout-flex wp-container-core-columns-is-layout-28f84493 wp-block-columns-is-layout-flex\">\n<div class=\"wp-block-column is-layout-flow wp-block-column-is-layout-flow\" style=\"flex-basis:66.66%\">\n<p class=\"has-medium-font-size\">Currently a PhD student at ISTA, Austria, I am interested in dynamic algorithms, and more specifically in dynamic graph algorithms. In particular, I looked into edge coloring and minimum cut algorithms.<\/p>\n\n\n\n<p class=\"has-medium-font-size\">I am also interested in distributed computing, in particular broadcasting and population protocols.<\/p>\n\n\n\n<p class=\"has-medium-font-size\">Looking at Computer Science problems is fun, but doing so on a cool planet is even more fun. That is why I support the <a href=\"http:\/\/tcs4f.org\">TCS4F<\/a> initiative, among others.<\/p>\n<\/div>\n\n\n\n<div class=\"wp-block-column is-layout-flow wp-block-column-is-layout-flow\" style=\"flex-basis:33.33%\">\n<figure class=\"wp-block-image aligncenter size-full\"><a href=\"https:\/\/antoineelhayek.wordpress.com\/wp-content\/uploads\/2025\/04\/antoine.png\"><img decoding=\"async\" src=\"https:\/\/antoineelhayek.wordpress.com\/wp-content\/uploads\/2025\/04\/antoine.png\" alt=\"\" class=\"wp-image-14\"\/><\/a><\/figure>\n<\/div>\n<\/div>\n\n\n\n<hr class=\"wp-block-separator has-alpha-channel-opacity\"\/>\n\n\n\n<h2 class=\"wp-block-heading\">List of Publications<\/h2>\n\n\n\n<p><\/p>\n\n\n\n<p class=\"has-medium-font-size\"><a href=\"https:\/\/arxiv.org\/abs\/2512.13105\">Deterministic and Exact Fully-dynamic Minimum Cut of Superpolylogarithmic Size in Subpolynomial Time<\/a><br>With Monika Henzinger and Jason Li<br>SODA 2026<\/p>\n\n\n\n<p class=\"has-medium-font-size\"><a href=\"http:\/\/arxiv.org\/abs\/2505.02765\">An Almost Tight Lower Bound for Plurality Consensus with Undecided State Dynamics in the Population Protocol Model<\/a><br>With Robert Els\u00e4sser and Stefan Schmid<br>PODC 2025<\/p>\n\n\n\n<p class=\"has-medium-font-size\"><a href=\"https:\/\/arxiv.org\/abs\/2505.02785\">Brief Announcement: Minimizing Energy Solves Relative Majority with a Cubic Number of States in Population Protocols<\/a><br>With Tom-Lukas Breitkopf, Julien Dallot and Stefan Schmid<br>PODC 2025<\/p>\n\n\n\n<p class=\"has-medium-font-size\"><a href=\"https:\/\/arxiv.org\/abs\/2310.01149\">On b-Matching and Fully-Dynamic Maximum k-Edge Coloring<\/a>&nbsp;<br>With Kathrin Hanauer and Monika Henzinger<br>SAND 2025<\/p>\n\n\n\n<p class=\"has-medium-font-size\"><a href=\"https:\/\/arxiv.org\/abs\/2412.15069\">Fully Dynamic Approximate Minimum Cut in Subpolynomial Time per Operation<\/a><br>With Monika Henzinger and Jason Li<br>SODA 2025<\/p>\n\n\n\n<p class=\"has-medium-font-size\"><a href=\"https:\/\/arxiv.org\/abs\/2302.11988\">Broadcast and Consensus in Stochastic Dynamic Networks with Byzantine Nodes and Adversarial Edges<\/a><br>With Monika Henzinger and Stefan Schmid<br>DISC 2024<\/p>\n\n\n\n<p class=\"has-medium-font-size\"><a href=\"https:\/\/arxiv.org\/abs\/2211.10151\">Asymptotically Tight Bounds on the Time Complexity of Broadcast and its Variants in Dynamic Networks<\/a><br>With Monika Henzinger and Stefan Schmid<br>ITCS 2023<\/p>\n\n\n\n<p class=\"has-medium-font-size\"><a href=\"https:\/\/arxiv.org\/abs\/2211.11352\">Brief Announcement: Broadcasting Time in Dynamic Rooted Trees is Linear<\/a>&nbsp;<br>With Monika Henzinger and Stefan Schmid<br>PODC 2022<\/p>\n\n\n\n<hr class=\"wp-block-separator has-alpha-channel-opacity\"\/>\n\n\n\n<h2 class=\"wp-block-heading\">Contact<\/h2>\n\n\n\n<p>antoine.el-hayek[x]ist.ac.at<\/p>\n","protected":false},"excerpt":{"rendered":"<p>About me Currently a PhD student at ISTA, Austria, I am interested in dynamic algorithms, and more specifically in dynamic graph algorithms. In particular, I looked into edge coloring and minimum cut algorithms. I am also interested in distributed computing, in particular broadcasting and population protocols. Looking at Computer Science problems is fun, but doing [&hellip;]<\/p>\n","protected":false},"author":2,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"open","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-8","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/el-hayek.eu\/index.php\/wp-json\/wp\/v2\/pages\/8","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/el-hayek.eu\/index.php\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/el-hayek.eu\/index.php\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/el-hayek.eu\/index.php\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/el-hayek.eu\/index.php\/wp-json\/wp\/v2\/comments?post=8"}],"version-history":[{"count":3,"href":"https:\/\/el-hayek.eu\/index.php\/wp-json\/wp\/v2\/pages\/8\/revisions"}],"predecessor-version":[{"id":61,"href":"https:\/\/el-hayek.eu\/index.php\/wp-json\/wp\/v2\/pages\/8\/revisions\/61"}],"wp:attachment":[{"href":"https:\/\/el-hayek.eu\/index.php\/wp-json\/wp\/v2\/media?parent=8"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}