| 2026 | ISIT | Perfect Secret Key Generation for a Class of Hypergraphical Sources. | Manuj Mukherjee, Sagnik Chatterjee, Alhad Sethi |
| 2025 | AISTATS | Generalization Bounds for Dependent Data using Online-to-Batch Conversion. | Sagnik Chatterjee, Manuj Mukherjee, Alhad Sethi |
| 2024 | ISIT | Improved Bounds on the Interactive Capacity via Error Pattern Analysis. | Mudit Aggarwal, Manuj Mukherjee |
| 2024 | ISIT | Information Exchange is Harder with Noise at Source. | Manuj Mukherjee, Ran Gelles |
| 2024 | ISIT | Computation in Server-Assisted Noisy Networks. | Manuj Mukherjee, Ran Gelles |
| 2021 | ITW | Multiparty Interactive Communication with Broadcast Links. | Manuj Mukherjee, Ran Gelles |
| 2020 | ITW | Approximating Probability Distributions by ReLU Networks. | Manuj Mukherjee, Aslan Tchamkerten, Mansoor I. Yousefi |
| 2018 | ISIT | Multiterminal Secret Key Agreement at Asymptotically Zero Discussion Rate. | Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou |
| 2017 | ISIT | Secret key agreement under discussion rate constraints. | Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou |
| 2016 | ISIT | Bounds on the communication rate needed to achieve SK capacity in the hypergraphical source model. | Manuj Mukherjee, Chung Chan, Navin Kashyap, Qiaoqiao Zhou |
| 2016 | ITW | When is omniscience a rate-optimal strategy for achieving secret key capacity? | Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou |
| 2015 | ISIT | The communication complexity of achieving SK capacity in a class of PIN models. | Manuj Mukherjee, Navin Kashyap |
| 2014 | ISIT | On the communication complexity of secret key generation in the multiterminal source model. | Manuj Mukherjee, Navin Kashyap |
| 2014 | ISIT | Achieving SK capacity in the source model: When must all terminals talk? | Manuj Mukherjee, Navin Kashyap, Yogesh Sankarasubramaniam |