ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1207.5211
  4. Cited By
Can Quantum Communication Speed Up Distributed Computation?

Can Quantum Communication Speed Up Distributed Computation?

22 July 2012
Michael Elkin
H. Klauck
Danupon Nanongkai
Gopal Pandurangan
ArXivPDFHTML

Papers citing "Can Quantum Communication Speed Up Distributed Computation?"

11 / 11 papers shown
Title
Even-Cycle Detection in the Randomized and Quantum CONGEST Model
Even-Cycle Detection in the Randomized and Quantum CONGEST Model
Pierre Fraigniaud
Mael Luce
F. Magniez
Ioan Todinca
43
6
0
19 Feb 2024
Distributed Merlin-Arthur Synthesis of Quantum States and Its
  Applications
Distributed Merlin-Arthur Synthesis of Quantum States and Its Applications
Franccois Le Gall
Masayuki Miyamoto
H. Nishimura
36
5
0
04 Oct 2022
An Almost Singularly Optimal Asynchronous Distributed MST Algorithm
An Almost Singularly Optimal Asynchronous Distributed MST Algorithm
Fabien Dufoulon
S. Kutten
W. Moses
Gopal Pandurangan
David Peleg
43
5
0
03 Oct 2022
Quantum Complexity of Weighted Diameter and Radius in CONGEST Networks
Quantum Complexity of Weighted Diameter and Radius in CONGEST Networks
Xudong Wu
Penghui Yao
MQ
35
10
0
06 Jun 2022
Complexity of Eccentricities and All-Pairs Shortest Paths in the Quantum
  CONGEST Model
Complexity of Eccentricities and All-Pairs Shortest Paths in the Quantum CONGEST Model
Changsheng Wang
Xudong Wu
Penghui Yao
24
2
0
06 Jun 2022
Quantum Distributed Algorithms for Detection of Cliques
Quantum Distributed Algorithms for Detection of Cliques
K. Censor-Hillel
Orr Fischer
Franccois Le Gall
Dean Leitersdorf
R. Oshman
GNN
26
23
0
09 Jan 2022
Distributed Weighted Min-Cut in Nearly-Optimal Time
Distributed Weighted Min-Cut in Nearly-Optimal Time
Michal Dory
Yuval Efron
Sagnik Mukhopadhyay
Danupon Nanongkai
41
21
0
20 Apr 2020
Distributed Exact Weighted All-Pairs Shortest Paths in Near-Linear Time
Distributed Exact Weighted All-Pairs Shortest Paths in Near-Linear Time
A. Bernstein
K. Kirchberg
16
49
0
08 Nov 2018
On the Distributed Complexity of Large-Scale Graph Computations
On the Distributed Complexity of Large-Scale Graph Computations
Gopal Pandurangan
Peter Robinson
Michele Scquizzato
35
53
0
26 Feb 2016
A Deterministic Almost-Tight Distributed Algorithm for Approximating
  Single-Source Shortest Paths
A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths
Monika Henzinger
Sebastian Krinninger
Danupon Nanongkai
48
111
0
27 Apr 2015
A Fast Distributed Approximation Algorithm for Minimum Spanning Trees in
  the SINR Model
A Fast Distributed Approximation Algorithm for Minimum Spanning Trees in the SINR Model
Maleq Khan
V. S. Anil Kumar
Gopal Pandurangan
Guanhong Pei
93
109
0
06 Jun 2012
1