• Conference Object  

      Efficiency of oblivious versus non-oblivious schedulers for optimistic, rate-based flow control 

      Fatourou, Panagiota; Mavronicolas, Marios; Spirakis, Paul G. (ACM, 1997)
      Lower and upper bounds on convergence complexity, under varying degrees of locality, for optimistic, rate-based flow control algorithms are established. It is shown that randomness can be exploited to yield an even simpler ...
    • 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  

      Optimal, distributed decision-making: The case of no communication 

      Georgiades, Stavros; Mavronicolas, Marios; Spirakis, Paul G. (1999)
      We present a combinatorial framework for the study of a natural class of distributed optimization problems that involve decisionmaking by a collection of n distributed agents in the presence of incomplete information