Skip to main navigation
Skip to search
Skip to main content
Ben-Gurion University Research Portal Home
Help & FAQ
Home
Profiles
Research output
Research units
Prizes
Press/Media
Student theses
Projects
Activities
Datasets
Research Labs / Equipment
Search by expertise, name or affiliation
Massively parallel algorithms for approximate shortest paths
Michal Dory
, Shaked Matar
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Massively parallel algorithms for approximate shortest paths'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Parallel Process Model
100%
Approximate Shortest Paths
100%
Massively Parallel Computation
100%
Massively Parallel Algorithms
100%
Distance Oracles
22%
Hopsets
22%
Emulator
22%
Linear Memory
22%
Undirected Graph
11%
Approximation Algorithms
11%
Fast Algorithm
11%
Randomized Algorithms
11%
Unweighting
11%
Fast Construction
11%
Approximate Distances
11%
Scale Distance
11%
Single-source Shortest Paths
11%
Distance Sketches
11%
Sublinear Memory
11%
Computer Science
Parallel Computation
100%
Parallel Algorithm
100%
Directed Graphs
11%
Approximation (Algorithm)
11%
Approximation Algorithms
11%
Randomized Algorithm
11%
Fast Algorithm
11%
Mathematics
Approximates
100%
Edge
20%
Fast Algorithm
20%