Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPODC 2020: Virtual Event, Italy
- Yuval Emek, Christian Cachin:
PODC '20: ACM Symposium on Principles of Distributed Computing, Virtual Event, Italy, August 3-7, 2020. ACM 2020, ISBN 978-1-4503-7582-5
Concurrency
- Sahil Dhoked
, Neeraj Mittal:
An Adaptive Approach to Recoverable Mutual Exclusion. 1-10 - Ohad Ben-Baruch, Danny Hendler, Matan Rusanovsky:
Upper and Lower Bounds on the Space Complexity of Detectable Objects. 11-20 - Matthieu Perrin, Achour Mostéfaoui, Grégoire Bonin:
Extending the Wait-free Hierarchy to Multi-Threaded Systems. 21-30 - Mirza Ahad Baig, Danny Hendler, Alessia Milani, Corentin Travers:
Long-Lived Snapshots with Polylogarithmic Amortized Step Complexity. 31-40 - Emmanuel Godard, Damien Imbs, Michel Raynal, Gadi Taubenfeld:
From Bezout's Identity to Space-Optimal Election in Anonymous Memory Systems. 41-50 - Hagit Attiya, Sweta Kumari, Archit Somani, Jennifer L. Welch:
Brief Announcement: Collect in the Presence of Continuous Churn with Application to Snapshots and Lattice Agreement. 51-53 - Dan Alistarh, James Aspnes, Faith Ellen, Rati Gelashvili, Leqi Zhu:
Brief Announcement: Why Extension-Based Proofs Fail. 54-56 - Stephen Dolan:
Brief Announcement: The Only Undoable CRDTs are Counters. 57-58
Graph algorithms I
- Michal Dory, Merav Parter:
Exponentially Faster Shortest Paths in the Congested Clique. 59-68 - Sebastian Brandt, Dennis Olivetti:
Truly Tight-in-Δ Bounds for Bipartite Maximal Matching and Variants. 69-78 - Sepehr Assadi, Gillat Kol, Rotem Oshman:
Lower Bounds for Distributed Sketching of Maximal Matchings and Maximal Independent Sets. 79-88 - Will Rosenbaum, Jukka Suomela:
Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems. 89-98 - Soumyottam Chatterjee, Robert Gmyr, Gopal Pandurangan:
Sleeping is Efficient: MIS in O(1)-rounds Node-averaged Awake Complexity. 99-108 - Fabian Kuhn, Philipp Schneider:
Computing Shortest Paths and Diameter in the Hybrid Network Model. 109-118 - Mohsen Ghaffari, Krzysztof Nowicki:
Massively Parallel Algorithms for Minimum Cut. 119-128
Consensus
- Yuan Lu, Zhenliang Lu, Qiang Tang, Guiling Wang:
Dumbo-MVBA: Optimal Multi-Valued Validated Asynchronous Byzantine Agreement, Revisited. 129-138 - Ittai Abraham, Danny Dolev, Gilad Stern:
Revisiting Asynchronous Fault Tolerant Computation with Optimal Resilience. 139-148 - Dimitris Sakavalas, Lewis Tseng, Nitin H. Vaidya:
Asynchronous Byzantine Approximate Consensus in Directed Networks. 149-158 - Mads Frederik Madsen, Søren Debois:
On the Subject of Non-Equivocation: Defining Non-Equivocation in Synchronous Agreement Systems. 159-168 - Ashish Choudhury:
Brief Announcement: Almost-surely Terminating Asynchronous Byzantine Agreement Protocols with a Constant Expected Running Time. 169-171 - Eli Goldweber, Nuda Zhang, Manos Kapritsos:
Brief Announcement: On the Significance of Consecutive Ballots in Paxos. 172-174 - Shir Cohen, Idit Keidar, Alexander Spiegelman:
Brief Announcement: Not a COINcidence: Sub-Quadratic Asynchronous Byzantine Agreement WHP. 175-177 - Pankaj Khanchandani, Roger Wattenhofer:
Brief Announcement: Byzantine Agreement with Unknown Participants and Failures. 178-180
Concurrency, self-* algorithms and more
- David Yu Cheng Chan, Philipp Woelfel:
Recoverable Mutual Exclusion with Constant Amortized RMR Complexity from Standard Primitives. 181-190 - Stav Ben-Nun, Tsvi Kopelowitz, Matan Kraus, Ely Porat:
An O(log3/2 n) Parallel Time Population Protocol for Majority with O(log n) States. 191-199 - Kaile Huang, Yu Huang, Hengfeng Wei:
Fine-grained Analysis on Fast Implementations of Distributed Multi-writer Atomic Registers. 200-209 - Hsueh-Ping Chen, Ho-Lin Chen:
Self-Stabilizing Leader Election in Regular Graphs. 210-217 - Petra Berenbrink, George Giakkoupis, Peter Kling:
Brief Announcement: Optimal Time and Space Leader Election in Population Protocols. 218-220 - Arik Rinberg, Idit Keidar:
Brief Announcement: Intermediate Value Linearizability: A Quantitative Correctness Criterion. 221-223 - Matthew Rodriguez, Michael F. Spear:
Brief Announcement: On Implementing Software Transactional Memory in the C++ Memory Model. 224-226 - Karine Altisen, Stéphane Devismes, Anaïs Durand, Colette Johnen, Franck Petit:
Brief Announcement: Self-stabilizing Systems in Spite of High Dynamics. 227-229 - Maged M. Michael:
Brief Announcement: Hazard Pointer Protection of Structures with Immutable Links. 230-232
Wireless protocols and graph models
- Magnús M. Halldórsson, Fabian Kuhn, Yannic Maus:
Distance-2 Coloring in the CONGEST Model. 233-242 - Philipp Bamberger, Fabian Kuhn, Yannic Maus:
Efficient Deterministic Distributed Coloring with Small Bandwidth. 243-252 - Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc:
Want to Gather? No Need to Chatter! 253-262 - Ali Pourmiri, Bernard Mans:
Tight Analysis of Asynchronous Rumor Spreading in Dynamic Networks. 263-272 - Yi-Jun Chang, Varsha Dani, Thomas P. Hayes, Seth Pettie:
The Energy Complexity of BFS in Radio Networks. 273-282 - Ken-ichi Kawarabayashi, Seri Khoury, Aaron Schild, Gregory Schwartzman:
Brief Announcement: Improved Distributed Approximations for Maximum-Weight Independent Set. 283-285 - Haimin Chen, Chaodong Zheng:
Brief Announcement: Resource Competitive Broadcast against Adaptive Adversary in Multi-channel Radio Networks. 286-288
Graph algorithms II
- Alkida Balliu, Fabian Kuhn, Dennis Olivetti:
Distributed Edge Coloring in Time Quasi-Polylogarithmic in Delta. 289-298 - Alkida Balliu, Sebastian Brandt, Dennis Olivetti, Jukka Suomela:
How much does randomness help with locally checkable problems? 299-308 - Artur Czumaj, Peter Davies, Merav Parter:
Simple, Deterministic, Constant-Round Coloring in the Congested Clique. 309-318 - Laurent Feuilloley, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Éric Rémila, Ioan Todinca:
Compact Distributed Certification of Planar Graphs. 319-328 - Sebastian Brandt, Christoph Grunau, Václav Rozhon:
Generalizing the Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local Lemma. 329-338 - Manoj Gupta, Rahul Jain, Nitiksha Modi:
Multiple Source Replacement Path Problem. 339-348 - Alkida Balliu, Sebastian Brandt, Yuval Efron, Juho Hirvonen, Yannic Maus, Dennis Olivetti, Jukka Suomela:
Brief Announcement: Classification of Distributed Binary Labeling Problems. 349-351 - Dennis Olivetti:
Brief Announcement: Round eliminator: a tool for automatic speedup simulation. 352-354
Byzantine attacks and consensus
- El-Mahdi El-Mhamdi, Rachid Guerraoui, Arsany Guirguis, Lê Nguyên Hoang, Sébastien Rouault:
Genuinely Distributed Byzantine Machine Learning. 355-364 - Nirupam Gupta, Nitin H. Vaidya:
Fault-Tolerance in Distributed Optimization: The Case of Redundancy. 365-374 - Yoram Moses, Nitzan Zamir:
Probably Approximately Knowing. 375-384 - Gregor Bankhamer, Robert Elsässer, Dominik Kaaser, Matjaz Krnc:
Positive Aging Admits Fast Asynchronous Plurality Consensus. 385-394 - Adam Shimi, Armando Castañeda:
K-set agreement bounds in round-based models through combinatorial topology. 395-404 - Guy Goren, Yoram Moses:
Brief Announcement: On Using Null Messages in a Byzantine Setting. 405-407
Coordination
- Fabien Dufoulon, Janna Burman, Joffroy Beauquier:
Can Uncoordinated Beeps tell Stories? 408-417 - Klim Efremenko, Gillat Kol, Raghuvansh R. Saxena:
Noisy Beeps. 418-427 - Yifan Mao, Soubhik Deb, Shaileshh Bojja Venkatakrishnan, Sreeram Kannan, Kannan Srinivasan:
Perigee: Efficient Peer-to-Peer Network Design for Blockchains. 428-437 - Seth Gilbert, Gopal Pandurangan, Peter Robinson, Amitabh Trehan:
DConstructor: Efficient and Robust Network Construction with Polylogarithmic Overhead. 438-447 - Othon Michail, George Skretas, Paul G. Spirakis:
Distributed Computation and Reconfiguration in Actively Dynamic Networks. 448-457 - Yagel Ashkenazi, Ran Gelles, Amir Leshem:
Brief Announcement: Noisy Beeping Networks. 458-460 - Maciej Pacut, Mahmoud Parham, Stefan Schmid:
Brief Announcement: Deterministic Lower Bound for Dynamic Balanced Graph Partitioning. 461-463
Graph algorithms and CONGEST model
- Shiri Chechik, Doron Mukhtar:
Single-Source Shortest Paths in the CONGEST Model with Improved Bound. 464-473 - Keren Censor-Hillel, François Le Gall, Dean Leitersdorf:
On Distributed Listing of Cliques. 474-482 - Michael Elkin, Arnold Filtser, Ofer Neiman:
Distributed Construction of Light Networks. 483-492 - Michael Dinitz, Caleb Robelle:
Efficient and Simple Algorithms for Fault-Tolerant Spanners. 493-500 - Reuven Bar-Yehuda, Keren Censor-Hillel, Yannic Maus, Shreyas Pai, Sriram V. Pemmaraju:
Distributed Approximation on Power Graphs. 501-510 - Yuval Efron, Ofer Grossman, Seri Khoury:
Beyond Alice and Bob: Improved Inapproximability for Maximum Independent Set in CONGEST. 511-520
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-08-15 23:33 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:
