default search action
38th DISC 2024: Madrid, Spain
- Dan Alistarh
:
38th International Symposium on Distributed Computing, DISC 2024, October 28 to November 1, 2024, Madrid, Spain. LIPIcs 319, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2024, ISBN 978-3-95977-352-2 - Front Matter, Table of Contents, Preface, Conference Organization. 0:i-0:xx
- Eden Aldema Tshuva, Rotem Oshman:
Fully Local Succinct Distributed Arguments. 1:1-1:24 - Kaya Alpturer, Joseph Y. Halpern, Ron van der Meyden:
A Knowledge-Based Analysis of Intersection Protocols. 2:1-2:17 - John Augustine, Jeffin Biju, Shachar Meir, David Peleg, Srikkanth Ramachandran, Aishwarya Thiruvengadam:
Byzantine Resilient Distributed Computing on External Data. 3:1-3:23 - Sirui Bai, Xinyu Fu, Xudong Wu, Penghui Yao, Chaodong Zheng:
Almost Optimal Algorithms for Token Collision in Anonymous Networks. 4:1-4:20 - Alkida Balliu, Pierre Fraigniaud, Patrick Lambein-Monette, Dennis Olivetti, Mikaël Rabie:
Asynchronous Fault-Tolerant Distributed Proper Coloring of Graphs. 5:1-5:20 - Leonid Barenboim, Uri Goldenberg:
Speedup of Distributed Algorithms for Power Graphs in the CONGEST Model. 6:1-6:23 - Benyamin Bashari, David Yu Cheng Chan, Philipp Woelfel:
A Fully Concurrent Adaptive Snapshot Object for RMWable Shared-Memory. 7:1-7:22 - Yoav Ben Shimon, Ori Lahav, Sharon Shoham:
Hyperproperty-Preserving Register Specifications. 8:1-8:19 - Nicolas Bonichon, Arnaud Casteigts, Cyril Gavoille, Nicolas Hanusse:
Freeze-Tag in L₁ Has Wake-Up Time Five with Linear Complexity. 9:1-9:16 - Manuel Bravo, Gregory V. Chockler, Alexey Gotsman, Alejandro Naser-Pastoriza, Christian Roldán:
Vertical Atomic Broadcast and Passive Replication. 10:1-10:19 - Armando Castañeda, Gregory V. Chockler, Brijesh Dongol, Ori Lahav:
What Cannot Be Implemented on Weak Memory? 11:1-11:22 - Keren Censor-Hillel, Tomer Even, Virginia Vassilevska Williams:
Faster Cycle Detection in the Congested Clique. 12:1-12:18 - Jérémie Chalopin, Shantanu Das, Maria Kokkou:
Deterministic Self-Stabilising Leader Election for Programmable Matter with Constant Memory. 13:1-13:17 - Pierre Civit, Muhammad Ayaz Dzulfikar, Seth Gilbert, Rachid Guerraoui, Jovan Komatovic, Manuel Vidigueira, Igor Zablotchi:
Efficient Signature-Free Validated Agreement. 14:1-14:23 - Andrei Constantinescu, Diana Ghinea, Roger Wattenhofer, Floris Westermann:
Convex Consensus with Asynchronous Fallback. 15:1-15:23 - Yannis Coutouly, Emmanuel Godard:
A Simple Computability Theorem for Colorless Tasks in Submodels of the Iterated Immediate Snapshot. 16:1-16:22 - Philipp Czerner:
Breaking Through the Ω(n)-Space Barrier: Population Protocols Decide Double-Exponential Thresholds. 17:1-17:18 - Niccolò D'Archivio, Robin Vacus:
On the Limits of Information Spread by Memory-Less Agents. 18:1-18:21 - Laxman Dhulipala, Michael Dinitz, Jakub Lacki, Slobodan Mitrovic:
Parallel Set Cover and Hypergraph Matching via Uniform Random Sampling. 19:1-19:23 - David Doty, Ben Heckmann:
The Computational Power of Discrete Chemical Reaction Networks with Bounded Executions. 20:1-20:15 - Antoine El-Hayek, Monika Henzinger, Stefan Schmid:
Broadcast and Consensus in Stochastic Dynamic Networks with Byzantine Nodes and Adversarial Edges. 21:1-21:15 - Yuval Emek, Yuval Gil, Noga Harlev:
On the Power of Graphical Reconfigurable Circuits. 22:1-22:16 - Panagiota Fatourou, Eric Ruppert:
Lock-Free Augmented Trees. 23:1-23:24 - Maxime Flin, Magnús M. Halldórsson, Alexandre Nolin:
Decentralized Distributed Graph Coloring II: Degree+1-Coloring Virtual Graphs. 24:1-24:22 - Fedor V. Fomin, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca:
Distributed Model Checking on Graphs of Bounded Treedepth. 25:1-25:20 - Fabian Frei, Ran Gelles, Ahmed Ghazy, Alexandre Nolin:
Content-Oblivious Leader Election on Rings. 26:1-26:20 - Ran Gelles, Zvi Lotker, Frederik Mallmann-Trenn:
Sorting in One and Two Rounds Using t-Comparators. 27:1-27:20 - George Giakkoupis, Volker Turau, Isabella Ziccardi:
Self-Stabilizing MIS Computation in the Beeping Model. 28:1-28:21 - Jeff Giliberti, Zahra Parsaeian:
Massively Parallel Ruling Set Made Deterministic. 29:1-29:21 - Neil Giridharan, Ittai Abraham, Natacha Crooks, Kartik Nayak, Ling Ren:
Granular Synchrony. 30:1-30:22 - Magnús M. Halldórsson, Yannic Maus:
Distributed Delta-Coloring Under Bandwidth Limitations. 31:1-31:22 - Longcheng Li, Xiaoming Sun, Jiadong Zhu:
Quantum Byzantine Agreement Against Full-Information Adversary. 32:1-32:22 - Raïssa Nataf, Yoram Moses:
Communication Requirements for Linearizable Registers. 33:1-33:17 - Shunhao Oh, Joseph L. Briones, Jacob Calvert, Noah Egan, Dana Randall, Andréa W. Richa:
Single Bridge Formation in Self-Organizing Particle Systems. 34:1-34:22 - Garrett Parzych, Joshua J. Daymude:
Memory Lower Bounds and Impossibility Results for Anonymous Dynamic Broadcast. 35:1-35:18 - Asaf Petruschka, Shay Spair, Elad Tzalik:
Connectivity Labeling in Faulty Colored Graphs. 36:1-36:22 - Victor Shoup:
Sing a Song of Simplex. 37:1-37:22 - Yuichi Sudo, Masahiro Shibata, Junya Nakamura, Yonghwan Kim, Toshimitsu Masuzawa:
Near-Linear Time Dispersion of Mobile Agents. 38:1-38:22 - Qinzi Zhang, Lewis Tseng:
The Power of Abstract MAC Layer: A Fault-Tolerance Perspective. 39:1-39:22 - Yaseen Abd-Elhaleem, Michal Dory, Merav Parter, Oren Weimann:
Brief Announcement: Distributed Maximum Flow in Planar Graphs. 40:1-40:8 - Timothé Albouy, Davide Frey, Ran Gelles, Carmit Hazay, Michel Raynal, Elad Michael Schiller, François Taïani, Vassilis Zikas:
Brief Announcement: Towards Optimal Communication Byzantine Reliable Broadcast Under a Message Adversary. 41:1-41:7 - Hagit Attiya, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum:
Brief Announcement: Solvability of Three-Process General Tasks. 42:1-42:7 - Andrei Constantinescu, Diana Ghinea, Jakub Sliwinski, Roger Wattenhofer:
Brief Announcement: Unifying Partial Synchrony. 43:1-43:7 - Philipp Czerner, Vincent Fischer, Roland Guttenberg:
Brief Announcement: The Expressive Power of Uniform Population Protocols with Logarithmic Space. 44:1-44:7 - Lei Fan, Jonathan Katz, Zhenghao Lu, Phuc Thai, Hong-Sheng Zhou:
Brief Announcement: Best-Possible Unpredictable Proof-Of-Stake. 45:1-45:7 - Caterina Feletti, Debasish Pattanayak, Gokarna Sharma:
Brief Announcement: Optimal Uniform Circle Formation by Asynchronous Luminous Robots. 46:1-46:7 - Pierre Fraigniaud, Minh-Hang Nguyen, Ami Paz:
Brief Announcement: Agreement Tasks in Fault-Prone Synchronous Networks of Arbitrary Structures. 47:1-47:5 - Fabian Frei, Koichi Wada:
Brief Announcement: Distinct Gathering Under Round Robin. 48:1-48:8 - Jan Matyás Kristan, Josef Erik Sedlácek:
Brief Announcement: Decreasing Verification Radius in Local Certification. 49:1-49:6 - Ajay D. Kshemkalyani, Manish Kumar, Anisur Rahaman Molla, Gokarna Sharma:
Brief Announcement: Agent-Based Leader Election, MST, and Beyond. 50:1-50:7 - Christoph Lenzen, Shreyas Srinivas:
Brief Announcement: Clock Distribution with Gradient TRIX. 51:1-51:7 - Xiao Li, Mohsen Lesani:
Brief Announcement: Reconfigurable Heterogeneous Quorum Systems. 52:1-52:8 - Gal Sela, Erez Petrank:
Brief Announcement: Concurrent Aggregate Queries. 53:1-53:7 - Yusong Shi, Weidong Liu:
Brief Announcement: Colorless Tasks and Extension-Based Proofs. 54:1-54:6 - Yuichi Sudo, Fukuhito Ooshita, Sayaka Kamei:
Brief Announcement: Self-Stabilizing Graph Exploration by a Single Agent. 55:1-55:7
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 2025-01-26 23:56 CET 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: