{"id":211,"date":"2023-05-15T11:57:22","date_gmt":"2023-05-15T11:57:22","guid":{"rendered":"https:\/\/www.podc.org\/podc2023\/?page_id=211"},"modified":"2023-06-19T08:13:27","modified_gmt":"2023-06-19T08:13:27","slug":"schedule","status":"publish","type":"page","link":"https:\/\/www.podc.org\/podc2023\/schedule\/","title":{"rendered":"Schedule"},"content":{"rendered":"\n<h1 class=\"wp-block-heading\">High-Level Overview<\/h1>\n\n\n\n<h2 class=\"wp-block-heading\">Saturday, June 17th<\/h2>\n\n\n\n<ul class=\"wp-block-list\">\n<li>9:00 &#8211; 12:30: <strong>Tutorial:<\/strong> High-Level Executable Specification and Reasoning for Improving Distributed Algorithms<\/li>\n<\/ul>\n\n\n\n<h2 class=\"wp-block-heading\">Monday, June 19th<\/h2>\n\n\n\n<ul class=\"wp-block-list\">\n<li><strong>Workshop:<\/strong> Advanced Tools, Programming Languages, and PLatforms for Implementing and Evaluating algorithms for Distributed systems (ApPLIED)<\/li>\n\n\n\n<li><strong>9:00 &#8211; 11:00: Tutorial: <\/strong>Fault-Tolerant Distributed Optimization and Learning<\/li>\n\n\n\n<li>11:20 &#8211; 12:30 FCRC Plenary Session <br>Kunle Olukotun: <em>Computing in the Foundation Model Era<\/em><\/li>\n<\/ul>\n\n\n\n<h2 class=\"wp-block-heading\">Tuesday, June 20th<\/h2>\n\n\n\n<figure class=\"wp-block-table\">\n<table style=\"border: 1px solid #b0b0b0;width: 100%;height: 223px;--darkreader-inline-border-top: #464c4f;--darkreader-inline-border-right: #464c4f;--darkreader-inline-border-bottom: #464c4f;--darkreader-inline-border-left: #464c4f\" data-darkreader-inline-border-top=\"\" data-darkreader-inline-border-right=\"\" data-darkreader-inline-border-bottom=\"\" data-darkreader-inline-border-left=\"\"><colgroup> <col style=\"width: 20%\" span=\"1\"> <col style=\"width: 80%\" span=\"1\"> <\/colgroup>\n<tbody>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20%\">8:50 \u2013 9:55<\/td>\n<td style=\"height: 41px;width: 80.0005%\"><strong>PODC Keynote Session<\/strong> <br>Roger Wattenhofer: <a href=\"https:\/\/www.podc.org\/podc2023\/roger-wattenhofer\/\"><em>From Distributed Algorithms to Machine Learning and Back<\/em><\/a><\/td>\n<\/tr>\n<tr style=\"height: 20px\">\n<td style=\"height: 20px;width: 20%\">9:55 \u2013 10:55<\/td>\n<td style=\"height: 20px;width: 80.0005%\"><a href=\"#session1\"><strong>Session: Dynamics<\/strong><\/a><\/td>\n<\/tr>\n<tr style=\"height: 20px\">\n<td style=\"height: 20px;width: 100.001%;text-align: center\" colspan=\"2\"><strong>Break<\/strong><\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20%\">11:20 \u2013 12:30<\/td>\n<td style=\"height: 41px;width: 80.0005%\"><strong>FCRC Plenary Session<\/strong> <br>Margaret Martonosi: <em>Taking on the World&#8217;s Challenges: The Role of Computing Research and Innovation<\/em><\/td>\n<\/tr>\n<tr style=\"height: 20px\">\n<td style=\"height: 20px;width: 100.001%;text-align: center\" colspan=\"2\"><strong>Lunch break<\/strong><\/td>\n<\/tr>\n<tr style=\"height: 20px\">\n<td style=\"height: 20px;width: 20%\">14:00 \u2013 15:30<\/td>\n<td style=\"height: 20px;width: 80.0005%\"><a href=\"#session2\"><strong>Session: Distributed approximation<\/strong><\/a><\/td>\n<\/tr>\n<tr style=\"height: 20px\">\n<td style=\"height: 20px;width: 100.001%;text-align: center\" colspan=\"2\"><strong>Break<\/strong><\/td>\n<\/tr>\n<tr style=\"height: 20px\">\n<td style=\"height: 20px;width: 20%\">16:15 \u2013 17:15<\/td>\n<td style=\"height: 20px;width: 80.0005%\">Plenary panel discussion<\/td>\n<\/tr>\n<tr style=\"height: 20px\">\n<td style=\"height: 21px;width: 20%\">17:30 \u2013 19:30<\/td>\n<td style=\"height: 21px;width: 80.0005%\"><strong>Business Meeting<\/strong><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/figure>\n\n\n\n<h2 class=\"wp-block-heading\">Wednesday, June 21st<\/h2>\n\n\n\n<figure class=\"wp-block-table\">\n<table style=\"border: 1px solid #b0b0b0;width: 100%;height: 201px;--darkreader-inline-border-top: #464c4f;--darkreader-inline-border-right: #464c4f;--darkreader-inline-border-bottom: #464c4f;--darkreader-inline-border-left: #464c4f\" data-darkreader-inline-border-top=\"\" data-darkreader-inline-border-right=\"\" data-darkreader-inline-border-bottom=\"\" data-darkreader-inline-border-left=\"\"><colgroup> <col style=\"width: 20%\" span=\"1\"> <col style=\"width: 80%\" span=\"1\"> <\/colgroup>\n<tbody>\n<tr style=\"height: 20px\">\n<td style=\"height: 20px;width: 20%\">8:50 \u2013 10:55<\/td>\n<td style=\"height: 20px;width: 80.0005%\"><a href=\"#session3\"><strong>Session: Data structures<\/strong><\/a><\/td>\n<\/tr>\n<tr style=\"height: 20px\">\n<td style=\"height: 20px;width: 100.001%;text-align: center\" colspan=\"2\"><strong>Break<\/strong><\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20%\">11:20 \u2013 12:30<\/td>\n<td style=\"height: 41px;width: 80.0005%\"><strong>FCRC Plenary Session&nbsp;<\/strong><br>Shafi Goldwasser: <em>Constructing and Deconstructing Trust: Employing Cryptographic Recipe in the ML Domain<\/em><\/td>\n<\/tr>\n<tr style=\"height: 20px\">\n<td style=\"height: 20px;width: 100.001%;text-align: center\" colspan=\"2\"><strong>Lunch break<\/strong><\/td>\n<\/tr>\n<tr style=\"height: 20px\">\n<td style=\"height: 20px;width: 20%\">14:00 \u2013 15:30<\/td>\n<td style=\"height: 20px;width: 80.0005%\"><a href=\"#session4\"><strong>Session: Symmetry breaking<\/strong><\/a><\/td>\n<\/tr>\n<tr style=\"height: 20px\">\n<td style=\"height: 20px;width: 100.001%;text-align: center\" colspan=\"2\"><strong>Break<\/strong><\/td>\n<\/tr>\n<tr style=\"height: 20px\">\n<td style=\"height: 20px;width: 20%\">16:00 \u2013 18:05<\/td>\n<td style=\"height: 20px;width: 80.0005%\"><a href=\"#session5\">Session: Networks<\/a><\/td>\n<\/tr>\n<tr style=\"height: 20px\">\n<td style=\"height: 20px;width: 100.001%;text-align: center\" colspan=\"2\"><strong>Break<\/strong><\/td>\n<\/tr>\n<tr style=\"height: 20px\">\n<td style=\"height: 20px;width: 20%\">19:00 \u2013 22:00<\/td>\n<td style=\"height: 20px;width: 80.0005%\"><strong>Banquet<br><\/strong><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/figure>\n\n\n\n<h2 class=\"wp-block-heading\">Thursday, June 22nd<\/h2>\n\n\n\n<figure class=\"wp-block-table\">\n<table style=\"border: 1px solid #b0b0b0;width: 100%;height: 161px;--darkreader-inline-border-top: #464c4f;--darkreader-inline-border-right: #464c4f;--darkreader-inline-border-bottom: #464c4f;--darkreader-inline-border-left: #464c4f\" data-darkreader-inline-border-top=\"\" data-darkreader-inline-border-right=\"\" data-darkreader-inline-border-bottom=\"\" data-darkreader-inline-border-left=\"\"><colgroup> <col style=\"width: 20%\" span=\"1\"> <col style=\"width: 80%\" span=\"1\"> <\/colgroup>\n<tbody>\n<tr style=\"height: 20px\">\n<td style=\"height: 20px;width: 20%\">8:50 \u2013 10:50<\/td>\n<td style=\"height: 20px;width: 80.0005%\"><a href=\"#session6\"><strong>Session: Byzantine agreement<\/strong><\/a><\/td>\n<\/tr>\n<tr style=\"height: 20px\">\n<td style=\"height: 20px;width: 100.001%;text-align: center\" colspan=\"2\"><strong>Break<\/strong><\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20%\">11:20 \u2013 12:30<\/td>\n<td style=\"height: 41px;width: 80.0005%\"><strong>FCRC Plenary Session<\/strong> <br>Don Towsley: <em>The Quantum Internet: Recent Advantages and Challenges<\/em><\/td>\n<\/tr>\n<tr style=\"height: 20px\">\n<td style=\"height: 20px;width: 100.001%;text-align: center\" colspan=\"2\"><strong>Lunch break<\/strong><\/td>\n<\/tr>\n<tr style=\"height: 20px\">\n<td style=\"height: 20px;width: 20%\">14:00 \u2013 15:40<\/td>\n<td style=\"height: 20px;width: 80.0005%\"><a href=\"#session8\">Session: Wireless <\/a><\/td>\n<\/tr>\n<tr style=\"height: 20px\">\n<td style=\"height: 20px;width: 100.001%;text-align: center\" colspan=\"2\"><strong>Break<\/strong><\/td>\n<\/tr>\n<tr style=\"height: 20px\">\n<td style=\"height: 20px;width: 20%\">16:00 \u2013 17:30<\/td>\n<td style=\"height: 20px;width: 80.0005%\"><a href=\"#session7\"><strong>Session: Complexity\/impossibility<\/strong><\/a><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<p>&nbsp;<\/p>\n<\/figure>\n\n\n\n<h2 class=\"wp-block-heading\">Friday, June 23rd<\/h2>\n\n\n\n<ul class=\"wp-block-list\">\n<li>11:20 &#8211; 12:30: FCRC Plenary Session <br>Torsten Hoefler: <em>Scalable and Efficient AI: From Supercomputers to Smartphones<\/em><\/li>\n\n\n\n<li>Workshop: BDA<\/li>\n\n\n\n<li>14:00 &#8211; 17:00: Tutorial: Cryptography in Distributed Protocols<\/li>\n\n\n\n<li><strong>9:00 &#8211; 11:00:<\/strong> Tutorial: Distributed computing with live streaming data<\/li>\n<\/ul>\n\n\n\n<h1 class=\"wp-block-heading\">Detailed schedule<\/h1>\n\n\n\n<h2 class=\"wp-block-heading\">Saturday, June 17th<\/h2>\n\n\n\n<h3 class=\"has-text-align-left\">9:00 &#8211; 12:30: Tutorial (in conjunction with PLDI)<\/h3>\n<p>Y. Annie Liu, Scott Stoller: <em>High-Level Executable Specification and Reasoning for Improving Distributed Algorithms<\/em><\/p>\n\n\n\n<h2 class=\"wp-block-heading\">Monday, June 19th<\/h2>\n\n\n\n<h3 class=\"has-text-align-left\">11:20 &#8211; 12:30: FCRC Plenary Session<\/h3>\n<p>Kunle Olukotun: <em>Computing in the Foundation Model Era<\/em><\/p>\n<h3 class=\"has-text-align-left\">Workshop: ApPLIED<\/h3>\n<h3 class=\"has-text-align-left\"><strong>9:00 &#8211; 11:00:<\/strong> Tutorial<\/h3>\n<p>Lili Su and Nitin H. Vaidya: <em>Fault-Tolerant Distributed Optimization and Learning<\/em><\/p>\n\n\n\n<h2 class=\"wp-block-heading\">Tuesday, June 20th<\/h2>\n\n\n\n<h3 class=\"has-text-align-left\">8:50 &#8211; 9:55: PODC Keynote Session<\/h3>\n<p><strong>Chair:<\/strong> Magn\u00fas M. Halld\u00f3rsson<\/p>\n\n\n\n<p>Roger Wattenhofer: <a href=\"https:\/\/www.podc.org\/podc2023\/roger-wattenhofer\/\">From Distributed Algorithms to Machine Learning and Back<\/a><\/p>\n\n\n\n<h3 id=\"session1\" class=\"has-text-align-left\">9:55 &#8211; 10:55: <strong>Session: Dynamics<\/strong><\/h3>\n<p><strong>Chair:<\/strong> George Giakkoupis<\/p>\n\n\n\n<figure class=\"wp-block-table\">\n<table style=\"width: 100%;border: 1px solid #b0b0b0;height: 164px;--darkreader-inline-border-top: #464c4f;--darkreader-inline-border-right: #464c4f;--darkreader-inline-border-bottom: #464c4f;--darkreader-inline-border-left: #464c4f\" data-darkreader-inline-border-top=\"\" data-darkreader-inline-border-right=\"\" data-darkreader-inline-border-bottom=\"\" data-darkreader-inline-border-left=\"\"><colgroup> <col style=\"width: 20%\" span=\"1\"> <col style=\"width: 80%\" span=\"1\"> <\/colgroup>\n<tbody>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20%\">9:55 \u2013 10:20<\/td>\n<td style=\"height: 41px;width: 79.6825%\"><em>A Near Time-optimal Population Protocol for Self-stabilizing Leader Election on Rings with a Poly-logarithmic Number of States. <\/em>Daisuke Yokota, Yuichi Sudo, Fukuhito Ooshita and Toshimitsu Masuzawa.<\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20%\">10:20 \u2013 10:45<\/td>\n<td style=\"height: 41px;width: 79.6825%\"><em>Fast Convergence of k-Opinion Undecided State Dynamics in the Population Protocol Model.<\/em> Talley Amir, James Aspnes, Petra Berenbrink, Felix Biermeier, Christopher Hahn, Dominik Kaaser and John Lazarsfeld.<\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20%\">10:45 \u2013 10:50<\/td>\n<td style=\"height: 41px;width: 79.6825%\"><em>Brief Announcement: Efficient Collaborative Tree Exploration with Breadth-First Depth-Next.<\/em> Romain Cosson, Laurent Massoulie and Laurent Viennot.<\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20%\">10:50 \u2013 10:55<\/td>\n<td style=\"height: 41px;width: 79.6825%\"><em>Brief Announcement: Population Protocols Decide Double-exponential Thresholds. <\/em>Philipp Czerner.<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/figure>\n\n\n\n<h3 class=\"has-text-align-left\">11:20 &#8211; 12:30: FCRC Plenary Session<\/h3>\n\n\n\n<p>Margaret Martonosi: <em>Taking on the World&#8217;s Challenges: The Role of Computing Research and Innovation<\/em><\/p>\n\n\n\n<h3 id=\"session2\" class=\"has-text-align-left\">14:00 &#8211; 15:30: Session: Distributed approximation<\/h3>\n<p><strong>Chair:<\/strong> Goran Zuzic<\/p>\n\n\n\n<figure class=\"wp-block-table\">\n<table style=\"width: 100%;border: 1px solid #b0b0b0;height: 246px;--darkreader-inline-border-top: #464c4f;--darkreader-inline-border-right: #464c4f;--darkreader-inline-border-bottom: #464c4f;--darkreader-inline-border-left: #464c4f\" data-darkreader-inline-border-top=\"\" data-darkreader-inline-border-right=\"\" data-darkreader-inline-border-bottom=\"\" data-darkreader-inline-border-left=\"\"><colgroup> <col style=\"width: 20%\" span=\"1\"> <col style=\"width: 80%\" span=\"1\"> <\/colgroup>\n<tbody>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20%\">14:00 \u2013 14:25<\/td>\n<td style=\"height: 41px;width: 79.6825%\"><em>The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs. <\/em>Yi-Jun Chang and Zeyong Li.<\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20%\">14:25 \u2013 14:50<\/td>\n<td style=\"height: 41px;width: 79.6825%\"><em>(1-\u03b5)-Approximate Maximum Weighted Matching in poly(1\/\u03b5, log n) Time in the Distributed and Parallel Settings. <\/em>Shang-En Huang and Hsin-Hao Su.<\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20%\">14:50 \u2013 15:15<\/td>\n<td style=\"height: 41px;width: 79.6825%\"><em>Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications.<\/em> Yi-Jun Chang.<\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20%\">15:15 &#8211; 15:20<\/td>\n<td style=\"height: 41px;width: 79.6825%\"><em>Brief Announcement: Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs.<\/em> Jinfeng Dou, Thorsten G\u00f6tte, Henning Hillebrandt, Christian Scheideler and Julian Werthmann.<\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"width: 20%;height: 41px\">15:20 &#8211; 15:25<\/td>\n<td style=\"width: 79.6825%;height: 41px\"><em>Brief Announcement: Minimum Cost Maximum Flow in the CONGEST Model. <\/em>Tijn de Vos.<\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"width: 20%;height: 41px\">15:25 &#8211; 15:30<\/td>\n<td style=\"width: 79.6825%;height: 41px\"><em>Brief Announcement: The Laplacian Paradigm in Deterministic Congested Clique. <\/em>Tijn de Vos and Sebastian Forster<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/figure>\n\n\n\n<h3 class=\"has-text-align-left\">16:15 &#8211; 17:15: FCRC Plenary panel discussion<\/h3>\n<h3 class=\"has-text-align-left\">17:30 &#8211; 19:30: Business meeting<\/h3>\n\n\n\n<h2 class=\"wp-block-heading\">Wednesday, June 21st<\/h2>\n\n\n\n<h3 id=\"session3\" class=\"has-text-align-left\">8:50 &#8211; 10:55: Session: Data structures<\/h3>\n<p><strong>Chair:<\/strong> Faith Ellen<\/p>\n<figure class=\"wp-block-table\">\n<table style=\"width: 100%;border: 1px solid #b0b0b0;height: 349px;--darkreader-inline-border-top: #464c4f;--darkreader-inline-border-right: #464c4f;--darkreader-inline-border-bottom: #464c4f;--darkreader-inline-border-left: #464c4f\" data-darkreader-inline-border-top=\"\" data-darkreader-inline-border-right=\"\" data-darkreader-inline-border-bottom=\"\" data-darkreader-inline-border-left=\"\"><colgroup> <col style=\"width: 20%\" span=\"1\"> <col style=\"width: 80%\" span=\"1\"> <\/colgroup>\n<tbody>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20%\">8:50 &#8211; 9:15<\/td>\n<td style=\"height: 41px;width: 79.6825%\"><em>Word-Size RMR Tradeoffs for Recoverable Mutual Exclusion. <\/em>David Yu Cheng Chan, George Giakkoupis and Philipp Woelfel.<\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20%\">9:15 &#8211; 9:40<\/td>\n<td style=\"height: 41px;width: 79.6825%\"><em>Asynchronous Wait-Free Runtime Verification and Enforcement of Linearizability.<\/em> Armando Casta\u00f1eda and Gilde Valeria Rodr\u00edguez.<\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20%\">9:40 &#8211; 10:05<\/td>\n<td style=\"height: 41px;width: 79.6825%\"><em>The ERA Theorem for Safe Memory Reclamation.<\/em> Gali Sheffi and Erez Petrank.<\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20%\">10:05 &#8211; 10:30<\/td>\n<td style=\"height: 41px;width: 79.6825%\"><em>Efficient Bounded Timestamping from Standard Synchronization Primitives.<\/em> Benyamin Bashari, Ali Jamadi and Philipp Woelfel.<\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20%\">10:30 &#8211; 10:55<\/td>\n<td style=\"height: 41px;width: 79.6825%\"><em>A Wait-free Queue with Polylogarithmic Step Complexity. <\/em>Hossein Naderibeni and Eric Ruppert.<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/figure>\n<h3 class=\"has-text-align-left\">11:20 &#8211; 12:30: FCRC Plenary Session<\/h3>\n<p>Shafi Goldwasser: <em>Constructing and Deconstructing Trust: Employing Cryptographic Recipe in the ML Domain<\/em><\/p>\n<h3 id=\"session4\" class=\"has-text-align-left\">14:00 &#8211; 15:30: Session: Symmetry breaking<\/h3>\n<p><strong>Chair: Taisuke Izumi<\/strong> <\/p>\n<figure class=\"wp-block-table\">\n<table style=\"width: 100%;border: 1px solid #b0b0b0;height: 349px;--darkreader-inline-border-top: #464c4f;--darkreader-inline-border-right: #464c4f;--darkreader-inline-border-bottom: #464c4f;--darkreader-inline-border-left: #464c4f\" data-darkreader-inline-border-top=\"\" data-darkreader-inline-border-right=\"\" data-darkreader-inline-border-bottom=\"\" data-darkreader-inline-border-left=\"\"><colgroup> <col style=\"width: 20%\" span=\"1\"> <col style=\"width: 80%\" span=\"1\"> <\/colgroup>\n<tbody>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20%\">14:00 \u2013 14:25<\/td>\n<td style=\"height: 41px;width: 79.6825%\"><em>Distributed MIS in O(log log n) Awake Complexity. <\/em>Fabien Dufoulon, William K. Moses Jr. and Gopal Pandurangan.<\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20%\">14:25 \u2013 14:50<\/td>\n<td style=\"height: 41px;width: 79.6825%\"><em>Distributed MIS with Low Energy and Time Complexities. <\/em>Mohsen Ghaffari and Julian Portmann.<\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20%\">14:50 \u2013 15:15<\/td>\n<td style=\"height: 41px;width: 79.6825%\"><em>Distributed Symmetry Breaking on Power Graphs via Sparsification.<\/em> Yannic Maus, Saku Peltonen and Jara Uitto.<\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20%\">15:15 &#8211; 15:20<\/td>\n<td style=\"height: 41px;width: 79.6825%\"><em>Brief Announcement: What Can We Compute in a Single Round of the Congested Clique? <\/em> Peter Robinson.<\/td>\n<\/tr>\n<tr>\n<td style=\"width: 20%\">15:20 &#8211; 15:25<\/td>\n<td style=\"width: 79.6825%\"><em>Brief Announcement: Local Problems in the SUPPORTED Model. <\/em>Akanksha Agrawal, John Augustine, David Peleg and Srikkanth Ramachandran.<\/td>\n<\/tr>\n<tr>\n<td style=\"width: 20%\">15:25 &#8211; 15:30<\/td>\n<td style=\"width: 79.6825%\"><em>Brief Announcement: Efficient Computation in Congested Anonymous Dynamic Networks. <\/em>Giuseppe Antonio Di Luna and Giovanni Viglietta.<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/figure>\n<h3 id=\"session5\" class=\"has-text-align-left\">16:00 &#8211; 18:05: Session: Networks<\/h3>\n<p><strong>Chair:<\/strong> Peter Davies<\/p>\n<figure class=\"wp-block-table\">\n<table style=\"width: 100%;border: 1px solid #b0b0b0;height: 349px;--darkreader-inline-border-top: #464c4f;--darkreader-inline-border-right: #464c4f;--darkreader-inline-border-bottom: #464c4f;--darkreader-inline-border-left: #464c4f\" data-darkreader-inline-border-top=\"\" data-darkreader-inline-border-right=\"\" data-darkreader-inline-border-bottom=\"\" data-darkreader-inline-border-left=\"\"><colgroup> <col style=\"width: 20%\" span=\"1\"> <col style=\"width: 80%\" span=\"1\"> <\/colgroup>\n<tbody>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20%\">16:00 \u2013 16:25<\/td>\n<td style=\"height: 41px;width: 79.6825%\"><em>A Near-Optimal Deterministic Distributed Synchronizer. <\/em>Mohsen Ghaffari and Anton Trygub.<\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20%\">16:25 \u2013 16:50<\/td>\n<td style=\"height: 41px;width: 79.6825%\"><em>Deterministic Fault-Tolerant Connectivity Labeling Scheme. <\/em>Taisuke Izumi, Yuval Emek, Tadashi Wadayama and Toshimitsu Masuzawa.<\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20%\">16:50 \u2013 17:15<\/td>\n<td style=\"height: 41px;width: 79.6825%\"><em>Universally Composable Simultaneous Broadcast against a Dishonest Majority and Applications.<\/em> Myrto Arapinis, \u00c1bel Kocsis, Nikolaos Lamprou, Liam Medley and Thomas Zacharias.<\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20%\">17:15 &#8211; 17:40<\/td>\n<td style=\"height: 41px;width: 79.6825%\"><em>Distributed Averaging in Opinion Dynamics.<\/em> Petra Berenbrink, Colin Cooper, Cristina Gava, David Kohan Marzag\u00e3o, Frederik Mallmann-Trenn, Tomasz Radzik and Nicolas Rivera.<\/td>\n<\/tr>\n<tr>\n<td style=\"width: 20%\">17:40 &#8211; 18:05<\/td>\n<td style=\"width: 79.6825%\"><em>Sparse Semi-Oblivious Routing: Few Random Paths Suffice. <\/em>Goran Zuzic, Bernhard Haeupler and Antti Roeyskoe.<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/figure>\n<h3 class=\"has-text-align-left\">19:00 &#8211; 22:00: Banquet<\/h3>\n\n\n\n<h2 class=\"wp-block-heading\">Thursday, June 22nd<\/h2>\n\n\n\n<h3 id=\"session6\" class=\"has-text-align-left\">8:50 &#8211; 10:55: Session: Byzantine agreement<\/h3>\n<p><strong>Chair:<\/strong> Seth Gilbert<\/p>\n<figure class=\"wp-block-table\">\n<table style=\"width: 100%;border: 1px solid #b0b0b0;height: 328px;--darkreader-inline-border-top: #464c4f;--darkreader-inline-border-right: #464c4f;--darkreader-inline-border-bottom: #464c4f;--darkreader-inline-border-left: #464c4f\" data-darkreader-inline-border-top=\"\" data-darkreader-inline-border-right=\"\" data-darkreader-inline-border-bottom=\"\" data-darkreader-inline-border-left=\"\"><colgroup> <col style=\"width: 20%\" span=\"1\"> <col style=\"width: 80%\" span=\"1\"> <\/colgroup>\n<tbody>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20%\">8:50 &#8211; 9:15<\/td>\n<td style=\"height: 41px;width: 79.6825%\"><em>BeeGees: Stayin&#8217; Alive in Chained BFT. <\/em>Neil Giridharan, Florian Suri-Payer, Matthew Ding, Heidi Howard, Ittai Abraham and Natacha Crooks.<\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20%\">9:15 &#8211; 9:40<\/td>\n<td style=\"height: 41px;width: 79.6825%\"><em>Optimal Eventual Byzantine Agreement Protocols with Omission Failures.<\/em> Kaya Alpturer, Joseph Halpern and Ron van der Meyden.<\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20%\">9:40 &#8211; 10:05<\/td>\n<td style=\"height: 41px;width: 79.6825%\"><em>On the Amortized Communication Complexity of Byzantine Broadcast.<\/em> Jun Wan, Atsuki Momose, Ling Ren, Elaine Shi and Zhuolun Xiang.<\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20%\">10:05 &#8211; 10:30<\/td>\n<td style=\"height: 41px;width: 79.6825%\"><em>Distributed CONGEST Algorithms against Mobile Adversaries.<\/em> Orr Fischer and Merav Parter.<\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20%\">10:30 &#8211; 10:35<\/td>\n<td style=\"height: 41px;width: 79.6825%\"><em>Brief Announcement: Breaking the f+1 Barrier: Executing Payment Transactions in Parallel with Less than f+1 Validations. <\/em>Rida Bazzi and Sara Tucci-Piergiovanni.<\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20%\">10:35 &#8211; 10:40<\/td>\n<td style=\"height: 41px;width: 79.6825%\"><em>Brief Announcement: Discrete Incremental Voting. <\/em>Colin Cooper, Tomasz Radzik and Takeharu Shiraga.<\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20%\">10:40 &#8211; 10:45<\/td>\n<td style=\"height: 41px;width: 79.6825%\"><em>Brief Announcement: The MBroadcast Abstraction. <\/em>Mathilde D\u00e9pr\u00e9s, Achour Most\u00e9faoui, Matthieu Perrin and Michel Raynal.<\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20%\">10:45 &#8211; 10:50<\/td>\n<td style=\"height: 41px;width: 79.6825%\"><em>Brief Announcement: Improved Consensus in Quantum Networks. <\/em>MohammadTaghi Hajiaghayi, Dariusz Rafal Kowalski and Jan Olkowski.<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/figure>\n<h3 class=\"has-text-align-left\">11:20 &#8211; 12:30: FCRC Plenary Session<\/h3>\n<p>Don Towsley: <em>The Quantum Internet: Recent Advantages and Challenges<\/em><\/p>\n<h3 id=\"session8\" class=\"has-text-align-left\">14:00 &#8211; 15:40: Wireless<\/h3>\n<p><strong>Chair:<\/strong> Przemys\u0142aw Uzna\u0144ski<\/p>\n<figure class=\"wp-block-table\">\n<table style=\"width: 100%;border: 1px solid #b0b0b0;height: 349px;--darkreader-inline-border-top: #464c4f;--darkreader-inline-border-right: #464c4f;--darkreader-inline-border-bottom: #464c4f;--darkreader-inline-border-left: #464c4f\" data-darkreader-inline-border-top=\"\" data-darkreader-inline-border-right=\"\" data-darkreader-inline-border-bottom=\"\" data-darkreader-inline-border-left=\"\"><colgroup> <col style=\"width: 20%\" span=\"1\"> <col style=\"width: 80%\" span=\"1\"> <\/colgroup>\n<tbody>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20%\">14:00 \u2013 14:25<\/td>\n<td style=\"height: 41px;width: 79.6825%\"><em>Uniting General-Graph and Geometric-Based Radio Networks via Independence Number Parametrization. <\/em>Peter Davies.<\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20%\">14:25 &#8211; 14:50<\/td>\n<td style=\"height: 41px;width: 79.6825%\"><em>Optimal Message-Passing with Noisy Beeps.<\/em> Peter Davies.<\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20%\">14:50 \u2013 15:15<\/td>\n<td style=\"height: 41px;width: 79.6825%\"><em>Distributed Self-Stabilizing MIS with Few States and Weak Communication. <\/em>George Giakkoupis and Isabella Ziccardi.<\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20%\">15:15 \u2013 15:40<\/td>\n<td style=\"height: 41px;width: 79.6825%\"><em>The Impact of Cooperation in Bilateral Network Creation.<\/em> Tobias Friedrich, Hans Gawendowicz, Pascal Lenzner and Arthur Zahn.<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/figure>\n<h3 id=\"session7\" class=\"has-text-align-left\">16:00 &#8211; 17:30: Session: Complexity\/impossibility<\/h3>\n<p><strong>Chair:<\/strong> Philipp Woelfel<\/p>\n<figure class=\"wp-block-table\">\n<table style=\"width: 100%;border: 1px solid #b0b0b0;height: 349px;--darkreader-inline-border-top: #464c4f;--darkreader-inline-border-right: #464c4f;--darkreader-inline-border-bottom: #464c4f;--darkreader-inline-border-left: #464c4f\" data-darkreader-inline-border-top=\"\" data-darkreader-inline-border-right=\"\" data-darkreader-inline-border-bottom=\"\" data-darkreader-inline-border-left=\"\"><colgroup> <col style=\"width: 20%\" span=\"1\"> <col style=\"width: 80%\" span=\"1\"> <\/colgroup>\n<tbody>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20%\">16:00 \u2013 16:25<\/td>\n<td style=\"height: 41px;width: 79.6825%\"><em>On the Validity of Consensus. <\/em>Pierre Civit, Seth Gilbert, Rachid Guerraoui, Jovan Komatovic and Manuel Vidigueira.<\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20%\">16:25 \u2013 16:50<\/td>\n<td style=\"height: 41px;width: 79.6825%\"><em>Deterministic Fault-Tolerant Distributed Computing in Linear Time and Communication. <\/em>Jan Olkowski, Bogdan Chlebus and Dariusz Kowalski.<\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20%\">16:50 \u2013 17:15<\/td>\n<td style=\"height: 41px;width: 79.6825%\"><em>Improved Tradeoffs for Leader Election.<\/em> Shay Kutten, Peter Robinson, Ming Ming Tan and Xianbin Zhu.<\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20%\">17:15 &#8211; 17:20<\/td>\n<td style=\"height: 41px;width: 79.6825%\"><em>Brief Announcement: Efficient Recoverable Writable-CAS.<\/em> Prasad Jayanti, Siddhartha Visveswara Jayanti and Sucharita Jayanti.<\/td>\n<\/tr>\n<tr>\n<td style=\"width: 20%\">17:20 &#8211; 17:25<\/td>\n<td style=\"width: 79.6825%\"><em>Brief Announcement: Improved, Partially-Tight Multiplicity Queue Lower Bounds. <\/em>Anh Tran and Edward Talmage.<\/td>\n<\/tr>\n<tr>\n<td style=\"width: 20%\">17:25 &#8211; 17:30<\/td>\n<td style=\"width: 79.6825%\"><em>Brief Announcement: CausalEC: A Causally Consistent Data Storage Algorithm based on Cross-Object Erasure Coding. <\/em>Viveck Cadambe and Shihang Lyu.<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<p>&nbsp;<\/p>\n<\/figure>\n\n\n\n<h2 class=\"wp-block-heading\">Friday, June 23rd<\/h2>\n\n\n\n<h3 class=\"has-text-align-left\">11:20 &#8211; 12:30: FCRC Plenary Session<\/h3>\n<p>Torsten Hoefler: <em>Scalable and Efficient AI: From Supercomputers to Smartphones<\/em><\/p>\n<h3 class=\"has-text-align-left\">8:45 &#8211; 18:00: Workshop: BDA<\/h3>\n<p><a href=\"https:\/\/sites.google.com\/view\/bda23\/home\">schedule<\/a><\/p>\n<h3 class=\"has-text-align-left\">14:00 &#8211; 17:00: Tutorial<\/h3>\n<p>Rotem Oshman and Vinod Vaikuntanathan: <em>Cryptography in Distributed Protocols<\/em><\/p>\n<p>Coffee break at 15:30<\/p>\n<h3 class=\"has-text-align-left\"><strong>9:00 &#8211; 11:00:<\/strong> Tutorial<\/h3>\n<p>Adrian Kosowski, Krzysztof Nowicki, and Przemyslaw Uznanski (Pathway.com): <a href=\"https:\/\/www.podc.org\/wordpress\/wp-content\/uploads\/2023\/05\/PODC_2023_Pathway_Tutorial.pdf\"><em>Distributed computing with live streaming data<\/em><\/a><\/p>\n","protected":false},"excerpt":{"rendered":"<p>High-Level Overview Saturday, June 17th Monday, June 19th Tuesday, June 20th 8:50 \u2013 9:55 PODC Keynote Session Roger Wattenhofer: From Distributed Algorithms to Machine Learning and Back 9:55 \u2013 10:55 Session: Dynamics Break 11:20 \u2013 12:30 FCRC Plenary Session Margaret Martonosi: Taking on the World&#8217;s Challenges: The Role of Computing Research and Innovation Lunch break &hellip; <a href=\"https:\/\/www.podc.org\/podc2023\/schedule\/\" class=\"more-link\">Continue reading<span class=\"screen-reader-text\"> &#8220;Schedule&#8221;<\/span><\/a><\/p>\n","protected":false},"author":19,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-211","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/www.podc.org\/podc2023\/wp-json\/wp\/v2\/pages\/211","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.podc.org\/podc2023\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/www.podc.org\/podc2023\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/www.podc.org\/podc2023\/wp-json\/wp\/v2\/users\/19"}],"replies":[{"embeddable":true,"href":"https:\/\/www.podc.org\/podc2023\/wp-json\/wp\/v2\/comments?post=211"}],"version-history":[{"count":32,"href":"https:\/\/www.podc.org\/podc2023\/wp-json\/wp\/v2\/pages\/211\/revisions"}],"predecessor-version":[{"id":288,"href":"https:\/\/www.podc.org\/podc2023\/wp-json\/wp\/v2\/pages\/211\/revisions\/288"}],"wp:attachment":[{"href":"https:\/\/www.podc.org\/podc2023\/wp-json\/wp\/v2\/media?parent=211"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}