• Article  

      Computing on a partially eponymous ring 

      Mavronicolas, Marios; Michael, Loizos; Spirakis, Paul G. (2006)
      We study the partially eponymous model of distributed computation, which simultaneously generalizes the anonymous and the eponymous models. In this model, processors have identities, which are neither necessarily all ...
    • Article  

      Distributed Finite-Time Average Consensus in Digraphs in the Presence of Time Delays 

      Charalambous, T.; Yuan, Y.; Yang, T.; Pan, W.; Hadjicostis, Christoforos N.; Johansson, M. (2015)
      Most algorithms for distributed averaging only guarantee asymptotic convergence. This paper introduces a distributed protocol that allows nodes to find the exact average of the initial values in a finite and minimum number ...
    • Article  

      Distributed Finite-Time Computation of Digraph Parameters: Left-Eigenvector, Out-Degree and Spectrum 

      Charalambous, T.; Rabbat, M. G.; Johansson, M.; Hadjicostis, Christoforos N. (2016)
      Many of the algorithms that have been proposed in the field of distributed computation rely on assumptions that require nodes to be aware of some global parameters. In this paper, we propose algorithms to compute some ...
    • Article  

      Efficient gossip and robust distributed computation 

      Georgiou, Chryssis; Kowalski, D. R.; Shvartsman, A. A. (2003)
      This paper presents an efficient deterministic gossip algorithm for p synchronous, crash-prone, message-passing processors. The algorithm has time complexity T = O(log2 p) and message complexity M = O(p1+ε), for any ε > ...
    • Article  

      On the stability of compositions of universally stable, greedy contention-resolution protocols 

      Koukopoulos, D.; Mavronicolas, Marios; Nikoletseas, Sotiris E.; Spirakis, Paul G. (2002)
      A distinguishing feature of today’s large-scale platforms for distributed computation and communication, such as the Internet, is their heterogeneity, predominantly manifested by the fact that a wide variety of communication ...
    • Article  

      Topic 8: Distributed systems and algorithms 

      Goscinski, A.; Mavronicolas, Marios; Shi, W.; Meng, T. Y. (2012)
      The increasing significance of Distributed Computing becomes more and more crucial with the prevail of technological advances that make Global Computing a reality in modern world. Indeed, it is hard to imagine some application ...