{"id":254,"date":"2022-05-19T02:30:46","date_gmt":"2022-05-19T02:30:46","guid":{"rendered":"https:\/\/www.podc.org\/podc2022\/?page_id=254"},"modified":"2022-07-27T10:23:19","modified_gmt":"2022-07-27T10:23:19","slug":"schedule","status":"publish","type":"page","link":"https:\/\/www.podc.org\/podc2022\/schedule\/","title":{"rendered":"Schedule"},"content":{"rendered":"\n<hr class=\"wp-block-separator has-alpha-channel-opacity is-style-wide\" \/>\n\n\n\n<h1 class=\"wp-block-heading\">High-Level Overview<\/h1>\n\n\n\n<h2 class=\"wp-block-heading\">Monday, July 25th<\/h2>\n\n\n\n<ul class=\"wp-block-list\"><li><strong>Workshop:<\/strong> <a href=\"#applied\">Workshop on Advanced Tools, Programming Languages, and Platforms for Implementing and Evaluating Algorithms for Distributed Systems (ApPLIED)<\/a><\/li><li><strong>Workshop:<\/strong> <a href=\"#podl\">Principles of Distributed Learning (PODL)<\/a><\/li><li>PODC reception<\/li><\/ul>\n\n\n\n<h2 class=\"wp-block-heading\">Tuesday, July 26th<\/h2>\n\n\n\n<figure class=\"wp-block-table\">\n<table style=\"border: 1px solid #b0b0b0;width: 100%;height: 201px\" 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:30 \u2013 8:40<\/td>\n<td style=\"height: 20px;width: 80.0005%\"><strong>Opening<\/strong><\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20%\">8:40 \u2013 9:40<\/td>\n<td style=\"height: 41px;width: 80.0005%\"><strong>Keynote 1<\/strong> <br>Michael L. Scott: <a href=\"https:\/\/www.podc.org\/podc2022\/michael-l-scott\/\" target=\"_blank\" rel=\"noopener\"><em>How Should We Think about Persistent Data Structures?<\/em><\/a><\/td>\n<\/tr>\n<tr style=\"height: 20px\">\n<td style=\"height: 20px;width: 100.001%;text-align: center\" colspan=\"2\"><strong>Coffee break<\/strong><\/td>\n<\/tr>\n<tr style=\"height: 20px\">\n<td style=\"height: 20px;width: 20%\">10:00 \u2013 11:56<\/td>\n<td style=\"height: 20px;width: 80.0005%\"><a href=\"#session1\"><strong>Session 1<\/strong><\/a><\/td>\n<\/tr>\n<tr style=\"height: 20px\">\n<td style=\"height: 20px;width: 100.001%;text-align: center\" colspan=\"2\"><strong>Lunch<\/strong><\/td>\n<\/tr>\n<tr style=\"height: 20px\">\n<td style=\"height: 20px;width: 20%\">13:30 \u2013 15:14<\/td>\n<td style=\"height: 20px;width: 80.0005%\"><a href=\"#session2\"><strong>Session 2<\/strong><\/a><\/td>\n<\/tr>\n<tr style=\"height: 20px\">\n<td style=\"height: 20px;width: 100.001%;text-align: center\" colspan=\"2\"><strong>Coffee break<\/strong><\/td>\n<\/tr>\n<tr style=\"height: 20px\">\n<td style=\"height: 20px;width: 20%\">15:35 \u2013 17:30<\/td>\n<td style=\"height: 20px;width: 80.0005%\"><a href=\"#session3\"><strong>Session 3<\/strong><\/a><\/td>\n<\/tr>\n<tr style=\"height: 20px\">\n<td style=\"height: 20px;width: 20%\">17:30 \u2013 19:30<\/td>\n<td style=\"height: 20px;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, July 27th<\/h2>\n\n\n\n<figure class=\"wp-block-table\">\n<table style=\"width: 100%;border: 1px solid #b0b0b0;height: 157px\" 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\">8:40 \u2013 9:40<\/td>\n<td style=\"height: 20px\"><strong>Keynote 2<\/strong> <br>Seny Kamara: <a href=\"https:\/\/www.podc.org\/podc2022\/seny-kamara\/\" target=\"_blank\" rel=\"noopener\"><em>Encrypted Distributed Systems<\/em><\/a><\/td>\n<\/tr>\n<tr style=\"height: 20px\">\n<td style=\"text-align: center;height: 20px\" colspan=\"2\"><strong>Coffee break<\/strong><\/td>\n<\/tr>\n<tr style=\"height: 20px\">\n<td style=\"height: 20px\">10:00 \u2013 12:01<\/td>\n<td style=\"height: 20px\"><a href=\"#session4\"><strong>Session 4<\/strong><\/a><\/td>\n<\/tr>\n<tr style=\"height: 20px\">\n<td style=\"text-align: center;height: 20px\" colspan=\"2\"><strong>Lunch<\/strong><\/td>\n<\/tr>\n<tr style=\"height: 20px\">\n<td style=\"height: 20px\">13:30 \u2013 15:14<\/td>\n<td style=\"height: 20px\"><a href=\"#session5\"><strong>Session 5<\/strong><\/a><\/td>\n<\/tr>\n<tr style=\"height: 20px\">\n<td style=\"text-align: center;height: 20px\" colspan=\"2\"><strong>Coffee break<\/strong><\/td>\n<\/tr>\n<tr style=\"height: 20px\">\n<td style=\"height: 17px\">15:35 \u2013 17:30<\/td>\n<td style=\"height: 17px\"><a href=\"#session6\"><strong>Session 6<\/strong><\/a><\/td>\n<\/tr>\n<tr style=\"height: 20px\">\n<td style=\"text-align: center;height: 20px\" colspan=\"2\"><strong>Excursion and Banquet<\/strong> <br>Visit of the archaeological site of <a href=\"https:\/\/www.pestum.it\/english\/\">Paestum<\/a> and social dinner in a nearby restaurant<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/figure>\n\n\n\n<h2 class=\"wp-block-heading\">Thursday, July 28th<\/h2>\n\n\n<figure class=\"wp-block-table\">\n<table style=\"width: 100%;border: 1px solid #b0b0b0;height: 180px\" data-darkreader-inline-border-top=\"\" data-darkreader-inline-border-right=\"\" data-darkreader-inline-border-bottom=\"\" data-darkreader-inline-border-left=\"\">\n<colgroup>\n<col style=\"width: 20%\" span=\"1\">\n<col style=\"width: 80%\" span=\"1\"> <\/colgroup>\n<tbody>\n<tr style=\"height: 20px\">\n<td style=\"height: 20px;border-style: solid;width: 20%\">8:40 \u2013 9:40<\/td>\n<td style=\"height: 20px;border-style: solid;width: 79.8413%\"><strong>Keynote 3<\/strong> <br>Merav Parter: <a href=\"https:\/\/www.podc.org\/podc2022\/merav-parter\/\" target=\"_blank\" rel=\"noopener\"><em>A Graph Theoretic Approach for Resilient Distributed Algorithms<\/em><\/a><\/td>\n<\/tr>\n<tr style=\"height: 20px\">\n<td style=\"text-align: center;height: 20px;border-style: solid;width: 99.8413%\" colspan=\"2\"><strong>Coffee break<\/strong><\/td>\n<\/tr>\n<tr style=\"height: 20px\">\n<td style=\"height: 20px;border-style: solid;width: 20%\">10:00 \u2013 12:02<\/td>\n<td style=\"height: 20px;border-style: solid;width: 79.8413%\"><a href=\"#session7\"><strong>Session 7<\/strong><\/a><\/td>\n<\/tr>\n<tr style=\"height: 20px\">\n<td style=\"text-align: center;height: 20px;border-style: solid;width: 99.8413%\" colspan=\"2\"><strong>Lunch<\/strong><\/td>\n<\/tr>\n<tr style=\"height: 20px\">\n<td style=\"height: 20px;border-style: solid;width: 20%\">13:30 \u2013 15:03<\/td>\n<td style=\"height: 20px;border-style: solid;width: 79.8413%\"><a href=\"#session5\"><strong>Session 8<\/strong><\/a><\/td>\n<\/tr>\n<tr style=\"height: 20px\">\n<td style=\"text-align: center;height: 20px;border-style: solid;width: 99.8413%\" colspan=\"2\"><strong>Coffee break<\/strong><\/td>\n<\/tr>\n<tr style=\"height: 20px\">\n<td style=\"height: 20px;border-style: solid;width: 20%\">15:25 \u2013 16:34<\/td>\n<td style=\"height: 20px;border-style: solid;width: 79.8413%\"><a href=\"#session9\"><strong>Session 9<\/strong><\/a><\/td>\n<\/tr>\n<tr style=\"height: 20px\">\n<td style=\"text-align: center;height: 20px;border-style: solid;width: 99.8413%\" colspan=\"2\"><strong>Break<\/strong><\/td>\n<\/tr>\n<tr style=\"height: 20px\">\n<td style=\"height: 20px;border-style: solid;width: 20%\">16:50 \u2013 18:05<\/td>\n<td style=\"height: 20px;border-style: solid;width: 79.8413%\"><a href=\"#session10\"><strong>Session 10<\/strong><\/a><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/figure>\n\n\n<h2 class=\"wp-block-heading\">Friday, July 29th<\/h2>\n\n\n\n<ul class=\"wp-block-list\"><li><strong>Workshop:<\/strong><a rel=\"noreferrer noopener\" href=\"https:\/\/podc-dare.github.io\/\" target=\"_blank\"> <\/a><a href=\"#dare\">2nd Workshop on Distributed Algorithms on Realistic Network Models<\/a><\/li><li><strong>Tutorial:<\/strong> <a href=\"#disp\">Dispersion of Mobile Robots<\/a><\/li><\/ul>\n\n\n\n<hr class=\"wp-block-separator has-alpha-channel-opacity is-style-wide\" \/>\n\n\n\n<h1 class=\"wp-block-heading\">Detailed Schedule<\/h1>\n\n\n\n<h2 class=\"has-text-align-center wp-block-heading\"><strong><span style=\"text-decoration: underline\" class=\"underline\">Monday, July 25th<\/span><\/strong><\/h2>\n\n\n\n<h2 class=\"has-text-align-left wp-block-heading\" id=\"podl\">Workshop &#8211; PODL (Monday, July 25th)<\/h2>\n\n\n<figure class=\"wp-block-table\">\n<table style=\"width: 100%;border: 1px solid #b0b0b0;height: 593px\" data-darkreader-inline-border-top=\"\" data-darkreader-inline-border-right=\"\" data-darkreader-inline-border-bottom=\"\" data-darkreader-inline-border-left=\"\">\n<colgroup>\n<col style=\"width: 20%\" span=\"1\">\n<col style=\"width: 80%\" span=\"1\"> <\/colgroup>\n<tbody>\n<tr style=\"height: 41px\">\n<td style=\"height: 19px;width: 19.8413%\">8:45 &#8211; 9:00<\/td>\n<td style=\"height: 19px;width: 79.8412%\">Welcome<\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 19.8413%\">9:00 &#8211; 9:20<\/td>\n<td style=\"height: 41px;width: 79.8412%\"><em>Tissue vs Silicon: Musings on the Future of Deep Learning Hardware and Software.<\/em> Nir Shavit.<\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 19.8413%\">9:20 &#8211; 9:40<\/td>\n<td style=\"height: 41px;width: 79.8412%\"><em>Hammer or Gavel. Or How I Learnt to Stop Learning and Love the Old-Fashioned Algorithm.<\/em> Indranil Gupta.<\/td>\n<\/tr>\n<tr style=\"height: 56px\">\n<td style=\"width: 19.8413%;height: 44px\">9:40 &#8211; 10:00<\/td>\n<td style=\"width: 79.8412%;height: 44px\"><em>Collaborative Learning is an Agreement Problem. <\/em>Sadegh Farhadkhani.<\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 22px;width: 19.8413%\">10:00 &#8211; 10:30<\/td>\n<td style=\"height: 22px;width: 79.8412%\">Coffee Break<\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 22px\">10:30 &#8211; 10:50<\/td>\n<td style=\"height: 22px\"><em>Asynchronous Distributed Machine Learning.<\/em> Hagit Attiya.<\/td>\n<\/tr>\n<tr style=\"height: 85px\">\n<td style=\"width: 19.8413%;height: 41px\">10:50 &#8211; 11:10<\/td>\n<td style=\"width: 79.8412%;height: 41px\"><em> Accelerated Deep Learning via Efficient, Compressed and Managed Communication.<\/em> Marco Canini.<\/td>\n<\/tr>\n<tr style=\"height: 56px\">\n<td style=\"width: 19.8413%;height: 21px\">11:10 &#8211; 11:30<\/td>\n<td style=\"width: 79.8412%;height: 21px\"><em>Frugal Distributed Learning.<\/em> Anne-Marrie Kermarrec.<\/td>\n<\/tr>\n<tr style=\"height: 56px\">\n<td style=\"width: 19.8413%;height: 10px\">11:30 &#8211; 11:50<\/td>\n<td style=\"width: 79.8412%;height: 10px\"><em>A Non-Parametric View of FEDAVG and FEDPROX: Beyond Stationary Points.<\/em> Lili Su.<\/td>\n<\/tr>\n<tr style=\"height: 56px\">\n<td style=\"width: 19.8413%;height: 10px\">11:50 &#8211; 12:00<\/td>\n<td style=\"width: 79.8412%;height: 10px\"><em>Robust Sparse Voting.<\/em> Youssef Allouah.<\/td>\n<\/tr>\n<tr style=\"height: 56px\">\n<td style=\"width: 19.8413%;height: 22px\">12:00 &#8211; 14:00<\/td>\n<td style=\"width: 79.8412%;height: 22px\">Lunch Break<\/td>\n<\/tr>\n<tr style=\"height: 85px\">\n<td style=\"width: 19.8413%;height: 52px\">14:00 &#8211; 14:20<\/td>\n<td style=\"width: 79.8412%;height: 52px\"><em>Elastic Consistency: a General Consistency Model for Distributed Optimization. <\/em>Dan Alistarh.<\/td>\n<\/tr>\n<tr style=\"height: 56px\">\n<td style=\"width: 19.8413%;height: 41px\">14:20 &#8211; 14:40<\/td>\n<td style=\"width: 79.8412%;height: 41px\"><em>Scaling Up Distributed Learning with System Relaxations: Bagua and Beyond.<\/em> Ce Zhang.<\/td>\n<\/tr>\n<tr style=\"height: 56px\">\n<td style=\"width: 19.8413%;height: 40px\">14:40 &#8211; 15:00<\/td>\n<td style=\"width: 79.8412%;height: 40px\"><em>Scalable Algorithms for Distributed Principal Component Analysis.<\/em> Waheed Bajwa.<\/td>\n<\/tr>\n<tr style=\"height: 56px\">\n<td style=\"width: 19.8413%;height: 43px\">15:00 &#8211; 15:20<\/td>\n<td style=\"width: 79.8412%;height: 43px\"><em>Marina: Faster Non-Convex Distributed Learning with Compression.<\/em> Konstantin Burlachenko.<\/td>\n<\/tr>\n<tr style=\"height: 56px\">\n<td style=\"width: 19.8413%;height: 22px\">15:20 &#8211; 15:40<\/td>\n<td style=\"width: 79.8412%;height: 22px\"><em>On Privacy and Security in Federated Learning.<\/em> Suhas Diggavi.<\/td>\n<\/tr>\n<tr style=\"height: 56px\">\n<td style=\"width: 19.8413%;height: 25px\">15:40 &#8211; 16:00<\/td>\n<td style=\"width: 79.8412%;height: 25px\"><em>The Role of Momentum in Byzantine Learning.<\/em> Nirupam Gupta.<\/td>\n<\/tr>\n<tr style=\"height: 56px\">\n<td style=\"width: 19.8413%;height: 21px\">16:00 &#8211; 16:30<\/td>\n<td style=\"width: 79.8412%;height: 21px\">Coffee Break<\/td>\n<\/tr>\n<tr style=\"height: 56px\">\n<td style=\"width: 19.8413%;height: 39px\">16:30 &#8211; 16:50<\/td>\n<td style=\"width: 79.8412%;height: 39px\"><em>Machine Learning without Jeopardizing the Data.<\/em> Arnaud Grivet S\u00e9bert.<\/td>\n<\/tr>\n<tr style=\"height: 56px\">\n<td style=\"width: 19.8413%;height: 17px\">16:50 &#8211; 17:10<\/td>\n<td style=\"width: 79.8412%;height: 17px\"><em>Can Byzantine Learning be Private?<\/em> Rafael Pinot.<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/figure>\n\n\n<p>For more details, please see <a href=\"https:\/\/dcl.epfl.ch\/site\/podc2022\" target=\"_blank\" rel=\"noreferrer noopener\">https:\/\/dcl.epfl.ch\/site\/podc2022<\/a><\/p>\n\n\n\n<h2 class=\"has-text-align-left wp-block-heading\" id=\"applied\">Workshop &#8211; ApPLIED<\/h2>\n\n\n<figure class=\"wp-block-table\">\n<table style=\"width: 100%;border: 1px solid #b0b0b0;height: 975px\" 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:55 &#8211; 9:00<\/td>\n<td style=\"height: 41px;width: 79.6825%\">Welcome<\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20%\">9:00 &#8211; 10:00<\/td>\n<td style=\"height: 41px;width: 79.6825%\"><strong>[Keynote]<\/strong> <em>Graph Neural Networks as Application of Distributed Algorithms.<\/em> Roger Wattenhofer.<\/td>\n<\/tr>\n<tr style=\"height: 56px\">\n<td style=\"height: 56px\">\n<p>10:00 &#8211; 10:30<\/p>\n<\/td>\n<td style=\"height: 56px;width: 79.6825%\">Coffee Break<\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20%\">10:30 &#8211; 11:00<\/td>\n<td style=\"height: 41px;width: 79.6825%\">\n<p><em>Towards an Approximation-Aware Computational Workflow Framework for Accelerating Large-Scale Discovery Tasks.<\/em> Michael Johnston and Vassils Vassiliadis.<\/p>\n<\/td>\n<\/tr>\n<tr style=\"height: 114px\">\n<td style=\"width: 20%;height: 114px\">11:00 &#8211; 11:30<\/td>\n<td style=\"width: 79.6825%;height: 114px\">\n<p><em>Colder than the warm start and warmer than the cold start! Experience the spawn start in FaaS providers. <\/em>Sashko Ristov, Christian Hollaus, and Mika Hautz.<\/p>\n<\/td>\n<\/tr>\n<tr style=\"height: 56px\">\n<td style=\"width: 20%;height: 56px\">11:30 &#8211; 11:45<\/td>\n<td style=\"width: 79.6825%;height: 56px\">\n<p><em>Research Summary: Deterministic, Explainable and Efficient Stream Processing.<\/em> Dimitrios Palyvos-Giannas, Marina Papatriantafilou, and Vincenzo Gulisano.<\/p>\n<\/td>\n<\/tr>\n<tr style=\"height: 56px\">\n<td style=\"width: 20%;height: 56px\">11:45 &#8211; 13:00<\/td>\n<td style=\"width: 79.6825%;height: 56px\">\n<p>Lunch Break<\/p>\n<\/td>\n<\/tr>\n<tr style=\"height: 56px\">\n<td style=\"width: 20%;height: 56px\">13:00 &#8211; 14:00<\/td>\n<td style=\"width: 79.6825%;height: 56px\">\n<p><strong>[Keynote]<\/strong> <em>Cascade: An Edge Computing Platform for Real-time Machine Intelligence. <\/em>Ken Birman (joint work with Weijia Song, Yuting Yang, Thompson Liu, Andrea Merlina, Thiago Garrett, Roman Vitenberg, Lorenzo Rosa, Aahil Awatramani, and Zheng Wang).<\/p>\n<\/td>\n<\/tr>\n<tr style=\"height: 56px\">\n<td style=\"width: 20%;height: 56px\">14:00 &#8211; 14:05<\/td>\n<td style=\"width: 79.6825%;height: 56px\">\n<p>Short Break<\/p>\n<\/td>\n<\/tr>\n<tr style=\"height: 56px\">\n<td style=\"width: 20%;height: 56px\">14:05 &#8211; 14:35<\/td>\n<td style=\"width: 79.6825%;height: 56px\">\n<p><em>DARTS: Distributed IoT Architecture for Real-Time, Resilient and AI-Compressed Workflows. <\/em>Ragini Gupta, Bo Chen, Shengzhong Liu, Tianshi Wang, Klara Nahrstedt, Tarek Abdelzaher, Sandeep Singh Sandha, Mani Srivastava, Abel Souza, Prashant Shenoy, Jeffrey Smith, Maggie Wigness, and Niranjan Suri.<\/p>\n<\/td>\n<\/tr>\n<tr style=\"height: 56px\">\n<td style=\"width: 20%;height: 56px\">14:35 &#8211; 15:05<\/td>\n<td style=\"width: 79.6825%;height: 56px\">\n<p><em>Drone-Truck Cooperated Delivery Under Time Varying Dynamics. <\/em>Arindam Khanda, Federico Coro\u0300, and Sajal K Das.<\/p>\n<\/td>\n<\/tr>\n<tr style=\"height: 56px\">\n<td style=\"width: 20%;height: 56px\">15:05 &#8211; 15:10<\/td>\n<td style=\"width: 79.6825%;height: 56px\">\n<p>Short Break<\/p>\n<\/td>\n<\/tr>\n<tr style=\"height: 56px\">\n<td style=\"width: 20%;height: 56px\">15:10 &#8211; 15:40<\/td>\n<td style=\"width: 79.6825%;height: 56px\">\n<p><em>QUANTAS: Quantitative User-friendly Adaptable Networked Things Abstract Simulator. <\/em>Joseph Oglio, Kendric Hood, Mikhail Nesterenko, and Sebastien Tixeuil.<\/p>\n<\/td>\n<\/tr>\n<tr style=\"height: 56px\">\n<td style=\"width: 20%;height: 56px\">15:40 &#8211; 16:10<\/td>\n<td style=\"width: 79.6825%;height: 56px\">\n<p><em>A Roadmap To Post-Moore Era for Distributed Systems. <\/em>Vincenzo De Maio, Atakan Aral, and Ivona Brandic.<\/p>\n<\/td>\n<\/tr>\n<tr style=\"height: 56px\">\n<td style=\"width: 20%;height: 10px\">16:10 &#8211; 16:40<\/td>\n<td style=\"width: 79.6825%;height: 10px\">\n<p>Coffee Break<\/p>\n<\/td>\n<\/tr>\n<tr style=\"height: 56px\">\n<td style=\"width: 20%;height: 56px\">16:40 &#8211; 17:10<\/td>\n<td style=\"width: 79.6825%;height: 56px\">\n<p><em>Exploring the use of Strongly Consistent Distributed Shared Memory in 3D NVEs. <\/em>Theophanis Hadjistasi, Nicolas Nicolaou, and Efstathios Stavrakis.<\/p>\n<\/td>\n<\/tr>\n<tr style=\"height: 56px\">\n<td style=\"width: 20%;height: 56px\">17:10 &#8211; 17:40<\/td>\n<td style=\"width: 79.6825%;height: 56px\">\n<p><em>A Closer Look at Detectable Objects for Persistent Memory. <\/em>Mohammad Moridi, Erica Wang, Amelia Cui, and Wojciech Golab.<\/p>\n<\/td>\n<\/tr>\n<tr style=\"height: 56px\">\n<td style=\"width: 20%;height: 56px\">17:40 &#8211; 17:45<\/td>\n<td style=\"width: 79.6825%;height: 56px\">\n<p>Closing<\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/figure>\n\n\n<p>For more details, please see <a rel=\"noreferrer noopener\" href=\"http:\/\/www.cse.chalmers.se\/~elad\/ApPLIED2022\/ApPLIED22program.pdf\" target=\"_blank\">http:\/\/www.cse.chalmers.se\/~elad\/ApPLIED2022\/ApPLIED22program.pdf<\/a><\/p>\n\n\n\n<h3 class=\"has-text-align-left wp-block-heading\">18:00 PODC Reception<\/h3>\n\n\n\n<hr class=\"wp-block-separator has-alpha-channel-opacity\" \/>\n\n\n\n<h2 class=\"wp-block-heading\"><strong><span style=\"text-decoration: underline\" class=\"underline\">Tuesday, July 26th<\/span><\/strong><\/h2>\n\n\n\n<h3 class=\"has-text-align-left wp-block-heading\">8:30 &#8211; 8:40 Opening <\/h3>\n\n\n\n<h3 class=\"has-text-align-left wp-block-heading\">8:40 &#8211; 9:40 Keynote 1<\/h3>\n\n\n\n<p>Michael L. Scott: <em>How Should We Think about Persistent Data Structures?<\/em><\/p>\n\n\n\n<h3 class=\"has-text-align-left wp-block-heading\" id=\"session1\">10:00 &#8211; 11:56 Session 1<\/h3>\n\n\n\n<p><strong>Session Chair: Dan Alistarh<\/strong><\/p>\n\n\n<figure class=\"wp-block-table\">\n<table style=\"width: 100%;border: 1px solid #b0b0b0;height: 349px\" data-darkreader-inline-border-top=\"\" data-darkreader-inline-border-right=\"\" data-darkreader-inline-border-bottom=\"\" data-darkreader-inline-border-left=\"\">\n<colgroup>\n<col style=\"width: 20%\" span=\"1\">\n<col style=\"width: 80%\" span=\"1\"> <\/colgroup>\n<tbody>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20%\">10:00 \u2013 10:23<\/td>\n<td style=\"height: 41px;width: 79.6825%\"><em>Node and Edge Averaged Complexities of Local Graph Problems. <\/em>Alkida Balliu, Mohsen Ghaffari, Fabian Kuhn, Dennis Olivetti.<em><br><\/em><\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20%\">10:23 \u2013 10:46<\/td>\n<td style=\"height: 41px;width: 79.6825%\"><em>Distributed Edge Coloring in Time Polylogarithmic in \u0394. <\/em>Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Dennis Olivetti.<\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20%\">10:46 \u2013 11:09<\/td>\n<td style=\"height: 41px;width: 79.6825%\"><em>Overcoming Congestion in Distributed Coloring. <\/em>Magnus M. Halldorsson, Alexandre Nolin, Tigran Tonoyan.<em><br><\/em><\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20%\">11:09 \u2013 11:32<\/td>\n<td style=\"height: 41px;width: 79.6825%\"><em>The Landscape of Distributed Complexities on Trees and Beyond. <\/em>Christoph Grunau, V\u00e1clav Rozho\u0148, Sebastian Brandt.<em><br><\/em><\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20%\">11:32 \u2013 11:38<\/td>\n<td style=\"height: 41px;width: 79.6825%\"><em>Brief Announcement: On Polynomial-Time Local Decision<\/em>. Eden Aldema Tshuva, Rotem Oshman.<\/td>\n<\/tr>\n<tr style=\"height: 62px\">\n<td style=\"height: 62px;width: 20%\">11:38 \u2013 11:44<\/td>\n<td style=\"height: 62px;width: 79.6825%\"><em>Brief Announcement: Distributed MST Computation in the Sleeping Model: Awake-Optimal Algorithms and Lower Bounds<\/em>. John Augustine, William K. Moses Jr., Gopal Pandurangan<em>.<\/em><\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20%\">11:44 \u2013 11:50<\/td>\n<td style=\"height: 41px;width: 79.6825%\"><em>Brief Announcement: Broadcasting Time in Dynamic Rooted Trees is Linear<\/em>. Antoine El-Hayek, Monika Henzinger, Stefan Schmid<em>.<\/em><\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20%\">11:50 \u2013 11:56<\/td>\n<td style=\"height: 41px;width: 79.6825%\"><em>Brief Announcement: (1+\u03b5)-Approximate Shortest Paths in Dynamic Streams<\/em>. Chhaya Trehan, Michael Elkin<em>.<\/em><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/figure>\n\n\n<h3 class=\"has-text-align-left wp-block-heading\" id=\"session2\">13:30 &#8211; 15:14 Session 2<\/h3>\n\n\n\n<p><strong>Session Chair: Hagit Attiya<\/strong><\/p>\n\n\n<figure class=\"wp-block-table\">\n<table style=\"width: 100%;border: 1px solid #b0b0b0;height: 268px\" data-darkreader-inline-border-top=\"\" data-darkreader-inline-border-right=\"\" data-darkreader-inline-border-bottom=\"\" data-darkreader-inline-border-left=\"\">\n<colgroup>\n<col style=\"width: 20%\" span=\"1\">\n<col style=\"width: 80%\" span=\"1\"> <\/colgroup>\n<tbody>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px\">13:30 \u2013 13:53<\/td>\n<td style=\"height: 41px\"><em>A Recursive Early-Stopping Phase King Protocol<\/em>. Christoph Lenzen, Sahar Sheikholeslami.<\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 42px\">13:53 \u2013 14:16<\/td>\n<td style=\"height: 42px\"><em>Optimal Synchronous Approximate Agreement with Asynchronous Fallback<\/em>. Diana Ghinea, Chen-Da Liu-Zhang, Roger Wattenhofer.<\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px\">14:16 \u2013 14:39<\/td>\n<td style=\"height: 41px\"><em>Internet Computer Consensus<\/em>. Jan Camenisch, Manu Drijvers, Timo Hanke, Yvonne-Anne Pignolet, Victor Shoup, Dominic Williams<em>.<\/em><\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px\">14:39 \u2013 15:02<\/td>\n<td style=\"height: 41px\"><em>Perfectly-Secure Synchronous MPC with Asynchronous Fallback Guarantees<\/em>. Ananya Appan, Anirudh Chandramouli, Ashish Choudhury.<\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px\">15:02 \u2013 15:08<\/td>\n<td style=\"height: 41px\"><em>Brief Announcement: Asynchronous Randomness and Consensus without Trusted Setup<\/em>. Luciano Freitas De Souza, Petr Kuznetsov, Andrei Tonkikh.<em><br><\/em><\/td>\n<\/tr>\n<tr style=\"height: 62px\">\n<td style=\"height: 62px\">15:08 \u2013 15:14<\/td>\n<td style=\"height: 62px\"><em>Brief Announcement: Deterministic Consensus and Checkpointing with Crashes: Time and Communication<\/em>. Bogdan Chlebus, Dariusz Kowalski, Jan Olkowski.<em><br><\/em><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/figure>\n\n\n<h3 class=\"has-text-align-left wp-block-heading\" id=\"session3\">15:35 &#8211; 17:30 Session 3<\/h3>\n\n\n\n<p><strong>Session Chair: Mohsen Ghaffari<\/strong><\/p>\n\n\n<figure class=\"wp-block-table\">\n<table style=\"width: 100%;border: 1px solid #b0b0b0;height: 180px\" data-darkreader-inline-border-top=\"\" data-darkreader-inline-border-right=\"\" data-darkreader-inline-border-bottom=\"\" data-darkreader-inline-border-left=\"\">\n<colgroup>\n<col style=\"width: 20%\" span=\"1\">\n<col style=\"width: 80%\" span=\"1\"> <\/colgroup>\n<tbody>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px\">15:35 \u2013 15:58<\/td>\n<td style=\"height: 41px\"><em>A Framework for Distributed Quantum Queries in the CONGEST Model<\/em>. Tijn de Vos, Joran van Apeldoorn<\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px\">15:38 \u2013 16:21<\/td>\n<td style=\"height: 41px\"><em>Quantum Complexity of Weighted Diameter and Radius in CONGEST Networks<\/em>. Xudong Wu, Penghui Yao.<\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px\">16:21 \u2013 16:44<\/td>\n<td style=\"height: 41px\"><em>What Can Be Certified Compactly? Compact local certification of MSO properties in tree-like graphs<\/em>. Laurent Feuilloley, Nicolas Bousquet, Th\u00e9o Pierron.<\/td>\n<\/tr>\n<tr style=\"height: 16px\">\n<td style=\"height: 16px\">16:44 \u2013 17:07<\/td>\n<td style=\"height: 16px\"><em>Distributed Computations in Fully-Defective Networks<\/em>. Keren Censor-Hillel, Shir Cohen, Ran Gelles, Gal Sela.<\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px\">17:07 \u2013 17:30<\/td>\n<td style=\"height: 41px\"><em>Can\u2019t See the Forest for the Trees: Navigating Metric Spaces by Bounded Hop-Diameter Spanners<\/em>. Omri Kahalon, Hung Le, Lazar Milenkovi\u0107, Shay Solomon<em>.<\/em><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/figure>\n\n\n<h3 class=\"has-text-align-left wp-block-heading\">17:30 &#8211; 19:30 Business Meeting<\/h3>\n\n\n\n<hr class=\"wp-block-separator has-alpha-channel-opacity\" \/>\n\n\n\n<h2 class=\"wp-block-heading\"><strong><span style=\"text-decoration: underline\" class=\"underline\">Wednesday, July 27th<\/span><\/strong><\/h2>\n\n\n\n<h3 class=\"has-text-align-left wp-block-heading\">8:40 &#8211; 9:40 Keynote 2<\/h3>\n\n\n\n<p>Seny Kamara: <em>Encrypted Distributed Systems<\/em><\/p>\n\n\n\n<h3 class=\"has-text-align-left wp-block-heading\" id=\"session4\">10:00 &#8211; 12:01 Session 4<\/h3>\n\n\n\n<p><strong>Session Chair: Philipp Woelfel<\/strong><\/p>\n\n\n<figure class=\"wp-block-table\">\n<table style=\"width: 100%;border: 1px solid #b0b0b0;height: 267px\" data-darkreader-inline-border-top=\"\" data-darkreader-inline-border-right=\"\" data-darkreader-inline-border-bottom=\"\" data-darkreader-inline-border-left=\"\">\n<colgroup>\n<col style=\"width: 20%\" span=\"1\">\n<col style=\"width: 80%\" span=\"1\"> <\/colgroup>\n<tbody>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20%\">10:00 \u2013 10:23<\/td>\n<td style=\"height: 41px;width: 79.8413%\"><em>Balanced Allocations with the Choice of Noise<\/em>. Dimitrios Los, Thomas Sauerwald. <strong>(Best Student Paper Award)<\/strong><\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20%\">10:23 \u2013 10:46<\/td>\n<td style=\"height: 41px;width: 79.8413%\"><em>The Space Complexity of Consensus from Swap. <\/em>Sean Ovens. <strong>(Best Paper Award)<\/strong><\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20%\">10:46 \u2013 11:09<\/td>\n<td style=\"height: 41px;width: 79.8413%\"><em>Fast and Fair Randomized Wait-Free Locks<\/em>. Naama Ben-David, Guy E. Blelloch<em>.<\/em><\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20%\">11:09 \u2013 11:32<\/td>\n<td style=\"height: 41px;width: 79.8413%\"><em>When is Recoverable Consensus Harder Than Consensus?<\/em> Carole Delporte-Gallet, Panagiota Fatourou, Hugues Fauconnier, Eric Ruppert<em>.<\/em><\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20%\">11:32 \u2013 11:55<\/td>\n<td style=\"height: 41px;width: 79.8413%\"><em>Blunting an Adversary Against Randomized Concurrent Programs with Linearizable Implementations<\/em>. Hagit Attiya, Constantin Enea, Jennifer Welch<em>.<\/em><\/td>\n<\/tr>\n<tr style=\"height: 62px\">\n<td style=\"height: 62px;width: 20%\">11:38 \u2013 11:44<\/td>\n<td style=\"height: 62px;width: 79.8413%\"><em>Brief Announcement: Towards a Theory of Wear Leveling in Persistent Data Structures<\/em>. Xialin Liu, Wojciech Golab<em>.<\/em><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/figure>\n\n\n<h3 class=\"has-text-align-left wp-block-heading\" id=\"session5\">13:30 &#8211; 15:14 Session 5<\/h3>\n\n\n\n<p><strong>Session Chair: Ran Gelles<\/strong><\/p>\n\n\n<figure class=\"wp-block-table\">\n<table style=\"width: 100%;border: 1px solid #b0b0b0;height: 246px\" data-darkreader-inline-border-top=\"\" data-darkreader-inline-border-right=\"\" data-darkreader-inline-border-bottom=\"\" data-darkreader-inline-border-left=\"\">\n<colgroup>\n<col style=\"width: 20%\" span=\"1\">\n<col style=\"width: 80%\" span=\"1\"> <\/colgroup>\n<tbody>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px\">13:30 \u2013 13:53<\/td>\n<td style=\"height: 41px\"><em>Population Protocols for Exact Plurality Consensus: How a small chance of failure helps to eliminate insignificant opinions. <\/em>Gregor Bankhamer, Petra Berenbrink, Felix Biermeier, Robert Els\u00e4sser, Hamed Hosseinpour, Dominik Kaaser, Peter Kling<em>.<\/em><\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px\">13:53 \u2013 14:16<\/td>\n<td style=\"height: 41px\"><em>Early Adapting to Trends: Self-Stabilizing Information Spread using Passive Communication<\/em>. Amos Korman, Robin Vacus<em>.<\/em><\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px\">14:16 \u2013 14:39<\/td>\n<td style=\"height: 41px\"><em>Near-Optimal Leader Election in Population Protocols on Graphs<\/em>. Dan Alistarh, Joel Rybicki, Sasha Voitovych<em>.<\/em><\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px\">14:39 \u2013 15:02<\/td>\n<td style=\"height: 41px\"><em>State Complexity of Protocols With Leaders<\/em>. J\u00e9r\u00f4me Leroux.<\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px\">15:02 \u2013 15:08<\/td>\n<td style=\"height: 41px\"><em>Brief Announcement: Computability and Anonymous Storage-Efficient Consensus with an Abstract MAC Layer<\/em>. Lewis Tseng, Qinzi Zhang<em>.<\/em><\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px\">15:08 \u2013 15:14<\/td>\n<td style=\"height: 41px\"><em>Brief Announcement: The weakest failure detector for genuine atomic multicast<\/em>. Pierre Sutra<em>.<\/em><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/figure>\n\n\n<h3 class=\"has-text-align-left wp-block-heading\" id=\"session6\">15:35 &#8211; 17:30 Session 6<\/h3>\n\n\n\n<p><strong>Session Chair: Ittai Abraham<\/strong><\/p>\n\n\n<figure class=\"wp-block-table\">\n<table style=\"width: 100%;border: 1px solid #b0b0b0;height: 180px\" data-darkreader-inline-border-top=\"\" data-darkreader-inline-border-right=\"\" data-darkreader-inline-border-bottom=\"\" data-darkreader-inline-border-left=\"\">\n<colgroup>\n<col style=\"width: 20%\" span=\"1\">\n<col style=\"width: 80%\" span=\"1\"> <\/colgroup>\n<tbody>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px\">15:35 \u2013 15:58<\/td>\n<td style=\"height: 41px\"><em>Deterministic Near-Optimal Distributed Listing of Cliques<\/em>. Keren Censor-Hillel, Dean Leitersdorf, David Vulakh<em>.<\/em><\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px\">15:58 \u2013 16:21<\/td>\n<td style=\"height: 41px\"><em>Universally-Optimal Distributed Exact Min-Cut<\/em>. Mohsen Ghaffari, Goran Zuzic<em>.<\/em><\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px\">16:21 \u2013 16:44<\/td>\n<td style=\"height: 41px\"><em>Near-Optimal Distributed Dominating Set in Bounded Arboricity Graphs<\/em>. Michal Dory, Mohsen Ghaffari, Saeed Ilchi<\/td>\n<\/tr>\n<tr style=\"height: 16px\">\n<td style=\"height: 16px\">16:44 \u2013 17:07<\/td>\n<td style=\"height: 16px\"><em>Narrowing the LOCAL\u2013CONGEST Gaps in Sparse Networks via Expander Decompositions<\/em>. Yi-Jun Chang, Hsin-Hao Su<em>.<\/em><\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px\">17:07 \u2013 17:30<\/td>\n<td style=\"height: 41px\"><em>From Switch Scheduling to Datacenter Scheduling: Matching-Coordinated Greed is Good<\/em>. Shijin Rajakrishnan, Rachit Agarwal, David Shmoys<em>.<\/em><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/figure>\n\n\n<h3 class=\"has-text-align-left wp-block-heading\"><strong>Excursion and Banquet<\/strong><\/h3>\n\n\n\n<p>Visit of the archaeological site of <a href=\"https:\/\/www.pestum.it\/english\/\">Paestum<\/a> and social dinner in a nearby restaurant<\/p>\n\n\n\n<hr class=\"wp-block-separator has-alpha-channel-opacity\" \/>\n\n\n\n<h2 class=\"wp-block-heading\"><strong><span style=\"text-decoration: underline\" class=\"underline\">Thursday, July 28th<\/span><\/strong><\/h2>\n\n\n\n<h3 class=\"has-text-align-left wp-block-heading\">8:40 &#8211; 9:40 Keynote 3<\/h3>\n\n\n\n<p>Merav Parter: <em>A Graph Theoretic Approach for Resilient Distributed Algorithms<\/em><\/p>\n\n\n\n<h3 class=\"has-text-align-left wp-block-heading\" id=\"session7\">10:00 &#8211; 12:02 Session 7<\/h3>\n\n\n\n<p><strong>Session Chair: Merav Parter<\/strong><\/p>\n\n\n<figure class=\"wp-block-table\">\n<table style=\"width: 100%;border: 1px solid #b0b0b0;height: 389px\" data-darkreader-inline-border-top=\"\" data-darkreader-inline-border-right=\"\" data-darkreader-inline-border-bottom=\"\" data-darkreader-inline-border-left=\"\">\n<colgroup>\n<col style=\"width: 20%\" span=\"1\">\n<col style=\"width: 80%\" span=\"1\"> <\/colgroup>\n<tbody>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20.1587%\">10:00 \u2013 10:23<\/td>\n<td style=\"height: 41px;width: 79.6825%\"><em>Constant-Round Near-Optimal Spanners in Congested Clique<\/em>. Shiri Chechik, Tianyi Zhang.<\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20.1587%\">10:23 \u2013 10:46<\/td>\n<td style=\"height: 41px;width: 79.6825%\"><em>The Laplacian Paradigm in the Broadcast Congested Clique<\/em>. Tijn de Vos, Sebastian Forster.<\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20.1587%\">10:46 \u2013 11:09<\/td>\n<td style=\"height: 41px;width: 79.6825%\"><em>Massively Parallel Computation in a Heterogeneous Regime<\/em>. Orr Fischer, Adi Horowitz, Rotem Oshman.<\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 40px;width: 20.1587%\">11:09 \u2013 11:32<\/td>\n<td style=\"height: 40px;width: 79.6825%\"><em>A Massively Parallel Modularity-Maximizing Algorithm With Provable Guarantees<\/em>. Vincent Cohen-Addad, Frederik Mallmann-Trenn, David Saulpic<em>.<\/em><\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20.1587%\">11:32 \u2013 11:38<\/td>\n<td style=\"height: 41px;width: 79.6825%\"><em>Brief Announcement: Deterministic Massively Parallel Algorithms for Ruling Sets. <\/em>Shreyas Pai, Sriram V. Pemmaraju.<em><br><\/em><\/td>\n<\/tr>\n<tr style=\"height: 62px\">\n<td style=\"height: 62px;width: 20.1587%\">11:38 \u2013 11:44<\/td>\n<td style=\"height: 62px;width: 79.6825%\"><em>Brief Announcement: Near Optimal Bounds for Replacement Paths and Related Problems in the CONGEST Model<\/em>. Vignesh Manoharan, Vijaya Ramachandran.<em><br><\/em><\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20.1587%\">11:44 \u2013 11:50<\/td>\n<td style=\"height: 41px;width: 79.6825%\">\n<div><em>Brief Announcement: Almost Universally Optimal Distributed Laplacian Solver<\/em>. Ioannis Anagnostides, Christoph Lenzen, Bernhard Haeupler, Goran Zuzic, Themis Gouleakis.<em><br><\/em><\/div>\n<\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20.1587%\">11:50 \u2013 11:56<\/td>\n<td style=\"height: 41px;width: 79.6825%\"><em>Brief Announcement: Gathering Despite a Linear Number of Weakly Byzantine Agents<\/em>. Jion Hirose, Junya Nakamura, Fukuhito Ooshita, Michiko Inoue<em>.<\/em><\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20.1587%\">11:56 \u2013 12:02<\/td>\n<td style=\"height: 41px;width: 79.6825%\"><em>Brief Announcement: Probabilistic Dynamic Input\/Output Automata<\/em>. Pierre Civit, Maria Potop-Butucaru<em>.<\/em><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/figure>\n\n\n<h3 class=\"has-text-align-left wp-block-heading\" id=\"session8\">13:30 &#8211; 15:03 Session 8<\/h3>\n\n\n\n<p><strong>Session Chair: Maurice Herlihy<\/strong><\/p>\n\n\n<figure class=\"wp-block-table\">\n<table style=\"width: 100%;border: 1px solid #b0b0b0;height: 277px\" data-darkreader-inline-border-top=\"\" data-darkreader-inline-border-right=\"\" data-darkreader-inline-border-bottom=\"\" data-darkreader-inline-border-left=\"\">\n<colgroup>\n<col style=\"width: 20%\" span=\"1\">\n<col style=\"width: 80%\" span=\"1\"> <\/colgroup>\n<tbody>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20%\">13:30 \u2013 13:53<\/td>\n<td style=\"height: 41px;width: 79.6825%\"><em>Efficient and Adaptively Secure Asynchronous Binary Agreement via Binding Crusader Agreement<\/em>. Ittai Abraham, Naama Ben David, Sravya Yandamuri<em>.<\/em><\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20%\">13:53 \u2013 14:16<\/td>\n<td style=\"height: 41px;width: 79.6825%\"><em>Gradecast in Synchrony and Reliable Broadcast in Asynchrony with Optimal Resilience, Efficiency, and Unconditional Security<\/em>. Ittai Abraham, Gilad Asharov<em>.<\/em><\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20%\">14:16 \u2013 14:39<\/td>\n<td style=\"height: 41px;width: 79.6825%\"><em>Balanced Byzantine Reliable Broadcast with Near-Optimal Communication and Improved Computation<\/em>. Nicolas Alhaddad, Sourav Das, Sisi Duan, Ling Ren, Mayank Varia, Zhuolun Xiang<em>, <\/em>Haibin Zhang.<\/td>\n<\/tr>\n<tr style=\"height: 13px\">\n<td style=\"height: 10px;width: 20%\">14:39 \u2013 14:45<\/td>\n<td style=\"height: 10px;width: 79.6825%\"><em>Brief Announcement: Asynchronous Verifiable Information Dispersal with Near-Optimal Communication. <\/em>Nicolas Alhaddad, Sourav Das, Sisi Duan, Ling Ren, Mayank Varia, Zhuolun Xiang, Haibin Zhang.<em><br><\/em><\/td>\n<\/tr>\n<tr style=\"height: 62px\">\n<td style=\"height: 62px;width: 20%\">14:45 \u2013 14:51<\/td>\n<td style=\"height: 62px;width: 79.6825%\"><em>Brief Announcement: Make Every Word Count: Adaptive Byzantine Agreement with Fewer Words<\/em>. Shir Cohen, Idit Keidar, Alexander Spiegelman.<em><br><\/em><\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20%\">14:51 \u2013 11:50<\/td>\n<td style=\"height: 41px;width: 79.6825%\">\n<div><em>Brief Announcement: Holistic Verification of Blockchain Consensus<\/em>. Nathalie Bertrand, Vincent Gramoli, Marijana Lazic, Igor Konnov, Pierre Tholoniat, Josef Widder.<em><br><\/em><\/div>\n<\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20%\">14:57 \u2013 15:03<\/td>\n<td style=\"height: 41px;width: 79.6825%\"><em>Brief Announcement: How to Tame Multiple Spending in Decentralized Cryptocurrencies<\/em>. Jo\u00e3o Paulo Bezerra de Ara\u00fajo, Petr Kuznetsov.<em><br><\/em><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/figure>\n\n\n<h3 class=\"has-text-align-left wp-block-heading\" id=\"session9\">15:25 &#8211; 16:34 Session 9<\/h3>\n\n\n\n<p><strong>Session Chair: Petr Kuznetsov<\/strong><\/p>\n\n\n<figure class=\"wp-block-table\">\n<table style=\"width: 100%;border: 1px solid #b0b0b0;height: 123px\" data-darkreader-inline-border-top=\"\" data-darkreader-inline-border-right=\"\" data-darkreader-inline-border-bottom=\"\" data-darkreader-inline-border-left=\"\">\n<colgroup>\n<col style=\"width: 20%\" span=\"1\">\n<col style=\"width: 80%\" span=\"1\"> <\/colgroup>\n<tbody>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px\">15:25 \u2013 15:48<\/td>\n<td style=\"height: 41px\"><em>Adaptively Secure Single Secret Leader Election from DDH<\/em>. Dario Catalano, Dario Fiore, Emanuele Giunta<em>.<\/em><\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px\">15:48 \u2013 16:11<\/td>\n<td style=\"height: 41px\"><em>Optimal Clock Synchronization with Signatures<\/em>. Christoph Lenzen, Julian Loss<em>.<\/em><\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px\">16:11 \u2013 16:34<\/td>\n<td style=\"height: 41px\"><em>Revisiting the Power of Non-Equivocation in Distributed Protocols<\/em>. Naama Ben-David, Benjamin Chan, Elaine Shi<em>.<\/em><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/figure>\n\n\n<h3 class=\"has-text-align-left wp-block-heading\" id=\"session10\">16:50 &#8211; 18:05 Session 10<\/h3>\n\n\n\n<p><strong>Session Chair: Faith Ellen<\/strong><\/p>\n\n\n<figure class=\"wp-block-table\">\n<table style=\"width: 100%;border: 1px solid #b0b0b0;height: 164px\" data-darkreader-inline-border-top=\"\" data-darkreader-inline-border-right=\"\" data-darkreader-inline-border-bottom=\"\" data-darkreader-inline-border-left=\"\">\n<colgroup>\n<col style=\"width: 20%\" span=\"1\">\n<col style=\"width: 80%\" span=\"1\"> <\/colgroup>\n<tbody>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20%\">16:50 \u2013 17:13<\/td>\n<td style=\"height: 41px;width: 79.6825%\"><em>A Speedup Theorem for Asynchronous Computation with Applications to Consensus and Approximate Agreement<\/em>. Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum<em>.<\/em><\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20%\">17:13 \u2013 17:36<\/td>\n<td style=\"height: 41px;width: 79.6825%\"><em>A Distributed Combinatorial Topology Approach to Arrow\u2019s Impossibility Theorem<\/em>. Sergio Rajsbaum, Armajac Ravent\u00f3s-Pujol<em>.<\/em><\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20%\">\n<p>17:36 \u2013 17:59<\/p>\n<\/td>\n<td style=\"height: 41px;width: 79.6825%\"><em>Parameterized Verification under Release Acquire is PSPACE-complete<\/em>. Shankaranarayanan Krishna, Adwait Godbole, Roland Meyer, Soham Chakraborty<em>.<\/em><\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20%\">17:59 \u2013 18:05<\/td>\n<td style=\"height: 41px;width: 79.6825%\"><em>Brief Announcement: Fault Tolerant Coloring of the Asynchronous Cycle<\/em>. Pierre Fraigniaud, Patrick Lambein-Monette, Mika\u00ebl Rabie<em>.<\/em><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/figure>\n\n\n<hr class=\"wp-block-separator has-alpha-channel-opacity\" \/>\n\n\n\n<h2 class=\"wp-block-heading\" id=\"dare\"><strong><span style=\"text-decoration: underline\" class=\"underline\">Friday, July 29th<\/span><\/strong><\/h2>\n\n\n\n<h3 class=\"has-text-align-left wp-block-heading\">Workshop &#8211; <strong>DARe<\/strong><\/h3>\n\n\n<figure class=\"wp-block-table\">\n<table style=\"width: 100%;border: 1px solid #b0b0b0;height: 363px\" 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:00 &#8211; 9:10<\/td>\n<td style=\"height: 41px;width: 79.6825%\">Welcome<\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20%\">9:10 &#8211; 10:00<\/td>\n<td style=\"height: 41px;width: 79.6825%\"><em>A Brief Introduction to Network Geometry. <\/em>Mari\u00e1n Bogu\u00f1\u00e1 Espinal.<\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20%\">\n<p>10:00 &#8211; 10:30<\/p>\n<\/td>\n<td style=\"height: 41px;width: 79.6825%\">Coffee Break<\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20%\">10:30 &#8211; 11:20<\/td>\n<td style=\"height: 41px;width: 79.6825%\">\n<p><em>Catching Up on the Internet Computer. <\/em>Yvonne-Anne Pignolet.<\/p>\n<\/td>\n<\/tr>\n<tr style=\"height: 114px\">\n<td style=\"width: 20%;height: 18px\">11:20 &#8211; 12:00<\/td>\n<td style=\"width: 79.6825%;height: 18px\">\n<p>Discussion<\/p>\n<\/td>\n<\/tr>\n<tr style=\"height: 56px\">\n<td style=\"width: 20%;height: 56px\">12:00 &#8211; 13:30<\/td>\n<td style=\"width: 79.6825%;height: 56px\">\n<p>Lunch Break<\/p>\n<\/td>\n<\/tr>\n<tr style=\"height: 56px\">\n<td style=\"width: 20%;height: 59px\">13:30 &#8211; 14:20<\/td>\n<td style=\"width: 79.6825%;height: 59px\">\n<p><em>Distributed Discharging: Global Guarantees of Local Behaviors. Marthe Bonamy.<\/em><\/p>\n<\/td>\n<\/tr>\n<tr style=\"height: 56px\">\n<td style=\"width: 20%;height: 56px\">14:20 &#8211; 15:10<\/td>\n<td style=\"width: 79.6825%;height: 56px\">\n<p><em>Large Scale Algorithms, Clustering and the MPC Model. <\/em>Silvio Lattanzi.<\/p>\n<\/td>\n<\/tr>\n<tr style=\"height: 56px\">\n<td style=\"width: 20%;height: 10px\">15:10 &#8211; 15:20<\/td>\n<td style=\"width: 79.6825%;height: 10px\">\n<p>Closing<\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/figure>\n\n\n<p>For more details, please see <a href=\"https:\/\/podc-dare.github.io\" target=\"_blank\" rel=\"noreferrer noopener\">https:\/\/podc-dare.github.io<\/a><\/p>\n\n\n\n<h3 class=\"has-text-align-left wp-block-heading\" id=\"disp\">Tutorial &#8211; Dispersion of Mobile Robots<\/h3>\n\n\n<figure class=\"wp-block-table\">\n<table style=\"width: 100%;border: 1px solid #b0b0b0;height: 143px\" data-darkreader-inline-border-top=\"\" data-darkreader-inline-border-right=\"\" data-darkreader-inline-border-bottom=\"\" data-darkreader-inline-border-left=\"\">\n<colgroup>\n<col style=\"width: 20%\" span=\"1\">\n<col style=\"width: 80%\" span=\"1\"> <\/colgroup>\n<tbody>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20%\">09:00 &#8211; 09:05<\/td>\n<td style=\"height: 41px;width: 79.6825%\">Welcome<\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20%\">9:05 &#8211; 10:00<\/td>\n<td style=\"height: 41px;width: 79.6825%\"><em>Part 1: Vanilla Setting. <\/em>Anisur Rahaman Molla.<\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 41px;width: 20%\">\n<p>10:00 &#8211; 10:30<\/p>\n<\/td>\n<td style=\"height: 41px;width: 79.6825%\">Coffee Break<\/td>\n<\/tr>\n<tr style=\"height: 41px\">\n<td style=\"height: 10px;width: 20%\">10:30 &#8211; 11:55<\/td>\n<td style=\"height: 10px;width: 79.6825%\">\n<p><em>Part 2: Extensions. <\/em>William K. Moses Jr.<\/p>\n<\/td>\n<\/tr>\n<tr style=\"height: 114px\">\n<td style=\"width: 20%;height: 10px\">11:55 &#8211; 12:00<\/td>\n<td style=\"width: 79.6825%;height: 10px\">\n<p>Closing<\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/figure>\n\n\n<p>For more details, please see <a href=\"https:\/\/sites.google.com\/view\/dispersion-mobilerobots-podc22\/\" target=\"_blank\" rel=\"noreferrer noopener\">https:\/\/sites.google.com\/view\/dispersion-mobilerobots-podc22\/<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"<p>High-Level Overview Monday, July 25th Workshop: Workshop on Advanced Tools, Programming Languages, and Platforms for Implementing and Evaluating Algorithms for Distributed Systems (ApPLIED) Workshop: Principles of Distributed Learning (PODL) PODC reception Tuesday, July 26th 8:30 \u2013 8:40 Opening 8:40 \u2013 9:40 Keynote 1 Michael L. Scott: How Should We Think about Persistent Data Structures? Coffee &hellip; <a href=\"https:\/\/www.podc.org\/podc2022\/schedule\/\" class=\"more-link\">Continue reading<span class=\"screen-reader-text\"> &#8220;Schedule&#8221;<\/span><\/a><\/p>\n","protected":false},"author":17,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-254","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/www.podc.org\/podc2022\/wp-json\/wp\/v2\/pages\/254","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.podc.org\/podc2022\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/www.podc.org\/podc2022\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/www.podc.org\/podc2022\/wp-json\/wp\/v2\/users\/17"}],"replies":[{"embeddable":true,"href":"https:\/\/www.podc.org\/podc2022\/wp-json\/wp\/v2\/comments?post=254"}],"version-history":[{"count":83,"href":"https:\/\/www.podc.org\/podc2022\/wp-json\/wp\/v2\/pages\/254\/revisions"}],"predecessor-version":[{"id":485,"href":"https:\/\/www.podc.org\/podc2022\/wp-json\/wp\/v2\/pages\/254\/revisions\/485"}],"wp:attachment":[{"href":"https:\/\/www.podc.org\/podc2022\/wp-json\/wp\/v2\/media?parent=254"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}