1 paper
Ye Wang, Shantanu Rane, Prakash Ishwar +1
Consider a network of k parties, each holding a long sequence of n entries (a database), with minimum vertex-cut greater than t. We show that any empirical statistic across the net…