TY  - GEN
AU  - Roughgarden, Tim 
TI  - Communication complexity (for algorithm designers)
SN  - 9781680831146
U1  - 004.6 ROU/C 
PY  - 2016///
CY  - United States of America -- 
PB  - Now Publishers -- 
KW  - Computer science
KW  - Computer algorithms Design
KW  - Design and analysis of algorithms
N1  - Preface1: Data Streams: Algorithms and Lower Bounds2: Lower Bounds for One Way Communication: Disjointness, Index, and Gap-Hamming3: Lower Bounds for Compressive Sensing4: Boot Camp on Communication Complexity5: Lower Bounds for the Extension Complexity of Polytopes6: Lower Bounds for Data Structures7: Lower Bounds in Algorithmic Game Theory8: Lower Bounds in Property TestingReferences
N2  - The two primary goals of the text are to learn several canonical problems in communication complexity that are useful for proving lower bounds for algorithms (Disjointness, Index, Gap-Hamming, and so on); and to learn how to reduce lower bounds for fundamental algorithmic problems to communication complexity lower bounds
ER  -