Sciweavers

96
Voted
SODA
2000
ACM
123views Algorithms» more  SODA 2000»
14 years 11 months ago
Communication complexity of document exchange
We address the problem of minimizing the communication involved in the exchange of similar documents. We consider two users, A and B, who hold documents x and y respectively. Neit...
Graham Cormode, Mike Paterson, Süleyman Cenk ...