We study how a server may disseminate a large volume of data to a set of clients in the shortest possible time. We first consider a cooperative scenario where clients are willing...
Distributed mobile applications operate on devices with diverse capabilities, in heterogeneous environments, where parameters such as processor, memory and network utilisation, are...
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
With the ultimate goal of extending the data integration paradigm and query processing capabilities to ad hoc wireless networks, sensors, and stream systems, we consider how to su...
Svilen R. Mihaylov, Marie Jacob, Zachary G. Ives, ...
Every computer needs a timer mechanism to keep track of current time and also for various accounting purposes such as calculating the time spent by a process in CPU utilization, di...