My Google Scholar profile can be found here. My DBLP profile is here.
Published patent applications:
M. Mukherjee, A. Tchamkerten, C. Jabbour, "Devices and methods for low power adaptive channel sensing," US Patent App. 17/787301.
PhD Thesis:
Secret Key Generation in the Multiterminal Source Model : Communication and Other Aspects. [Link]
Journals:
M. Mukherjee, A. Tchamkerten, C. Jabbour, "Reconfigurable Adaptive Channel Sensing," in IEEE Transactions on Green Communications and Networking, vol. 7, no. 3, pp. 1394-1406, Sept. 2023.
M. Mukherjee, R. Gelles, "Multiparty interactive coding over networks of intersecting broadcast links," IEEE Journal on Selected Areas in Information Theory, vol. 2, no. 4, pp. 1078-1092, Dec. 2021.
C. Chan, M. Mukherjee, N. Kashyap, Q. Zhou, “Upper bounds via lamination on the constrained secrecy capacity of hypergraphical sources,” IEEE Trans. Inf. Theory, vol. 65, no.8, pp. 5080–5093, August 2019.
C. Chan, M. Mukherjee, N. Kashyap, Q. Zhou, “On the optimality of secret key agreement via omniscience,” IEEE Trans. Inf. Theory, vol. 64, no. 4, pp. 2371–2389, April 2018.
M. Mukherjee, N. Kashyap, Y. Sankarasubramaniam, “On the public communication needed to achieve SK capacity in the multiterminal source model,” IEEE Trans. Inf. Theory, vol. 62, no. 7, pp. 3811–3830, July 2016.
Conference Publications:
S. Chatterjee, M. Mukherjee, A. Sethi, "Generalization Bounds for Dependent Data using Online-to-Batch Conversion ," in Proc. 2025 International Conference on Artificial Intelligence and Statistics (AISTATS 2025), PMLR, vol. 258, pp. 2152-2160.
M. Mukherjee and R. Gelles, "Information Exchange is Harder with Noise at Source," in Proc. 2024 IEEE International Symposium on Information Theory (ISIT), Athens, Greece, 2024, pp. 3285-3290. (Long version here)
M. Aggarwal and M. Mukherjee, "Improved Bounds on the Interactive Capacity via Error Pattern Analysis," in Proc. 2024 IEEE International Symposium on Information Theory (ISIT), Athens, Greece, 2024, pp. 2975-2980.
M. Mukherjee and R. Gelles, "Computation in Server-Assisted Noisy Networks," in Proc. 2024 IEEE International Symposium on Information Theory (ISIT), Athens, Greece, 2024, pp. 3297-3301.
M. Mukherjee, R. Gelles, “Multiparty Interactive Communication with Broadcast Links,” in Proc. 2021 IEEE Information Theory Workshop (ITW), 2021, Kanazawa, Japan, pp. 1-6.
M. Mukherjee, A. Tchamkerten, and M. Yousefi, "Approximating Probability Distributions by ReLU Networks", in Proc. 2020 IEEE Information Theory Workshop (ITW), Riva del Garda, Italy, 2021, pp. 1-5.
C. Chan, M. Mukherjee, N. Kashyap, and Q. Zhou, “Multiterminal secret key agreement at asymptotically zero discussion rate”, in Proc. 2018 IEEE Int. Symp. Inf. Theory (ISIT2018), Vail, Colorado, USA, June 17-22, 2018, pp. 2654–2658.
C. Chan, M Mukherjee, N. Kashyap, and Q. Zhou, “Secret key agreement under discussion rate constraints”, in Proc. 2017 IEEE Int. Symp. Inf. Theory (ISIT2017), Aachen, Germany, June 25-30, 2017, pp. 1519–1523.
C. Chan, M. Mukherjee, N. Kashyap, Q. Zhou, “When is omniscience a rate-optimal strategy for achieving secret key capacity?” in Proc. 2016 IEEE Inf. Theory Workshop (ITW2016), Cambridge, UK, Sep. 11-14, 2016, pp 354–358.
M. Mukherjee, C. Chan, N. Kashyap, Q. Zhou, “Bounds on the communication rate needed to achieve SK capacity in the hypergraphical source model,” in Proc. 2016 IEEE Int. Symp. Inf. Theory (ISIT2016), Barcelona, Spain, July 10-15, 2016, pp. 2504–2508.
M. Mukherjee, N. Kashyap, “The communication complexity of achieving SK capacity in a class of PIN models,” in Proc. 2015 IEEE Int. Symp. Inf. Theory (ISIT2015), Hong Kong, China, June 14-19, 2015, pp. 296–300.
M. Mukherjee, N. Kashyap, “On the communication complexity of secret key generation in the multiterminal source model,” in Proc. 2014 IEEE Int. Symp. Inf. Theory (ISIT2014), Honolulu, Hawai’i, USA, June 29–July 4, 2014, pp. 1151–1155.
M. Mukherjee, N. Kashyap, Y. Sankarasubramaniam, “Achieving SK capacity in the source model: When must all terminals talk?” in Proc. 2014 IEEE Int. Symp. Inf. Theory (ISIT2014), Honolulu, Hawai’i, USA, June 29–July 4, 2014, pp. 1156–1160.
N. Kashyap, M. Mukherjee, Y. Sankarasubramaniam, “On the secret key capacity of the Harary graph PIN model,” in Proc. 2013 Nat. Conf. Commun. (NCC 2013), Delhi, India, Feb. 2013, pp. 1–5.