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
Distributed verification and hardness of distributed approximation
Atish Das Sarma
, Stephan Holzer
, Liah Kor
,
Amos Korman
, Danupon Nanongkai
, Gopal Pandurangan
, David Peleg
, Roger Wattenhofer
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Distributed verification and hardness of distributed approximation'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Distributed Approximation
100%
Minimum Spanning Tree
100%
Distributed Verification
100%
Time Complexity
50%
Distributed Computation
50%
Optimization Problem
25%
Communication Complexity
25%
Round numbers
25%
Connected Subgraphs
25%
Tight Lower Bound
25%
Distributed Algorithms
25%
Hardness of Approximation
25%
Shortest Path
25%
Approximation Factor
25%
Distributed Computing
25%
Distributed Network
25%
Minimum Cut
25%
Peleg
25%
Approximation Bound
25%
Distributed Approximation Algorithm
25%
Distributed Communication
25%
Time Lower Bound
25%
Minimum S-t Cut
25%
Verification Algorithm
25%
Verification Problem
25%
Specified Properties
25%
Classical Optimization
25%
Exact Algorithm
25%
Computer Science
Approximation (Algorithm)
100%
Minimum Spanning Tree
100%
Time Complexity
50%
Distributed Computation
50%
Fundamental Problem
25%
Optimization Problem
25%
Communication Complexity
25%
Connected Subgraph
25%
Approximation Algorithms
25%
Subgraphs
25%
approximation factor
25%
Distributed Computing
25%
Distributed Network
25%
Exact Algorithm
25%
Distributed Algorithm
25%