| 595 | -- | 596 | Mark Braverman, David P. Woodruff. Guest Editorial for Information Complexity and Applications |
| 597 | -- | 629 | Gábor Braun, Sebastian Pokutta. Common Information and Unique Disjointness |
| 630 | -- | 653 | Elad Haramaty, Madhu Sudan. Deterministic Compression with Uncertain Priors |
| 654 | -- | 683 | Venkatesan Guruswami, Krzysztof Onak. Superlinear Lower Bounds for Multipass Graph Processing |
| 684 | -- | 719 | Mika Göös, Toniann Pitassi, Thomas Watson 0001. Zero-Information Protocols and Unambiguity in Arthur-Merlin Communication |
| 720 | -- | 748 | Rahul Jain 0001, Attila Pereszlényi, Penghui Yao. A Direct Product Theorem for Two-Party Bounded-Round Public-Coin Communication Complexity |
| 749 | -- | 781 | Joshua Brody, Harry Buhrman, Michal Koucký, Bruno Loff, Florian Speelman, Nikolai K. Vereshchagin. Towards a Reverse Newman's Theorem in Interactive Information Complexity |
| 782 | -- | 795 | Gillat Kol, Shay Moran, Amir Shpilka, Amir Yehudayoff. Direct Sum Fails for Zero-Error Average Communication |
| 796 | -- | 845 | Joshua Brody, Amit Chakrabarti, Ranganath Kondapally, David P. Woodruff, Grigory Yaroslavtsev. Certifying Equality With Limited Interaction |
| 846 | -- | 864 | Mark Braverman, Omri Weinstein. A Discrepancy Lower Bound for Information Complexity |