Now showing items 6-7 of 7

    • Set Reconciliation with Nearly Optimal Communication Complexity 

      Minsky, Yaron; Trachtenberg, Ari; Zippel, Richard (Cornell University, 2000-09-27)
      We consider the problem of efficiently reconciling two similar sets held by different hosts while minimizing the communication complexity. This type of problem arises naturally from gossip protocols used for the distribution ...
    • Set Reconciliation with Nearly Optimal Communication Complexity 

      Minsky, Yaron; Trachtenberg, Ari; Zippel, Richard (Cornell University, 2000-04-28)
      We consider a fundamental problem that arises in the context of gossip protocols. Specifically, we consider the problem of efficiently reconciling two similar sets held by different hosts while minimizing the ...