Invitation to Local Algorithms
Fuente:
arXiv
Saved in:
| Main Author: | Rozhoň, Václav |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
A Nearly Linear-Time Distributed Algorithm for Maximum Cardinality Matching
by: Izumi, Taisuke, et al.
Published: (2023)
by: Izumi, Taisuke, et al.
Published: (2023)
Moser-Tardos Algorithm with small number of random bits
by: Csóka, Endre, et al.
Published: (2022)
by: Csóka, Endre, et al.
Published: (2022)
Forgetting Alternation and Blossoms: A New Framework for Fast Matching Augmentation and Its Applications to Sequential/Distributed/Streaming Computation
by: Izumi, Taisuke, et al.
Published: (2025)
by: Izumi, Taisuke, et al.
Published: (2025)
A Cut-Matching Game for Constant-Hop Expanders
by: Haeupler, Bernhard, et al.
Published: (2022)
by: Haeupler, Bernhard, et al.
Published: (2022)
Distributed Approximation Algorithms for Minimum Dominating Set in Locally Nice Graphs
by: Bonamy, Marthe, et al.
Published: (2025)
by: Bonamy, Marthe, et al.
Published: (2025)
Distributed Stochastic Graph Algorithms
by: Censor-Hillel, Keren, et al.
Published: (2026)
by: Censor-Hillel, Keren, et al.
Published: (2026)
DAG-Inducing Problems and Algorithms
by: Gupta, Arya Tanmay, et al.
Published: (2023)
by: Gupta, Arya Tanmay, et al.
Published: (2023)
Eventually Lattice-Linear Algorithms
by: Gupta, Arya Tanmay, et al.
Published: (2023)
by: Gupta, Arya Tanmay, et al.
Published: (2023)
Distributed Graph Algorithms with Predictions
by: Boyar, Joan, et al.
Published: (2025)
by: Boyar, Joan, et al.
Published: (2025)
On the Locality of Hall's Theorem
by: Brandt, Sebastian, et al.
Published: (2025)
by: Brandt, Sebastian, et al.
Published: (2025)
Parallel Algorithms for Hierarchical Nucleus Decomposition
by: Shi, Jessica, et al.
Published: (2023)
by: Shi, Jessica, et al.
Published: (2023)
Encoding Schemes for Parallel In-Place Algorithms
by: Hutton, Chase, et al.
Published: (2025)
by: Hutton, Chase, et al.
Published: (2025)
Massively Parallel Algorithms for Approximate Shortest Paths
by: Dory, Michal, et al.
Published: (2024)
by: Dory, Michal, et al.
Published: (2024)
PASGAL: Parallel And Scalable Graph Algorithm Library
by: Dong, Xiaojun, et al.
Published: (2024)
by: Dong, Xiaojun, et al.
Published: (2024)
Local Density and its Distributed Approximation
by: Christiansen, Aleksander Bjørn, et al.
Published: (2024)
by: Christiansen, Aleksander Bjørn, et al.
Published: (2024)
Almost Optimal Algorithms for Token Collision in Anonymous Networks
by: Bai, Sirui, et al.
Published: (2024)
by: Bai, Sirui, et al.
Published: (2024)
Designing Parallel Algorithms for Community Detection using Arachne
by: Li, Fuhuan, et al.
Published: (2025)
by: Li, Fuhuan, et al.
Published: (2025)
Two Efficient Message-passing Exclusive Scan Algorithms
by: Träff, Jesper Larsson
Published: (2026)
by: Träff, Jesper Larsson
Published: (2026)
Parallel Algorithms for the One Sided Crossing Minimization Problem
by: Popa, Bogdan-Ioan, et al.
Published: (2025)
by: Popa, Bogdan-Ioan, et al.
Published: (2025)
Fully Scalable MPC Algorithms for Euclidean k-Center
by: Czumaj, Artur, et al.
Published: (2025)
by: Czumaj, Artur, et al.
Published: (2025)
Fully Scalable MPC Algorithms for Clustering in High Dimension
by: Czumaj, Artur, et al.
Published: (2023)
by: Czumaj, Artur, et al.
Published: (2023)
Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering
by: De Man, Quinten, et al.
Published: (2025)
by: De Man, Quinten, et al.
Published: (2025)
Fast and Space-Efficient Parallel Algorithms for Influence Maximization
by: Wang, Letong, et al.
Published: (2023)
by: Wang, Letong, et al.
Published: (2023)
Reductions in local certification
by: Esperet, Louis, et al.
Published: (2025)
by: Esperet, Louis, et al.
Published: (2025)
Scheduled Jacobian Chaining
by: Märtens, Simon, et al.
Published: (2025)
by: Märtens, Simon, et al.
Published: (2025)
Fast algorithms for Vizing's theorem on bounded degree graphs
by: Bernshteyn, Anton, et al.
Published: (2023)
by: Bernshteyn, Anton, et al.
Published: (2023)
Congested Clique Counting for Local Gibbs Distributions
by: Sobel, Joshua Z.
Published: (2025)
by: Sobel, Joshua Z.
Published: (2025)
On the Randomized Locality of Matching Problems in Regular Graphs
by: Khoury, Seri, et al.
Published: (2025)
by: Khoury, Seri, et al.
Published: (2025)
The Local Information Cost of Distributed Graph Spanners
by: Robinson, Peter
Published: (2020)
by: Robinson, Peter
Published: (2020)
A Parallel Scan Algorithm in the Tensor Core Unit Model
by: Zouzias, Anastasios, et al.
Published: (2024)
by: Zouzias, Anastasios, et al.
Published: (2024)
Optimal Parallel Algorithms for Dendrogram Computation and Single-Linkage Clustering
by: Dhulipala, Laxman, et al.
Published: (2024)
by: Dhulipala, Laxman, et al.
Published: (2024)
A Fault-Tolerant Version of Safra's Termination Detection Algorithm
by: Fokkink, Wan, et al.
Published: (2026)
by: Fokkink, Wan, et al.
Published: (2026)
Distributed Lovász Local Lemma under Bandwidth Limitations
by: Halldórsson, Magnús M., et al.
Published: (2024)
by: Halldórsson, Magnús M., et al.
Published: (2024)
A Simple Distributed Algorithm for Sparse Fractional Covering and Packing Problems
by: Li, Qian, et al.
Published: (2024)
by: Li, Qian, et al.
Published: (2024)
Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications
by: Chang, Yi-Jun
Published: (2023)
by: Chang, Yi-Jun
Published: (2023)
A $(3+\varepsilon)$-Approximate Correlation Clustering Algorithm in Dynamic Streams
by: Cambus, Mélanie, et al.
Published: (2022)
by: Cambus, Mélanie, et al.
Published: (2022)
Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation
by: Blelloch, Guy, et al.
Published: (2026)
by: Blelloch, Guy, et al.
Published: (2026)
Engineering A Workload-balanced Push-Relabel Algorithm for Massive Graphs on GPUs
by: Hsieh, Chou-Ying, et al.
Published: (2024)
by: Hsieh, Chou-Ying, et al.
Published: (2024)
BinomialHash: A Constant Time, Minimal Memory Consistent Hash Algorithm
by: Coluzzi, Massimo, et al.
Published: (2024)
by: Coluzzi, Massimo, et al.
Published: (2024)
Beyond BFS: A Comparative Study of Rooted Spanning Tree Algorithms on GPUs
by: Sahu, Abhijeet, et al.
Published: (2026)
by: Sahu, Abhijeet, et al.
Published: (2026)
Similar Items
-
A Nearly Linear-Time Distributed Algorithm for Maximum Cardinality Matching
by: Izumi, Taisuke, et al.
Published: (2023) -
Moser-Tardos Algorithm with small number of random bits
by: Csóka, Endre, et al.
Published: (2022) -
Forgetting Alternation and Blossoms: A New Framework for Fast Matching Augmentation and Its Applications to Sequential/Distributed/Streaming Computation
by: Izumi, Taisuke, et al.
Published: (2025) -
A Cut-Matching Game for Constant-Hop Expanders
by: Haeupler, Bernhard, et al.
Published: (2022) -
Distributed Approximation Algorithms for Minimum Dominating Set in Locally Nice Graphs
by: Bonamy, Marthe, et al.
Published: (2025)