default search action
Mayank Bakshi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j10]Neha Sangwan
, Mayank Bakshi
Byzantine Multiple Access Channels - Part I: Reliable Communication. IEEE Trans. Inf. Theory 70(4): 2309-2366 (2024) - [c41]Eeshan Modak, Mayank Bakshi, Bikash Kumar Dey, Vinod M. Prabhakaran:
Sequential Adversarial Hypothesis Testing. ISIT 2024: 1474-1479 - [c40]Mayank Bakshi, Sara Ghasvarianjahromi, Yauhen Yakimenka, Allison Beemer, Oliver Kosut, Jörg Kliewer:
Valid: a Validated Algorithm for Learning in Decentralized Networks with Possible Adversarial Presence. ISIT 2024: 2502-2507 - [i27]Mayank Bakshi, Sara Ghasvarianjahromi, Yauhen Yakimenka, Allison Beemer, Oliver Kosut, Jörg Kliewer:
VALID: a Validated Algorithm for Learning in Decentralized Networks with Possible Adversarial Presence. CoRR abs/2405.07316 (2024) - [i26]Afonso de Sá Delgado Neto, Maximilian Egger, Mayank Bakshi, Rawad Bitar:
Communication-Efficient Byzantine-Resilient Federated Zero-Order Optimization. CoRR abs/2406.14362 (2024) - 2023
- [j9]Qiaosheng Eric Zhang
Optimal Information Security Against Limited-View Adversaries: Beyond MDS Codes. IEEE Trans. Commun. 71(12): 7206-7217 (2023) - [c39]Narayana Prasad Santhanam, Mayank Bakshi:
Universal Compression of High Dimensional Gaussian Vectors with James-Stein shrinkage. ISIT 2023: 382-387 - [c38]Eeshan Modak, Neha Sangwan, Mayank Bakshi, Bikash Kumar Dey, Vinod M. Prabhakaran:
Hypothesis Testing for Adversarial Channels: Chernoff-Stein Exponents. ISIT 2023: 1225-1230 - [c37]Mayank Bakshi, Oliver Kosut:
On Authentication against a Myopic Adversary using Stochastic Codes. ISIT 2023: 2422-2427 - [i25]Eeshan Modak, Neha Sangwan, Mayank Bakshi, Bikash Kumar Dey, Vinod M. Prabhakaran:
Hypothesis Testing for Adversarial Channels: Chernoff-Stein Exponents. CoRR abs/2304.14166 (2023) - [i24]Mayank Bakshi, Oliver Kosut:
On Authentication against a Myopic Adversary using Stochastic Codes. CoRR abs/2305.07292 (2023) - [i23]Neha Sangwan, Mayank Bakshi, Bikash Kumar Dey, Vinod M. Prabhakaran:
Byzantine Multiple Access Channels - Part II: Communication With Adversary Identification. CoRR abs/2309.11174 (2023) - 2022
- [j8]Zhenyu Ming, Liping Zhang, Hao Wu, Yanwei Xu, Mayank Bakshi, Bo Bai, Gong Zhang:
An accurate and practical algorithm for internet traffic recovery problem. Neurocomputing 467: 203-213 (2022) - [i22]Neha Sangwan, Mayank Bakshi, Bikash Kumar Dey, Vinod M. Prabhakaran:
Byzantine Multiple Access Channels - Part I: Reliable Communication. CoRR abs/2211.12769 (2022) - 2021
- [j7]Liqun Qi, Yannan Chen, Mayank Bakshi
Triple Decomposition and Tensor Recovery of Third Order Tensors. SIAM J. Matrix Anal. Appl. 42(1): 299-329 (2021) - [j6]Qiaosheng Eric Zhang
Covert Communication Over Adversarially Jammed Channels. IEEE Trans. Inf. Theory 67(9): 6096-6121 (2021) - [c36]Syomantak Chaudhuri, Neha Sangwan, Mayank Bakshi, Bikash Kumar Dey, Vinod M. Prabhakaran:
Compound Arbitrarily Varying Channels. ISIT 2021: 503-508 - [c35]Neha Sangwan, Mayank Bakshi, Bikash Kumar Dey, Vinod M. Prabhakaran:
Communication With Adversary Identification in Byzantine Multiple Access Channels. ISIT 2021: 688-693 - [i21]Neha Sangwan, Mayank Bakshi, Bikash Kumar Dey, Vinod M. Prabhakaran:
Communication With Adversary Identification in Byzantine Multiple Access Channels. CoRR abs/2105.03380 (2021) - [i20]Syomantak Chaudhuri, Neha Sangwan, Mayank Bakshi, Bikash Kumar Dey, Vinod M. Prabhakaran:
Compound Arbitrarily Varying Channels. CoRR abs/2105.03420 (2021) - 2020
- [j5]Jianhan Song
Stealthy Communication Over Adversarially Jammed Multipath Networks. IEEE Trans. Commun. 68(12): 7473-7484 (2020) - [j4]Qiaosheng Eric Zhang
Covert Communication With Polynomial Computational Complexity. IEEE Trans. Inf. Theory 66(3): 1354-1384 (2020) - [i19]Qiaosheng Eric Zhang, Matthieu R. Bloch, Mayank Bakshi, Sidharth Jaggi:
Undetectable Radios: Covert Communication under Spectral Mask Constraints. CoRR abs/2001.01201 (2020) - [i18]Liqun Qi, Yannan Chen, Mayank Bakshi, Xinzhen Zhang:
Triple Decomposition and Tensor Recovery of Third Order Tensors. CoRR abs/2002.02259 (2020)
2010 – 2019
- 2019
- [c34]Neha Sangwan, Mayank Bakshi, Bikash Kumar Dey, Vinod M. Prabhakaran:
Multiple Access Channels with Adversarial Users. ISIT 2019: 435-439 - [c33]Qiaosheng Eric Zhang
Undetectable Radios: Covert Communication under Spectral Mask Constraints. ISIT 2019: 992-996 - [c32]Neha Sangwan, Mayank Bakshi, Bikash Kumar Dey, Vinod M. Prabhakaran:
Multiple Access Channels with Byzantine Users. ITW 2019: 1-5 - [i17]Neha Sangwan, Mayank Bakshi, Bikash Kumar Dey, Vinod M. Prabhakaran:
Byzantine Multiple Access. CoRR abs/1904.11925 (2019) - 2018
- [j3]Mayank Bakshi
Plausible Deniability Over Broadcast Channels. IEEE Trans. Inf. Theory 64(12): 7883-7902 (2018) - [c31]Jianhan Song, Qiaosheng Eric Zhang
Multipath Stealth Communication with Jammers. ISIT 2018: 761-765 - [c30]Qiaosheng Eric Zhang
Covert Communication over Adversarially Jammed Channels. ITW 2018: 1-5 - [i16]Qiaosheng Eric Zhang, Mayank Bakshi, Sidharth Jaggi:
Covert Communication over Adversarially Jammed Channels. CoRR abs/1805.02426 (2018) - [i15]Jianhan Song, Qiaosheng Eric Zhang, Swanand Kadhe, Mayank Bakshi, Sidharth Jaggi:
Multipath Stealth Communication with Jammers. CoRR abs/1805.03095 (2018) - 2017
- [j2]Sheng Cai
Efficient Algorithms for Noisy Group Testing. IEEE Trans. Inf. Theory 63(4): 2113-2136 (2017) - [c29]Fariba Abbasi
Coding for networks of compound channels. ISIT 2017: 2388-2392 - [c28]Amit Kalele, Kiran Narkhede, Mayank Bakshi:
Time of Use Tariff parameter Estimation: A Data Analysis Approach on Multicore Systems. ICPE Companion 2017: 113-118 - 2016
- [j1]Mayank Bakshi
SHO-FA: Robust Compressive Sensing With Order-Optimal Complexity, Measurements, and Bits. IEEE Trans. Inf. Theory 62(12): 7419-7444 (2016) - [c27]Peida Tian, Sidharth Jaggi, Mayank Bakshi
Arbitrarily varying networks: Capacity-achieving computationally efficient codes. ISIT 2016: 2139-2143 - [c26]Mayank Bakshi
Plausible deniability over broadcast channels. ISIT 2016: 2219-2223 - [c25]Qiaosheng Eric Zhang
Computationally efficient deniable communication. ISIT 2016: 2234-2238 - [c24]Tongxin Li, Mayank Bakshi
Fundamental limits and achievable strategies for low energy compressed sensing with applications in wireless communication. SPAWC 2016: 1-6 - [i14]Mayank Bakshi, Vinod M. Prabhakaran:
Plausible Deniability over Broadcast Channels. CoRR abs/1601.06676 (2016) - [i13]Peida Tian, Sidharth Jaggi, Mayank Bakshi, Oliver Kosut:
Arbitrarily Varying Networks: Capacity-achieving Computationally Efficient Codes. CoRR abs/1605.01834 (2016) - [i12]Qiaosheng Eric Zhang, Mayank Bakshi, Sidharth Jaggi:
Computationally Efficient Deniable Communication. CoRR abs/1607.02014 (2016) - 2015
- [c23]Swanand Kadhe
Reliable and secure communication over adversarial multipath networks: A survey. ICICS 2015: 1-5 - [c22]Anubhav Jain, Mayank Bakshi, Amit Kalele, Easwar Subramanian:
On Accelerating Concurrent PCA Computations for Financial Risk Applications. HiPC 2015: 175-184 - [c21]Qiaosheng Eric Zhang
Coding against a limited-view adversary: The effect of causality and feedback. ISIT 2015: 2530-2534 - [c20]Qiaosheng Eric Zhang
Talking reliably, secretly, and efficiently: A "complete" characterization. ITW 2015: 1-5 - [i11]Qiaosheng Eric Zhang, Swanand Kadhe, Mayank Bakshi, Sidharth Jaggi, Alex Sprintson:
Coding against a Limited-view Adversary: The Effect of Causality and Feedback. CoRR abs/1504.05984 (2015) - 2014
- [c19]Sheng Cai, Mayank Bakshi
FRANTIC: A Fast Reference-based Algorithm for Network Tomography via compressive sensing. COMSNETS 2014: 1-7 - [c18]Swanand Kadhe
Reliable, deniable, and hidable communication over multipath networks. ISIT 2014: 611-615 - [c17]Sheng Cai, Mayank Bakshi
SUPER: Sparse signals with unknown phases efficiently recovered. ISIT 2014: 2007-2011 - [c16]Pak Hou Che, Mayank Bakshi
Reliable, deniable and hidable communication. ITA 2014: 1-10 - [c15]Pak Hou Che, Mayank Bakshi
Reliable deniable communication with channel uncertainty. ITW 2014: 30-34 - [c14]Pak Hou Che, Swanand Kadhe
Reliable, deniable and hidable communication: A quick survey. ITW 2014: 227-231 - [i10]Sheng Cai, Mayank Bakshi, Sidharth Jaggi, Minghua Chen:
SUPER: Sparse signals with Unknown Phases Efficiently Recovered. CoRR abs/1401.4269 (2014) - [i9]Swanand Kadhe, Sidharth Jaggi, Mayank Bakshi, Alex Sprintson:
Reliable, Deniable, and Hidable Communication over Multipath Networks. CoRR abs/1401.4451 (2014) - 2013
- [c13]Sheng Cai, Mohammad Jahangoshahi, Mayank Bakshi
GROTESQUE: Noisy Group Testing (Quick and Efficient). Allerton 2013: 1234-1241 - [c12]Farzin Haddadpour, Mahdi Jafari Siavoshani, Mayank Bakshi
On AVCs with quadratic constraints. ISIT 2013: 271-275 - [c11]Pak Hou Che, Mayank Bakshi
Reliable deniable communication: Hiding messages in noise. ISIT 2013: 2945-2949 - [c10]Chun Lam Chan, Sheng Cai, Mayank Bakshi
Stochastic threshold group testing. ITW 2013: 1-5 - [i8]Farzin Haddadpour, Mahdi Jafari Siavoshani, Mayank Bakshi, Sidharth Jaggi:
On AVCs with Quadratic Constraints. CoRR abs/1301.6345 (2013) - [i7]Chun Lam Chan, Sheng Cai, Mayank Bakshi, Sidharth Jaggi, Venkatesh Saligrama:
Near-Optimal Stochastic Threshold Group Testing. CoRR abs/1304.6027 (2013) - [i6]Pak Hou Che, Mayank Bakshi, Sidharth Jaggi:
Reliable Deniable Communication: Hiding Messages in Noise. CoRR abs/1304.6693 (2013) - [i5]Sheng Cai, Mohammad Jahangoshahi, Mayank Bakshi, Sidharth Jaggi:
GROTESQUE: Noisy Group Testing (Quick and Efficient). CoRR abs/1307.2811 (2013) - [i4]Sheng Cai, Mayank Bakshi, Sidharth Jaggi, Minghua Chen:
FRANTIC: A Fast Reference-based Algorithm for Network Tomography via Compressive Sensing. CoRR abs/1312.0825 (2013) - 2012
- [c9]Mayank Bakshi
SHO-FA: Robust compressive sensing with order-optimal complexity, measurements, and bits. Allerton Conference 2012: 786-793 - [c8]Mayank Bakshi
On network coding capacity under on-off scheduling. ISIT 2012: 1667-1671 - [i3]Mayank Bakshi, Sidharth Jaggi, Sheng Cai, Minghua Chen:
SHO-FA: Robust compressive sensing with order-optimal complexity, measurements, and bits. CoRR abs/1207.2335 (2012) - 2011
- [c7]Mayank Bakshi
On equivalence for networks of noisy channels under byzantine attacks. ISIT 2011: 973-977 - 2010
- [c6]Mayank Bakshi
On zero-error source coding with feedback. ISIT 2010: 11-15 - [c5]Mayank Bakshi
Concatenated Polar codes. ISIT 2010: 918-922 - [i2]Mayank Bakshi, Sidharth Jaggi, Michelle Effros:
Concatenated Polar Codes. CoRR abs/1001.2545 (2010) - [i1]Mayank Bakshi, Michelle Effros:
On Zero-Error Source Coding with Feedback. CoRR abs/1001.2547 (2010)
2000 – 2009
- 2009
- [c4]Mayank Bakshi
On feedback in network source coding. ISIT 2009: 1348-1352 - 2008
- [c3]Wei-Hsin Gu, Michelle Effros, Mayank Bakshi
A continuity theory for lossless source coding over networks. Allerton 2008: 1527-1534 - [c2]Mayank Bakshi
On achievable rates for multicast in the presence of side information. ISIT 2008: 1661-1665 - 2007
- [c1]Mayank Bakshi
On Network Coding of Independent and Dependent Sources in Line Networks. ISIT 2007: 1096-1100
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-12 22:57 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: