Cover Image

Energy-Efficient Maximal Independent Sets in Radio Networks

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Banasik, Dominick, Dani, Varsha, Dufoulon, Fabien, Gupta, Aayush, Hayes, Thomas P., Pandurangan, Gopal
Format:	Preprint
Published:	2025
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

Improved Byzantine Agreement under an Adaptive Adversary
by: Dufoulon, Fabien, et al.
Published: (2025)

Fully-Distributed Byzantine Agreement in Sparse Networks
by: Augustine, John, et al.
Published: (2024)

Quantum Communication Advantage for Leader Election and Agreement
by: Dufoulon, Fabien, et al.
Published: (2025)

Message Optimality and Message-Time Trade-offs for APSP and Beyond
by: Dufoulon, Fabien, et al.
Published: (2025)

Low-Distortion Clustering in Bounded Growth Graphs
by: Chang, Yi-Jun, et al.
Published: (2024)

Fast Gossip-based Rumor Spreading using Small Messages
by: Dufoulon, Fabien, et al.
Published: (2026)

Parallel Batch-Dynamic Maximal Independent Set
by: Blelloch, Guy, et al.
Published: (2026)

TC-MIS: Maximal Independent Set on Tensor-cores
by: Nijhara, Prajjwal, et al.
Published: (2026)

Energy-Efficient Aggregation and Minimum-Degree Spanning Trees in Radio Networks
by: Chang, Yi-Jun, et al.
Published: (2026)

Distributed Reductions for the Maximum Weight Independent Set Problem
by: Borowitz, Jannick, et al.
Published: (2025)

Dynamic Maximal Matching in Clique Networks
by: Li, Minming, et al.
Published: (2024)

Efficient Enumeration of Large Maximal k-Plexes
by: Cheng, Qihao, et al.
Published: (2024)

Improved Deterministic Distributed Maximum Weight Independent Set Approximation in Sparse Graphs
by: Gil, Yuval
Published: (2024)

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

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

Parallel Dynamic Maximal Matching
by: Ghaffari, Mohsen, et al.
Published: (2024)

Time-Optimal and Energy-Efficient Deterministic Consensus
by: Meir, Shachar, et al.
Published: (2025)

Near-Optimal Deterministic Network Decomposition and Ruling Set, and Improved MIS
by: Ghaffari, Mohsen, et al.
Published: (2024)

History-Independent Concurrent Hash Tables
by: Attiya, Hagit, et al.
Published: (2025)

MTASet: A Tree-based Set for Efficient Range Queries in Update-heavy Workloads
by: Manor, Daniel, et al.
Published: (2025)

GreedyML: A Parallel Algorithm for Maximizing Constrained Submodular Functions
by: Gopal, Shivaram, et al.
Published: (2024)

When MIS and Maximal Matching are Easy in the Congested Clique
by: Censor-Hillel, Keren, et al.
Published: (2025)

Enhancing Scalability and Performance in Influence Maximization with Optimized Parallel Processing
by: Wu, Hanjiang, et al.
Published: (2024)

Parallel Batch-Dynamic Maximal Matching with Constant Work per Update
by: Blelloch, Guy E., et al.
Published: (2025)

Round Elimination via Self-Reduction: Closing Gaps for Distributed Maximal Matching
by: Khoury, Seri, et al.
Published: (2025)

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

Fully-Distributed Construction of Byzantine-Resilient Dynamic Peer-to-Peer Networks
by: Gupta, Aayush, et al.
Published: (2025)

Massively Parallel Ruling Set Made Deterministic
by: Giliberti, Jeff, et al.
Published: (2024)

An Implementation and Experimental Comparison of Dynamic Ordered Sets
by: Malek, Jordan
Published: (2024)

CPMA: An Efficient Batch-Parallel Compressed Set Without Pointers
by: Wheatman, Brian, et al.
Published: (2023)

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

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

Near-Optimal Distributed Ruling Sets for Trees and High-Girth Graphs
by: Baumecker, Malte, et al.
Published: (2025)

Distributed Download from an External Data Source in Faulty Majority Settings
by: Augustine, John, et al.
Published: (2024)

Distributed Approximation Algorithms for Minimum Dominating Set in Locally Nice Graphs
by: Bonamy, Marthe, et al.
Published: (2025)

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

Tight Communication Bounds for Distributed Algorithms in the Quantum Routing Model
by: Dufoulon, Fabien, et al.
Published: (2026)

Round and Communication Efficient Graph Coloring
by: Chang, Yi-Jun, et al.
Published: (2024)

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

Parallel Contraction Hierarchies Can Be Efficient and Scalable
by: Wan, Zijin, et al.
Published: (2024)