Skip to main navigation
Skip to search
Skip to main content
University of Haifa Home
Update your profile
Link opens in a new tab
Search content at University of Haifa
Home
Researchers
Research units
Research output
Constant-round spanners and shortest paths in congested clique and MPC
Michal Dory
, Orr Fischer
, Seri Khoury
, Dean Leitersdorf
Department of Computer Science
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Constant-round spanners and shortest paths in congested clique and MPC'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Shortest Path
100%
Spanners
100%
Massively Parallel Computation
100%
Constant Rounds
100%
Clique
100%
All-pairs Shortest Paths
50%
Fast Algorithm
33%
Weighted Graph
33%
Approximate Shortest Paths
33%
Unweighted Graph
33%
High Probability
16%
Node Graph
16%
Congested Clique Model
16%
Parallel Process Model
16%
Linear Memory
16%
Computer Science
Pair Shortest Path
100%
Parallel Computation
100%
Fast Algorithm
66%
Approximation (Algorithm)
66%
weighted graph
66%