{"id":186,"date":"2023-04-05T14:54:54","date_gmt":"2023-04-05T14:54:54","guid":{"rendered":"https:\/\/www.podc.org\/podc2023\/?page_id=186"},"modified":"2023-04-30T13:58:36","modified_gmt":"2023-04-30T13:58:36","slug":"list-of-accepted-papers","status":"publish","type":"page","link":"https:\/\/www.podc.org\/podc2023\/list-of-accepted-papers\/","title":{"rendered":"List of accepted papers"},"content":{"rendered":"\n

Full Papers<\/strong><\/h2>\n\n\n\n

The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs
Yi-Jun Chang and Zeyong Li<\/p>\n\n\n\n

Asynchronous Wait-Free Runtime Verification and Enforcement of Linearizability
Armando Casta\u00f1eda and Valeria Rodr\u00edguez-Jim\u00e9nez<\/p>\n\n\n\n

The ERA Theorem for Safe Memory Reclamation
Gali Sheffi and Erez Petrank<\/p>\n\n\n\n

A Wait-free Queue with Polylogarithmic Step Complexity
Hossein Naderibeni and Eric Ruppert<\/p>\n\n\n\n

On the Validity of Consensus
Pierre Civit, Seth Gilbert, Rachid Guerraoui, Jovan Komatovic and Manuel Vidigueira<\/p>\n\n\n\n

(1-\u03b5)-Approximate Maximum Weighted Matching in poly(1\/\u03b5, log n) Time in the Distributed and Parallel Settings
Shang-En Huang and Hsin-Hao Su<\/p>\n\n\n\n

BeeGees: strengthened liveness in chained BFT
Ittai Abraham, Natacha Crooks, Neil Giridharan, Heidi Howard and Florian Suri-Payer<\/p>\n\n\n\n

Optimal Eventual Byzantine Agreement Protocols with Omission Failures
Kaya Alpturer, Joseph Halpern and Ron van der Meyden<\/p>\n\n\n\n

Distributed MIS in O(log log n) Awake Complexity
Fabien Dufoulon, William K. Moses Jr. and Gopal Pandurangan<\/p>\n\n\n\n

Improved Tradeoffs for Leader Election
Shay Kutten, Peter Robinson, Ming Ming Tan and Xianbin Zhu<\/p>\n\n\n\n

Distributed CONGEST Algorithms against Mobile Adversaries
Orr Fischer and Merav Parter<\/p>\n\n\n\n

Distributed Symmetry Breaking on Power Graphs via Sparsification
Yannic Maus, Jara Uitto and Saku Peltonen<\/p>\n\n\n\n

Distributed Self-Stabilizing MIS with Few States and Weak Communication
George Giakkoupis and Isabella Ziccardi<\/p>\n\n\n\n

Deterministic Fault-Tolerant Connectivity Labeling Scheme
Taisuke Izumi, Yuval Emek, Tadashi Wadayama and Toshimitsu Masuzawa<\/p>\n\n\n\n

Sparse Semi-Oblivious Routing: Few Random Paths Suffice
Goran Zuzic, Bernhard Haeupler and Antti Roeyskoe<\/p>\n\n\n\n

A Near Time-optimal Population Protocol for Self-stabilizing Leader Election on Rings with a Poly-logarithmic Number of States
Daisuke Yokota, Yuichi Sudo, Toshimitsu Masuzawa and Fukuhito Ooshita<\/p>\n\n\n\n

Distributed MIS with Low Energy and Time Complexities
Mohsen Ghaffari and Julian Portmann<\/p>\n\n\n\n

The Impact of Cooperation in Bilateral Network Creation
Tobias Friedrich, Hans Gawendowicz, Pascal Lenzner and Arthur Zahn<\/p>\n\n\n\n

Fast Convergence of k-Opinion Undecided State Dynamics in the Population Protocol Model
Talley Amir, James Aspnes, Petra Berenbrink, Felix Biermeier, Christopher Hahn, Dominik Kaaser and John Lazarsfeld<\/p>\n\n\n\n

Universally Composable Simultaneous Broadcast against a Dishonest Majority and Applications
Myrto Arapinis, \u00c1bel Kocsis, Nikolaos Lamprou, Liam Medley and Thomas Zacharias<\/p>\n\n\n\n

Distributed Averaging in Opinion Dynamics
Petra Berenbrink, Colin Cooper, Cristina Gava, David Kohan Marzag\u00e3o, Frederik Mallmann-Trenn, Tomasz Radzik and Nicolas Rivera<\/p>\n\n\n\n

Optimal Message-Passing with Noisy Beeps
Peter Davies<\/p>\n\n\n\n

Uniting General-Graph and Geometric-Based Radio Networks via Independence Number Parametrization
Peter Davies<\/p>\n\n\n\n

On the Amortized Communication Complexity of Byzantine Broadcast
Atsuki Momose, Ling Ren, Elaine Shi, Jun Wan and Zhuolun Xiang<\/p>\n\n\n\n

Word-Size RMR Trade-offs for Recoverable Mutual Exclusion
David Yu Cheng Chan, George Giakkoupis and Philipp Woelfel<\/p>\n\n\n\n

A Near-Optimal Deterministic Distributed Synchronizer
Mohsen Ghaffari and Anton Trygub<\/p>\n\n\n\n

Deterministic Fault-Tolerant Distributed Computing in Linear Time and Communication
Jan Olkowski, Bogdan Chlebus and Dariusz Kowalski<\/p>\n\n\n\n

Efficient Bounded Timestamping from Standard Synchronization Primitives
Benyamin Bashari, Ali Jamadi and Philipp Woelfel<\/p>\n\n\n\n

Efficient Distributed Decomposition and Routing Algorithms in Minor-free Networks and their Applications
Yi-Jun Chang<\/p>\n\n\n\n

Brief announcements<\/h2>\n\n\n\n

Brief Announcement: Near-Optimal Compact Routing and Decomposition Schemes for Planar Graphs
Jinfeng Dou, Thorsten G\u00f6tte, Henning Hillebrandt, Christian Scheideler and Julian Werthmann<\/p>\n\n\n\n

Brief Announcement: Minimum Cost Maximum Flow in the CONGEST Model
Tijn de Vos<\/p>\n\n\n\n

Brief Announcement: Breadth-First Depth-Next: Optimal Collaborative Exploration of Trees with Low Diameter
Romain Cosson, Laurent Massoulie and Laurent Viennot<\/p>\n\n\n\n

Brief Announcement: Send\/Receive Patterns versus Read\/Write Patterns: the MB-Broadcast Abstraction
Mathilde D\u00e9pr\u00e9s, Achour Most\u00e9faoui, Matthieu Perrin and Michel Raynal<\/p>\n\n\n\n

Brief Announcement: Breaking through the \u03a9(n)-space barrier: Population Protocols Decide Double-exponential Thresholds
Philipp Czerner<\/p>\n\n\n\n

Brief Announcement: What Can We Compute in a Single Round of the Congested Clique?
Peter Robinson<\/p>\n\n\n\n

Brief Announcement: The Laplacian Paradigm in Deterministic Congested Clique
Tijn de Vos and Sebastian Forster<\/p>\n\n\n\n

Brief Announcement: Breaking the f+1 Barrier: Executing Payment Transactions in Parallel with Less than f+1 Validations
Rida Bazzi and Sara Tucci-Piergiovanni<\/p>\n\n\n\n

Brief Announcement: Discrete Incremental Voting
Colin Cooper, Tomasz Radzik and Takeharu Shiraga<\/p>\n\n\n\n

Brief Announcement: Local Problems in the SUPPORTED Model
Akanksha Agrawal, John Augustine, David Peleg and Srikkanth Ramachandran<\/p>\n\n\n\n

Brief Announcement: Efficient Computation in Congested Anonymous Dynamic Networks
Giovanni Viglietta and Giuseppe Antonio Di Luna<\/p>\n\n\n\n

Brief Announcement: Durable Algorithms for Writable LL\/SC and CAS with Dynamic Joining
Prasad Jayanti, Siddhartha Visveswara Jayanti and Sucharita Jayanti<\/p>\n\n\n\n

Brief Announcement: Improved Consensus in Quantum Networks
Jan Olkowski, Dariusz Kowalski and MohammadTaghi Hajiaghayi<\/p>\n\n\n\n

Brief Announcement: Improved, Partially-Tight Multiplicity Queue Lower Bounds
Anh Tran and Edward Talmage<\/p>\n\n\n\n

Brief Announcement: CausalEC: A Causally Consistent Data Storage Algorithm based on Cross-Object Erasure Coding
Viveck Cadambe and Shihang Lyu<\/p>\n","protected":false},"excerpt":{"rendered":"

Full Papers The Complexity of Distributed Approximation of Packing and Covering Integer Linear ProgramsYi-Jun Chang and Zeyong Li Asynchronous Wait-Free Runtime Verification and Enforcement of LinearizabilityArmando Casta\u00f1eda and Valeria Rodr\u00edguez-Jim\u00e9nez The ERA Theorem for Safe Memory ReclamationGali Sheffi and Erez Petrank A Wait-free Queue with Polylogarithmic Step ComplexityHossein Naderibeni and Eric Ruppert On the Validity … Continue reading “List of accepted papers”<\/span><\/a><\/p>\n","protected":false},"author":19,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-186","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/www.podc.org\/podc2023\/wp-json\/wp\/v2\/pages\/186","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.podc.org\/podc2023\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/www.podc.org\/podc2023\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/www.podc.org\/podc2023\/wp-json\/wp\/v2\/users\/19"}],"replies":[{"embeddable":true,"href":"https:\/\/www.podc.org\/podc2023\/wp-json\/wp\/v2\/comments?post=186"}],"version-history":[{"count":3,"href":"https:\/\/www.podc.org\/podc2023\/wp-json\/wp\/v2\/pages\/186\/revisions"}],"predecessor-version":[{"id":209,"href":"https:\/\/www.podc.org\/podc2023\/wp-json\/wp\/v2\/pages\/186\/revisions\/209"}],"wp:attachment":[{"href":"https:\/\/www.podc.org\/podc2023\/wp-json\/wp\/v2\/media?parent=186"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}