Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPODC 2023: Orlando, FL, USA
- Rotem Oshman, Alexandre Nolin, Magnús M. Halldórsson, Alkida Balliu:
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, PODC 2023, Orlando, FL, USA, June 19-23, 2023. ACM 2023
Keynote
- Roger Wattenhofer
:
From Distributed Algorithms to Machine Learning and Back. 1
Dynamics
- Daisuke Yokota, Yuichi Sudo, Fukuhito Ooshita, Toshimitsu Masuzawa:
A Near Time-optimal Population Protocol for Self-stabilizing Leader Election on Rings with a Poly-logarithmic Number of States. 2-12 - Talley Amir, James Aspnes, Petra Berenbrink, Felix Biermeier, Christopher Hahn, Dominik Kaaser, John Lazarsfeld:
Fast Convergence of k-Opinion Undecided State Dynamics in the Population Protocol Model. 13-23 - Romain Cosson, Laurent Massoulié, Laurent Viennot:
Brief Announcement: Efficient Collaborative Tree Exploration with Breadth-First Depth-Next. 24-27 - Philipp Czerner:
Brief Announcement: Population Protocols Decide Double-exponential Thresholds. 28-31
Distributed Approximations
- Yi-Jun Chang, Zeyong Li:
The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs. 32-43 - Shang-En Huang, Hsin-Hao Su:
(1-ϵ)-Approximate Maximum Weighted Matching in poly(1/ϵ, log n) Time in the Distributed and Parallel Settings. 44-54 - Yi-Jun Chang:
Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications. 55-66 - Jinfeng Dou, Thorsten Götte, Henning Hillebrandt, Christian Scheideler, Julian Werthmann:
Brief Announcement: Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs. 67-70 - Tijn de Vos:
Brief Announcement: Minimum Cost Maximum Flow in the CONGEST Model. 71-74 - Sebastian Forster, Tijn de Vos:
Brief Announcement: The Laplacian Paradigm in Deterministic Congested Clique. 75-78
Data Structures
- David Yu Cheng Chan, George Giakkoupis, Philipp Woelfel:
Word-Size RMR Tradeoffs for Recoverable Mutual Exclusion. 79-89 - Armando Castañeda, Gilde Valeria Rodríguez:
Asynchronous Wait-Free Runtime Verification and Enforcement of Linearizability. 90-101 - Gali Sheffi, Erez Petrank:
The ERA Theorem for Safe Memory Reclamation. 102-112 - Benyamin Bashari, Ali Jamadi, Philipp Woelfel:
Efficient Bounded Timestamping from Standard Synchronization Primitives. 113-123 - Hossein Naderibeni, Eric Ruppert:
A Wait-free Queue with Polylogarithmic Step Complexity. 124-134
Symmetry Breaking
- Fabien Dufoulon, William K. Moses Jr., Gopal Pandurangan:
Distributed MIS in O(log log n) Awake Complexity. 135-145 - Mohsen Ghaffari, Julian Portmann:
Distributed MIS with Low Energy and Time Complexities. 146-156 - Yannic Maus, Saku Peltonen, Jara Uitto:
Distributed Symmetry Breaking on Power Graphs via Sparsification. 157-167 - Peter Robinson:
Brief Announcement: What Can We Compute in a Single Round of the Congested Clique? 168-171 - Akanksha Agrawal, John Augustine, David Peleg, Srikkanth Ramachandran:
Brief Announcement: Local Problems in the SUPPORTED Model. 172-175 - Giuseppe Antonio Di Luna, Giovanni Viglietta:
Brief Announcement: Efficient Computation in Congested Anonymous Dynamic Networks. 176-179
Networks
- Mohsen Ghaffari, Anton Trygub:
A Near-Optimal Deterministic Distributed Synchronizer. 180-189 - Taisuke Izumi, Yuval Emek, Tadashi Wadayama, Toshimitsu Masuzawa:
Deterministic Fault-Tolerant Connectivity Labeling Scheme. 190-199 - Myrto Arapinis, Ábel Kocsis, Nikolaos Lamprou, Liam Medley, Thomas Zacharias:
Universally Composable Simultaneous Broadcast against a Dishonest Majority and Applications. 200-210 - Petra Berenbrink, Colin Cooper, Cristina Gava, David Kohan Marzagão, Frederik Mallmann-Trenn, Tomasz Radzik, Nicolas Rivera:
Distributed Averaging in Opinion Dynamics. 211-221 - Goran Zuzic, Bernhard Haeupler, Antti Roeyskoe:
Sparse Semi-Oblivious Routing: Few Random Paths Suffice. 222-232
Byzantine Agreement
- Neil Giridharan, Florian Suri-Payer, Matthew Ding, Heidi Howard, Ittai Abraham, Natacha Crooks:
BeeGees: Stayin' Alive in Chained BFT. 233-243 - Kaya Alpturer, Joseph Y. Halpern, Ron van der Meyden:
Optimal Eventual Byzantine Agreement Protocols with Omission Failures. 244-252 - Jun Wan, Atsuki Momose, Ling Ren, Elaine Shi, Zhuolun Xiang:
On the Amortized Communication Complexity of Byzantine Broadcast. 253-261 - Orr Fischer, Merav Parter:
Distributed CONGEST Algorithms against Mobile Adversaries. 262-273 - Rida A. Bazzi, Sara Tucci Piergiovanni:
Brief Announcement: Breaking the f + 1 Barrier: Executing Payment Transactions in Parallel with Less than f + 1 Validations. 274-277 - Colin Cooper, Tomasz Radzik, Takeharu Shiraga:
Brief Announcement: Discrete Incremental Voting. 278-281 - Mathilde Déprés, Achour Mostéfaoui, Matthieu Perrin, Michel Raynal:
Brief Announcement: The MBroadcast Abstraction. 282-285 - MohammadTaghi Hajiaghayi, Dariusz Rafal Kowalski, Jan Olkowski:
Brief Announcement: Improved Consensus in Quantum Networks. 286-289
Wireless
- Peter Davies:
Uniting General-Graph and Geometric-Based Radio Networks via Independence Number Parametrization. 290-299 - Peter Davies:
Optimal Message-Passing with Noisy Beeps. 300-309 - George Giakkoupis, Isabella Ziccardi:
Distributed Self-Stabilizing MIS with Few States and Weak Communication. 310-320 - Tobias Friedrich, Hans Gawendowicz, Pascal Lenzner, Arthur Zahn:
The Impact of Cooperation in Bilateral Network Creation. 321-331
Complexity/Impossibility
- Pierre Civit, Seth Gilbert, Rachid Guerraoui, Jovan Komatovic, Manuel Vidigueira:
On the Validity of Consensus. 332-343 - Bogdan S. Chlebus, Dariusz Rafal Kowalski, Jan Olkowski:
Deterministic Fault-Tolerant Distributed Computing in Linear Time and Communication. 344-354 - Shay Kutten, Peter Robinson, Ming Ming Tan, Xianbin Zhu:
Improved Tradeoffs for Leader Election. 355-365 - Prasad Jayanti, Siddhartha Visveswara Jayanti, Sucharita Jayanti:
Brief Announcement: Efficient Recoverable Writable-CAS. 366-369 - Anh Tran, Edward Talmage:
Brief Announcement: Improved, Partially-Tight Multiplicity Queue Lower Bounds. 370-373 - Viveck R. Cadambe, Shihang Lyu:
Brief Announcement: CausalEC: A Causally Consistent Data Storage Algorithm based on Cross-Object Erasure Coding. 374-377
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-26 18:39 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
