Cover Image

Memory Lower Bounds and Impossibility Results for Anonymous Dynamic Broadcast

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Parzych, Garrett, Daymude, Joshua J.
Format:	Preprint
Published:	2024
Subjects:	Distributed, Parallel, and Cluster Computing
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Adaptive Self-Organization in Anonymous Dynamic Networks
by: Parzych, Garrett, et al.
Published: (2026)

On the Runtime of Local Mutual Exclusion for Anonymous Dynamic Networks
by: Chaturvedi, Anya, et al.
Published: (2025)

Circumventing the FLP Impossibility Result with Open Atomic Ethernet
by: Borrill, Paul
Published: (2026)

Dynamic Probabilistic Reliable Broadcast
by: Anikina, Veronika, et al.
Published: (2023)

A Simple Lower Bound for Set Agreement in Dynamic Networks
by: Fraigniaud, Pierre, et al.
Published: (2025)

Optimal Broadcast Schedules in Logarithmic Time with Applications to Broadcast, All-Broadcast, Reduction and All-Reduction
by: Träff, Jesper Larsson
Published: (2024)

Fault-tolerant Consensus in Anonymous Dynamic Network
by: Zhang, Qinzi, et al.
Published: (2024)

Synchronization in Anonymous Networks Under Arbitrary Dynamics
by: Bazzi, Rida, et al.
Published: (2025)

Different Perspectives on FLP Impossibility
by: Klianev, Ivan
Published: (2022)

Understanding Read-Write Wait-Free Coverings in the Fully-Anonymous Shared-Memory Model
by: Losa, Giuliano, et al.
Published: (2024)

Towards Fully Automatic Distributed Lower Bounds
by: Balliu, Alkida, et al.
Published: (2024)

Tight Lower Bounds in the Supported LOCAL Model
by: Balliu, Alkida, et al.
Published: (2024)

Revisiting Lower Bounds for Two-Step Consensus
by: Ryabinin, Fedor, et al.
Published: (2025)

An Almost Tight Lower Bound for Plurality Consensus with Undecided State Dynamics in the Population Protocol Model
by: El-Hayek, Antoine, et al.
Published: (2025)

Pending Conflicts Make Progress Impossible
by: Kuznetsov, Petr, et al.
Published: (2026)

BCM-Broadcast: A Byzantine-Tolerant Causal Broadcast Algorithm for Distributed Mobile Systems
by: NamvariTazehkand, Leila, et al.
Published: (2024)

Broadcast in Almost Mixing Time
by: Paramonov, Anton, et al.
Published: (2025)

Universal Finite-State and Self-Stabilizing Computation in Anonymous Dynamic Networks
by: Di Luna, Giuseppe A., et al.
Published: (2024)

Fast Byzantine Total Order Broadcast
by: Monti, Matteo, et al.
Published: (2024)

Broadcasting on Adversarial Multiple Access Channels
by: Aldawsari, Bader A., et al.
Published: (2021)

Communication Lower Bounds and Optimal Algorithms for Symmetric Matrix Computations
by: Daas, Hussam Al, et al.
Published: (2024)

Lower Bounds for $k$-Set Agreement in Fault-Prone Networks
by: Fraigniaud, Pierre, et al.
Published: (2025)

Communication Lower Bounds and Algorithms for Sketching with Random Dense Matrices
by: Daas, Hussam Al, et al.
Published: (2026)

Slim-ABC: An Optimized Atomic Broadcast Protocol
by: Sony, Nasit S, et al.
Published: (2024)

A Post-Quantum Lower Bound for the Distributed Lovász Local Lemma
by: Brandt, Sebastian, et al.
Published: (2025)

Snow: Self-organizing Broadcast Protocol for Cloud
by: Tong, Chengkai
Published: (2025)

Clock Synchronization Is Almost Impossible with Bounded Memory
by: Charron-Bost, Bernadette, et al.
Published: (2024)

Vertical Atomic Broadcast and Passive Replication (Extended Version)
by: Bravo, Manuel, et al.
Published: (2024)

Byzantine Reliable Broadcast with Low Communication and Time Complexity
by: Locher, Thomas
Published: (2024)

Asynchrony-Resilient Sleepy Total-Order Broadcast Protocols
by: D'Amato, Francesco, et al.
Published: (2023)

Amortized Asynchronous Byzantine Reliable Broadcast with Optimal Resilience
by: Hu, Michael Yiqing, et al.
Published: (2026)

Optimistic, Signature-Free Reliable Broadcast and Its Applications
by: Shrestha, Nibesh, et al.
Published: (2025)

Gathering Teams of Bounded Memory Agents on a Line
by: Gao, Younan, et al.
Published: (2025)

Space-Time Trade-off in Bounded Iterated Memory
by: Toyos-Marfurt, Guillermo, et al.
Published: (2025)

Network-Offloaded Bandwidth-Optimal Broadcast and Allgather for Distributed AI
by: Khalilov, Mikhail, et al.
Published: (2024)

Round-optimal $n$-Block Broadcast Schedules in Logarithmic Time
by: Träff, Jesper Larsson
Published: (2023)

Beyond 2-Edge-Connectivity: Algorithms and Impossibility for Content-Oblivious Leader Election
by: Chang, Yi-Jun, et al.
Published: (2025)

PilotANN: Memory-Bounded GPU Acceleration for Vector Search
by: Gui, Yuntao, et al.
Published: (2025)

Deterministic Collision-Free Exploration of Unknown Anonymous Graphs
by: Bhagat, Subhash, et al.
Published: (2024)

Tame the Wild with Byzantine Linearizability: Reliable Broadcast, Snapshots, and Asset Transfer
by: Cohen, Shir, et al.
Published: (2021)