Imagen de Portada

On the Locality of Hall's Theorem

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Brandt, Sebastian, Maus, Yannic, Narayanan, Ananth, Schager, Florian, Uitto, Jara
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms Distributed, Parallel, and Cluster Computing
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

Fast Deterministic Distributed Degree Splitting
por: Maus, Yannic, et al.
Publicado: (2026)

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

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

Towards Optimal Distributed Delta Coloring
por: Jakob, Manuel, et al.
Publicado: (2025)

Distributed Lovász Local Lemma under Bandwidth Limitations
por: Halldórsson, Magnús M., et al.
Publicado: (2024)

Distributed Delta-Coloring under Bandwidth Limitations
por: Maus, Yannic, et al.
Publicado: (2024)

A $(3+\varepsilon)$-Approximate Correlation Clustering Algorithm in Dynamic Streams
por: Cambus, Mélanie, et al.
Publicado: (2022)

Sublogarithmic Distributed Vertex Coloring with Optimal Number of Colors
por: Flin, Maxime, et al.
Publicado: (2026)

Optimal Deterministic Rendezvous in Labeled Lines
por: Bourreau, Yann, et al.
Publicado: (2025)

Faster Distributed $Δ$-Coloring via a Reduction to MIS
por: Bourreau, Yann, et al.
Publicado: (2025)

Faster Distributed $Δ$-Coloring via Ruling Subgraphs
por: Bourreau, Yann, et al.
Publicado: (2025)

Meta-Theorems for Cuttable Distributed Problems
por: Bonamy, Marthe, et al.
Publicado: (2026)

Local Density and its Distributed Approximation
por: Christiansen, Aleksander Bjørn, et al.
Publicado: (2024)

Congested Clique Counting for Local Gibbs Distributions
por: Sobel, Joshua Z.
Publicado: (2025)

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

The Local Information Cost of Distributed Graph Spanners
por: Robinson, Peter
Publicado: (2020)

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

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

Slipstream: Ebb-and-Flow Consensus on a DAG with Fast Confirmation for UTXO Transactions
por: Polyanskii, Nikita, et al.
Publicado: (2024)

On the Locality of the Lovász Local Lemma
por: Davies-Peck, Peter
Publicado: (2025)

Invitation to Local Algorithms
por: Rozhoň, Václav
Publicado: (2024)

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

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

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

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

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

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

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

HiPerMotif: Novel Parallel Subgraph Isomorphism in Large-Scale Property Graphs
por: Dindoost, Mohammad, et al.
Publicado: (2025)

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

A Fast-Converging Decentralized Approach to the Weighted Minimum Vertex Cover Problem
por: Mordacchini, Matteo, et al.
Publicado: (2025)

Constrained Cuts, Flows, and Lattice-Linearity
por: Streit, Robert, et al.
Publicado: (2025)

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

BLEST: Blazingly Efficient BFS using Tensor Cores
por: Elbek, Deniz, et al.
Publicado: (2025)

Weighted Matching in a Poly-Streaming Model
por: Ullah, Ahammed, et al.
Publicado: (2025)

Computing in a Faulty Congested Clique
por: Censor-Hillel, Keren, et al.
Publicado: (2025)

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

Distributed Interactive Proofs for Planarity with Log-Star Communication
por: Gil, Yuval, et al.
Publicado: (2025)