Publication date
January 2016
DOI Publisher
Springer Science and Business Media LLCAbstract
International audienceSurvey of core results in the context of locality in distributed graph algorithms
International audienceSurvey of core results in the context of locality in distributed graph algorithms
International audienceWe study the problem of the amount of information (advice) about a graph that ...
Over the last decade we have witnessed the rapid proliferation of large-scale complex networks, span...
Locally checkable labeling problems in the LOCAL model of distributed computation are known to have ...
International audienceSurvey of core results in the context of locality in distributed graph algorit...
The theory of distributed computing aims at understanding which tasks can be solved efficiently in l...
International audienceIn this talk we attempt to identify the characteristics of a task of distribut...
Abstract. This paper concerns a number of algorithmic problems on graphs and how they may be solved ...
We use Martingale inequalities to give a simple and uniform analysis of two families of distributed ...
Locality is one of the central themes in distributed computing. Suppose in a network each node only ...
In this work, we give a unifying view of locality in four settings: distributed algorithms, sequenti...
We illustrate the use of Talagrand's inequality and an extensionof it to dependent random variables ...
The locality of a graph problem is the smallest distance T such that each node can choose its own pa...
Limiting the knowledge of individual nodes is a major concern for the design of distributed algorith...
Publisher Copyright: © 2023 The Author(s)The locality of a graph problem is the smallest distance T ...
A local algorithm is a distributed algorithm that runs in constant time, independently of the size o...
International audienceWe study the problem of the amount of information (advice) about a graph that ...
Over the last decade we have witnessed the rapid proliferation of large-scale complex networks, span...
Locally checkable labeling problems in the LOCAL model of distributed computation are known to have ...
International audienceSurvey of core results in the context of locality in distributed graph algorit...
The theory of distributed computing aims at understanding which tasks can be solved efficiently in l...
International audienceIn this talk we attempt to identify the characteristics of a task of distribut...
Abstract. This paper concerns a number of algorithmic problems on graphs and how they may be solved ...
We use Martingale inequalities to give a simple and uniform analysis of two families of distributed ...
Locality is one of the central themes in distributed computing. Suppose in a network each node only ...
In this work, we give a unifying view of locality in four settings: distributed algorithms, sequenti...
We illustrate the use of Talagrand's inequality and an extensionof it to dependent random variables ...
The locality of a graph problem is the smallest distance T such that each node can choose its own pa...
Limiting the knowledge of individual nodes is a major concern for the design of distributed algorith...
Publisher Copyright: © 2023 The Author(s)The locality of a graph problem is the smallest distance T ...
A local algorithm is a distributed algorithm that runs in constant time, independently of the size o...
International audienceWe study the problem of the amount of information (advice) about a graph that ...
Over the last decade we have witnessed the rapid proliferation of large-scale complex networks, span...
Locally checkable labeling problems in the LOCAL model of distributed computation are known to have ...
Add to ORKG