default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDManuj Mukherjee
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c12]Mudit Aggarwal, Manuj Mukherjee:
Improved Bounds on the Interactive Capacity via Error Pattern Analysis. ISIT 2024: 2975-2980- [c11]Manuj Mukherjee, Ran Gelles:
Information Exchange is Harder with Noise at Source. ISIT 2024: 3285-3290 - [c10]Manuj Mukherjee, Ran Gelles:
Computation in Server-Assisted Noisy Networks. ISIT 2024: 3297-3301 - [i16]Mudit Aggarwal, Manuj Mukherjee:
Improved bounds on the interactive capacity via error pattern analysis. CoRR abs/2401.15355 (2024) - [i15]Sagnik Chatterjee, Manuj Mukherjee, Alhad Sethi:
Generalization Bounds for Dependent Data using Online-to-Batch Conversion. CoRR abs/2405.13666 (2024) - 2023
- [j5]Manuj Mukherjee
, Aslan Tchamkerten, Chadi Jabbour:
Reconfigurable Adaptive Channel Sensing. IEEE Trans. Green Commun. Netw. 7(3): 1394-1406 (2023) - [i14]Sabyasachi Basu, Manuj Mukherjee:
Optimal storage codes on graphs with fixed locality. CoRR abs/2307.08680 (2023) - 2021
- [j4]Manuj Mukherjee, Ran Gelles:
Multiparty Interactive Coding Over Networks of Intersecting Broadcast Links. IEEE J. Sel. Areas Inf. Theory 2(4): 1078-1092 (2021) - [c9]Manuj Mukherjee, Ran Gelles:
Multiparty Interactive Communication with Broadcast Links. ITW 2021: 1-6 - [i13]Manuj Mukherjee, Aslan Tchamkerten, Mansoor I. Yousefi:
Approximating Probability Distributions by ReLU Networks. CoRR abs/2101.09973 (2021) - [i12]Manuj Mukherjee, Aslan Tchamkerten, Chadi Jabbour:
Reconfigurable Adaptive Channel Sensing. CoRR abs/2104.12460 (2021) - [i11]Manuj Mukherjee, Ran Gelles:
Multiparty Interactive Coding over Networks of Intersecting Broadcast Links. CoRR abs/2105.01506 (2021) - 2020
- [c8]Manuj Mukherjee, Aslan Tchamkerten, Mansoor I. Yousefi:
Approximating Probability Distributions by ReLU Networks. ITW 2020: 1-5
2010 – 2019
- 2019
- [j3]Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou:
Upper Bounds via Lamination on the Constrained Secrecy Capacity of Hypergraphical Sources. IEEE Trans. Inf. Theory 65(8): 5080-5093 (2019) - [i10]Chung Chan, Manuj Mukherjee, Praneeth Kumar Vippathalla, Qiaoqiao Zhou:
Multiterminal Secret Key Agreement with Nearly No Discussion. CoRR abs/1904.11383 (2019) - 2018
- [j2]Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou:
On the Optimality of Secret Key Agreement via Omniscience. IEEE Trans. Inf. Theory 64(4): 2371-2389 (2018) - [c7]Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou:
Multiterminal Secret Key Agreement at Asymptotically Zero Discussion Rate. ISIT 2018: 2654-2658 - [i9]Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou:
Multiterminal Secret Key Agreement at Asymptotically Zero Discussion Rate. CoRR abs/1802.04955 (2018) - [i8]Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou:
Upper Bounds via Lamination on the Constrained Secrecy Capacity of Hypergraphical Sources. CoRR abs/1805.01115 (2018) - 2017
- [c6]Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou:
Secret key agreement under discussion rate constraints. ISIT 2017: 1519-1523 - [i7]Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou:
Secret Key Agreement under Discussion Rate Constraints. CoRR abs/1701.05008 (2017) - [i6]Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou:
On the Optimality of Secret Key Agreement via Omniscience. CoRR abs/1702.07429 (2017) - 2016
- [j1]Manuj Mukherjee, Navin Kashyap, Yogesh Sankarasubramaniam:
On the Public Communication Needed to Achieve SK Capacity in the Multiterminal Source Model. IEEE Trans. Inf. Theory 62(7): 3811-3830 (2016) - [c5]Manuj Mukherjee, Chung Chan, Navin Kashyap, Qiaoqiao Zhou:
Bounds on the communication rate needed to achieve SK capacity in the hypergraphical source model. ISIT 2016: 2504-2508 - [c4]Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou:
When is omniscience a rate-optimal strategy for achieving secret key capacity? ITW 2016: 354-358 - [i5]Manuj Mukherjee, Chung Chan, Navin Kashyap, Qiaoqiao Zhou:
Bounds on the Communication Rate Needed to Achieve SK Capacity in the Hypergraphical Source Model. CoRR abs/1601.05377 (2016) - 2015
- [c3]Manuj Mukherjee, Navin Kashyap:
The communication complexity of achieving SK capacity in a class of PIN models. ISIT 2015: 296-300 - [i4]Manuj Mukherjee, Navin Kashyap:
The communication complexity of achieving SK capacity in a class of PIN models. CoRR abs/1504.00629 (2015) - [i3]Manuj Mukherjee, Navin Kashyap, Yogesh Sankarasubramaniam:
On the Public Communication Needed to Achieve SK Capacity in the Multiterminal Source Model. CoRR abs/1507.02874 (2015) - 2014
- [c2]Manuj Mukherjee, Navin Kashyap:
On the communication complexity of secret key generation in the multiterminal source model. ISIT 2014: 1151-1155 - [c1]Manuj Mukherjee, Navin Kashyap, Yogesh Sankarasubramaniam:
Achieving SK capacity in the source model: When must all terminals talk? ISIT 2014: 1156-1160 - [i2]Manuj Mukherjee, Navin Kashyap:
On the Communication Complexity of Secret Key Generation in the Multiterminal Source Model. CoRR abs/1401.1117 (2014) - [i1]Manuj Mukherjee, Navin Kashyap, Yogesh Sankarasubramaniam:
Achieving SK Capacity in the Source Model: When Must All Terminals Talk? CoRR abs/1401.5037 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-13 18:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
