FEAT: Fair and Efficient Adversarial Transaction Ordering
Dakai Kang (University of California, Davis); Tien Tuan Anh Dinh (Deakin University); Mohammad Sadoghi (University of California, Davis)<\/p>\n\n\n\n
The Power of Strong Linearizability: the Difficulty of Consistent Refereeing
Hagit Attiya (Technion); Armando Casta\u00f1eda (Instituto de Matem\u00e1ticas, Universidad Nacional Aut\u00f3noma de M\u00e9xico (UNAM)); Constantin Enea (Ecole Polytechnique, LIX)<\/p>\n\n\n\n
Distributed Approximate Maximum Matching and Minimum Vertex Cover via Generalized Graph Decomposition
Peter Davies-Peck (Durham University)<\/p>\n\n\n\n
Deterministic Distributed Algorithms for Short Disjoint Paths
Mohsen Ghaffari (MIT); Hsin-Hao Su (Boston College)<\/p>\n\n\n\n
Ranking Opinions with Few States in Population Protocols
Tom-Lukas Breitkopf, Julien Dallot (TU Berlin); Antoine El-Hayek (Institute of Science and Technology Austria); Stefan Schmid (TU Berlin)<\/p>\n\n\n\n
Distributed Renaming with Subquadratic Bits via Scalable Committee Election
Sirui Bai, Xinyu Fu (Nanjing University); Yuyi Wang (CRRC Zhuzhou Institute & Tengen Intelligence Institute); Chaodong Zheng (Nanjing University)<\/p>\n\n\n\n
The Task Completion Problem and its Application to Crash-Resilient Computation
Orr Fischer, Ran Gelles (Bar-Ilan University)<\/p>\n\n\n\n
Efficient Counting and Simulation in Content-Oblivious Rings
J\u00e9r\u00e9mie Chalopin (CNRS, Aix-Marseille universit\u00e9); Yi-Jun Chang (National University of Singapore); Giuseppe Antonio Di Luna (Sapienza University); Haoran Zhou (National University of Singapore)<\/p>\n\n\n\n
Reaching Univalency with Subquadratic Communication
Andrew Lewis-Pye (London School of Economics)<\/p>\n\n\n\n
Undecided State Dynamics with Many Opinions
Colin Cooper, Frederik Mallmann-Trenn, Tomasz Radzik (King\u2019s College London); Nobutaka Shimizu (Institute of Science Tokyo); Takeharu Shiraga (Chuo University)<\/p>\n\n\n\n
Order Statistics in Population Protocols via Simple Dynamics
Niccol\u00f2 D’Archivio (INRIA); Hind AlMahmoud (Kings College London); Emanuele Natale (CNRS, COATI, I3S, Universit\u00e9 C\u00f4te d’Azur); Frederik Mallmann-Trenn (King’s College London)<\/p>\n\n\n\n
Distributed Treewidth Computation and Courcelle\u2019s Theorem in the CONGEST Model
Benjam\u00edn Jauregui (Universidad de Chile); Jason Li (CMU); Pedro Montealegre (Universidad Adolfo Ib\u00e1\u00f1ez); Ioan Todinca (Universit\u00e9 d’Orl\u00e9ans)<\/p>\n\n\n\n
Early-Stabilizing Counting
Christoph Lenzen (Aalto University); Julian Loss (Ruhr University Bochum)<\/p>\n\n\n\n
Information-Theoretic Optimistic Verifiable Secret Sharing
Chen-Da Liu-Zhang (Lucerne University of Applied Sciences and Arts); Martin Hirt, Emanuele Marsicano (ETH Zurich)<\/p>\n\n\n\n
Distributed Algorithms for Potential Problems
Alkida Balliu, Thomas Boudier, Francesco d’Amore (Gran Sasso Science Institute); Fabian Kuhn (University of Freiburg); Dennis Olivetti (Gran Sasso Science Institute); Gustav Schmid (University of Freiburg); Jukka Suomela (Aalto University)<\/p>\n\n\n\n
Byzantine Consensus in the Partially Authenticated Setting
Christoph Lenzen (Reykjavik University); Julian Loss (Ruhr University Bochum); Kecheng Shi (CISPA Helmholtz Center for Information Security); Benedikt Wagner (Ethereum Foundation)<\/p>\n\n\n\n
Two Fast Array Algorithms: Reinitializable and RMWable
N. Efe \u00c7ekirge, Owen Chen, Siddhartha Jayanti, Evan Lucca (Dartmouth College)<\/p>\n\n\n\n
Distributed Stochastic Graph Algorithms
Keren Censor-Hillel (Technion); Aditi Dudeja (The Chinese University of Hong Kong, Shenzhen); George Giakkoupis (Inria)<\/p>\n\n\n\n
Girth Approximations in the CONGEST Model
Shiri Chechik (Tel Aviv University); Gur Lifshitz (Tel-Aviv University); Doron Mukhtar (Tel Aviv University)<\/p>\n\n\n\n
New Hardness Results for the LOCAL Model via a Simple Self-Reduction
Alkida Balliu, Filippo Casagrande, Francesco d’Amore, Dennis Olivetti (Gran Sasso Science Institute)<\/p>\n\n\n\n
Supervised Distributed Computing: Efficiency and Robustness under a Majority of Adversarial Workers
John Augustine (Indian Institute of Technology Madras); Henning Hillebrandt (Paderborn University); Manish Kumar (Indian Institute of Technology Madras); Christian Scheideler, Julian Werthmann (Paderborn University)<\/p>\n\n\n\n
Informative Trains: A Memory-Efficient Journey to a Self-Stabilizing Leader Election Algorithm in Anonymous Graphs
L\u00e9lia Blin (IRIF, Universit\u00e9 Paris Cit\u00e9); Sylvain Gay (IRIF, Universit\u00e9 Paris Cit\u00e9, \u00c9cole Normale Sup\u00e9rieure); Isabella Ziccardi (IRIF, CNRS, Universit\u00e9 Paris Cit\u00e9)<\/p>\n\n\n\n
A Separation Between Optimal Demand-Oblivious and Demand-Aware Network Throughput
Matthias Bentert (TU Berlin); Chen Avin (Ben Gurion University of the Negev); Stefan Schmid (TU Berlin)<\/p>\n\n\n\n
Nearly Quadratic Asynchronous Distributed Key Generation from Recursive Consensus
Ittai Abraham (A16Z); Renas Bacho (CISPA Helmholtz Center for Information Security); Julian Loss (Ruhr University Bochum); Gilad Stern (Tel Aviv University, Israel)<\/p>\n\n\n\n
Fast Gossip-based Rumor Spreading Using Small Messages
Fabien Dufoulon (Lancaster University); William K. Moses Jr. (Durham University); Gopal Pandurangan (University of Houston)<\/p>\n\n\n\n
Improved Bounds for Distributed Random Walks and Spanning Trees
Gopal Pandurangan (University of Houston); Sriram V. Pemmaraju, Sourya Roy, Joshua Z. Sobel (University of Iowa)<\/p>\n\n\n\n
Fast Byzantine Total Order Broadcast
Matteo Monti (HES-SO Valais-Wallis); Martina Camaioni (EPFL); Pierre-Louis Roman<\/p>\n\n\n\n
The Distributed Complexity Landscape on Trees Depends on the Knowledge About the Network Size
Gustav Schmid (University of Freiburg); Alkida Balliu (Gran Sasso Science Institute); Fabian Kuhn (University of Freiburg); Dennis Olivetti (GSSI, L’Aquila, Italy); Sebastian Brandt (CISPA Helmholtz Center for Information Security); Timothe Picavet (LaBRI, Universit\u00e9 de Bordeaux)<\/p>\n\n\n\n
Why Canonical-Round Algorithms Fail for Optimal Byzantine Resilience
Hagit Attiya, Itay Flam (Technion); Jennifer Welch (TAMU)<\/p>\n\n\n\n
Complementary Time-Space Tradeoff for Self-Stabilizing Leader Election: Polynomial States Meet Sublinear Time
Yuichi Sudo (Hosei University)<\/p>\n\n\n\n
Simple and Efficient Randomized Wait-Free Locks
Kahbod Aeini, Dante Bencivenga (University of Calgary); George Giakkoupis (INRIA Rennes); Philipp Woelfel (University of Calgary, Canada)<\/p>\n\n\n\n
Adaptively Secure Asynchronous Common Coin and Byzantine Agreement With Near-optimal Resilience and \u00d5(sqrt(n))-bit per Party
Hanwen Feng, Tiancheng Mai, Qiang Tang (The University of Sydney)<\/p>\n\n\n\n
Conflict-Freedom as a Progress Condition
Petr Kuznetsov (T\u00e9l\u00e9com Paris, Institut Polytechnique Paris); Pierre Sutra (T\u00e9l\u00e9com SudParis, Institut Polytechnique de Paris); Guillermo Toyos-Marfurt (T\u00e9l\u00e9com Paris, Institut Polytechnique de Paris)<\/p>\n\n\n\n
Gradient Clock Synchronization with Practically Constant Local Skew
Christoph Lenzen (CISPA Helmholtz Center for Information Security)<\/p>\n\n\n\n
Meta-Theorems for Cuttable Distributed Problems
Marthe Bonamy (LaBRI \u2013 CNRS, University of Bordeaux); Cyril Gavoille (LaBRI \u2013 University of Bordeaux); Avinandan Das, Jukka Suomela (Aalto University); Timoth\u00e9 Picavet (LaBRI \u2013 University of Bordeaux); Alexandra Wesolek (LaBRI \u2013 CNRS, University of Bordeaux)<\/p>\n\n\n\n
Network-Agnostic Multidimensional Approximate Agreement with Optimal Resilience
Diana Ghinea (Lucerne University of Applied Sciences and Arts); Darya Melnyk, Tijana Milentijevi\u0107 (TU Berlin)<\/p>\n\n\n\n
Distinct Gathering and the Virtue of Self-Consistency
Fabian Frei (MIT); Koichi Wada (Hosei U. Japan)<\/p>\n\n\n\n
From Few to Many Faults: Optimal Adaptive Byzantine Agreement
Andrei Constantinescu, Marc Dufay, Anton Paramonov, Roger Wattenhofer (ETH Zurich)<\/p>\n\n\n\n
Forget-IT: Optimal Good-Case Latency For Information-Theoretic BFT
Ittai Abraham (A16Z); Sourav Das (Category Labs); Yuval Efron (Ritual);
Jovan Komatovic (Category Labs)<\/p>\n\n\n\n
Near-Resolution of the Tradeoff Conjecture in Distributed Proof Labeling Schemes
Arnold Filtser, Orr Fischer (Bar-Ilan University)<\/p>\n\n\n\n
Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs
Marc Fuchs (University of Freiburg); Diana Ghinea (Lucerne University of Applied Sciences and Arts); Zahra Parsaeian (University of Freiburg); Joel Rybicki (Humboldt University of Berlin)<\/p>\n\n\n\n
Generalized Compare-and-Swap and Space-Efficient Universal Constructions for the Infinite-Arrival Model
Vassos Hadzilacos, Myles Thiessen, Sam Toueg (University of Toronto)<\/p>\n\n\n\n
Exponential Quantum Advantage for Message Complexity in Distributed Algorithms
Ma\u00ebl Luce (Nagoya University); Mathieu Roget (Universit\u00e9 Aix-Marseille); Joseph Marchand (Ecole normale sup\u00e9rieure Paris-Saclay); Fran\u00e7ois Le Gall (Nagoya University)<\/p>\n\n\n\n
Is a LOCAL Algorithm Computable?
Antonio Cruciani, Avinandan Das, Massimo Equi, Henrik Lievonen (Aalto University); Diep Luong-Le (Columbia University); Augusto Modanese
(CISPA Helmholtz Center for Information Security); Jukka Suomela (Aalto University)<\/p>\n\n\n\n
Amortized Asynchronous Byzantine Reliable Broadcast with Optimal Resilience
Michael Yiqing Hu, Hong Yao Alvin Yan, Jialin Li (National University of Singapore)<\/p>\n\n\n\n
Delay-Optimal Transaction Order Fairness
Zhuo Cai (Hong Kong University of Science and Technology); Amir K. Goharshady (University of Oxford)<\/p>\n\n\n\n
Byzantine Machine Learning, MultiKrum and an Optimal Notion of Robustness
Gilles Bareilles (\u00c9cole Polytechnique); Wassim Bouaziz (Mistral AI); Julien Fageot (EPFL); El-Mahdi El-Mhamdi (\u00c9cole Polytechnique)<\/p>\n\n\n\n
Communication Efficient Byzantine Agreement with Predictions
Muhammad Ayaz Dzulfikar, Seth Gilbert (National University of Singapore)<\/p>\n\n\n\n
Cryptographically Secure Domain Extension for Byzantine Agreement with Improved Round Complexity
Ashish Choudhury, Madhav Natarajan H (IIIT Bangalore)<\/p>\n\n\n\n
It Does Not Matter How You Define Locally Checkable Labelings
Antonio Cruciani, Avinandan Das, Alesya Raevskaya, Jukka Suomela (Aalto University)<\/p>\n\n\n\n
D\u00e9j\u00e0Vu: A Minimalistic Mechanism for Distributed Plurality Consensus
Francesco d’Amore (Gran Sasso Science Institute); Niccol\u00f2 D’Archivio (Inria); George Giakkoupis (Inria Rennes); Fr\u00e9d\u00e9ric Giroire (CNRS\/
Universit\u00e9 C\u00f4te d’Azur); Emanuele Natale (CNRS, COATI, I3S, Universit\u00e9 C\u00f4te d’Azur)<\/p>\n\n\n\n
Computing Least Fixed Points with Overwrite Semantics in Parallel and Distributed Systems
Vijay K. Garg (The University of Texas at Austin); Rohan Garg (Purdue University)<\/p>\n\n\n\n
What Is Agreement About if Not Common Knowledge?
Or David, Yoram Moses (Technion)<\/p>\n\n\n\n
Distributed Statistical Zero-Knowledge Proofs via Sumcheck
Benjam\u00edn Jauregui (Universidad de Chile & Universit\u00e9 Paris Cit\u00e9); Masayuki Miyamoto (University of Tsukuba)<\/p>\n\n\n\n
A Space-Efficient Lock-Free Linear-Probing Hash Table
Hagit Attiya (Technion); Rotem Oshman (Tel Aviv University and NYU); Noa Schiller (Tel Aviv University)<\/p>\n\n\n\n
2-Coloring Cycles in One Round
Maxime Flin, Alesya Raevskaya, Ronja Stimpert, Jukka Suomela, Qingxin Yang (Aalto University)<\/p>\n\n\n\n
On Energy Complexity and Multi-Instance Computation in the Congested Clique
Dominick Banasik, Varsha Dani (Rochester Institute of Technology)<\/p>\n\n\n\n
Toward Uniform Content-Oblivious Leader Election on General Graphs
Fabian Frei (MIT); Ran Gelles (Bar-Ilan University); Ahmed Ghazy (CISPA Helmholtz Center for Information Security); Alexandre Nolin (T\u00e9l\u00e9com SudParis)<\/p>\n\n\n\n
Deterministic Edge Coloring with few Colors in CONGEST
Tijn de Vos, Yannic Maus (TU Graz); Joakim Blikstad (Centrum Wiskunde & Informatica (CWI))<\/p>\n\n\n\n
Sinkless Orientation Made Trivial
Alexandre Nolin (T\u00e9l\u00e9com SudParis)<\/p>\n\n\n\n
Fast Deterministic Distributed Degree Splitting
Yannic Maus (TU Graz); Alexandre Nolin (T\u00e9l\u00e9com SudParis); Florian Schager (TU Graz)<\/p>\n\n\n\n
Subcubic Coin Tossing in Asynchrony without Setup
Mose Mizrahi, Roger Wattenhofer (ETH Zurich)<\/p>\n\n\n\n
Limit Laws for Consensus Protocols on the Complete Graph
Julian Becker, Konstantinos Panagiotou (LMU Munich)<\/p>\n\n\n\n
Distributed Non-Interactive Zero-Knowledge Proofs
Alex Bredariol Grilo (CNRS, Sorbonne Universit\u00e9); Ami Paz (LISN, CNRS, Paris-Saclay University); Mor Perry (The Academic College of Tel-Aviv-Yaffo)<\/p>\n\n\n\n
BumbleBee: Best-of-Both-Worlds MVBA with Optimal Communication, Latency and Resilience Tradeoffs
Fatima Elsheimy (Yale University); Simon Kamp (Ruhr University Bochum)<\/p>\n","protected":false},"excerpt":{"rendered":"
Full papers FEAT: Fair and Efficient Adversarial Transaction OrderingDakai Kang (University of California, Davis); Tien Tuan Anh Dinh (Deakin University); Mohammad Sadoghi (University of California, Davis) The Power of Strong Linearizability: the Difficulty of Consistent RefereeingHagit Attiya (Technion); Armando Casta\u00f1eda (Instituto de Matem\u00e1ticas, Universidad Nacional Aut\u00f3noma de M\u00e9xico (UNAM)); Constantin Enea (Ecole Polytechnique, LIX) Distributed … Continue reading “List of Accepted Papers”<\/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-115","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/www.podc.org\/podc2026\/wp-json\/wp\/v2\/pages\/115","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=115"}],"version-history":[{"count":1,"href":"https:\/\/www.podc.org\/podc2026\/wp-json\/wp\/v2\/pages\/115\/revisions"}],"predecessor-version":[{"id":116,"href":"https:\/\/www.podc.org\/podc2026\/wp-json\/wp\/v2\/pages\/115\/revisions\/116"}],"wp:attachment":[{"href":"https:\/\/www.podc.org\/podc2026\/wp-json\/wp\/v2\/media?parent=115"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}