Skip to main navigation
Skip to search
Skip to main content
The Hebrew University of Jerusalem Home
Approve / Request updates on publications
Home
Profiles
Research units
Research output
Prizes
Search by expertise, name or affiliation
Locality in distributed graph algorithms
Nathan Linial
*
*
Corresponding author for this work
The Rachel and Selim Benin School of Engineering and Computer Science
Research output
:
Contribution to journal
›
Article
›
peer-review
705
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Locality in distributed graph algorithms'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Regular Tree
100%
Tight
100%
Computational Model
100%
At a Distance
100%
Vortex
100%
Locally Available
100%
Computational Problems
100%
Algorithmic Problems
100%
Large Degree
100%
Global Solution
100%
Distributed Processing
100%
N Cycling
100%
3-coloring
100%
Distributed Graph Algorithms
100%
Time Log
100%
2-coloring
100%
Mathematics
Regular Tree
100%
Global Solution
100%
Computational Problem
100%
Graph Algorithm
100%
Time Unit
100%
Computer Science
Computational Problem
100%
Computational Modeling
100%
Graph Algorithms
100%
Distributed Processing
100%
Collecting Data
100%