Skip to main navigation
Skip to search
Skip to main content
University of Haifa Home
Update your profile
Home
Researchers
Research units
Research output
Search by expertise, name or affiliation
Exponentially Faster Shortest Paths in the Congested Clique
Michal Dory
, Merav Parter
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Exponentially Faster Shortest Paths in the Congested Clique'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Log-log
100%
Shortest Path
100%
Congested Clique
100%
All-pairs Shortest Paths
50%
Long Distance
33%
Shortest Distance
33%
Polynomial Time
16%
Distance-based
16%
2-approximation
16%
Deterministic Algorithm
16%
Multi-source
16%
Derandomization
16%
Novel Variants
16%
Unweighting
16%
Congested Clique Model
16%
Round Complexity
16%
Distributed Computing
16%
Deterministic Solution
16%
Log-t
16%
Emulator
16%
Hitting Set Problem
16%
Distance Threshold
16%
Distance-sensitive
16%
Computer Science
Approximation (Algorithm)
100%
Pair Shortest Path
66%
Short Distance
66%
Polynomial Time
33%
Pair Shortest Path Problem
33%
Distributed Computing
33%
Distance Threshold
33%
Mathematics
Clique
100%
Edge
50%
Polynomial Time
50%
Derandomization
50%
Path Problem
50%
Hitting Set
50%