| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A Direct Product Theorem for Two-Party Bounded-Round Public-Coin Communication Complexity
|
Jain, Rahul
|
|
2015
|
76 |
3 |
p. 720-748
|
artikel
|
| 2 |
A Discrepancy Lower Bound for Information Complexity
|
Braverman, Mark
|
|
2015
|
76 |
3 |
p. 846-864
|
artikel
|
| 3 |
Certifying Equality With Limited Interaction
|
Brody, Joshua
|
|
2016
|
76 |
3 |
p. 796-845
|
artikel
|
| 4 |
Common Information and Unique Disjointness
|
Braun, Gábor
|
|
2016
|
76 |
3 |
p. 597-629
|
artikel
|
| 5 |
Deterministic Compression with Uncertain Priors
|
Haramaty, Elad
|
|
2016
|
76 |
3 |
p. 630-653
|
artikel
|
| 6 |
Direct Sum Fails for Zero-Error Average Communication
|
Kol, Gillat
|
|
2016
|
76 |
3 |
p. 782-795
|
artikel
|
| 7 |
Guest Editorial for Information Complexity and Applications
|
Braverman, Mark
|
|
2016
|
76 |
3 |
p. 595-596
|
artikel
|
| 8 |
Superlinear Lower Bounds for Multipass Graph Processing
|
Guruswami, Venkatesan
|
|
2016
|
76 |
3 |
p. 654-683
|
artikel
|
| 9 |
Towards a Reverse Newman’s Theorem in Interactive Information Complexity
|
Brody, Joshua
|
|
2016
|
76 |
3 |
p. 749-781
|
artikel
|
| 10 |
Zero-Information Protocols and Unambiguity in Arthur–Merlin Communication
|
Göös, Mika
|
|
2016
|
76 |
3 |
p. 684-719
|
artikel
|
Tijdschrift beschrijving