default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBhagyashree Puranik
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j3]Bhagyashree Puranik
, Ozgur Guldogan, Upamanyu Madhow, Ramtin Pedarsani:
Long-Term Fairness in Sequential Multi-Agent Selection With Positive Reinforcement. IEEE J. Sel. Areas Inf. Theory 5: 424-441 (2024)- 2022
- [j2]Bhagyashree Puranik, Upamanyu Madhow, Ramtin Pedarsani:
Generalized Likelihood Ratio Test for Adversarially Robust Hypothesis Testing. IEEE Trans. Signal Process. 70: 4124-4139 (2022) - 2018
- [j1]M. Nikhil Krishnan, Bhagyashree Puranik, P. Vijay Kumar, Itzhak Tamo, Alexander Barg:
Exploiting Locality for Improved Decoding of Binary Cyclic Codes. IEEE Trans. Commun. 66(6): 2346-2358 (2018)
Conference and Workshop Papers
- 2024
- [c6]Bhagyashree Puranik, Ahmad Beirami, Yao Qin, Upamanyu Madhow:
Improving Robustness via Tilted Exponential Layer: A Communication-Theoretic Perspective. AISTATS 2024: 4510-4518 - 2022
- [c5]Bhagyashree Puranik, Upamanyu Madhow, Ramtin Pedarsani:
A Dynamic Decision-Making Framework Promoting Long-Term Fairness. AIES 2022: 547-556 - [c4]Maryam Eslami Rasekh, Bhagyashree Puranik, Upamanyu Madhow, Mark J. W. Rodwell:
In-the-Field Calibration of All-Digital MIMO Arrays. WCNC 2022: 1389-1394 - 2021
- [c3]Bhagyashree Puranik, Upamanyu Madhow, Ramtin Pedarsani:
Adversarially Robust Classification Based on GLRT. ICASSP 2021: 3785-3789 - 2018
- [c2]Myna Vajha, Vinayak Ramkumar, Bhagyashree Puranik, Ganesh R. Kini, Elita A. Lobo, Birenjith Sasidharan, P. Vijay Kumar, Alexander Barg, Min Ye, Srinivasan Narayanamurthy, Syed Hussain, Siddhartha Nandi:
Clay Codes: Moulding MDS Codes to Yield an MSR Code. FAST 2018: 139-154 - 2017
- [c1]M. Nikhil Krishnan, Bhagyashree Puranik, P. Vijay Kumar, Itzhak Tamo, Alexander Barg:
A study on the impact of locality in the decoding of binary cyclic codes. ISIT 2017: 176-180
Informal and Other Publications
- 2024
- [i5]Bhagyashree Puranik, Ozgur Guldogan, Upamanyu Madhow, Ramtin Pedarsani:
Long-Term Fairness in Sequential Multi-Agent Selection with Positive Reinforcement. CoRR abs/2407.07350 (2024) - 2023
- [i4]Bhagyashree Puranik, Ahmad Beirami, Yao Qin, Upamanyu Madhow:
Improving Robustness via Tilted Exponential Layer: A Communication-Theoretic Perspective. CoRR abs/2311.01047 (2023) - 2021
- [i3]Bhagyashree Puranik, Upamanyu Madhow, Ramtin Pedarsani:
Generalized Likelihood Ratio Test for Adversarially Robust Hypothesis Testing. CoRR abs/2112.02209 (2021) - 2020
- [i2]Bhagyashree Puranik, Upamanyu Madhow, Ramtin Pedarsani:
Adversarially Robust Classification based on GLRT. CoRR abs/2011.07835 (2020) - 2017
- [i1]M. Nikhil Krishnan, Bhagyashree Puranik, P. Vijay Kumar, Itzhak Tamo, Alexander Barg:
A Study on the Impact of Locality in the Decoding of Binary Cyclic Codes. CoRR abs/1702.03786 (2017)
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-08-25 20:04 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:
