Abstract. Analysis of privacy-sensitive data in a multi-party environment often assumes that the parties are well-behaved and they abide by the protocols. Parties compute whatever ...
We present an algorithm to compute the cycle structure of large directed graphs where each node has exactly one outgoing edge. Such graphs appear as state diagrams of finite stat...
In this paper, we propose a novel cache consistency maintenance scheme, called Ë Ð Ð ×ÝÒ ÖÓÒÓÙ× ÓÒ× ×Ø Ò Ý Ë Ñ (SACCS), for mobile environments. It relies on ...
Mobile opportunistic networks are characterized by unpredictable mobility, heterogeneity of contact rates and lack of global information. Successful delivery of messages at low co...
Vijay Erramilli, Mark Crovella, Augustin Chaintrea...
In this paper, we address the problem of temporal synchronization of a team of mobile agents on a set of rendezvous points defined by the nodes of a bipartite network. In particula...