Networks, Communication, and VLSI
Lists
Only you see this
Abstract
Results about communication complexity have all kinds of applications. The most obvious ones are applications to communication problems. For example, for the management of a distributed system it is often required to check whether two copies of a file that reside in two different sites are the same. Clearly, this is just solving the “equality” problem EQ, whose communication complexity was extensively studied in the first part of this book. It is also very useful to compare a whole directory. Namely, to get for each file in the directory a bit indicating whether the copies of this particular file are the same or not. This is the same as solving the direct-sum version of EQ (see Section 4.1).
BibTeX
@inproceedings{kushilevitz1996networks,
author = {Eyal Kushilevitz and Noam Nisan},
title = {{Networks, Communication, and VLSI}},
booktitle = {Cambridge},
year = {1996},
doi = {10.1017/cbo9780511574948.009},
}Loading related content...