Communication Complexity For Algorithm Designers
Download Communication Complexity For Algorithm Designers PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get Communication Complexity For Algorithm Designers book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages.
Communication Complexity (for Algorithm Designers)
This text collects the lecture notes from the author's course "Communication Complexity (for Algorithm Designers)," taught at Stanford in the winter quarter of 2015. The two primary goals of the text are: (1) Learn several canonical problems in communication complexity that are useful for proving lower bounds for algorithms (disjointness, index, gap-hamming, etc.). (2) Learn how to reduce lower bounds for fundamental algorithmic problems to communication complexity lower bounds. Along the way, readers will also: (3) Get exposure to lots of cool computational models and some famous results about them -- data streams and linear sketches, compressive sensing, space-query time trade-offs in data structures, sublinear-time algorithms, and the extension complexity of linear programs. (4) Scratch the surface of techniques for proving communication complexity lower bounds (fooling sets, corruption arguments, etc.).
Communication Complexity (for Algorithm Designers)
Author: Tim Roughgarden
language: en
Publisher: Foundations and Trends (R) in Theoretical Computer Science
Release Date: 2016-05-11
This book deals mostly with impossibility results - lower bounds on what can be accomplished by algorithms. However, the perspective is unapologetically that of an algorithm designer. The reader will learn lower bound technology on a "need-to-know" basis, guided by fundamental algorithmic problems that we care about.
Structural Information and Communication Complexity
This book constitutes the refereed conference proceedings of the 29th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2022, held in Paderborn, Germany, in June 2022. The 16 full papers presented in this book were carefully reviewed and selected from 30 submissions. SIROCCO is devoted to the study of the interplay between structural knowledge, communication, and computing in decentralized systems of multiple communicating entities. Special emphasis is given to innovative approaches leading to better understanding of the relationship between computing and communication.