• Conference Object  

      Confidential gossip 

      Georgiou, Chryssis; Gilbert, S.; Kowalski, D. R. (2011)
      Epidemic gossip has proven a reliable and efficient technique for sharing information in a distributed network. Much of the reliability and efficiency derives from processes collaborating, sharing the work of distributing ...
    • Conference Object  

      Distributed network size estimation and average degree estimation and control in networks isomorphic to directed graphs 

      Shames, I.; Charalambous, T.; Hadjicostis, Christoforos N.; Johansson, M. (2012)
      Many properties of interest in graph structures are based on the nodes' average degree (i.e., the average number of edges incident to/from each node). In this work, we present asynchronous distributed algorithms, based on ...
    • Article  

      Finding the K highest-ranked answers in a distributed network 

      Zeinalipour-Yazdi, Constantinos D.; Vagena, Zografoula; Kalogeraki, Vana; Gunopulos, Dimitrios; Tsotras, Vassilis J.; Vlachos, Michail; Koudas, Nick; Srivastava, D. (2009)
      In this paper, we present an algorithm for finding the k highest-ranked (or Top-k) answers in a distributed network. A Top-K query returns the subset of most relevant answers, in place of all answers, for two reasons: (i) ...
    • Conference Object  

      The power of the defender 

      Gelastou, Marina; Mavronicolas, Marios; Lesta, Vicky Papadopoulou; Philippou, Anna; Spirakis, Paul G. (2006)
      We consider a security problem on a distributed network. We assume a network whose nodes are vulnerable to infection by threats (e.g. viruses), the attackers. A system security software, the defender, is available in the ...