In this paper we propose a fundamental approach to perform the class of Nearest Neighbor (NN) queries, the core class of queries used in many of the location-based services, withou...
Designing algorithms that use logarithmic space for graph reachability problems is fundamental to complexity theory. It is well known that for general directed graphs this problem...
— In this paper, we present a distributed algorithm for detecting redundancies in a sensor network with no location information. We demonstrate how, in the absence of localizatio...
In this paper, we present a series of distributed algorithms for coverage verification in sensor networks with no location information. We demonstrate how, in the absence of locali...
We develop a game-theoretic framework for the study of competition between firms who have budgets to “seed” the initial adoption of their products by consumers located in a s...