We consider the complexity of join problems, focusing on equijoins, spatial-overlap joins, and set-containment joins. We use a graph pebbling model to characterize these joins com...
Jin-yi Cai, Venkatesan T. Chakaravarthy, Raghav Ka...
We pose and study the problem of Byzantine-robust topology discovery in an arbitrary asynchronous network. The problem straction of fault-tolerant routing. We formally state the we...
Studying an evolving complex system and drawing some conclusions from it is an integral part of nature-inspired computing; being a part of that complex system, some insight can als...
In this paper, we present our ongoing work on developing a framework for detecting time-varying communities on human mobile networks. We define the term community in environments ...
This paper presents a framework for specifying Web services communities. A Web service is an accessible application that humans, software agents, and other applications in general ...