Back to Results
First PageMeta Content
Information theory / Communication / Cybernetics / Information Age / Communication complexity / Entropy / Pseudorandomness / Mutual information / Decision tree model / Theoretical computer science / Applied mathematics / Computational complexity theory


How to Compress Interactive Communication Boaz Barak∗ Mark Braverman† Xi Chen‡
Add to Reading List

Document Date: 2011-10-10 23:50:06

Open Document

File Size: 384,11 KB

Share Result on Facebook

Company

ZK / /

Country

United States / /

Currency

KRW / /

/

Facility

Princeton University / /

IndustryTerm

protocol compression algorithms / compression algorithm / randomized public coin protocol / compression protocol / interactive communication protocols / binary search / data intensive applications / protocol computing / communication protocol / computing / compression algorithms / naive protocol / arbitrary protocol / randomized protocols / /

Organization

National Science Foundation / Department of Computer Science / Center for Computational Intractability / Princeton University / /

Person

Boaz Barak / Anup Rao / Mark Braverman† Xi Chen / /

Position

player / independent observer / /

ProgrammingLanguage

D / C / /

Technology

15 6 Protocol / arbitrary protocol / Compressing protocol / compression algorithm / compression protocol / compression algorithms / 1.1 Compressing Communication Protocols / communication protocol / naive protocol / compressed protocol / compressed protocols / simulation / interactive communication protocols / protocol compression algorithms / randomized public coin protocol / interactive protocol / /

SocialTag