We study the dynamic version of the distributed all-pairs shortest paths problem. Most of the solutions given in the literature for this problem work under the assumption that bef...
In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...
Abstract--We consider a set of multicast sources, each multicasting a finite amount of data to its corresponding destinations. The objective is to minimize the time to deliver all ...
Abstract— We propose the first practical solution to the longstanding problem of secure wireless routing in the presence of colluding attackers. Our secure routing protocol, Spr...
Jakob Eriksson, Michalis Faloutsos, Srikanth V. Kr...
Background: The construction of interaction networks between proteins is central to understanding the underlying biological processes. However, since many useful relations are exc...