A
Amos Korman
Researcher at Paris Diderot University
Publications - 146
Citations - 3549
Amos Korman is an academic researcher from Paris Diderot University. The author has contributed to research in topics: Upper and lower bounds & Distributed algorithm. The author has an hindex of 32, co-authored 143 publications receiving 3265 citations. Previous affiliations of Amos Korman include Centre national de la recherche scientifique & Weizmann Institute of Science.
Papers
More filters
Journal ArticleDOI
Distributed Verification and Hardness of Distributed Approximation
Atish Das Sarma,Stephan Holzer,Liah Kor,Amos Korman,Danupon Nanongkai,Gopal Pandurangan,David Peleg,Roger Wattenhofer +7 more
TL;DR: The verification problem in distributed networks is studied, stated as follows: let H be a subgraph of a network G where each vertex of G knows which edges incident on it are in H.
Journal ArticleDOI
Proof labeling schemes
TL;DR: The approach separates the configuration design from the verification, which allows for a more modular design of algorithms, and has the potential to aid in verifying properties even when the original design of the structures for maintaining them was done without verification in mind.
Journal ArticleDOI
Online computation with advice
TL;DR: A model for online computation in which the online algorithm receives, together with each request, some information regarding the future, referred to as advice, and its applicability is illustrated by considering two of the most extensively studied online problems, namely, metrical task systems (MTS) and the k-server problem.
Journal ArticleDOI
Labeling Schemes for Flow and Connectivity
TL;DR: A flow labeling scheme using O(log ṡ logŵ-vertex graphs with maximum (integral) capacity and is shown to be asymptotically optimal.
Journal ArticleDOI
Towards a complexity theory for local distributed computing
TL;DR: It turns out that the combination of randomization with nondeterminism that enables to decide all languages in constant time, as there exist languages that cannot be decided locally nondeterministically.