This book is devoted to the investigation of a special topic in theoretical computer science - communication complexity as an abstract measure of the complexity of computing problems. Its main aim is to show how the theoretical study of communication complexity can be useful in the process of designing effective parallel algorithms. The author shows how to get important information about the parallel complexity (parallel time, the number of processors, the descriptional complexity of the topology of the parallel architecture) of specific computing problems from knowledge of their communication complexity. The book is written as a textbook for undergraduate and graduate students and provides a careful explanation of the subject as well as motivation for further research.
Communication Complexity and Parallel Computing
and over one million other books are available for Amazon Kindle.
Learn more
FREE Two-Day Shipping for students on millions of items. Learn more |
| |||||||||||||||||||||||||
Book Description
Editorial Reviews
Review
Altogether, students and researchers interested in the field of complexity theory get an informative compendium at their disposal. Formulations are precise, and the proofs are exact and complete...the book should be contained in the library of every complexity theorist. -- Christoph Meinel, Mathematical Reviews, Issue 98f
--This text refers to an alternate
Hardcover
edition.
Product Details
Would you like to update product info or give feedback on images?
|
More About the Author
Discover books, learn about writers, read author blogs, and more.
Customer Reviews
|
There are no customer reviews yet.
|
|||
|
Video reviews
|
Inside This Book
(learn more)
Browse and search another edition of this book.
Browse and search another edition of this book.
First Sentence:
Parallel data processing has become a reality. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
nondeterministic communication complexity, fooling set, lower bound proof technique, combinational complexity, parallel complexity measures, lower bound proof methods, relates communication complexity, linear communication complexity, superlogarithmic lower bound, communication complexity classes, sublinear separators, monochromatic submatrix, concentric representation, nondeterministic protocols, crossing sequence argument, communication complexity measure, nonlinear lower bounds, advice variables, direct lower bound, balanced partition, communication protocol model, input assignment, planar realization, lower bound method, probabilistic communication complexity Key Phrases - Capitalized Phrases (CAPs): (learn more)
Monte Carlo, Las Vegas, Exercises Exercise, Applying Lemma, Planar Separator New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Parallel data processing has become a reality. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
nondeterministic communication complexity, fooling set, lower bound proof technique, combinational complexity, parallel complexity measures, lower bound proof methods, relates communication complexity, linear communication complexity, superlogarithmic lower bound, communication complexity classes, sublinear separators, monochromatic submatrix, concentric representation, nondeterministic protocols, crossing sequence argument, communication complexity measure, nonlinear lower bounds, advice variables, direct lower bound, balanced partition, communication protocol model, input assignment, planar realization, lower bound method, probabilistic communication complexity Key Phrases - Capitalized Phrases (CAPs): (learn more)
Monte Carlo, Las Vegas, Exercises Exercise, Applying Lemma, Planar Separator New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Citations (learn more)
This book cites 26
books:
See all 26 books this book cites
36
books
cite this book:
See all 36 books citing this book
- Computer Science: A Modern Introduction (Prentice-Hall International Series in Computer Science) by Les Goldschlager in Back Matter
- Discrete Mathematics by Wiley in Back Matter
- Theoretical Computer Science: Essays in Memory of Shimon Even (Lecture Notes in Computer Science / Theoretical Computer Science and General Issues) by Oded Goldreich in Back Matter
- Rational Series and Their Languages (Eatcs Monographs on Theoretical Computer Science) by Jean Berstel in Back Matter
- Computing in Horn Clause Theories (E a T C S Monographs on Theoretical Computer Science) by Peter Padawitz in Back Matter
See all 26 books this book cites
- Automata, Languages and Programming: 26th International Colloquium, ICALP'99, Prague, Czech Republic, July 11-15, 1999 Proceedings (Lecture Notes in Computer Science) by Jiri Wiedermann on page 442, and page 502
- Design and Analysis of Randomized Algorithms: Introduction to Design Paradigms (Texts in Theoretical Computer Science. An EATCS Series) by J. Hromkovic in Back Matter (1), and Back Matter (2)
- SOFSEM 2005: Theory and Practice of Computer Science: 31st Conference on Current Trends in Theory and Practice of Computer Science, Liptovský Ján, ... Computer Science and General Issues) by Maria Bieliková on page 309
- Komplexitätstheorie: Grenzen der Effizienz von Algorithmen (Springer-Lehrbuch) (German Edition) by Ingo Wegener in Back Matter
- Mathematical Foundations of Computer Science 2002: 27th International Symposium, MFCS 2002, Warsaw, Poland, August 26-30, 2002. Proceedings (Lecture Notes in Computer Science) by Krzystof Diks on page 142
See all 36 books citing this book
Books on Related Topics
(learn more)
|
Tag this product(What's this?)Think of a tag as a keyword or label you consider is strongly related to this product.
Tags will help all customers organize and find favorite items. |
Customer Discussions
|
This product's forum
Active discussions in related forums
Search Customer Discussions
|
Related forums
|
