Name
Abstract | ||
|---|---|---|
We initiate the theory of communication complexity of indi- vidual inputs held by the agents, rather than worst-case or average-case. We consider total, partial, and partially correct protocols, one-way versus two-way, with (not in this version) and without help bits. |
Year | Venue | Keywords |
|---|---|---|
2004 | STACS | communication complexity |
Field | DocType | Citations |
Discrete mathematics,Computer science,Communication complexity,Theoretical computer science,Worst-case complexity | Conference | 1 |
PageRank | References | Authors |
0.36 | 7 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Harry Buhrman | 1 | 1607 | 117.99 |
| Hartmut Klauck | 2 | 484 | 30.85 |
| Nikolai K. Vereshchagin | 3 | 193 | 25.19 |
| Paul Vitányi | 4 | 2130 | 287.76 |