Cover Image

Sublinear-Time Quantum Computation of the Diameter in CONGEST Networks

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Gall, François Le, Magniez, Frédéric
Format:	Preprint
Published:	2018
Subjects:	Distributed, Parallel, and Cluster Computing Data Structures and Algorithms Quantum Physics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Deterministic Even-Cycle Detection in Broadcast CONGEST
by: Fraigniaud, Pierre, et al.
Published: (2024)

Quantum Communication Advantage for Leader Election and Agreement
by: Dufoulon, Fabien, et al.
Published: (2025)

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

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

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

Even-Cycle Detection in the Randomized and Quantum CONGEST Model
by: Fraigniaud, Pierre, et al.
Published: (2024)

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

DiaQ: Efficient State-Vector Quantum Simulation
by: Chundury, Srikar, et al.
Published: (2024)

Faster CONGEST Approximation Algorithms for Maximum Weighted Independent Set in Sparse Graphs
by: Faour, Salwa, et al.
Published: (2025)

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

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

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

Treasure Hunt in Anonymous Graphs with Quantum Pebbles by Oblivious Agents
by: Gaur, Gaurav, et al.
Published: (2025)

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

Optimal Parallel Algorithms for Dendrogram Computation and Single-Linkage Clustering
by: Dhulipala, Laxman, et al.
Published: (2024)

Computing Least Fixed Points with Overwrite Semantics in Parallel and Distributed Systems
by: Garg, Vijay K., et al.
Published: (2026)

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

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

Two for One, One for All: Deterministic LDC-based Robust Computation in Congested Clique
by: Censor-Hillel, Keren, et al.
Published: (2025)

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

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

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

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

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

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

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

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

Parallel, Distributed, and Quantum Exact Single-Source Shortest Paths with Negative Edge Weights
by: Ashvinkumar, Vikrant, et al.
Published: (2023)

Parallel Batch Dynamic Vertex Coloring in $O(\log Δ)$ Amortized Update Time
by: Hutton, Chase, et al.
Published: (2025)

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

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

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

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

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

Overlay Network Construction: Improved Overall and Node-Wise Message Complexity
by: Chang, Yi-Jun, et al.
Published: (2024)

Computing in Anonymous Dynamic Networks Is Linear
by: Di Luna, Giuseppe A., et al.
Published: (2022)

Informative Trains: A Memory-Efficient Journey to a Self-Stabilizing Leader Election Algorithm in Anonymous Graphs
by: Blin, Lelia, et al.
Published: (2026)

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

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

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