:: Library Catalog

Copertina

Salvato in:

Dettagli Bibliografici
Autori principali:	Lenzen, Christoph, Wenning, Sophie
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Distributed, Parallel, and Cluster Computing Data Structures and Algorithms
Accesso online:	https://arxiv.org/abs/2408.12998
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

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

Tight Bounds on the Message Complexity of Distributed Tree Verification
di: Kutten, Shay, et al.
Pubblicazione: (2024)

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

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

Round-Delayed Amnesiac Flooding
di: Alafin, Oluwatobi, et al.
Pubblicazione: (2026)

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

Sorting in One and Two Rounds using $t$-Comparators
di: Gelles, Ran, et al.
Pubblicazione: (2024)

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

Model-Agnostic Approximation of Constrained Forest Problems
di: Coupette, Corinna, et al.
Pubblicazione: (2024)

Improved Massively Parallel Triangle Counting in $O(1)$ Rounds
di: Liu, Quanquan C., et al.
Pubblicazione: (2024)

What Can We Compute in a Single Round of the Congested Clique?
di: Robinson, Peter
Pubblicazione: (2022)

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

Memory Bounds for Concurrent Bounded Queues
di: Aksenov, Vitaly, et al.
Pubblicazione: (2021)

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

BinomialHash: A Constant Time, Minimal Memory Consistent Hash Algorithm
di: Coluzzi, Massimo, et al.
Pubblicazione: (2024)

Bounded Memory in Distributed Networks
di: Basat, Ran Ben, et al.
Pubblicazione: (2025)

Distributed Triangle Detection is Hard in Few Rounds
di: Assadi, Sepehr, et al.
Pubblicazione: (2025)

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

Near Optimal Bounds for Replacement Paths and Related Problems in the CONGEST Model
di: Manoharan, Vignesh, et al.
Pubblicazione: (2022)

Deterministic Lower Bounds for $k$-Edge Connectivity in the Distributed Sketching Model
di: Robinson, Peter, et al.
Pubblicazione: (2025)

A Cut-Matching Game for Constant-Hop Expanders
di: Haeupler, Bernhard, et al.
Pubblicazione: (2022)

Multi-Agent Online Graph Exploration on Cycles and Tadpole Graphs
di: Akker, Erik van den, et al.
Pubblicazione: (2024)

Decentralized Distributed Graph Coloring II: degree+1-Coloring Virtual Graphs
di: Flin, Maxime, et al.
Pubblicazione: (2024)

Distributed Stochastic Graph Algorithms
di: Censor-Hillel, Keren, et al.
Pubblicazione: (2026)

Distributed Graph Algorithms with Predictions
di: Boyar, Joan, et al.
Pubblicazione: (2025)

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

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

Distributed Maximum Flow in Planar Graphs
di: Abd-Elhaleem, Yaseen, et al.
Pubblicazione: (2024)

Adaptive Massively Parallel Coloring in Sparse Graphs
di: Latypov, Rustam, et al.
Pubblicazione: (2024)

PASGAL: Parallel And Scalable Graph Algorithm Library
di: Dong, Xiaojun, et al.
Pubblicazione: (2024)

On the Randomized Locality of Matching Problems in Regular Graphs
di: Khoury, Seri, et al.
Pubblicazione: (2025)

The Local Information Cost of Distributed Graph Spanners
di: Robinson, Peter
Pubblicazione: (2020)

Online Load and Graph Balancing for Random Order Inputs
di: Im, Sungjin, et al.
Pubblicazione: (2024)

Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation
di: Blelloch, Guy, et al.
Pubblicazione: (2026)

Brief Announcement: Distributed Unconstrained Local Search for Multilevel Graph Partitioning
di: Sanders, Peter, et al.
Pubblicazione: (2024)

A Near-Optimal Low-Energy Deterministic Distributed SSSP with Ramifications on Congestion and APSP
di: Ghaffari, Mohsen, et al.
Pubblicazione: (2024)

Engineering A Workload-balanced Push-Relabel Algorithm for Massive Graphs on GPUs
di: Hsieh, Chou-Ying, et al.
Pubblicazione: (2024)

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

Õptimal Fault-Tolerant Labeling for Reachability and Approximate Distances in Directed Planar Graphs
di: Boneh, Itai, et al.
Pubblicazione: (2025)