Deterministic Expander Routing: Faster and More Versatile
Fuente:
arXiv
Saved in:
| Main Authors: | Chang, Yi-Jun, Huang, Shang-En, Su, Hsin-Hao |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Narrowing the LOCAL$\unicode{x2013}$CONGEST Gaps in Sparse Networks via Expander Decompositions
by: Chang, Yi-Jun, et al.
Published: (2022)
by: Chang, Yi-Jun, et al.
Published: (2022)
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)
Min-Max Correlation Clustering via Neighborhood Similarity
by: Cao, Nairen, et al.
Published: (2025)
by: Cao, Nairen, 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)
Energy-Efficient Aggregation and Minimum-Degree Spanning Trees in Radio Networks
by: Chang, Yi-Jun, et al.
Published: (2026)
by: Chang, Yi-Jun, et al.
Published: (2026)
Optimal local certification on graphs of bounded pathwidth
by: Baterisna, Dan Alden, et al.
Published: (2025)
by: Baterisna, Dan Alden, et al.
Published: (2025)
Faster Cycle Detection in the Congested Clique
by: Censor-Hillel, Keren, et al.
Published: (2024)
by: Censor-Hillel, Keren, et al.
Published: (2024)
Overlay Network Construction: Improved Overall and Node-Wise Message Complexity
by: Chang, Yi-Jun, et al.
Published: (2024)
by: Chang, Yi-Jun, et al.
Published: (2024)
Fast Deterministic Distributed Degree Splitting
by: Maus, Yannic, et al.
Published: (2026)
by: Maus, Yannic, et al.
Published: (2026)
Optimal Deterministic Rendezvous in Labeled Lines
by: Bourreau, Yann, et al.
Published: (2025)
by: Bourreau, Yann, et al.
Published: (2025)
Breaking Barriers for Distributed MIS by Faster Degree Reduction
by: Khoury, Seri, et al.
Published: (2025)
by: Khoury, Seri, et al.
Published: (2025)
Faster Distributed $Δ$-Coloring via Ruling Subgraphs
by: Bourreau, Yann, et al.
Published: (2025)
by: Bourreau, Yann, et al.
Published: (2025)
Massively Parallel Ruling Set Made Deterministic
by: Giliberti, Jeff, et al.
Published: (2024)
by: Giliberti, Jeff, et al.
Published: (2024)
Deterministic Even-Cycle Detection in Broadcast CONGEST
by: Fraigniaud, Pierre, et al.
Published: (2024)
by: Fraigniaud, Pierre, et al.
Published: (2024)
Time-Optimal and Energy-Efficient Deterministic Consensus
by: Meir, Shachar, et al.
Published: (2025)
by: Meir, Shachar, et al.
Published: (2025)
A Simple Distributed Deterministic Planar Separator
by: Abd-Elhaleem, Yaseen, et al.
Published: (2026)
by: Abd-Elhaleem, Yaseen, et al.
Published: (2026)
Low-Distortion Clustering in Bounded Growth Graphs
by: Chang, Yi-Jun, et al.
Published: (2024)
by: Chang, Yi-Jun, et al.
Published: (2024)
Faster Distributed $Δ$-Coloring via a Reduction to MIS
by: Bourreau, Yann, et al.
Published: (2025)
by: Bourreau, Yann, et al.
Published: (2025)
Parallel, Distributed, and Quantum Exact Single-Source Shortest Paths with Negative Edge Weights
by: Ashvinkumar, Vikrant, et al.
Published: (2023)
by: Ashvinkumar, Vikrant, et al.
Published: (2023)
Universally Optimal Information Dissemination and Shortest Paths in the HYBRID Distributed Model
by: Chang, Yi-Jun, et al.
Published: (2023)
by: Chang, Yi-Jun, et al.
Published: (2023)
Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation
by: Blelloch, Guy, et al.
Published: (2026)
by: Blelloch, Guy, et al.
Published: (2026)
Near-Optimal Deterministic Network Decomposition and Ruling Set, and Improved MIS
by: Ghaffari, Mohsen, et al.
Published: (2024)
by: Ghaffari, Mohsen, et al.
Published: (2024)
Deterministic Lower Bounds for $k$-Edge Connectivity in the Distributed Sketching Model
by: Robinson, Peter, et al.
Published: (2025)
by: Robinson, Peter, et al.
Published: (2025)
Faster Multi-Source Reachability and Approximate Distances via Shortcuts, Hopsets and Matrix Multiplication
by: Elkin, Michael, et al.
Published: (2025)
by: Elkin, Michael, et al.
Published: (2025)
Round and Communication Efficient Graph Coloring
by: Chang, Yi-Jun, et al.
Published: (2024)
by: Chang, Yi-Jun, et al.
Published: (2024)
Fast Broadcast in Highly Connected Networks
by: Chandra, Shashwat, et al.
Published: (2024)
by: Chandra, Shashwat, et al.
Published: (2024)
Improved Deterministic Distributed Maximum Weight Independent Set Approximation in Sparse Graphs
by: Gil, Yuval
Published: (2024)
by: Gil, Yuval
Published: (2024)
Improved All-Pairs Approximate Shortest Paths in Congested Clique
by: Bui, Hong Duc, et al.
Published: (2024)
by: Bui, Hong Duc, et al.
Published: (2024)
A Near-Optimal Low-Energy Deterministic Distributed SSSP with Ramifications on Congestion and APSP
by: Ghaffari, Mohsen, et al.
Published: (2024)
by: Ghaffari, Mohsen, et al.
Published: (2024)
Two for One, One for All: Deterministic LDC-based Robust Computation in Congested Clique
by: Censor-Hillel, Keren, et al.
Published: (2025)
by: Censor-Hillel, Keren, et al.
Published: (2025)
A Tight Lower Bound for 3-Coloring Grids in the Online-LOCAL Model
by: Chang, Yi-Jun, et al.
Published: (2023)
by: Chang, Yi-Jun, et al.
Published: (2023)
Optimal Distributed Replacement Paths
by: Chang, Yi-Jun, et al.
Published: (2025)
by: Chang, Yi-Jun, et al.
Published: (2025)
Bounded Memory in Distributed Networks
by: Basat, Ran Ben, et al.
Published: (2025)
by: Basat, Ran Ben, et al.
Published: (2025)
All-to-All Communication with Mobile Edge Adversary: Almost Linearly More Faults, For Free
by: Fischer, Orr, et al.
Published: (2025)
by: Fischer, Orr, et al.
Published: (2025)
Concurrent Deterministic Skiplist and Other Data Structures
by: Sasidharan, Aparna
Published: (2023)
by: Sasidharan, Aparna
Published: (2023)
Efficient Enumeration of Large Maximal k-Plexes
by: Cheng, Qihao, et al.
Published: (2024)
by: Cheng, Qihao, et al.
Published: (2024)
On Distributed Computation of the Minimum Triangle Edge Transversal
by: Censor-Hillel, Keren, et al.
Published: (2024)
by: Censor-Hillel, Keren, et al.
Published: (2024)
Paralleling and Accelerating Arc Consistency Enforcement with Recurrent Tensor Computations
by: Yang, Mingqi
Published: (2024)
by: Yang, Mingqi
Published: (2024)
Parallel Cluster-BFS and Applications to Shortest Paths
by: Wang, Letong, et al.
Published: (2024)
by: Wang, Letong, et al.
Published: (2024)
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)
Similar Items
-
Narrowing the LOCAL$\unicode{x2013}$CONGEST Gaps in Sparse Networks via Expander Decompositions
by: Chang, Yi-Jun, et al.
Published: (2022) -
Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications
by: Chang, Yi-Jun
Published: (2023) -
Min-Max Correlation Clustering via Neighborhood Similarity
by: Cao, Nairen, et al.
Published: (2025) -
A Cut-Matching Game for Constant-Hop Expanders
by: Haeupler, Bernhard, et al.
Published: (2022) -
Energy-Efficient Aggregation and Minimum-Degree Spanning Trees in Radio Networks
by: Chang, Yi-Jun, et al.
Published: (2026)