{"id":240,"date":"2022-05-11T07:19:28","date_gmt":"2022-05-11T07:19:28","guid":{"rendered":"https:\/\/www.podc.org\/podc2022\/?page_id=240"},"modified":"2022-05-23T06:53:48","modified_gmt":"2022-05-23T06:53:48","slug":"accepted-papers","status":"publish","type":"page","link":"https:\/\/www.podc.org\/podc2022\/accepted-papers\/","title":{"rendered":"List of accepted papers"},"content":{"rendered":"\n

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

A Framework for Distributed Quantum Queries in the CONGEST Model
T. de Vos, J. van Apeldoorn<\/p>\n\n\n\n

Early Adapting to Trends: Self-Stabilizing Information Spread using Passive Communication
A. Korman, R. Vacus<\/p>\n\n\n\n

What can be certified compactly?
L. Feuilloley, N. Bousquet, T. Pierron<\/p>\n\n\n\n

Perfectly-Secure Synchronous MPC with Asynchronous Fallback Guarantees
A. Appan, A. Chandramouli, A. Choudhury<\/p>\n\n\n\n

When is Recoverable Consensus Harder Than Consensus?
C. Delporte-Gallet, P. Fatourou, H. Fauconnier, E. Ruppert<\/p>\n\n\n\n

Node and Edge Averaged Complexities of Local Graph Problems
A. Balliu, M. Ghaffari, F. Kuhn, D. Olivetti<\/p>\n\n\n\n

The Space Complexity of Consensus from Swap
S. Ovens<\/p>\n\n\n\n

State Complexity of Protocols With Leaders
J. Leroux<\/p>\n\n\n\n

Narrowing the LOCAL – CONGEST Gaps in Sparse Networks via Expander Decompositions
Y. Chang, H. Su<\/p>\n\n\n\n

A Recursive Early-Stopping Phase King Protocol
C. Lenzen, S. Sheikholeslami<\/p>\n\n\n\n

Efficient and Adaptively Secure Asynchronous Binary Agreement via Binding Crusader Agreement
I. Abraham, N. Ben-David, S. Yandamuri<\/p>\n\n\n\n

Universally-Optimal Distributed Exact Min-Cut
M. Ghaffari, G. Zuzic<\/p>\n\n\n\n

Distributed Computations in Fully-Defective Networks
K. Censor-Hillel, S. Cohen, R. Gelles, G. Sela<\/p>\n\n\n\n

A Distributed Combinatorial Topology Approach to Arrow\u2019s Impossibility
S. Rajsbaum, A. Ravent\u00f3s-Pujol<\/p>\n\n\n\n

Deterministic Near-Optimal Distributed Listing of Cliques
K. Censor-Hillel, D. Leitersdorf, D. Vulakh<\/p>\n\n\n\n

Near-Optimal Leader Election in Population Protocols on Graphs
D. Alistarh, J. Rybicki, S. Voitovych<\/p>\n\n\n\n

The Laplacian Paradigm in the Broadcast Congested Clique
T. de Vos, S. Forster<\/p>\n\n\n\n

Near-Optimal Distributed Dominating Set in Bounded Arboricity Graphs
M. Dory, M. Ghaffari, S. Ilchi<\/p>\n\n\n\n

Overcoming Congestion in Distributed Coloring
M. Halldorsson, A. Nolin, T. Tonoyan<\/p>\n\n\n\n

Constant-Round Near-Optimal Spanners in Congested Clique
S. Chechik, T. Zhang<\/p>\n\n\n\n

Distributed Edge Coloring in Time Polylogarithmic in \u0394
A. Balliu, S. Brandt, F. Kuhn, D. Olivetti<\/p>\n\n\n\n

Quantum Complexity of Weighted Diameter and Radius in CONGEST Networks
X. Wu, P. Yao<\/p>\n\n\n\n

Optimal Synchronous Approximate Agreement with Asynchronous Fallback
D. Ghinea, C. Liu-Zhang, R. Wattenhofer<\/p>\n\n\n\n

From Switch Scheduling to Datacenter Scheduling: Matching-Coordinated Greed is Good
S. Rajakrishnan, R. Agarwal, D. Shmoys<\/p>\n\n\n\n

Optimal Clock Synchronization with Signatures
C. Lenzen, J. Loss<\/p>\n\n\n\n

Parameterized Verification under Release Acquire is PSPACE-complete
S. Krishna, A. Godbole, R. Meyer, S. Chakraborty<\/p>\n\n\n\n

Blunting an Adversary Against Randomized Concurrent Programs with Linearizable Implementations
H. Attiya, C. Enea, J. Welch<\/p>\n\n\n\n

Population Protocols for Exact Plurality Consensus
G. Bankhamer, P. Berenbrink, F. Biermeier, R. Els\u00e4sser, H. Hosseinpour, D. Kaaser, P. Kling<\/p>\n\n\n\n

Fast and Fair Lock-Free Locks
N. Ben-David, G. Blelloch<\/p>\n\n\n\n

A Massively Parallel Modularity-Maximizing Algorithm With Provable Guarantees
V. Cohen-Addad, F. Mallmann-Trenn, D. Saulpic<\/p>\n\n\n\n

Massively Parallel Computation in a Heterogeneous Regime
O. Fischer, A. Horowitz, R. Oshman<\/p>\n\n\n\n

Gradecast in Synchrony and Reliable Broadcast in Asynchrony with Optimal Resilience, Efficiency, and Unconditional Security
I. Abraham, G. Asharov<\/p>\n\n\n\n

The Landscape of Distributed Complexities on Trees and Beyond
C. Grunau, V. Rozho\u0148, S. Brandt<\/p>\n\n\n\n

Can\u2019t See the Forest for the Trees: Navigating Metric Spaces by Bounded Hop-Diameter Spanners
O. Kahalon, H. Le, L. Milenkovi\u0107, S. Solomon<\/p>\n\n\n\n

A Speedup Theorem for Asynchronous Computation with Applications to Consensus and Approximate Agreement
P. Fraigniaud, A. Paz, S. Rajsbaum<\/p>\n\n\n\n

Adaptively Secure Single Secret Leader Election from DDH
D. Catalano, D. Fiore, E. Giunta<\/p>\n\n\n\n

Revisiting the Power of Non-Equivocation in Distributed Protocols
N. Ben-David, B. Chan, E. Shi<\/p>\n\n\n\n

Balanced Allocations with the Choice of Noise
D. Los, T. Sauerwald<\/p>\n\n\n\n

Internet Computer Consensus
J. Camenisch, M. Drijvers, T. Hanke, Y. Pignolet, V. Shoup, D. Williams<\/p>\n\n\n\n

Balanced Byzantine Reliable Broadcast with Near-Optimal Communication and Improved Computation
N. Alhaddad, S. Das, S. Duan, L. Ren, M. Varia, Z. Xiang, H. Zhang<\/p>\n\n\n\n

Brief Announcements<\/strong><\/p>\n\n\n\n

Brief Announcement: Fault Tolerant Coloring of the Asynchronous Cycle
P. Fraigniaud, P. Lambein-Monette, M. Rabie<\/p>\n\n\n\n

Brief Announcement: Towards a Theory of Wear Leveling in Persistent Data Structures
X. Liu, W. Golab<\/p>\n\n\n\n

Brief Announcement: Make Every Word Count: Adaptive BA with Fewer Words
S. Cohen, I. Keidar, A. Spiegelman<\/p>\n\n\n\n

Brief Announcement: Distributed MST Computation in the Sleeping Model: Awake-Optimal Algorithms and Lower Bounds
J. Augustine, W. Moses Jr., G. Pandurangan<\/p>\n\n\n\n

Brief Announcement: Broadcasting Time in Dynamic Rooted Trees is Linear
A. El-Hayek, M. Henzinger, S. Schmid<\/p>\n\n\n\n

Brief Announcement: Asynchronous Randomness and Consensus without Trusted Setup
L. De Souza, P. Kuznetsov, A. Tonkikh<\/p>\n\n\n\n

Brief Announcement: Computability and Anonymous Storage-Efficient Consensus with an Abstract MAC Layer
L. Tseng, Q. Zhang<\/p>\n\n\n\n

Brief Announcement: Deterministic Massively Parallel Algorithms for Ruling Sets
S. Pai, S. Pemmaraju<\/p>\n\n\n\n

Brief Announcement: Deterministic Consensus and Checkpointing with Crashes: Time and Communication Efficiency
B. Chlebus, D. Kowalski, J. Olkowski<\/p>\n\n\n\n

Brief Announcement: The weakest failure detector for genuine atomic multicast
P. Sutra<\/p>\n\n\n\n

Brief Announcement: How to Tame Multiple Spending in Decentralized Cryptocurrencies
J. Bezerra de Ara\u00fajo, P. Kuznetsov<\/p>\n\n\n\n

Brief Announcement: Gathering despite a linear number of weakly Byzantine agents
J. Hirose, J. Nakamura, F. Ooshita, M. Inoue<\/p>\n\n\n\n

Brief Announcement: Near Optimal Bounds for Replacement Paths and Related Problems in the CONGEST Model
V. Manoharan, V. Ramachandran<\/p>\n\n\n\n

Brief Announcement: (1+\u03f5)-Approximate Shortest Paths in Dynamic Streams.
C. Trehan, M. Elkin<\/p>\n\n\n\n

Brief Announcement: A Hierarchy of Time-Bounded Local Decision
E. Tshuva, R. Oshman<\/p>\n\n\n\n

Brief Announcement: Almost Universally Optimal Distributed Laplacian Solver
I. Anagnostides, C. Lenzen, B. Haeupler, G. Zuzic, T. Gouleakis<\/p>\n\n\n\n

Brief Announcement: Probabilistic Dynamic Input\/Output Automata
P. Civit, M. Potop-Butucaru<\/p>\n\n\n\n

Brief Announcement: Holistic Verification of Blockchain Consensus
N. Bertrand, V. Gramoli, M. Lazic, I. Konnov, P. Tholoniat, J. Widder<\/p>\n\n\n\n

Brief Announcement: Asynchronous Verifiable Information Dispersal with Near-Optimal Communication
N. Alhaddad, S. Das, S. Duan, L. Ren, M. Varia, Z. Xiang, H. Zhang<\/p>\n","protected":false},"excerpt":{"rendered":"

Full Papers A Framework for Distributed Quantum Queries in the CONGEST ModelT. de Vos, J. van Apeldoorn Early Adapting to Trends: Self-Stabilizing Information Spread using Passive CommunicationA. Korman, R. Vacus What can be certified compactly?L. Feuilloley, N. Bousquet, T. Pierron Perfectly-Secure Synchronous MPC with Asynchronous Fallback GuaranteesA. Appan, A. Chandramouli, A. Choudhury When is Recoverable … 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-240","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/www.podc.org\/podc2022\/wp-json\/wp\/v2\/pages\/240","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.podc.org\/podc2022\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/www.podc.org\/podc2022\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/www.podc.org\/podc2022\/wp-json\/wp\/v2\/users\/19"}],"replies":[{"embeddable":true,"href":"https:\/\/www.podc.org\/podc2022\/wp-json\/wp\/v2\/comments?post=240"}],"version-history":[{"count":7,"href":"https:\/\/www.podc.org\/podc2022\/wp-json\/wp\/v2\/pages\/240\/revisions"}],"predecessor-version":[{"id":270,"href":"https:\/\/www.podc.org\/podc2022\/wp-json\/wp\/v2\/pages\/240\/revisions\/270"}],"wp:attachment":[{"href":"https:\/\/www.podc.org\/podc2022\/wp-json\/wp\/v2\/media?parent=240"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}