5 citations · 5 across the 2 of their papers we have counts for
3 papers
eess.SY2016
Collection and Dissemination of Data on Time-Varying Digraphs
Kevin Topley
Given a network of fixed size and an initial distribution of data, we derive sufficient connectivity conditions on a sequence of time-varying digraphs for (a) data collection a…
math.CO2016★ 5 cited
Computationally Efficient Bounds for the Sum of Catalan Numbers
Kevin Topley
Easily computable lower and upper bounds are found for the sum of Catalan numbers. The lower bound is proven to be tighter than the upper bound, which previously was declared to be…
cs.DC2011
Average-Consensus Algorithms in a Deterministic Framework
Kevin Topley, Vikram Krishnamurthy
We consider the average-consensus problem in a multi-node network of finite size. Communication between nodes is modeled by a sequence of directed signals with arbitrary communicat…