{"id":213,"date":"2024-05-14T08:44:31","date_gmt":"2024-05-14T08:44:31","guid":{"rendered":"https:\/\/www.podc.org\/podc2024\/?page_id=213"},"modified":"2024-06-17T15:48:54","modified_gmt":"2024-06-17T15:48:54","slug":"schedule","status":"publish","type":"page","link":"https:\/\/www.podc.org\/podc2024\/schedule\/","title":{"rendered":"Schedule"},"content":{"rendered":"\n<h2 class=\"wp-block-heading\">Monday, June 17th<\/h2>\n\n\n\n<ul class=\"wp-block-list\">\n<li>08:55 &#8211; 17:00: <strong>Workshop<\/strong>: Advanced Tools, Programming Languages, and PLatforms for Implementing and Evaluating algorithms for Distributed systems (ApPLIED)<\/li>\n\n\n\n<li>08:45-18:00: <strong>Workshop<\/strong>: Biological Distributed Algorithms (BDA)<\/li>\n\n\n\n<li>19:00-20:00: <strong>Reception<\/strong> &amp; HOPC poster session<\/li>\n<\/ul>\n\n\n\n<h2 class=\"wp-block-heading\">Tuesday, June 18th<\/h2>\n\n\n\n<ul class=\"wp-block-list\">\n<li>8:45-9:00: Opening remarks<\/li>\n\n\n\n<li>9:00 &#8211; 10:00: <strong>Keynote<\/strong>: Tim Harris (Microsoft): The growth of parallelism in machine learning inference.<\/li>\n\n\n\n<li><strong>Coffee break<\/strong><\/li>\n\n\n\n<li>10:30 &#8211; 11:25: <a href=\"#session1\" data-type=\"internal\" data-id=\"#session1\">Session: Concurrency and synchronization<\/a><\/li>\n\n\n\n<li>11:30 &#8211; 12:10: <a href=\"#session2\">Session: Population Protocols<\/a><\/li>\n\n\n\n<li><strong>Lunch break<\/strong><\/li>\n\n\n\n<li>13:40 &#8211; 14:35: <a href=\"#session3\">Session: Biological Distributed Algorithms<\/a><\/li>\n\n\n\n<li>14:40 &#8211; 15:20: <a href=\"#session4\">Session: The LOCAL model and variations<\/a><\/li>\n\n\n\n<li><strong>Coffee break<\/strong><\/li>\n\n\n\n<li>15:50 &#8211; 16:15: <a href=\"#session5\">Session: Distributed Machine Learning<\/a><\/li>\n\n\n\n<li>16:20 &#8211; 17:30: <a href=\"#session6\">Session: Byzantine fault-tolerance<\/a><\/li>\n\n\n\n<li>17:45-18:00: <strong>In memory of Matthieu Roy<\/strong><\/li>\n\n\n\n<li>18:00-19:00: <strong>Business Meeting<\/strong><\/li>\n<\/ul>\n\n\n\n<h2 class=\"wp-block-heading\">Wednesday, June 19th<\/h2>\n\n\n\n<ul class=\"wp-block-list\">\n<li>9:00 &#8211; 10:00: <strong>Keynote<\/strong>: Tim Roughgarden (University of Columbia): The Economic Limits of Permissionless Consensus<\/li>\n\n\n\n<li><strong>Coffee break<\/strong><\/li>\n\n\n\n<li>10:30 &#8211; 11:10: <a href=\"#session7\">Session: Algorithms for the CONGEST model<\/a><\/li>\n\n\n\n<li>11:15 &#8211; 12:10: <a href=\"#session8\">Session: Quantum Computing and Communication Networks<\/a><\/li>\n\n\n\n<li><strong>Lunch break and <a href=\"https:\/\/www.podc.org\/podc2024\/senior-junior-meeting\/\">Senior-junior meeting<\/a><\/strong><\/li>\n\n\n\n<li>13:40 &#8211; 14:35: <a href=\"#session9\">Session: Blockchain and BFT Consensus<\/a><\/li>\n\n\n\n<li>14:40 &#8211; 15:20: <a href=\"#session10\">Session: Protocols for decentralized finance<\/a><\/li>\n\n\n\n<li><strong>Coffee break<\/strong><\/li>\n\n\n\n<li>15:50 &#8211; 16:45: <a href=\"#session11\">Session: Fault-tolerance and synchronization<\/a><\/li>\n\n\n\n<li>16:50 &#8211; 17:40: <a href=\"#session12\">Session: Lower bounds<\/a><\/li>\n\n\n\n<li>19:00: Bus departure<\/li>\n\n\n\n<li>19:30-23:00:<strong> Banquet<\/strong><\/li>\n<\/ul>\n\n\n\n<h2 class=\"wp-block-heading\">Thursday, June 20th<\/h2>\n\n\n\n<ul class=\"wp-block-list\">\n<li>9:00 &#8211; 10:00: <strong>Keynote<\/strong> (Dijkstra award session): Nicola Santoro (Carleton University). Time is not a Healer: Before and After<\/li>\n\n\n\n<li><strong>Coffee break<\/strong><\/li>\n\n\n\n<li>10:30 &#8211; 11:25: <a href=\"#session13\">Session: Concurrency and consistency<\/a><\/li>\n\n\n\n<li>11:30 &#8211; 12:10: <a href=\"#session14\">Session: Security and cryptography<\/a><\/li>\n\n\n\n<li><strong>Lunch break<\/strong><\/li>\n\n\n\n<li>13:40 &#8211; 14:35: <a href=\"#session15\" data-type=\"page\" data-id=\"320\">Session: Shortest path algorithms<\/a><\/li>\n\n\n\n<li>14:40 &#8211; 15:20: <a href=\"#session16\">Session: Coloring in Graphs<\/a><\/li>\n\n\n\n<li><strong>Coffee break<\/strong><\/li>\n\n\n\n<li>15:50 &#8211; 16:45: <a href=\"#session17\">Session: Massively parallel computation<\/a><\/li>\n\n\n\n<li>16:50 &#8211; 17:30: <a href=\"#session18\">Session: Self-stabilization<\/a><\/li>\n<\/ul>\n\n\n\n<h2 class=\"wp-block-heading\">Friday, June 21st<\/h2>\n\n\n\n<ul class=\"wp-block-list\">\n<li>Morning+afternoon: <strong>Workshop<\/strong>: Principles of Distributed Learning (PODL)<\/li>\n\n\n\n<li>09:00-18:00: <strong>Workshop<\/strong>: Distributed Computing with Emerging Hardware Technology (EMERALD)<\/li>\n\n\n\n<li>09:00-12:20: <strong>Tutorial<\/strong>: Weak memory models in programming language semantics<\/li>\n\n\n\n<li>14:00-17:30: <strong>Tutorial<\/strong>: Permissionless Consensus<\/li>\n<\/ul>\n\n\n\n<p><\/p>\n\n\n\n<h1 class=\"wp-block-heading\">Program<\/h1>\n\n\n\n<h2 class=\"wp-block-heading\">Table of contents for the PODC&#8217;24 proceedings<\/h2>\n\n\n\n<div id=\"DLheader\"><a class=\"DLcitLink\" title=\"Go to the ACM Digital Library for additional information about this proceeding\" href=\"https:\/\/dl.acm.org\/doi\/proceedings\/10.1145\/3662158\"><img decoding=\"async\" class=\"DLlogo\" alt=\"Digital Library logo\" height=\"30\" src=\"https:\/\/dl.acm.org\/specs\/products\/acm\/releasedAssets\/images\/footer-logo1.png\">\n                Full Citation in the ACM Digital Library\n            <\/a><\/div>\n\n\n\n<h2 class=\"wp-block-heading\">Monday, June 17th<\/h2>\n\n\n\n<h3 class=\"wp-block-heading has-text-align-left\">08:55 &#8211; 17:00: Workshop: Advanced Tools, Programming Languages, and PLatforms for<br>Implementing and Evaluating algorithms for Distributed systems (ApPLIED)<\/h3>\n\n\n\n<p><a href=\"https:\/\/www.cse.chalmers.se\/~elad\/ApPLIED2024\/Program.pdf\">Schedule<\/a><\/p>\n\n\n\n<h3 class=\"wp-block-heading has-text-align-left\">08:45-18:00: Workshop: Biological Distributed Algorithms (BDA)<\/h3>\n\n\n\n<p><a href=\"https:\/\/sites.google.com\/view\/bda24\/home\">Schedule<\/a><\/p>\n\n\n\n<h3 class=\"wp-block-heading has-text-align-left\">19:00-20:00:&nbsp;<strong>Reception<\/strong>&nbsp;&amp; HOPC poster session<\/h3>\n\n\n\n<p><\/p>\n\n\n\n<h2 class=\"wp-block-heading\">Tuesday, June 18th<\/h2>\n\n\n\n<h3 class=\"wp-block-heading has-text-align-left\">9:00 &#8211; 10:00: <strong>Keynote<\/strong><\/h3>\n\n\n\n<p>Tim Harris (Microsoft): The growth of parallelism in machine learning inference.<\/p>\n\n\n\n<h3 class=\"wp-block-heading has-text-align-left\">Coffee break<\/h3>\n\n\n\n<h3 class=\"wp-block-heading has-text-align-left\" id=\"session1\">10:30 &#8211; 11:25: Concurrency and synchronization<\/h3>\n\n\n\n<p><strong>Chair: Eric Ruppert<\/strong><\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li><strong>Best Paper: <\/strong>S. Ovens. <a class=\"DLtitleLink\" title=\"Full Citation in the ACM Digital Library\" href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662775\">Determining Recoverable Consensus Numbers&nbsp;<\/a><\/li>\n\n\n\n<li>H. Attiya, M. Bender, M. Farach-Colton, R. Oshman, N. Schiller. <a class=\"DLtitleLink\" title=\"Full Citation in the ACM Digital Library\" href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662814\">History-Independent Concurrent Objects&nbsp;<\/a><\/li>\n\n\n\n<li>P. Jayanti, S. Jayanti, S. Jayanti. <a class=\"DLtitleLink\" title=\"Full Citation in the ACM Digital Library\" href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662820\">An Efficient RMWable Snapshot Algorithm<\/a><\/li>\n\n\n\n<li>A. Mostefaoui, M. Perrin, J. Weibel. <a class=\"DLtitleLink\" title=\"Full Citation in the ACM Digital Library\" href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662824\">Brief Announcement: Randomized Consensus: Common Coins Are not the Holy Grail!<\/a>&nbsp;<\/li>\n<\/ul>\n\n\n\n<h3 class=\"wp-block-heading has-text-align-left\" id=\"session2\">11:30 &#8211; 12:10: Population Protocols<\/h3>\n\n\n\n<p><strong>Chair: Eric Ruppert<\/strong><\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>D. Alistarh, K. Chatterjee, M. Karrabi, J. Lazarsfeld. <a class=\"DLtitleLink\" title=\"Full Citation in the ACM Digital Library\" href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662768\">Game Dynamics and Equilibrium Computation in the Population Protocol Model<\/a><\/li>\n\n\n\n<li>D. Kaaser, M. Lohmann. <a class=\"DLtitleLink\" title=\"Full Citation in the ACM Digital Library\" href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662825\">Dynamic Size Counting in the Population Protocol Model<\/a><\/li>\n\n\n\n<li>A. Luchsinger, D. Doty, D. Soloveichik. <a class=\"DLtitleLink\" title=\"Full Citation in the ACM Digital Library\" href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662827\">Brief Announcement: Optimally Encoding Information in Chemical Reaction Networks<\/a><\/li>\n<\/ul>\n\n\n\n<h3 class=\"wp-block-heading has-text-align-left\">Lunch<\/h3>\n\n\n\n<h3 class=\"wp-block-heading has-text-align-left\" id=\"session3\">13:40 &#8211; 14:35: Biological Distributed Algorithms<\/h3>\n\n\n\n<p><strong>Chair: Andrea Richa<\/strong><\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>A. Padalkin, C. Scheideler. <a class=\"DLtitleLink\" title=\"Full Citation in the ACM Digital Library\" href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662776\">Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter<\/a>&nbsp;<\/li>\n\n\n\n<li>M. F\u00fcgger, T. Nowak, J. Rybicki. <a class=\"DLtitleLink\" title=\"Full Citation in the ACM Digital Library\" href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662823\">Majority consensus thresholds in competitive Lotka-Volterra populations<\/a><\/li>\n\n\n\n<li>G. Giakkoupis, V. Turau, I. Ziccardi. <a class=\"DLtitleLink\" title=\"Full Citation in the ACM Digital Library\" href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662811\">Brief Announcement: Self-Stabilizing MIS Computation in the Beeping Model<\/a><\/li>\n\n\n\n<li>N. D&#8217;Archivio, R. Vacus. <a class=\"DLtitleLink\" title=\"Full Citation in the ACM Digital Library\" href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662813\">Brief Announcement: On the Limits of Information Spread by Memory-less Agents<\/a>&nbsp;<\/li>\n<\/ul>\n\n\n\n<h3 class=\"wp-block-heading has-text-align-left\" id=\"session4\">14:40 &#8211; 15:20: The LOCAL model and variations<\/h3>\n\n\n\n<p><strong>Chair: Andrea Richa<\/strong><\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>A. Balliu, T. Boudier, S. Brandt, D. Olivetti. <a class=\"DLtitleLink\" title=\"Full Citation in the ACM Digital Library\" href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662798\">Tight Lower Bounds in the Supported LOCAL Model<\/a><\/li>\n\n\n\n<li>Y. Chang, G. Mishra, H. Nguyen, M. Yang, Y. Yeh. <a class=\"DLtitleLink\" title=\"Full Citation in the ACM Digital Library\" href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662794\">A Tight Lower Bound for 3-Coloring Grids in the Online-LOCAL Model<\/a><\/li>\n\n\n\n<li>A. Balliu, S. Brandt, F. Kuhn, K. Nowicki, D. Olivetti, E. Rotenberg, J. Suomela. <a class=\"DLtitleLink\" title=\"Full Citation in the ACM Digital Library\" href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662805\">Brief Announcement: Local Advice and Local Decompression<\/a><\/li>\n<\/ul>\n\n\n\n<h3 class=\"wp-block-heading has-text-align-left\">Coffee break<\/h3>\n\n\n\n<h3 class=\"wp-block-heading has-text-align-left\" id=\"session5\">15:50 &#8211; 16:15: Distributed Machine Learning<\/h3>\n\n\n\n<p><strong>Chair: Rida Bazzi<\/strong><\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>S. Jacobs, M. Tanaka, C. Zhang, M. Zhang, R. Aminadabi, S. Song, S. Rajbhandari, Y. He. <a class=\"DLtitleLink\" title=\"Full Citation in the ACM Digital Library\" href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662806\">System Optimizations for Enabling Training of Extreme Long Sequence Transformer Models<\/a>&nbsp;<\/li>\n\n\n\n<li>S. Farhadkhani, R. Guerraoui, N. Gupta, R. Pinot. <a class=\"DLtitleLink\" title=\"Full Citation in the ACM Digital Library\" href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662802\">Brief Announcement: A Case for Byzantine Machine Learning&nbsp;<\/a><\/li>\n<\/ul>\n\n\n\n<h3 class=\"wp-block-heading has-text-align-left\" id=\"session6\">16:20 &#8211; 17:30: Byzantine fault-tolerance<\/h3>\n\n\n\n<p><strong>Chair: Rida Bazzi<\/strong><\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>A. Lewis-Pye, D. Malkhi, O. Naor, K. Nayak. <a class=\"DLtitleLink\" title=\"Full Citation in the ACM Digital Library\" href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662787\">Lumiere: Making Optimal BFT for Partial Synchrony Practical<\/a><\/li>\n\n\n\n<li>P. Civit, M. Dzulfikar, S. Gilbert, R. Guerraoui, J. Komatovic, M. Vidigueira.&nbsp; <a class=\"DLtitleLink\" title=\"Full Citation in the ACM Digital Library\" href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662792\">DARE to Agree: Byzantine Agreement With Optimal Resilience and Adaptive Communication<\/a><\/li>\n\n\n\n<li>P. Civit, S. Gilbert, R. Guerraoui, J. Komatovic, A. Paramonov, M. Vidigueira. <a class=\"DLtitleLink\" title=\"Full Citation in the ACM Digital Library\" href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662780\">All Byzantine Agreement Problems Are Expensive<\/a><\/li>\n\n\n\n<li>D. Avelas, H. Heydari, T. Distler, E. Alchieri, A. Bessani. <a class=\"DLtitleLink\" title=\"Full Citation in the ACM Digital Library\" href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662810\">Probabilistic Byzantine Fault Tolerance<\/a><\/li>\n<\/ul>\n\n\n\n<h3 class=\"wp-block-heading has-text-align-left\">17:45-18:00: In memory of Matthieu Roy<\/h3>\n\n\n\n<h3 class=\"wp-block-heading has-text-align-left\">18:00-19:00: Business Meeting<\/h3>\n\n\n\n<p><\/p>\n\n\n\n<h2 class=\"wp-block-heading\">Wednesday, June 19th<\/h2>\n\n\n\n<h3 class=\"wp-block-heading has-text-align-left\" id=\"session1\">9:00 &#8211; 10:00: <strong>Keynote<\/strong><\/h3>\n\n\n\n<p><a class=\"DLtitleLink\" title=\"Full Citation in the ACM Digital Library\" href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3664933\">Tim Roughgarden (University of Columbia): The Economic Limits of Permissionless Consensus<\/a><\/p>\n\n\n\n<h3 class=\"wp-block-heading has-text-align-left\">Coffee break<\/h3>\n\n\n\n<h3 class=\"wp-block-heading has-text-align-left\" id=\"session7\">10:30 &#8211; 11:10: Algorithms for the CONGEST model<\/h3>\n\n\n\n<p><strong>Chair: Gopal Pandurangan<\/strong><\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>V. Manoharan, V. Ramachandran. <a class=\"DLtitleLink\" title=\"Full Citation in the ACM Digital Library\" href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662801\">Computing Minimum Weight Cycle in the CONGEST Model<\/a><\/li>\n\n\n\n<li>Y. Chang, S. Huang, H. Su. <a class=\"DLtitleLink\" title=\"Full Citation in the ACM Digital Library\" href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662797\">Deterministic Expander Routing: Faster and More Versatile<\/a><\/li>\n\n\n\n<li>F. Fomin, P. Fraigniaud, P. Montealegre, I. Rapaport, I. Todinca. <a class=\"DLtitleLink\" title=\"Full Citation in the ACM Digital Library\" href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662793\">Brief Announcement: Distributed Model Checking on&nbsp;Graphs of Bounded Treedepth<\/a><\/li>\n<\/ul>\n\n\n\n<h3 class=\"wp-block-heading has-text-align-left\" id=\"session8\">11:15 &#8211; 12:10: Quantum Computing and Communication Networks<\/h3>\n\n\n\n<p><strong>Chair: Gopal Pandurangan<\/strong><\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>P. Fraigniaud, M. Luce, F. Magniez, I. Todinca. <a class=\"DLtitleLink\" title=\"Full Citation in the ACM Digital Library\" href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662767\">Even-Cycle Detection in the Randomized and Quantum CONGEST Model<\/a><\/li>\n\n\n\n<li>A. Hasegawa, S. Kundu, H. Nishimura. <a class=\"DLtitleLink\" title=\"Full Citation in the ACM Digital Library\" href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662788\">On the Power of Quantum Distributed Proofs<\/a><\/li>\n\n\n\n<li>M. Bender, J. Fineman, S. Gilbert, J. Kuszmaul, M. Young. <a class=\"DLtitleLink\" title=\"Full Citation in the ACM Digital Library\" href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662807\">Fully Energy-Efficient Randomized Backoff: Slow Feedback Loops Yield Fast Contention Resolution<\/a><\/li>\n\n\n\n<li>B. Charron-Bost, P. Lambein-Monette. <a class=\"DLtitleLink\" title=\"Full Citation in the ACM Digital Library\" href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662784\">Brief Announcement: Know Your Audience<\/a><\/li>\n<\/ul>\n\n\n\n<h3 class=\"wp-block-heading has-text-align-left\">Lunch and <a href=\"https:\/\/www.podc.org\/podc2024\/senior-junior-meeting\/\">Senior-junior meeting<\/a><\/h3>\n\n\n\n<h3 class=\"wp-block-heading has-text-align-left\" id=\"session9\">13:40 &#8211; 14:35: Blockchain and BFT Consensus<\/h3>\n\n\n\n<p><strong>Chair: Kartik Nayak<\/strong><\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>L. Zanolini, F. D&#8217;Amato, G. Losa. <a class=\"DLtitleLink\" title=\"Full Citation in the ACM Digital Library\" href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662779\">Asynchrony-Resilient Sleepy Total-Order Broadcast Protocols<\/a><\/li>\n\n\n\n<li>Q. Yu, G. Losa, X. Wang. <a class=\"DLtitleLink\" title=\"Full Citation in the ACM Digital Library\" href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662783\">TetraBFT: Reducing Latency of Unauthenticated, Responsive BFT Consensus<\/a><\/li>\n\n\n\n<li>K. Chatterjee, A. Ebrahim-Zadeh, M. Karrabi, K. Pietrzak, M. Yeo, \u0110. \u017dikeli\u0107. <a class=\"DLtitleLink\" title=\"Full Citation in the ACM Digital Library\" href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662769\">Fully Automated Selfish Mining Analysis in Efficient Proof Systems Blockchains<\/a><\/li>\n\n\n\n<li>G. Ramseyer, A. Goel. <a class=\"DLtitleLink\" title=\"Full Citation in the ACM Digital Library\" href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662772\">Brief Announcement: Fair Ordering via Streaming Social Choice Theory<\/a><\/li>\n<\/ul>\n\n\n\n<h3 class=\"wp-block-heading has-text-align-left\" id=\"session10\">14:40 &#8211; 15:20: Protocols for decentralized finance<\/h3>\n\n\n\n<p><strong>Chair: Kartik Nayak<\/strong><\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>A. Tonkikh, L. Freitas. <a class=\"DLtitleLink\" title=\"Full Citation in the ACM Digital Library\" href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662799\">Swiper: a new paradigm for efficient weighted distributed protocols<\/a><\/li>\n\n\n\n<li>R. Bazzi, S. Tucci-Piergiovanni. <a class=\"DLtitleLink\" title=\"Full Citation in the ACM Digital Library\" href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662817\">The Fractional Spending Problem: Executing Payment transactions in parallel with less than f+1 validations<\/a><\/li>\n\n\n\n<li>Z. Avarikioti, S. Schmid, S. Tiwari. <a class=\"DLtitleLink\" title=\"Full Citation in the ACM Digital Library\" href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662809\">Brief Announcement: Musketeer: Incentive-Compatible Rebalancing for Payment Channel Networks<\/a><\/li>\n<\/ul>\n\n\n\n<h3 class=\"wp-block-heading has-text-align-left\">Coffee break<\/h3>\n\n\n\n<h3 class=\"wp-block-heading has-text-align-left\" id=\"session11\">15:50 &#8211; 16:45: Fault-tolerance and synchronization<\/h3>\n\n\n\n<p><strong>Chair: Giuliano Losa<\/strong><\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>C. Delporte-Gallet, H. Fauconnier, P. Fraigniaud, S. Rajsbaum, C. Travers. <a class=\"DLtitleLink\" title=\"Full Citation in the ACM Digital Library\" href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662789\">The Computational Power of Distributed Shared-Memory Models with Bounded-Size Registers<\/a><\/li>\n\n\n\n<li><strong>Best Student Paper (one of two):<\/strong> M. Hajiaghayi, D. Kowalski, J. Olkowski. <a class=\"DLtitleLink\" title=\"Full Citation in the ACM Digital Library\" href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662826\">Nearly-Optimal Consensus Tolerating Adaptive Omissions: Why a Lot of Randomness is Needed?&nbsp;<\/a><\/li>\n\n\n\n<li>M. Braverman, R. Oshman, T. Roth. <a class=\"DLtitleLink\" title=\"Full Citation in the ACM Digital Library\" href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662795\">Multi-Party Set Disjointness and Intersection with Bounded Dependence<\/a><\/li>\n\n\n\n<li>S. Gay, A. Mostefaoui, M. Perrin. <a class=\"DLtitleLink\" title=\"Full Citation in the ACM Digital Library\" href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662818\">Brief Announcement: No Broadcast Abstraction Captures k-Set-Agreement<\/a><\/li>\n<\/ul>\n\n\n\n<h3 class=\"wp-block-heading has-text-align-left\" id=\"session12\">16:50 &#8211; 17:40: Lower bounds<\/h3>\n\n\n\n<p><strong>Chair: Giuliano Losa<\/strong><\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>F. Reiter. <a class=\"DLtitleLink\" title=\"Full Citation in the ACM Digital Library\" href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662774\">A LOCAL View of the Polynomial Hierarchy<\/a><\/li>\n\n\n\n<li>M. Ferreira, N. Atre, J. Sherry, J. Sobrinho.&nbsp; <a class=\"DLtitleLink\" title=\"Full Citation in the ACM Digital Library\" href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662777\">Impossibility Results for Data-Center Routing with Congestion Control and Unsplittable Flows<\/a>&nbsp;<\/li>\n\n\n\n<li>A. Balliu, S. Brandt, F. Kuhn, D. Olivetti, G. Schmid. <a class=\"DLtitleLink\" title=\"Full Citation in the ACM Digital Library\" href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662773\">Completing the Node-Averaged Complexity Landscape of LCLs on Trees<\/a><\/li>\n<\/ul>\n\n\n\n<h3 class=\"wp-block-heading has-text-align-left\">Banquet<\/h3>\n\n\n\n<p><\/p>\n\n\n\n<h2 class=\"wp-block-heading\">Thursday, June 20th<\/h2>\n\n\n\n<h3 class=\"wp-block-heading has-text-align-left\" id=\"session1\">9:00 &#8211; 10:00: <strong>Keynote<\/strong> (Dijkstra award session)<\/h3>\n\n\n\n<p><a class=\"DLtitleLink\" title=\"Full Citation in the ACM Digital Library\" href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3664932\">Nicola Santoro (Carleton University). Time is not a Healer: Before and After<\/a><\/p>\n\n\n\n<h3 class=\"wp-block-heading has-text-align-left\">Coffee break<\/h3>\n\n\n\n<h3 class=\"wp-block-heading has-text-align-left\" id=\"session13\">10:30 &#8211; 11:25: Concurrency and consistency<\/h3>\n\n\n\n<p><strong>Chair: Igor Zablotchi<\/strong><\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>H. Attiya, A. Castaneda, C. Enea. <a class=\"DLtitleLink\" title=\"Full Citation in the ACM Digital Library\" href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662790\">Strong Linearizability using Primitives with Consensus Number 2<\/a><\/li>\n\n\n\n<li>F. Naderi Semiromi, P. Woelfel. <a class=\"DLtitleLink\" title=\"Full Citation in the ACM Digital Library\" href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662800\">Strongly Linearizable LL\/SC<\/a>&nbsp;<\/li>\n\n\n\n<li>D. Bencivenga, G. Giakkoupis, P. Woelfel. <a class=\"DLtitleLink\" title=\"Full Citation in the ACM Digital Library\" href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662828\">Faster Randomized Repeated Choice and DCAS<\/a><\/li>\n\n\n\n<li>G. Losa, E. Gafni. <a class=\"DLtitleLink\" title=\"Full Citation in the ACM Digital Library\" href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662786\">Brief Announcement: Understanding Read-Write Wait-Free Coverings in the Fully-Anonymous Shared-Memory Model<\/a><\/li>\n<\/ul>\n\n\n\n<h3 class=\"wp-block-heading has-text-align-left\" id=\"session14\">11:30 &#8211; 12:10: Security and cryptography<\/h3>\n\n\n\n<p><strong>Chair: Igor Zablotchi<\/strong><\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>H. Feng, Z. Lu, Q. Tang. <a class=\"DLtitleLink\" title=\"Full Citation in the ACM Digital Library\" href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662771\">Dragon: Decentralization at the cost of Representation after Arbitrary Grouping and Its Applications to Sub-cubic DKG and Interactive Consistency<\/a><\/li>\n\n\n\n<li>J. Bartusek, T. Bergamaschi, S. Khoury, S. Mutreja, O. Paradise.&nbsp; <a class=\"DLtitleLink\" title=\"Full Citation in the ACM Digital Library\" href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662815\">On the Communication Complexity of Secure Multi-Party Computation With Aborts<\/a><\/li>\n\n\n\n<li>D. Ghinea, C. Liu-Zhang, R. Wattenhofer. <a class=\"DLtitleLink\" title=\"Full Citation in the ACM Digital Library\" href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662782\">Brief Announcement: Communication-Optimal Convex Agreement<\/a><\/li>\n<\/ul>\n\n\n\n<h3 class=\"wp-block-heading has-text-align-left\">Lunch<\/h3>\n\n\n\n<h3 class=\"wp-block-heading has-text-align-left\" id=\"session15\">13:40 &#8211; 14:35: Shortest path algorithms<\/h3>\n\n\n\n<p><strong>Chair: Boaz Patt-Shamir<\/strong><\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>M. Ghaffari, A. Trygub. <a href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662812\">A Near-Optimal Low-Energy Deterministic Distributed SSSP with Ramifications on Congestion and APSP<\/a><\/li>\n\n\n\n<li><strong>Best Student Paper <strong>(one of two)<\/strong>:<\/strong> H. Bui, S. Chandra, Y. Chang, M. Dory, D. Leitersdorf. <a class=\"DLtitleLink\" title=\"Full Citation in the ACM Digital Library\" href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662804\">Improved All-Pairs Approximate Shortest Paths in Congested Clique<\/a><\/li>\n\n\n\n<li>Y. Chang, O. Hecht, D. Leitersdorf, P. Schneider. <a class=\"DLtitleLink\" title=\"Full Citation in the ACM Digital Library\" href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662791\">Universally Optimal Information Dissemination and Shortest Paths in the HYBRID Distributed Model<\/a><\/li>\n\n\n\n<li>Y. Chang, V. Dani, T. Hayes. <a class=\"DLtitleLink\" title=\"Full Citation in the ACM Digital Library\" href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662822\">Brief Announcement: Low-Distortion Clustering in Bounded Growth Graphs<\/a><\/li>\n<\/ul>\n\n\n\n<h3 class=\"wp-block-heading has-text-align-left\" id=\"session16\">14:40 &#8211; 15:20: Coloring in Graphs<\/h3>\n\n\n\n<p><strong>Chair: Boaz Patt-Shamir<\/strong><\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>M. Flin, P. Mittal. <a class=\"DLtitleLink\" title=\"Full Citation in the ACM Digital Library\" href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662796\">(\u0394+1) Vertex Coloring in O(n) Communication<\/a><\/li>\n\n\n\n<li>M. Fuchs, F. Kuhn. <a class=\"DLtitleLink\" title=\"Full Citation in the ACM Digital Library\" href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662808\">Brief Announcement: Simpler and More General Distributed Coloring Based on Simple List Defective Coloring Algorithms<\/a>&nbsp;<\/li>\n\n\n\n<li>N. Bousquet, L. Feuilloley, S. Zeitoun. <a class=\"DLtitleLink\" title=\"Full Citation in the ACM Digital Library\" href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662781\">Brief Announcement: Global certification via perfect hashing<\/a><\/li>\n<\/ul>\n\n\n\n<h3 class=\"wp-block-heading has-text-align-left\">Coffee break<\/h3>\n\n\n\n<h3 class=\"wp-block-heading has-text-align-left\" id=\"session17\">15:50 &#8211; 16:45: Massively parallel computation<\/h3>\n\n\n\n<p><strong>Chair: S\u00e9bastien Tixeuil<\/strong><\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>A. Czumaj, G. Mishra, A. Mukherjee. <a class=\"DLtitleLink\" title=\"Full Citation in the ACM Digital Library\" href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662770\">Streaming Graph Algorithms in the Massively Parallel Computation Model<\/a>&nbsp;<\/li>\n\n\n\n<li>R. Latypov, Y. Maus, S. Pai, J. Uitto. <a class=\"DLtitleLink\" title=\"Full Citation in the ACM Digital Library\" href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662821\">Adaptive Massively Parallel Coloring in Sparse Graphs<\/a><\/li>\n\n\n\n<li>Q. Liu, C. Seshadhri. <a class=\"DLtitleLink\" title=\"Full Citation in the ACM Digital Library\" href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662819\">Brief Announcement. Improved Massively Parallel Triangle Counting in O(1) Rounds<\/a>&nbsp;<\/li>\n\n\n\n<li>J. Giliberti, Z. Parsaeian. <a class=\"DLtitleLink\" title=\"Full Citation in the ACM Digital Library\" href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662816\">Brief Announcement. Massively Parallel Ruling Set Made Deterministic<\/a><\/li>\n<\/ul>\n\n\n\n<h3 class=\"wp-block-heading has-text-align-left\" id=\"session18\">16:50 &#8211; 17:30: Self-stabilization<\/h3>\n\n\n\n<p><strong>Chair: S\u00e9bastien Tixeuil<\/strong><\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>K. Altisen, A. Cournier, G. Defalque, S. Devismes. <a class=\"DLtitleLink\" title=\"Full Citation in the ACM Digital Library\" href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662778\">On Self-stabilizing Leader Election in Directed Networks<\/a><\/li>\n\n\n\n<li>C. Johnen, S. Devismes, F. Mazoit, D. Ilcinkas. <a class=\"DLtitleLink\" title=\"Full Citation in the ACM Digital Library\" href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662803\">Asynchronous Self-stabilization Made Fast, Simple, and Energy-efficient<\/a><\/li>\n\n\n\n<li>F. Frei, R. Gelles, A. Ghazy, A. Nolin.&nbsp; <a class=\"DLtitleLink\" title=\"Full Citation in the ACM Digital Library\" href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662785\">Brief Announcement: Content-Oblivious Leader Election on Rings<\/a><\/li>\n<\/ul>\n\n\n\n<h2 class=\"wp-block-heading\">Friday, June 21st<\/h2>\n\n\n\n<h3 class=\"wp-block-heading has-text-align-left\" id=\"session1\">Morning+afternoon: Workshop: Principles of Distributed Learning (PODL)<\/h3>\n\n\n\n<p><a href=\"https:\/\/dcl.epfl.ch\/site\/podc2024\">Schedule (tentative)<\/a><\/p>\n\n\n\n<h3 class=\"wp-block-heading has-text-align-left\" id=\"session1\">09:00-18:00: Workshop: <strong>Distributed Computing with Emerging Hardware Technology (EMERALD)<\/strong><\/h3>\n\n\n\n<p><a href=\"https:\/\/emerald-workshop.github.io\/\">Schedule<\/a><\/p>\n\n\n\n<h3 class=\"wp-block-heading has-text-align-left\" id=\"session1\">09:00-12:20: Tutorial: <strong>Weak memory models in programming language semantics<\/strong><\/h3>\n\n\n\n<p>Organized by Ori Lahav. <\/p>\n\n\n\n<h3 class=\"wp-block-heading has-text-align-left\" id=\"session1\">14:00-17:30: Tutorial: <strong>Permissionless Consensus<\/strong><\/h3>\n\n\n\n<p>Organized by Andrew Lewis-Pye and Tim Roughgarden. <\/p>\n","protected":false},"excerpt":{"rendered":"<p>Monday, June 17th Tuesday, June 18th Wednesday, June 19th Thursday, June 20th Friday, June 21st Program Table of contents for the PODC&#8217;24 proceedings Full Citation in the ACM Digital Library Monday, June 17th 08:55 &#8211; 17:00: Workshop: Advanced Tools, Programming Languages, and PLatforms forImplementing and Evaluating algorithms for Distributed systems (ApPLIED) Schedule 08:45-18:00: Workshop: Biological &hellip; <a href=\"https:\/\/www.podc.org\/podc2024\/schedule\/\" class=\"more-link\">Continue reading<span class=\"screen-reader-text\"> &#8220;Schedule&#8221;<\/span><\/a><\/p>\n","protected":false},"author":26,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-213","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/www.podc.org\/podc2024\/wp-json\/wp\/v2\/pages\/213","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.podc.org\/podc2024\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/www.podc.org\/podc2024\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/www.podc.org\/podc2024\/wp-json\/wp\/v2\/users\/26"}],"replies":[{"embeddable":true,"href":"https:\/\/www.podc.org\/podc2024\/wp-json\/wp\/v2\/comments?post=213"}],"version-history":[{"count":68,"href":"https:\/\/www.podc.org\/podc2024\/wp-json\/wp\/v2\/pages\/213\/revisions"}],"predecessor-version":[{"id":340,"href":"https:\/\/www.podc.org\/podc2024\/wp-json\/wp\/v2\/pages\/213\/revisions\/340"}],"wp:attachment":[{"href":"https:\/\/www.podc.org\/podc2024\/wp-json\/wp\/v2\/media?parent=213"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}