{"id":174,"date":"2026-06-17T05:28:07","date_gmt":"2026-06-17T05:28:07","guid":{"rendered":"https:\/\/www.podc.org\/podc2026\/?page_id=174"},"modified":"2026-07-04T20:18:57","modified_gmt":"2026-07-04T20:18:57","slug":"programme","status":"publish","type":"page","link":"https:\/\/www.podc.org\/podc2026\/programme\/","title":{"rendered":"Programme"},"content":{"rendered":"\n<p>See <a href=\"https:\/\/icalppodcspaa2026.cs.rhul.ac.uk\/program\/\">https:\/\/icalppodcspaa2026.cs.rhul.ac.uk\/program\/<\/a> for combined ICALP\/PODC\/SPAA programme information<\/p>\n\n\n\n<h2 class=\"wp-block-heading\">Monday (July 6th)<\/h2>\n\n\n\n<p>See <a href=\"https:\/\/www.podc.org\/podc2026\/workshops-and-tutorials\/\" data-type=\"page\" data-id=\"127\">Workshops and Tutorials<\/a> page for more details<\/p>\n\n\n\n<h3 class=\"wp-block-heading\">08:55-18:00: Advanced Tools, Programming Languages, and PLatforms for Implementing and Evaluating algorithms for Distributed systems (ApPLIED) Workshop<\/h3>\n\n\n\n<p><strong>Opening remarks (08:55-09:00)<\/strong><\/p>\n\n\n\n<p><strong>Keynote Talk (09:00-10:00): &#8220;Efficient Randomized Shared Memory Primitives and Algorithms&#8221; &#8211; Philipp Woelfel (University of Calgary)<\/strong><\/p>\n\n\n\n<p><strong>Coffee Break (10:00-10:30)<\/strong><\/p>\n\n\n\n<p><strong>Session 1<\/strong><\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>10:30\u201310:50: Obfuscated Consensus (James Aspnes, Shlomi Dolev, Amit Hendin)<\/li>\n\n\n\n<li>10:50\u201311:10: Analyzing Linearizability in Relativistic Distributed Systems (Kahbod Aeini, Wojciech Golab)<\/li>\n\n\n\n<li>11:10\u201311:30: CHARISMA: Do You Read Me? (Andria Trigeorgi, Stela Makri, Kyriacos Clerides, Andreas Hadjipieris, Panagiotis Charalambous, Ioannis Kyriakides, Efstathios Stavrakis, Nicolas Nicolaou)<\/li>\n\n\n\n<li>11:30\u201311:50: QUANTAS 2: An Abstract, Concrete and Byzantine Simulator (Joseph Oglio, Mikhail Nesterenko)<\/li>\n\n\n\n<li>11:50\u201312:10: Invited Paper: Experimental Analysis of Distributed Agentic Large-Language Model Inference Architectures (Kartik Padalkar, Vitor Jesus, Jose M. Alcaraz Calero)<\/li>\n\n\n\n<li>12:10\u201312:30: DScale: a Simulation Framework for Large-Scale Distributed Systems (Konstantin Shprenger, Michael Anoprenko, Petr Kuznetsov)<\/li>\n<\/ul>\n\n\n\n<p><strong>Lunch (12:30-14:00)<\/strong><\/p>\n\n\n\n<p><strong>Keynote Talk (14:00\u201315:00): &#8220;Relaxed Concurrent Data Structures&#8221; &#8211; Philippas Tsigas (Chalmers University of Technology, Sweden)<\/strong><\/p>\n\n\n\n<p><strong>Coffee Break (15:00-15:30)<\/strong><\/p>\n\n\n\n<p><strong>Session 2<\/strong><\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>15:30\u201315:40: Invited Paper: Relaxed Data Structures for Practical Parallelism: Survey and Design Recommendations (Philippas Tsigas, K\u00e5re von Geijer)<\/li>\n\n\n\n<li>15:40\u201316:00: Invited Paper: A Verifiable and Adaptive Federated Learning Framework via Zero-Knowledge Proofs and Reputation-Weighted Blockchain (Djamel Djenouri, Shahid Latif, Jawad Ahmad)<\/li>\n\n\n\n<li>16:00\u201316:20: A Formal Model of Multi-Controller Orchestration Systems in Cloud Management (Tengfei An, Maria Potop-Butucaru)<\/li>\n\n\n\n<li>16:20\u201316:40: Invited Paper: Quality Without Control: Evidence-Driven Software Quality Assurance for Cross-Domain System (Stefan Tai, Maria Borges, Sebastian Werner, Mi-Jung Choi, Katinka Wolter)<\/li>\n<\/ul>\n\n\n\n<p><strong>Short break (16:40\u201316:50)<\/strong><\/p>\n\n\n\n<p><strong>Session 3<\/strong><\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>16:50\u201317:10: Invited Paper: Composable Autonomic Offerings for Decentralized Service Provisioning in the Computing Continuum (Ildefons Magrans de Abril, Boris Sedlak, Victor Casamayor Pujol, Schahram Dustdar)<\/li>\n\n\n\n<li>17:10\u201317:20: Byzantine Reliable Broadcast with Causal Ordering (Mariarosaria Barbaraci, Christian Cachin)<\/li>\n\n\n\n<li>17:20\u201317:30: Convergence Analysis of Consensus-Based Tracking Algorithms for Logical Time Functions in Multi-Agent Networks (Ivan Arkhipov, Evgeny Krokhalev, Oleg Granichin)<\/li>\n<\/ul>\n\n\n\n<h3 class=\"wp-block-heading\">09:00-12:30: Student Spotlight Workshop<\/h3>\n\n\n\n<p><strong>Opening remarks (09:00\u201309:10)<\/strong><\/p>\n\n\n\n<p><strong>Session 1<\/strong><\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>09:10\u201309:22: Distributed Computability with Automata Theory (Coutouly Yannis)<\/li>\n\n\n\n<li>09:22\u20139:34: Compress or Random: Bipartite Matching is in Catalytic Logspace, and more (Aryan Agarwala)<\/li>\n\n\n\n<li>9:34\u20139:46: Distributed MIS Algorithms for Rational Agents using Games (Nithin Salevemula)<\/li>\n\n\n\n<li>9:46\u20139:58: Toggle Tree: A New Data Structure for Efficient Parallel Graph Processing (Xinjian Jiang)<\/li>\n<\/ul>\n\n\n\n<p><strong>Coffee Break (10:00-10:30)<\/strong><\/p>\n\n\n\n<p><strong>Session 2<\/strong><\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>10:30\u201310:42: Synchronization in Anonymous Networks Under Arbitrary Dynamics (Anya Chaturvedi)<\/li>\n\n\n\n<li>10:42\u201310:54: Consensus Time in 3-Majority and 2-Choices Is Determined by the Maximum Initial Opinion Density (Niccol\u00f2 D\u2019Archivio)<\/li>\n\n\n\n<li>10:54\u201311:06: Safe Diameter-Free Consensus in Granular Synchrony (Hadar Matlaw)<\/li>\n\n\n\n<li>11:06-11:18: TEE is not a Healer, TEE-Rex is (Sadegh Keshavarzi)<\/li>\n\n\n\n<li>11:18\u201311:30 Break<\/li>\n\n\n\n<li>11:30\u201311:42: History-Independent Concurrent Hash Tables (Noa Schiller)<\/li>\n\n\n\n<li>11:42\u201311:54: Workload Informed Concurrent Priority Queue Design (Olivia Grimes)<\/li>\n\n\n\n<li>11:54\u201312:06: Flexible Lock-Free Locks (Yael Zak)<\/li>\n\n\n\n<li>12:06\u201312:18: Machine Verification of Concurrent Fast Arrays (Evan Lucca)<\/li>\n<\/ul>\n\n\n\n<p><strong>Concluding remarks (12:18\u201312:30)<\/strong><\/p>\n\n\n\n<h3 class=\"wp-block-heading\">14:00-17:00: Grassroots Computing: Distributed Systems Without Global Resources Tutorial<\/h3>\n\n\n\n<p><strong>Session 1 (14:00\u201315:00)<\/strong><\/p>\n\n\n\n<p><strong>Break (15:00-15:30)<\/strong><\/p>\n\n\n\n<p><strong>Session 2 (15:30-16:30)<\/strong><\/p>\n\n\n\n<h3 class=\"wp-block-heading\">16:30-18:30: Prasad Jayanti&#8217;s 60th Birthday Celebration <\/h3>\n\n\n\n<ul class=\"wp-block-list\">\n<li>Eric Ruppert \u2014 Lower Bounds<\/li>\n\n\n\n<li>Panagiota Fatourou \u2014 Early Results on Snapshots<\/li>\n\n\n\n<li>Philipp Woelfel \u2014 Adaptive Snapshot Algorithms<\/li>\n\n\n\n<li>Siddhartha Jayanti \u2014 Mutual Exclusion<\/li>\n\n\n\n<li>Srdjan Petrovic \u2014 Efficient Implementations of LL\/SC<\/li>\n\n\n\n<li>Videos, personal insights, and open discussion<\/li>\n<\/ul>\n\n\n\n<h3 class=\"wp-block-heading\">18:00: <strong>Reception<\/strong><\/h3>\n\n\n\n<h2 class=\"wp-block-heading\"><strong>Tuesday<\/strong> (July 7th)<\/h2>\n\n\n\n<p><strong>Opening Remarks (8:40-8:45)<\/strong><\/p>\n\n\n\n<p><strong>Session 1<\/strong> (chair: Peter Davies-Peck)<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>08:45-09:05: Deterministic Distributed Algorithms for Short Disjoint Paths (Mohsen Ghaffari, Hsin-Hao Su)<\/li>\n\n\n\n<li>09:05-09:25: Girth Approximations in the CONGEST Model (Shiri Chechik, Gur Lifshitz, Doron Mukhtar)<\/li>\n\n\n\n<li>09:25-09:45: Distributed Treewidth Computation and Courcelle&#8217;s Theorem in the CONGEST Model (Benjam\u00edn Jauregui, Jason Li, Pedro Montealegre, Ioan Todinca)<\/li>\n\n\n\n<li>09:45-09:50: Brief Announcement: On Energy Complexity and Multi-Instance Computation in the Congested Clique (Dominick Banasik, Varsha Dani)<\/li>\n\n\n\n<li>09:50-09:55: Brief Announcement: Deterministic Edge Coloring with few Colors in CONGEST (Tijn de Vos, Yannic Maus, Joakim Blikstad)<\/li>\n\n\n\n<li>09:55-10:00: Brief Announcement: 2-Coloring Cycles in One Round (Maxime Flin, Alesya Raevskaya, Ronja Stimpert, Jukka Suomela, Qingxin Yang)<\/li>\n<\/ul>\n\n\n\n<p><strong>Coffee Break (10:00-10:30)<\/strong><\/p>\n\n\n\n<p><strong>Session 2<\/strong> (chair: Naama Ben-David)<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>10:30-10:50: Simple and Efficient Randomized Wait-Free Locks (Kahbod Aeini, Dante Bencivenga, George Giakkoupis, Philipp Woelfel) <strong>Best Paper Award<\/strong><\/li>\n\n\n\n<li>10:50-11:10: Generalized and Reinitializable Concurrent Fast Arrays (N. Efe \u00c7ekirge, Owen Chen, Siddhartha Jayanti, Evan Lucca)<\/li>\n\n\n\n<li>11:10-11:15: Brief Announcement: A Space-Efficient Lock-Free Linear-Probing Hash Table (Hagit Attiya, Rotem Oshman, Noa Schiller)<\/li>\n\n\n\n<li>11:15-11:20: Brief Announcement: Computing Least Fixed Points with Overwrite Semantics in Parallel and Distributed Systems (Vijay K. Garg, Rohan Garg)<\/li>\n<\/ul>\n\n\n\n<p><strong>Session 3<\/strong> (chair: Isabella Ziccardi)<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>11:20-11:40: Undecided State Dynamics with Many Opinions (Colin Cooper, Frederik Mallmann-Trenn, Tomasz Radzik, Nobutaka Shimizu, Takeharu Shiraga)<\/li>\n\n\n\n<li>11:40-12:00: Fast Gossip-Based Rumor Spreading Using Small Messages (Fabien Dufoulon, William K. Moses Jr., Gopal Pandurangan)<\/li>\n\n\n\n<li>12:00-12:20: Complementary Time\u2013Space Tradeoff for Self-Stabilizing Leader Election (Yuichi Sudo)<\/li>\n<\/ul>\n\n\n\n<p><strong>Lunch Break (12:20-14:00)<\/strong><\/p>\n\n\n\n<p><strong>Session 4<\/strong> (chair: Sebastian Brandt)<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>14:00-14:20: Informative Trains: A Memory-Efficient Journey to a Self-Stabilizing Leader Election Algorithm in Anonymous Graphs (L\u00e9lia Blin, Sylvain Gay, Isabella Ziccardi)<\/li>\n\n\n\n<li>14:20-14:40: Early-Stabilizing Counting (Christoph Lenzen, Julian Loss)<\/li>\n\n\n\n<li>14:40-15:00: Gradient Clock Synchronization with Practically Constant Local Skew (Christoph Lenzen)<\/li>\n<\/ul>\n\n\n\n<p><strong>Session 5<\/strong> (chair: Gopal Pandurangan)<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>15:05-15:25: Near-Resolution of the Tradeoff Conjecture in Distributed Proof Labeling Schemes (Arnold Filtser, Orr Fischer)<\/li>\n\n\n\n<li>15:25-15:45: Distributed Algorithms for Potential Problems (Alkida Balliu, Thomas Boudier, Francesco d&#8217;Amore, Fabian Kuhn, Dennis Olivetti, Gustav Schmid, Jukka Suomela)<\/li>\n\n\n\n<li>15:45-15:50: Brief Announcement: Exponential Quantum Advantage for Message Complexity in Distributed Algorithms (Ma\u00ebl Luce, Mathieu Roget, Joseph Marchand, Fran\u00e7ois Le Gall)<\/li>\n\n\n\n<li>15:50-15:55: Brief Announcement: Distributed Statistical Zero-Knowledge Proofs via Sumcheck (Benjam\u00edn Jauregui, Masayuki Miyamoto)<\/li>\n\n\n\n<li>15:55-16:00: Brief Announcement: Distributed Non-Interactive Zero-Knowledge Proofs (Alex Bredariol Grilo, Ami Paz, Mor Perry)<\/li>\n<\/ul>\n\n\n\n<p><strong>Coffee Break (16:00-16:25)<\/strong><\/p>\n\n\n\n<p><strong>Keynote Talk (16:25-17:35): &#8220;Parallel Algorithm Engineering Reconsidered&#8221; &#8211; P<\/strong><strong>eter Sanders (Karlsruhe Insitute of Technology)<\/strong><\/p>\n\n\n\n<p><strong>Business Meeting (17:45)<\/strong><\/p>\n\n\n\n<h2 class=\"wp-block-heading\"><strong>Wednesday<\/strong> (July 8th)<\/h2>\n\n\n\n<p><strong>Session 6<\/strong> (chair: Frederik Mallmann-Trenn)<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>08:40-09:00: From Few to Many Faults: Optimal Adaptive Byzantine Agreement (Andrei Constantinescu, Marc Dufay, Anton Paramonov, Roger Wattenhofer)<\/li>\n\n\n\n<li>09:00-09:20: Reaching Univalency with Subquadratic Communication (Andrew Lewis-Pye)<\/li>\n\n\n\n<li>09:20-09:40: Why Canonical-Round Algorithms Fail for Optimal Byzantine Resilience (Hagit Attiya, Itay Flam, Jennifer Welch)<\/li>\n\n\n\n<li>09:40-09:45: Brief Announcement: Communication Efficient Byzantine Agreement with Predictions (Muhammad Ayaz Dzulfikar, Seth Gilbert)<\/li>\n\n\n\n<li>09:45-09:50: Brief Announcement: BumbleBee: Best-of-Both-Worlds MVBA with Optimal Communication, Latency and Resilience Tradeoffs (Fatima Elsheimy, Simon Kamp)<\/li>\n\n\n\n<li>09:50-09:55: Brief Announcement: What is Agreement About if not Common Knowledge? (Or David, Yoram Moses)<\/li>\n\n\n\n<li>09:55-10:00: Brief Announcement: Byzantine Machine Learning, MultiKrum and an Optimal Notion of Robustness (Gilles Bareilles, Wassim Bouaziz, Julien Fageot, El-Mahdi El-Mhamdi)<\/li>\n<\/ul>\n\n\n\n<p><strong>Coffee Break (10:00-10:30)<\/strong><\/p>\n\n\n\n<p><strong>Dijkstra Prize Talk (10:30-11:30): &#8220;The Omega(D+sqrt(n)) Lower Bound Story of Distributed Algorithms&#8221; &#8211; Gopal Pandurangan (University of Houston)<\/strong><\/p>\n\n\n\n<p><strong>Session 7<\/strong> (chair: Avery Miller)<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>11:35-11:55: Efficient Counting and Simulation in Content-Oblivious Rings (J\u00e9r\u00e9mie Chalopin, Yi-Jun Chang, Giuseppe Antonio Di Luna, Haoran Zhou) <strong>Best Student Paper Award<\/strong><\/li>\n\n\n\n<li>11:55-12:00: Brief Announcement: Toward Uniform Content-Oblivious Leader Election on General Graphs (Fabian Frei, Ran Gelles, Ahmed Ghazy, Alexandre Nolin)<\/li>\n\n\n\n<li>12:00-12:20: Distinct Gathering and the Virtue of Self-Consistency (Fabian Frei, Koichi Wada)<\/li>\n<\/ul>\n\n\n\n<p><strong>Lunch Break (12:20-14:00)<\/strong><\/p>\n\n\n\n<p><strong>Session 8<\/strong> (chair: Hagit Attiya)<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>14:00-14:20: Nearly Quadratic Asynchronous Distributed Key Generation from Recursive Consensus (Ittai Abraham, Renas Bacho, Julian Loss, Gilad Stern)<\/li>\n\n\n\n<li>14:20-14:40: Information-Theoretic Optimistic Verifiable Secret Sharing (Chen-Da Liu-Zhang, Martin Hirt, Emanuele Marsicano)<\/li>\n\n\n\n<li>14:40-15:00: Balanced and Adaptively Secure Asynchronous Common Coin and Byzantine Agreement With Sub-Quadratic Communication (Hanwen Feng, Tiancheng Mai, Qiang Tang)<\/li>\n\n\n\n<li>15:00-15:20: Byzantine Consensus in the Partially Authenticated Setting (Christoph Lenzen, Julian Loss, Kecheng Shi, Benedikt Wagner)<\/li>\n\n\n\n<li>15:20-15:25: Brief Announcement: Cryptographically Secure Domain Extension for Byzantine Agreement with Improved Round Complexity (Ashish Choudhury, Madhav Natarajan H)<\/li>\n\n\n\n<li>15:25-15:30: Brief Announcement: Subcubic Coin Tossing in Asynchrony without PKI (Mose Mizrahi, Roger Wattenhofer)<\/li>\n<\/ul>\n\n\n\n<p><strong>Coffee Break (15:30-15:55)<\/strong><\/p>\n\n\n\n<p><strong>Session 9<\/strong> (chair: Yi-Jun Chang)<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>15:55-16:15: New Hardness Results for the LOCAL Model via a Simple Self-Reduction (Alkida Balliu, Filippo Casagrande, Francesco d&#8217;Amore, Dennis Olivetti)<\/li>\n\n\n\n<li>16:15-16:35: The Distributed Complexity Landscape on Trees Depends on the Knowledge About the Network Size (Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Dennis Olivetti, Timothe Picavet, Gustav Schmid)<\/li>\n\n\n\n<li>16:35-16:40: Brief Announcement: Is a LOCAL Algorithm Computable? (Antonio Cruciani, Avinandan Das, Massimo Equi, Henrik Lievonen, Diep Luong-Le, Augusto Modanese, Jukka Suomela)<\/li>\n\n\n\n<li>16:40-16:45: Brief Announcement: It Does Not Matter How You Define Locally Checkable Labelings (Antonio Cruciani, Avinandan Das, Alesya Raevskaya, Jukka Suomela)<\/li>\n\n\n\n<li>16:45-16:50: Brief Announcement: Fast Deterministic Distributed Degree Splitting (Yannic Maus, Alexandre Nolin, Florian Schager)<\/li>\n\n\n\n<li>16:50-16:55: Brief Announcement: Sinkless Orientation Made Trivial (Alexandre Nolin)<\/li>\n<\/ul>\n\n\n\n<p><strong>Session 10<\/strong> (chair: Fabien Dufoulon)<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>17:00-17:20: Supervised Distributed Computing: Efficiency and Robustness under a Majority of Adversarial Workers (John Augustine, Henning Hillebrandt, Manish Kumar, Christian Scheideler, Julian Werthmann)<\/li>\n\n\n\n<li>17:20-17:40: The Task Completion Problem and its Application to Crash-Resilient Computation (Orr Fischer, Ran Gelles)<\/li>\n\n\n\n<li>17:40-18:00: A Separation Between Optimal Demand-Oblivious and Demand-Aware Network Throughput (Matthias Bentert, Chen Avin, Stefan Schmid)<\/li>\n<\/ul>\n\n\n\n<p><strong>Barbecue (19:30)<\/strong><\/p>\n\n\n\n<h2 class=\"wp-block-heading\"><strong>Thursday<\/strong> (July 9th)<\/h2>\n\n\n\n<p><strong>Session 11<\/strong> (chair: Alexandre Nolin)<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>08:40-09:00: Distributed Approximate Maximum Matching and Minimum Vertex Cover via Generalized Graph Decomposition (Peter Davies-Peck)<\/li>\n\n\n\n<li>09:00-09:20: Meta-Theorems for Cuttable Distributed Problems (Marthe Bonamy, Cyril Gavoille, Avinandan Das, Jukka Suomela, Timoth\u00e9 Picavet, Alexandra Wesolek)<\/li>\n\n\n\n<li>09:20-09:40: Distributed Stochastic Graph Algorithms (Keren Censor-Hillel, Aditi Dudeja, George Giakkoupis)<\/li>\n\n\n\n<li>09:40-10:00: Improved Bounds for Distributed Random Walks and Spanning Trees (Gopal Pandurangan, Sriram V. Pemmaraju, Sourya Roy, Joshua Z. Sobel)<\/li>\n<\/ul>\n\n\n\n<p><strong>Coffee Break (10:00-10:30)<\/strong><\/p>\n\n\n\n<p><strong>Session 12<\/strong> (chair: Robin Vacus)<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>10:30-10:50: Ranking Opinions with Few States in Population Protocols (Tom-Lukas Breitkopf, Julien Dallot, Antoine El-Hayek, Stefan Schmid)<\/li>\n\n\n\n<li>10:50-11:10: Order Statistics in Population Protocols via Simple Dynamics (Niccol\u00f2 D&#8217;Archivio, Hind AlMahmoud, Emanuele Natale, Frederik Mallmann-Trenn)<\/li>\n\n\n\n<li>11:10-11:15: Brief Announcement: D\u00e9j\u00e0Vu: A Minimalistic Mechanism for Distributed Plurality Consensus (Francesco d&#8217;Amore, Niccol\u00f2 D&#8217;Archivio, George Giakkoupis, Fr\u00e9d\u00e9ric Giroire, Emanuele Natale)<\/li>\n\n\n\n<li>11:15-11:20: Brief Announcement: Limit Laws for Consensus Protocols on the Complete Graph (Julian Becker, Konstantinos Panagiotou)<\/li>\n<\/ul>\n\n\n\n<p><strong>Session 13<\/strong> (chair: Faith Ellen)<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>11:20-11:40: Impossibility Results for Strong Linearizability: The Difficulty of Consistent Refereeing (Hagit Attiya, Armando Casta\u00f1eda, Constantin Enea)<\/li>\n\n\n\n<li>11:40-12:00: Conflict-Freedom as a Progress Condition (Petr Kuznetsov, Pierre Sutra, Guillermo Toyos-Marfurt)<\/li>\n\n\n\n<li>12:00-12:20: Generalized Compare-and-Swap and Space-Efficient Universal Constructions for the Infinite-Arrival Model (Vassos Hadzilacos, Myles Thiessen, Sam Toueg)<\/li>\n<\/ul>\n\n\n\n<p><strong>Lunch Break (12:20-14:00)<\/strong><\/p>\n\n\n\n<p><strong>Session 14<\/strong> (chair: Diana Ghinea)<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>14:00-14:20: Forget-IT: Optimal Good-Case Latency For Information-Theoretic BFT (Ittai Abraham, Sourav Das, Yuval Efron, Jovan Komatovic)<\/li>\n\n\n\n<li>14:20-14:40: FEAT: Fair and Efficient Adversarial Transaction Ordering (Tien Tuan Anh Dinh, Dakai Kang, Mohammad Sadoghi)<\/li>\n\n\n\n<li>14:40-15:00: Fast Byzantine Total Order Broadcast (Matteo Monti, Martina Camaioni, Pierre-Louis Roman)<\/li>\n\n\n\n<li>15:00-15:05: Brief Announcement: Delay-Optimal Transaction Order Fairness (Zhuo Cai, Amir K. Goharshady)<\/li>\n<\/ul>\n\n\n\n<p><strong>Session 15<\/strong> (chair: Eric Ruppert)<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>15:10-15:30: Distributed Renaming with Subquadratic Bits via Scalable Committee Election (Sirui Bai, Xinyu Fu, Yuyi Wang, Chaodong Zheng)<\/li>\n\n\n\n<li>15:30-15:50: Network-Agnostic Multidimensional Approximate Agreement with Optimal Resilience (Diana Ghinea, Darya Melnyk, Tijana Milentijevi\u0107)<\/li>\n\n\n\n<li>15:50-16:10: Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs (Marc Fuchs, Diana Ghinea, Zahra Parsaeian, Joel Rybicki)<\/li>\n\n\n\n<li>16:10-16:15: Brief Announcement: Amortized Asynchronous Byzantine Reliable Broadcast with Optimal Resilience (Michael Yiqing Hu, Hong Yao Alvin Yan, Jialin Li)<\/li>\n<\/ul>\n\n\n\n<p><strong>Coffee Break (16:15-16:45)<\/strong><\/p>\n\n\n\n<p><strong>Keynote Talk (16:45-17:55): &#8220;Highly Asynchronous Concurrency in Data Structures&#8221; &#8211; Robert Tarjan (Princeton University)<\/strong><\/p>\n\n\n\n<p><strong>Closing Remarks (17:55)<\/strong><\/p>\n\n\n\n<h2 class=\"wp-block-heading\">Friday (July 10th)<\/h2>\n\n\n\n<p>See <a href=\"https:\/\/www.podc.org\/podc2026\/workshops-and-tutorials\/\" data-type=\"page\" data-id=\"127\">Workshops and Tutorials<\/a> page for more details<\/p>\n\n\n\n<h3 class=\"wp-block-heading\">09:00-10:00: <strong>Gems of Distributed Computing (GODC@PODC) Lecture Series<\/strong><\/h3>\n\n\n\n<ul class=\"wp-block-list\">\n<li>Two Complexity Lower Bounds (Faith Ellen)<\/li>\n<\/ul>\n\n\n\n<h3 class=\"wp-block-heading\">10:30-12:15, 14:00-15:00: <strong>Erasure Coding in Distributed Protocols Tutorial<\/strong><\/h3>\n\n\n\n<ul class=\"wp-block-list\">\n<li>Fundamentals (Vivien\u00a0Bammert)<\/li>\n\n\n\n<li>Verifiable Information Dispersal and Optimizations (Annalisa Cimatti)<\/li>\n\n\n\n<li>Applications to Consensus and Blockchains (Mariarosaria Barbaraci)<\/li>\n<\/ul>\n","protected":false},"excerpt":{"rendered":"<p>See https:\/\/icalppodcspaa2026.cs.rhul.ac.uk\/program\/ for combined ICALP\/PODC\/SPAA programme information Monday (July 6th) See Workshops and Tutorials page for more details 08:55-18:00: Advanced Tools, Programming Languages, and PLatforms for Implementing and Evaluating algorithms for Distributed systems (ApPLIED) Workshop Opening remarks (08:55-09:00) Keynote Talk (09:00-10:00): &#8220;Efficient Randomized Shared Memory Primitives and Algorithms&#8221; &#8211; Philipp Woelfel (University of Calgary) Coffee &hellip; <a href=\"https:\/\/www.podc.org\/podc2026\/programme\/\" class=\"more-link\">Continue reading<span class=\"screen-reader-text\"> &#8220;Programme&#8221;<\/span><\/a><\/p>\n","protected":false},"author":29,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-174","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/www.podc.org\/podc2026\/wp-json\/wp\/v2\/pages\/174","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.podc.org\/podc2026\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/www.podc.org\/podc2026\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/www.podc.org\/podc2026\/wp-json\/wp\/v2\/users\/29"}],"replies":[{"embeddable":true,"href":"https:\/\/www.podc.org\/podc2026\/wp-json\/wp\/v2\/comments?post=174"}],"version-history":[{"count":12,"href":"https:\/\/www.podc.org\/podc2026\/wp-json\/wp\/v2\/pages\/174\/revisions"}],"predecessor-version":[{"id":215,"href":"https:\/\/www.podc.org\/podc2026\/wp-json\/wp\/v2\/pages\/174\/revisions\/215"}],"wp:attachment":[{"href":"https:\/\/www.podc.org\/podc2026\/wp-json\/wp\/v2\/media?parent=174"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}