E. Canale

activity

19972023

most citedA Lower Bound for Chaos on the Elliptical Stadium

17 citations · 20 across the 10 of their papers we have counts for

collaborators

Showing 2014Show all

4 papers · 1 filter

cs.DC2014

A Full Characterization of Irrelevant Components in Diameter Constrained Reliability

Eduardo Canale, Pablo Romero, Gerardo Rubino

In classical network reliability analysis, the system under study is a network with perfect nodes but imperfect link, that fail stochastically and independently. There, the goal is…

cs.DS2014

Irrelevant Components and Exact Computation of the Diameter Constrained Reliability

Eduardo Canale, Pablo Romero, Gerardo Rubino

Let $G = (V, E)$ be a simple graph with $∣ V ∣ = n$ nodes and $∣ E ∣ = m$ links, a subset $K \subseteq V$ of \emph{terminals}, a vector $p = (p_{1}, ..., p_{m}) \in [0, 1]^{m}$ and a positive integer $d…

math.PR2014

Robustness of Cucker-Smale flocking model

Eduardo Canale, Federico Dalmao, Ernesto Mordecki +1

Consider a system of autonomous interacting agents moving in space, adjusting each own velocity as a weighted mean of the relative velocities of the other agents. In order to test…

cs.CC2014★ 2 cited

Diameter Constrained Reliability: Computational Complexity in terms of the diameter and number of terminals

Eduardo Canale, Pablo Romero

Let $G = (V, E)$ be a simple graph with $∣ V ∣ = n$ nodes and $∣ E ∣ = m$ links, a subset $K \subseteq V$ of \emph{terminals}, a vector $p = (p_{1}, \dots, p_{m}) \in [0, 1]^{m}$ and a positive integer…