6 citations · 6 across the 2 of their papers we have counts for
Showing cs.ITShow all
2 papers · 1 filter
cs.IT2012
Bounds on Minimum Number of Anchors for Iterative Localization and its Connections to Bootstrap Percolation
Rahul Vaze, Piyush Gupta
Iterated localization is considered where each node of a network needs to get localized (find its location on 2-D plane), when initially only a subset of nodes have their location…
cs.IT2010★ 6 cited
When is a Function Securely Computable?
Himanshu Tyagi, Prakash Narayan, Piyush Gupta
A subset of a set of terminals that observe correlated signals seek to compute a given function of the signals using public communication. It is required that the value of the func…