Breaking the $O(\\sqrt n)$-Bit Barrier: Byzantine Agreement with Polylog Bits Per Party
E. Boyle, R. Cohen, A. Goel<\/p>\n\n\n\n
Time-Optimal Self-Stabilizing Leader Election in Population Protocols
J. Burman, H. Chen, H. Chen, D. Doty, T. Nowak, E. Severson, C. Xu<\/p>\n\n\n\n
Good-case Latency of Byzantine Broadcast: a Complete Categorization
I. Abraham, K. Nayak, L. Ren, Z. Xiang<\/p>\n\n\n\n
Efficient Deterministic Leader Election for Programmable Matter
F. Dufoulon, S. Kutten, W. Moses Jr.<\/p>\n\n\n\n
Approximate Byzantine Fault-Tolerance in Distributed Optimization
S. Liu, N. Gupta, N. Vaidya<\/p>\n\n\n\n
Hedging Against Sore Loser Attacks in Cross-Chain Transactions
Y. Xue, M. Herlihy<\/p>\n\n\n\n
All You Need is DAG
I. Keidar, E. Kokoris-Kogias, O. Naor, A. Spiegelman<\/p>\n\n\n\n
Reductions and Extension-Based Proofs
K. Brusse, F. Ellen<\/p>\n\n\n\n
On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition
D. Harris, H. Su, H. Vu<\/p>\n\n\n\n
Can We Break Symmetry with o(m) Communication ?
S. Pai, G. Pandurangan, S. Pemmaraju, P. Robinson<\/p>\n\n\n\n
Separating Bounded and Unbounded Asynchrony for Autonomous Robots: Point Convergence with Limited Visibility
D. Kirkpatrick, I. Kostitsyna, A. Navarra, G. Prencipe, N. Santoro<\/p>\n\n\n\n
Contention Resolution with Predictions
S. Gilbert, C. Newport, N. Vaidya, A. Weaver<\/p>\n\n\n\n
Lower Bounds on the State Complexity of Population Protocols
P. Czerner, J. Esparza<\/p>\n\n\n\n
Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs
G. Bodwin, M. Parter<\/p>\n\n\n\n
Reaching Consensus for Asynchronous Distributed Key Generation
G. Stern, I. Abraham, P. Jovanovic, S. Meiklejohn, A. Tomescu, M. Maller<\/p>\n\n\n\n
Fast and Robust Comparison Dynamics in Population Protocols
D. Alistarh, M. T\u00f6pfer, P. Uzna\u0144ski<\/p>\n\n\n\n
On Implementing Stabilizing Leader Election with Weak Assumptions on Network Dynamics
K. Altisen, S. Devismes, A. Durand, C. Johnen, F. Petit<\/p>\n\n\n\n
Decision Power of Weak Asynchronous Models of Distributed Computing
P. Czerner, R. Guttenberg, M. Helfrich, J. Esparza<\/p>\n\n\n\n
Differential Privacy and Byzantine Resilience in SGD: Do They Add Up?
R. Guerraoui, N. Gupta, R. Pinot, S. Rouault, J. Stephan<\/p>\n\n\n\n
Tight Trade-off in Contention Resolution without Collision Detection
H. Chen, Y. Jiang, C. Zheng<\/p>\n\n\n\n
Search via Parallel L\u00e9vy Walks on Z^2
A. Clementi, F. d’Amore, G. Giakkoupis, E. Natale<\/p>\n\n\n\n
A Thin Self-Stabilizing Asynchronous Unison Algorithm with Applications to Fault Tolerant Biological Networks
Y. Emek, E. Keren<\/p>\n\n\n\n
Stochastic Coordination in Heterogeneous Load Balancing Systems
G. Goren, S. Vargaftik, Y. Moses<\/p>\n\n\n\n
Revisiting Optimal Resilience of Fast Byzantine Consensus
P. Kuznetsov, A. Tonkikh, Y. Zhang<\/p>\n\n\n\n
Low-Congestion Shortcuts in Constant Diameter Graphs
S. Kogan, M. Parter<\/p>\n\n\n\n
Constant-Round Spanners and Shortest Paths in Congested Clique and MPC
M. Dory, O. Fischer, S. Khoury, D. Leitersdorf<\/p>\n\n\n\n
Fault-Tolerant Labeling and Compact Routing Schemes
M. Dory, M. Parter<\/p>\n\n\n\n
Embedding a Deterministic BFT Protocol in a Block DAG
M. Schett, G. Danezis<\/p>\n\n\n\n
Randomized Local Computation Complexity of the Lov\u00e1sz Local Lemma
S. Brandt, C. Grunau, V. Rozhon<\/p>\n\n\n\n
Time-Optimal Construction of Overlay Networks
T. G\u00f6tte, K. Hinnenthal, C. Scheideler, J. Werthmann<\/p>\n\n\n\n
Strong-Diameter Network Decomposition
Y. Chang, M. Ghaffari<\/p>\n\n\n\n
Locally Checkable Problems in Rooted Trees
A. Balliu, S. Brandt, D. Olivetti, J. Studen\u00fd, J. Suomela, A. Tereshchenko<\/p>\n\n\n\n
Low-Congestion Shortcuts for Graphs Excluding Dense Minors
M. Ghaffari, B. Haeupler<\/p>\n\n\n\n
The Topology of Randomized Symmetry-Breaking Distributed Computing
P. Fraigniaud, R. Gelles, Z. Lotker<\/p>\n\n\n\n
A Tight Lower Bound for the RMR Complexity of Recoverable Mutual Exclusion
D. Chan, P. Woelfel<\/p>\n\n\n\n
An Efficient Adaptive Partial Snapshot Implementation
B. Bashari, P. Woelfel<\/p>\n\n\n\n
Diversity, Fairness and Sustainability in Population Protocols
N. Kang, F. Mallmann-Trenn, N. Rivera<\/p>\n\n\n\n
Improved Distributed Lower Bounds for MIS and Bounded (Out-)Degree Dominating Sets in Trees
A. Balliu, S. Brandt, F. Kuhn, D. Olivetti<\/p>\n\n\n\n
Improved Deterministic $(\\Delta+1)$ Coloring in Low-Space MPC
A. Czumaj, P. Davies, M. Parter<\/p>\n\n\n\n
Component Stability in Low-Space Massively Parallel Computation
A. Czumaj, P. Davies, M. Parter<\/p>\n\n\n\n
A New Way to Achieve Round-Efficient Byzantine Agreement
M. Fitzi, C. Liu-Zhang, J. Loss<\/p>\n\n\n\n
The Space Complexity of Scannable Binary Objects
S. Ovens<\/p>\n\n\n\n
On Register Linearizability and Termination
V. Hadzilacos, X. Hu, S. Toueg<\/p>\n\n\n\n
Ultra-Sparse Near-Additive Emulators
M. Elkin, S. Matar<\/p>\n\n\n\n
Brief Announcement: Be Prepared When Network Goes Bad: An Asynchronous View-Change Protocol
R. Gelashvili, L. Kokoris-Kogias, A. Spiegelman, Z. Xiang<\/p>\n\n\n\n
Brief Announcement: A Time and Space Optimal Stable Population Protocol Solving Exact Majority
D. Doty, M. Eftekhari, L. G\u0105sieniec, E. Severson, G. Stachowiak, P. Uzna\u0144ski<\/p>\n\n\n\n
Brief Announcement: An Improved Distributed Approximate Single Source Shortest Paths Algorithm
N. Cao, J. Fineman, K. Russell<\/p>\n\n\n\n
Brief Announcement: Classifying Trusted Hardware via Unidirectional Communication
N. Ben-David, K. Nayak<\/p>\n\n\n\n
Brief Announcement: Variants of approximate agreement on graphs and simplicial complexes
J. Ledent<\/p>\n\n\n\n
Brief Announcement: Making Synchronous BFT Protocols Secure in the Presence of Mobile Sluggish Faults
J. Kim, V. Mehta, K. Nayak, N. Shrestha<\/p>\n\n\n\n
Brief Announcement: A Randomness-efficient Massively Parallel Algorithm for Connectivity
M. Charikar, W. Ma, L. Tan<\/p>\n\n\n\n
Brief Announcement: Brokering with Hashed Timelock Contracts is NP-Hard
E. Chan, M. Lesani<\/p>\n\n\n\n
Brief Announcement: Detectable Sequential Specifications for Recoverable Shared Objects
N. Li, W. Golab<\/p>\n\n\n\n
Brief Announcement: Linearizability: a Typo
G. Sela, M. Herlihy, E. Petrank<\/p>\n\n\n\n
Brief Announcement: What’s Live? Understanding Distributed Consensus
S. Chand, Y. Liu<\/p>\n\n\n\n
Brief Announcement: On the Message Complexity of Fault-Tolerant Computation: Leader Election and Agreement
M. Kumar, A. Molla<\/p>\n\n\n\n
Brief Announcement: Wake Up and Join Me! An Energy Efficient Algorithm for Maximal Matching in Radio Networks
V. Dani, A. Gupta, T. Hayes, S. Pettie<\/p>\n\n\n\n
Brief Announcement: Malicious Security Comes for Free in Consensus with Leaders
M. Rambaud, T. Attema, M. Abspoel<\/p>\n","protected":false},"excerpt":{"rendered":"
Full Papers Breaking the $O(\\sqrt n)$-Bit Barrier: Byzantine Agreement with Polylog Bits Per PartyE. Boyle, R. Cohen, A. Goel Time-Optimal Self-Stabilizing Leader Election in Population ProtocolsJ. Burman, H. Chen, H. Chen, D. Doty, T. Nowak, E. Severson, C. Xu Good-case Latency of Byzantine Broadcast: a Complete CategorizationI. Abraham, K. Nayak, L. Ren, Z. Xiang Efficient … Continue reading “List of Accepted Papers”<\/span><\/a><\/p>\n","protected":false},"author":17,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-156","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/www.podc.org\/podc2021\/wp-json\/wp\/v2\/pages\/156","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.podc.org\/podc2021\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/www.podc.org\/podc2021\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/www.podc.org\/podc2021\/wp-json\/wp\/v2\/users\/17"}],"replies":[{"embeddable":true,"href":"https:\/\/www.podc.org\/podc2021\/wp-json\/wp\/v2\/comments?post=156"}],"version-history":[{"count":4,"href":"https:\/\/www.podc.org\/podc2021\/wp-json\/wp\/v2\/pages\/156\/revisions"}],"predecessor-version":[{"id":192,"href":"https:\/\/www.podc.org\/podc2021\/wp-json\/wp\/v2\/pages\/156\/revisions\/192"}],"wp:attachment":[{"href":"https:\/\/www.podc.org\/podc2021\/wp-json\/wp\/v2\/media?parent=156"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}