• Conference Object  

      Information dissemination in networks via linear iterative strategies over finite fields 

      Sundaram, S.; Hadjicostis, Christoforos N. (2009)
      Given an arbitrary network of interconnected nodes, each with an initial value from a discrete set, we consider the problem of distributively disseminating these initial values under the constraint that the nodes can only ...
    • Conference Object  

      On the time complexity of information dissemination via linear iterative strategies 

      Sundaram, S.; Hadjicostis, Christoforos N. (2010)
      Given an arbitrary network of interconnected nodes, each with an initial value, we study the number of time-steps required for some (or all) of the nodes to gather all of the initial values via a linear iterative strategy. ...
    • Conference Object  

      Universal bufferless routing 

      Busch, Costas; Magdon-Ismail, M.; Mavronicolas, Marios (2005)
      Given an arbitrary network, and a routing problem with congestion C and dilation D, a long standing open problem is to show the existence of bufferless routing algorithms with optimal performance guarantees (routing time ...