Publication date
July 2016
DOI Publisher
Association for Computing Machinery (ACM)Abstract
10.1145/2935764.2935781Annual ACM Symposium on Parallelism in Algorithms and Architectures11-13-July-2016405 - 41
10.1145/2935764.2935781Annual ACM Symposium on Parallelism in Algorithms and Architectures11-13-July-2016405 - 41
International audienceThe diameter of a network is one of the most fundamental network parameters. B...
The diameter of a graph is among its most basic parameters. Since a few years, it moreover became a ...
© Bertie Ancona, Monika Henzinger, Liam Roditty, Virginia Vassilevska Williams, and Nicole Wein; lic...
International audienceComputing the Dynamic Diameter of Non-Deterministic Dynamic Networks is Har
We consider how a set of collaborating agents can distributedly infer some of the properties of the ...
Communication speed in a parallel and distributed system is related to the diameter of its underlyin...
It has become fashionable to argue against research on new interconnection networks by claiming that...
In this paper we study the problem of counting processes in a synchronous dynamic network where a di...
This paper estimates the link costs of constraint based nonblocking ATM networks on a sphere. Analyt...
Finding strongly connected components (SCCs) and the diameter of a directed network play a key role ...
The 20th Annual European Symposium, Ljubljana, Slovenia, 10-12 September 2012Computing diameters of ...
Computing the average shortest-path length of a large scale-free network needs much memory space and...
Abstract — We consider the problem of estimating the size of dynamic anonymous networks, motivated b...
Abstract — We consider the problem of estimating the size of dynamic anonymous networks, motivated b...
This paper presents a distributed algorithm to simultaneously compute the di-ameter, radius and node...
International audienceThe diameter of a network is one of the most fundamental network parameters. B...
The diameter of a graph is among its most basic parameters. Since a few years, it moreover became a ...
© Bertie Ancona, Monika Henzinger, Liam Roditty, Virginia Vassilevska Williams, and Nicole Wein; lic...
International audienceComputing the Dynamic Diameter of Non-Deterministic Dynamic Networks is Har
We consider how a set of collaborating agents can distributedly infer some of the properties of the ...
Communication speed in a parallel and distributed system is related to the diameter of its underlyin...
It has become fashionable to argue against research on new interconnection networks by claiming that...
In this paper we study the problem of counting processes in a synchronous dynamic network where a di...
This paper estimates the link costs of constraint based nonblocking ATM networks on a sphere. Analyt...
Finding strongly connected components (SCCs) and the diameter of a directed network play a key role ...
The 20th Annual European Symposium, Ljubljana, Slovenia, 10-12 September 2012Computing diameters of ...
Computing the average shortest-path length of a large scale-free network needs much memory space and...
Abstract — We consider the problem of estimating the size of dynamic anonymous networks, motivated b...
Abstract — We consider the problem of estimating the size of dynamic anonymous networks, motivated b...
This paper presents a distributed algorithm to simultaneously compute the di-ameter, radius and node...
International audienceThe diameter of a network is one of the most fundamental network parameters. B...
The diameter of a graph is among its most basic parameters. Since a few years, it moreover became a ...
© Bertie Ancona, Monika Henzinger, Liam Roditty, Virginia Vassilevska Williams, and Nicole Wein; lic...
Add to ORKG