• Conference Object  

      Distributed minimum-time weight balancing over digraphs 

      Charalambous, T.; Hadjicostis, Christoforos N.; Johansson, M. (IEEE Computer Society, 2014)
      We address the weight-balancing problem for a distributed system whose components (nodes) can exchange information via interconnection links (edges) that form an arbitrary, possibly directed, communication topology (digraph). ...
    • Article  

      Distributed stopping for average consensus in undirected graphs via event-triggered strategies 

      Manitara, N. E.; Hadjicostis, Christoforos N. (2016)
      We develop and analyze two distributed event-triggered linear iterative algorithms that enable the components of a distributed system, each with some initial value, to reach approximate average consensus on their initial ...
    • Conference Object  

      Distributed stopping for average consensus using double linear iterative strategies 

      Manitara, N. E.; Hadjicostis, Christoforos N. (Institute of Electrical and Electronics Engineers Inc., 2014)
      We consider how double linear iterative strategies for asymptotic average consensus can be adapted so that the nodes can determine, in a distributed fashion, a stopping criterion that allows them to terminate (in finite ...
    • Conference Object  

      Distributed stopping in average consensus via event-triggered strategies 

      Manitara, N.; Hadjicostis, Christoforos N. (IEEE Computer Society, 2013)
      We develop and analyze a distributed event-triggered linear iterative algorithm that enables the components of a distributed system, each with some initial value, to reach approximate average consensus on their initial ...