Imagen de Portada

Overlay Network Construction: Improved Overall and Node-Wise Message Complexity

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Chang, Yi-Jun, Chen, Yanyu, Mishra, Gopinath
Formato:	Preprint
Publicado:	2024
Materias:	Distributed, Parallel, and Cluster Computing Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Optimal Distributed Replacement Paths
por: Chang, Yi-Jun, et al.
Publicado: (2025)

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

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

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

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

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

Narrowing the LOCAL$\unicode{x2013}$CONGEST Gaps in Sparse Networks via Expander Decompositions
por: Chang, Yi-Jun, et al.
Publicado: (2022)

Improved All-Pairs Approximate Shortest Paths in Congested Clique
por: Bui, Hong Duc, et al.
Publicado: (2024)

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

Fast Broadcast in Highly Connected Networks
por: Chandra, Shashwat, et al.
Publicado: (2024)

Optimal local certification on graphs of bounded pathwidth
por: Baterisna, Dan Alden, et al.
Publicado: (2025)

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

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

Two Efficient Message-passing Exclusive Scan Algorithms
por: Träff, Jesper Larsson
Publicado: (2026)

Deterministic Expander Routing: Faster and More Versatile
por: Chang, Yi-Jun, et al.
Publicado: (2024)

Universally Optimal Information Dissemination and Shortest Paths in the HYBRID Distributed Model
por: Chang, Yi-Jun, et al.
Publicado: (2023)

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

The Quantum Message Complexity of Distributed Wake-Up with Advice
por: Robinson, Peter, et al.
Publicado: (2026)

Exploiting Multi-Core Parallelism in Blockchain Validation and Construction
por: Karmegam, Arivarasan, et al.
Publicado: (2026)

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

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

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

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

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

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

Almost Optimal Algorithms for Token Collision in Anonymous Networks
por: Bai, Sirui, et al.
Publicado: (2024)

Energy-Efficient Maximal Independent Sets in Radio Networks
por: Banasik, Dominick, et al.
Publicado: (2025)

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

Can Like Attract Like? A Study of Homonymous Gathering in Networks
por: Devismes, Stéphane, et al.
Publicado: (2025)

Improving the Bit Complexity of Communication for Distributed Convex Optimization
por: Ghadiri, Mehrdad, et al.
Publicado: (2024)

Hash & Adjust: Competitive Demand-Aware Consistent Hashing
por: Pourdamghani, Arash, et al.
Publicado: (2024)

On Distributed Computation of the Minimum Triangle Edge Transversal
por: Censor-Hillel, Keren, et al.
Publicado: (2024)

Paralleling and Accelerating Arc Consistency Enforcement with Recurrent Tensor Computations
por: Yang, Mingqi
Publicado: (2024)

Parallel Cluster-BFS and Applications to Shortest Paths
por: Wang, Letong, et al.
Publicado: (2024)

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

Revising Apetrei's bounding volume hierarchy construction algorithm to allow stackless traversal
por: Prokopenko, Andrey, et al.
Publicado: (2024)

Parallel Integer Sort: Theory and Practice
por: Dong, Xiaojun, et al.
Publicado: (2024)

Multi-Agent Online Graph Exploration on Cycles and Tadpole Graphs
por: Akker, Erik van den, 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)

Cuckoo Heavy Keeper and the balancing act of maintaining heavy hitters in stream processing
por: Ngo, Vinh Quang, et al.
Publicado: (2024)