{"id":185,"date":"2024-04-22T13:06:26","date_gmt":"2024-04-22T13:06:26","guid":{"rendered":"https:\/\/www.podc.org\/podc2024\/?page_id=185"},"modified":"2024-05-30T11:00:44","modified_gmt":"2024-05-30T11:00:44","slug":"list-of-accepted-papers","status":"publish","type":"page","link":"https:\/\/www.podc.org\/podc2024\/list-of-accepted-papers\/","title":{"rendered":"List of accepted papers"},"content":{"rendered":"\n

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

Even-Cycle Detection in the Randomized and Quantum CONGEST Model
P. Fraigniaud, M. Luce, F. Magniez, I. Todinca<\/p>\n\n\n\n

Game Dynamics and Equilibrium Computation in the Population Protocol Model
D. Alistarh, K. Chatterjee, M. Karrabi, J. Lazarsfeld<\/p>\n\n\n\n

Fully Automated Selfish Mining Analysis in Efficient Proof Systems Blockchains
K. Chatterjee, A. Ebrahim-Zadeh, M. Karrabi, K. Pietrzak, M. Yeo, \u0110. \u017dikeli\u0107<\/p>\n\n\n\n

Streaming Graph Algorithms in the Massively Parallel Computation Model
A. Czumaj, G. Mishra, A. Mukherjee<\/p>\n\n\n\n

Dragon: Decentralization at the cost of Representation after Arbitrary Grouping and Its Applications to Sub-cubic DKG and Interactive Consistency
H. Feng, Z. Lu, Q. Tang<\/p>\n\n\n\n

Completing the Node-Averaged Complexity Landscape of LCLs on Trees
A. Balliu, S. Brandt, F. Kuhn, D. Olivetti, G. Schmid<\/p>\n\n\n\n

A LOCAL View of the Polynomial Hierarchy
F. Reiter<\/p>\n\n\n\n

Determining Recoverable Consensus Numbers
S. Ovens<\/p>\n\n\n\n

Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter
A. Padalkin, C. Scheideler<\/p>\n\n\n\n

Impossibility Results for Data-Center Routing with Congestion Control and Unsplittable Flows
M. Ferreira, N. Atre, J. Sherry, J. Sobrinho<\/p>\n\n\n\n

On Self-stabilizing Leader Election in Directed Networks
K. Altisen, A. Cournier, G. Defalque, S. Devismes<\/p>\n\n\n\n

Asynchrony-Resilient Sleepy Total-Order Broadcast Protocols
L. Zanolini, F. D’Amato, G. Losa<\/p>\n\n\n\n

All Byzantine Agreement Problems are Expensive
P. Civit, S. Gilbert, R. Guerraoui, J. Komatovic, A. Paramonov, M. Vidigueira<\/p>\n\n\n\n

TetraBFT: Reducing Latency of Unauthenticated, Responsive BFT Consensus
Q. Yu, G. Losa, X. Wang<\/p>\n\n\n\n

Lumiere: Making Optimal BFT for Partial Synchrony Practical
A. Lewis-Pye, D. Malkhi, O. Naor, K. Nayak<\/p>\n\n\n\n

On the Power of Quantum Distributed Proofs
A. Hasegawa, S. Kundu, H. Nishimura<\/p>\n\n\n\n

The Computational Power of Distributed Shared-Memory Models with Bounded-Size Registers
C. Delporte-Gallet, H. Fauconnier, P. Fraigniaud, S. Rajsbaum, C. Travers<\/p>\n\n\n\n

Strong Linearizability using Primitives with Consensus Number 2
H. Attiya, A. Castaneda, C. Enea<\/p>\n\n\n\n

Universally Optimal Information Dissemination and Shortest Paths in the HYBRID Distributed Model
Y. Chang, O. Hecht, D. Leitersdorf, P. Schneider<\/p>\n\n\n\n

DARE to agree: Byzantine Agreement with Optimal Resilience and Adaptive Communication
P. Civit, M. Dzulfikar, S. Gilbert, R. Guerraoui, J. Komatovic, M. Vidigueira<\/p>\n\n\n\n

A Tight Lower Bound for 3-Coloring Grids in the Online-LOCAL Model
Y. Chang, G. Mishra, H. Nguyen, M. Yang, Y. Yeh<\/p>\n\n\n\n

Multi-Party Set Disjointness and Intersection with Bounded Dependence
M. Braverman, R. Oshman, T. Roth<\/p>\n\n\n\n

(\u0394+1)-Vertex Coloring in O(n) Communication
M. Flin, P. Mittal<\/p>\n\n\n\n

Deterministic Expander Routing: Faster and More Versatile
Y. Chang, S. Huang, H. Su<\/p>\n\n\n\n

Tight Lower Bounds in the Supported LOCAL Model
A. Balliu, T. Boudier, S. Brandt, D. Olivetti<\/p>\n\n\n\n

Swiper: a new paradigm for efficient weighted distributed protocols
A. Tonkikh, L. Freitas<\/p>\n\n\n\n

Strongly Linearizable LL\/SC
F. Naderi Semiromi, P. Woelfel<\/p>\n\n\n\n

Computing Minimum Weight Cycle in the CONGEST Model
V. Manoharan, V. Ramachandran<\/p>\n\n\n\n

Asynchronous Self-stabilization Made Fast, Simple, and Energy-efficient
C. Johnen, S. Devismes, F. Mazoit, D. Ilcinkas<\/p>\n\n\n\n

Improved All-Pairs Approximate Shortest Paths in Congested Clique
H. Bui, S. Chandra, Y. Chang, M. Dory, D. Leitersdorf<\/p>\n\n\n\n

System Optimizations for Enabling Training of Extreme Long Sequence Transformer Models
S. Jacobs, M. Tanaka, C. Zhang, M. Zhang, R. Aminadabi, S. Song, S. Rajbhandari, Y. He<\/p>\n\n\n\n

Fully Energy-Efficient Randomized Backoff: Slow Feedback Loops Yield Fast Contention Resolution
M. Bender, J. Fineman, S. Gilbert, J. Kuszmaul, M. Young<\/p>\n\n\n\n

Probabilistic Byzantine Fault Tolerance
D. Avelas, H. Heydari, T. Distler, E. Alchieri, A. Bessani<\/p>\n\n\n\n

A Near-Optimal Low-Energy Deterministic Distributed SSSP with Ramifications on Congestion and APSP
M. Ghaffari, A. Trygub<\/p>\n\n\n\n

History-Independent Concurrent Objects
H. Attiya, M. Bender, M. Farach-Colton, R. Oshman, N. Schiller<\/p>\n\n\n\n

On the Communication Complexity of Secure Multi-Party Computation With Aborts
J. Bartusek, T. Bergamaschi, S. Khoury, S. Mutreja, O. Paradise<\/p>\n\n\n\n

The Fractional Spending Problem: Executing Payment transactions in parallel with less than f+1 validations
R. Bazzi, S. Tucci-Piergiovanni<\/p>\n\n\n\n

An Efficient RMWable Snapshot Algorithm
P. Jayanti, S. Jayanti, S. Jayanti<\/p>\n\n\n\n

Adaptive Massively Parallel Coloring in Sparse Graphs
R. Latypov, Y. Maus, S. Pai, J. Uitto<\/p>\n\n\n\n

Majority consensus thresholds in competitive Lotka-Volterra populations
M. F\u00fcgger, T. Nowak, J. Rybicki<\/p>\n\n\n\n

Dynamic Size Counting in the Population Protocol Model
D. Kaaser, M. Lohmann<\/p>\n\n\n\n

Nearly-Optimal Consensus Tolerating Adaptive Omissions: Why a Lot of Randomness is Needed?
M. Hajiaghayi, D. Kowalski, J. Olkowski<\/p>\n\n\n\n

Faster Randomized Repeated Choice and DCAS
D. Bencivenga, G. Giakkoupis, P. Woelfel<\/p>\n\n\n\n

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

Brief Announcement: Global certification via perfect hashing
N. Bousquet, L. Feuilloley, S. Zeitoun<\/p>\n\n\n\n

Communication-Optimal Convex Agreement
D. Ghinea, C. Liu-Zhang, R. Wattenhofer<\/p>\n\n\n\n

Know Your Audience
B. Charron-Bost, P. Lambein-Monette<\/p>\n\n\n\n

Content-Oblivious Leader Election on Rings
F. Frei, R. Gelles, A. Ghazy, A. Nolin<\/p>\n\n\n\n

A Case for Byzantine Robustness Against Data Poisoning
S. Farhadkhani, R. Guerraoui, N. Gupta, R. Pinot<\/p>\n\n\n\n

Local Advice and Local Decompression
A. Balliu, S. Brandt, F. Kuhn, K. Nowicki, D. Olivetti, E. Rotenberg, J. Suomela<\/p>\n\n\n\n

Simpler and More General Distributed Coloring Based on Simple List Defective Coloring Algorithms
M. Fuchs, F. Kuhn<\/p>\n\n\n\n

Self-Stabilizing MIS Computation in the Beeping Model
G. Giakkoupis, V. Turau, I. Ziccardi<\/p>\n\n\n\n

On the Limits of Information Spread by Memory-less Agents
N. D’Archivio, R. Vacus<\/p>\n\n\n\n

Improved Massively Parallel Triangle Counting in  O(1) Rounds
Q. Liu, C. Seshadhri<\/p>\n\n\n\n

Low-Distortion Clustering in Bounded Growth Graphs
Y. Chang, V. Dani, T. Hayes<\/p>\n\n\n\n

Randomized Consensus: Common Coins Are not the Holy Grail!
A. Mostefaoui, M. Perrin, J. Weibel<\/p>\n\n\n\n

Brief Announcement: Optimally Encoding Information in Chemical Reaction Networks
A. Luchsinger, D. Doty, D. Soloveichik<\/p>\n\n\n\n

Brief Announcement: Fair Ordering via Streaming Social Choice Theory
G. Ramseyer, A. Goel<\/p>\n\n\n\n

Brief Announcement: Understanding Read-Write Wait-Free Coverings in the Fully-Anonymous Shared-Memory Model
G. Losa, E. Gafni<\/p>\n\n\n\n

Brief Announcement: Distributed Model Checking on\u00a0Graphs of Bounded Treedepth
F. Fomin, P. Fraigniaud, P. Montealegre, I. Rapaport, I. Todinca<\/p>\n\n\n\n

Brief Announcement: Musketeer: Incentive-Compatible Rebalancing for Payment Channel Networks
Z. Avarikioti, S. Schmid, S. Tiwari<\/p>\n\n\n\n

Brief Announcement. Massively Parallel Ruling Set Made Deterministic
J. Giliberti, Z. Parsaeian<\/p>\n\n\n\n

Brief Announcement: No Broadcast Abstraction Captures k-Set-Agreement
S. Gay, A. Mostefaoui, M. Perrin<\/p>\n","protected":false},"excerpt":{"rendered":"

Full Papers Even-Cycle Detection in the Randomized and Quantum CONGEST ModelP. Fraigniaud, M. Luce, F. Magniez, I. Todinca Game Dynamics and Equilibrium Computation in the Population Protocol ModelD. Alistarh, K. Chatterjee, M. Karrabi, J. Lazarsfeld Fully Automated Selfish Mining Analysis in Efficient Proof Systems BlockchainsK. Chatterjee, A. Ebrahim-Zadeh, M. Karrabi, K. Pietrzak, M. Yeo, \u0110. … Continue reading “List of accepted papers”<\/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-185","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/www.podc.org\/podc2024\/wp-json\/wp\/v2\/pages\/185","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=185"}],"version-history":[{"count":6,"href":"https:\/\/www.podc.org\/podc2024\/wp-json\/wp\/v2\/pages\/185\/revisions"}],"predecessor-version":[{"id":243,"href":"https:\/\/www.podc.org\/podc2024\/wp-json\/wp\/v2\/pages\/185\/revisions\/243"}],"wp:attachment":[{"href":"https:\/\/www.podc.org\/podc2024\/wp-json\/wp\/v2\/media?parent=185"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}