Cover Image

Selective Population Protocols

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Gańczorz, Adam, Gąsieniec, Leszek, Jurdziński, Tomasz, Kowalski, Jakub, Stachowiak, Grzegorz
Format:	Preprint
Published:	2023
Subjects:	Distributed, Parallel, and Cluster Computing Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Population Protocols Revisited: Parity and Beyond
by: Gąsieniec, Leszek, et al.
Published: (2025)

Improving Efficiency in Near-State and State-Optimal Self-Stabilising Leader Election Population Protocols
by: Gąsieniec, Leszek, et al.
Published: (2025)

Optimal-Length Labeling Schemes for Fast Deterministic Communication in Radio Networks
by: Gańczorz, Adam, et al.
Published: (2024)

A Simple and Robust Protocol for Distributed Counting
by: Cohen, Edith, et al.
Published: (2025)

Parallel Set Cover and Hypergraph Matching via Uniform Random Sampling
by: Dhulipala, Laxman, et al.
Published: (2024)

Parallel Batch Dynamic Vertex Coloring in $O(\log Δ)$ Amortized Update Time
by: Hutton, Chase, et al.
Published: (2025)

Encoding Schemes for Parallel In-Place Algorithms
by: Hutton, Chase, et al.
Published: (2025)

Anonymous Self-Stabilising Localisation via Spatial Population Protocols
by: Gąsieniec, Leszek, et al.
Published: (2024)

The Online Pause and Resume Problem: Optimal Algorithms and An Application to Carbon-Aware Load Shifting
by: Lechowicz, Adam, et al.
Published: (2023)

Towards Scalable and Practical Batch-Dynamic Connectivity
by: De Man, Quinten, et al.
Published: (2024)

Nearly-Optimal Consensus Tolerating Adaptive Omissions: Why is a Lot of Randomness Needed?
by: Hajiaghayi, Mohammad T., et al.
Published: (2024)

Optimal-Length Labeling Schemes and Fast Algorithms for k-gathering and k-broadcasting
by: Ganczorz, Adam, et al.
Published: (2025)

Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications
by: Chang, Yi-Jun
Published: (2023)

DAG-Inducing Problems and Algorithms
by: Gupta, Arya Tanmay, et al.
Published: (2023)

Parallel Algorithms for Hierarchical Nucleus Decomposition
by: Shi, Jessica, et al.
Published: (2023)

The Art of the Fugue: Minimizing Interleaving in Collaborative Text Editing
by: Weidner, Matthew, et al.
Published: (2023)

Improved Approximation Bounds for Minimum Weight Cycle in the CONGEST Model
by: Manoharan, Vignesh, et al.
Published: (2023)

A Tight Lower Bound for 3-Coloring Grids in the Online-LOCAL Model
by: Chang, Yi-Jun, et al.
Published: (2023)

Parallel, Distributed, and Quantum Exact Single-Source Shortest Paths with Negative Edge Weights
by: Ashvinkumar, Vikrant, et al.
Published: (2023)

Eventually Lattice-Linear Algorithms
by: Gupta, Arya Tanmay, et al.
Published: (2023)

Fully Scalable MPC Algorithms for Clustering in High Dimension
by: Czumaj, Artur, et al.
Published: (2023)

A Simple $(1-ε)$-Approximation Semi-Streaming Algorithm for Maximum (Weighted) Matching
by: Assadi, Sepehr
Published: (2023)

A Distributed Conductance Tester Without Global Information Collection
by: Batu, Tugkan, et al.
Published: (2023)

Universally Optimal Information Dissemination and Shortest Paths in the HYBRID Distributed Model
by: Chang, Yi-Jun, et al.
Published: (2023)

Fast and Space-Efficient Parallel Algorithms for Influence Maximization
by: Wang, Letong, et al.
Published: (2023)

Near-Optimal Fault Tolerance for Efficient Batch Matrix Multiplication via an Additive Combinatorics Lens
by: Censor-Hillel, Keren, et al.
Published: (2023)

Efficient Dynamic MaxFlow Computation on GPUs
by: Kannappan, Shruthi, et al.
Published: (2025)

Informative Trains: A Memory-Efficient Journey to a Self-Stabilizing Leader Election Algorithm in Anonymous Graphs
by: Blin, Lelia, et al.
Published: (2026)

Towards Optimal Distributed Edge Coloring with Fewer Colors
by: Jakob, Manuel, et al.
Published: (2025)

Perfect Matching with Few Link Activations
by: Mirault, Hugo, et al.
Published: (2025)

Towards True Work-Efficiency in Parallel Derandomization: MIS, Maximal Matching, and Hitting Set
by: Ghaffari, Mohsen, et al.
Published: (2025)

Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling
by: Feist, Dankrad, et al.
Published: (2025)

Designing Parallel Algorithms for Community Detection using Arachne
by: Li, Fuhuan, et al.
Published: (2025)

New Distributed Interactive Proofs for Planarity: A Matter of Left and Right
by: Gil, Yuval, et al.
Published: (2025)

Narrowing the LOCAL$\unicode{x2013}$CONGEST Gaps in Sparse Networks via Expander Decompositions
by: Chang, Yi-Jun, et al.
Published: (2022)

WarpSpeed: A High-Performance Library for Concurrent GPU Hash Tables
by: McCoy, Hunter, et al.
Published: (2025)

Improved All-Pairs Approximate Shortest Paths in Congested Clique
by: Bui, Hong Duc, et al.
Published: (2024)

A Scalable and Unified Framework to Weighted Rank Aggregation
by: Carmel, Amir, et al.
Published: (2026)

FractalSortCPU: Bandwidth-Efficient Compressed Radix Sort on CPU
by: Dang'ana, Michael
Published: (2026)

Distributed Santa Claus via Global Rounding
by: de Vos, Tijn, et al.
Published: (2026)