default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSwanand Kadhe
Swanand Ravindra Kadhe
Person information
SPARQL queries 
🛈 Please note that only 65% of the records listed on this page have a DOI. Therefore, DOI-based queries can only provide partial results.
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[i34]Swanand Ravindra Kadhe, Farhan Ahmed, Dennis Wei, Nathalie Baracaldo, Inkit Padhi:
Split, Unlearn, Merge: Leveraging Data Attributes for More Effective Unlearning in LLMs. CoRR abs/2406.11780 (2024)- [i33]Shuli Jiang, Swanand Ravindra Kadhe, Yi Zhou, Farhan Ahmed, Ling Cai, Nathalie Baracaldo:
Turning Generative Models Degenerate: The Power of Data Poisoning Attacks. CoRR abs/2407.12281 (2024) - 2023
- [j9]Qiaosheng Eric Zhang
, Swanand Kadhe, Mayank Bakshi, Sidharth Jaggi, Alex Sprintson:
Optimal Information Security Against Limited-View Adversaries: Beyond MDS Codes. IEEE Trans. Commun. 71(12): 7206-7217 (2023) - [j8]Orhan Öçal, Swanand Kadhe, Xiao Li, Kannan Ramchandran:
Minimum-Rate Spectrum-Blind Sampling Based on Sparse-Graph Codes. IEEE Trans. Signal Process. 71: 587-600 (2023) - [c39]Timothy Castiglia, Yi Zhou, Shiqiang Wang, Swanand Kadhe, Nathalie Baracaldo, Stacy Patterson:
LESS-VFL: Communication-Efficient Feature Selection for Vertical Federated Learning. ICML 2023: 3757-3781 - [c38]Nathalie Baracaldo, Farhan Ahmed, Kevin Eykholt, Yi Zhou, Shriti Priya, Taesung Lee, Swanand Kadhe, Mike Tan, Sridevi Polavaram, Sterling Suggs, Yuyang Gao, David Slater:
Benchmarking the Effect of Poisoning Defenses on the Security and Bias of Deep Learning Models. SP (Workshops) 2023: 45-56 - [i32]Timothy Castiglia, Yi Zhou, Shiqiang Wang, Swanand Kadhe, Nathalie Baracaldo, Stacy Patterson:
LESS-VFL: Communication-Efficient Feature Selection for Vertical Federated Learning. CoRR abs/2305.02219 (2023) - [i31]Swanand Ravindra Kadhe, Heiko Ludwig, Nathalie Baracaldo, Alan King, Yi Zhou, Keith Houck, Ambrish Rawat, Mark Purcell, Naoise Holohan, Mikio Takeuchi, Ryo Kawahara, Nir Drucker, Hayim Shaul, Eyal Kushnir, Omri Soceanu:
Privacy-Preserving Federated Learning over Vertically and Horizontally Partitioned Data for Financial Anomaly Detection. CoRR abs/2310.19304 (2023) - [i30]Shuli Jiang, Swanand Ravindra Kadhe, Yi Zhou, Ling Cai, Nathalie Baracaldo:
Forcing Generative Models to Degenerate Ones: The Power of Data Poisoning Attacks. CoRR abs/2312.04748 (2023) - [i29]Swanand Ravindra Kadhe, Anisa Halimi, Ambrish Rawat, Nathalie Baracaldo:
FairSISA: Ensemble Post-Processing to Improve Fairness of Unlearning in LLMs. CoRR abs/2312.07420 (2023) - 2022
- [c37]Runhua Xu, Nathalie Baracaldo, Yi Zhou, Ali Anwar, Swanand Kadhe, Heiko Ludwig:
DeTrust-FL: Privacy-Preserving Federated Learning in Decentralized Trust Setting. CLOUD 2022: 417-426 - [c36]Ambrish Rawat, Giulio Zizzo, Swanand Kadhe, Jonathan P. Epperlein, Stefano Braghin:
Robust Learning Protocol for Federated Tumor Segmentation Challenge. BrainLes@MICCAI (2) 2022: 183-195 - [i28]Anisa Halimi, Swanand Kadhe, Ambrish Rawat, Nathalie Baracaldo:
Federated Unlearning: How to Efficiently Erase a Client in FL? CoRR abs/2207.05521 (2022) - [i27]Runhua Xu, Nathalie Baracaldo, Yi Zhou, Ali Anwar, Swanand Kadhe, Heiko Ludwig:
DeTrust-FL: Privacy-Preserving Federated Learning in Decentralized Trust Setting. CoRR abs/2207.07779 (2022) - [i26]Ambrish Rawat, Giulio Zizzo, Swanand Kadhe, Jonathan P. Epperlein, Stefano Braghin:
Robust Learning Protocol for Federated Tumor Segmentation Challenge. CoRR abs/2212.08290 (2022) - 2021
- [j7]Swanand Kadhe, Anoosheh Heidarzadeh, Alex Sprintson, Onur Ozan Koyluoglu:
Single-Server Private Information Retrieval Schemes are Equivalent to Locally Recoverable Coding Schemes. IEEE J. Sel. Areas Inf. Theory 2(1): 391-402 (2021) - [j6]Avishek Ghosh, Raj Kumar Maity, Swanand Kadhe, Arya Mazumdar, Kannan Ramchandran:
Communication-Efficient and Byzantine-Robust Distributed Learning With Error Feedback. IEEE J. Sel. Areas Inf. Theory 2(3): 942-953 (2021) - [j5]Mehmet Fatih Aktas, Swanand Kadhe, Emina Soljanin, Alex Sprintson:
Download Time Analysis for Distributed Storage Codes With Locality and Availability. IEEE Trans. Commun. 69(6): 3898-3910 (2021) - [j4]Mehmet S. Aktas, Gauri Joshi, Swanand Kadhe, Fatemeh Kazemi, Emina Soljanin:
Service Rate Region: A New Aspect of Coded Distributed System Design. IEEE Trans. Inf. Theory 67(12): 7940-7963 (2021) - [c35]Swanand Kadhe, Nived Rajaraman, Kannan Ramchandran:
FastShare: Scalable Secret Sharing by Leveraging Locality. ISIT 2021: 1118-1123 - [c34]Divyansh Jhunjhunwala, Ankur Mallick, Advait Gadhikar, Swanand Kadhe, Gauri Joshi:
Leveraging Spatial and Temporal Correlations in Sparsified Mean Estimation. NeurIPS 2021: 14280-14292 - [i25]Divyansh Jhunjhunwala, Ankur Mallick, Advait Gadhikar, Swanand Kadhe, Gauri Joshi:
Leveraging Spatial and Temporal Correlations in Sparsified Mean Estimation. CoRR abs/2110.07751 (2021) - 2020
- [j3]Jianhan Song, Qiaosheng Eric Zhang, Swanand Kadhe, Mayank Bakshi, Sidharth Jaggi:
Stealthy Communication Over Adversarially Jammed Multipath Networks. IEEE Trans. Commun. 68(12): 7473-7484 (2020) - [j2]Swanand Kadhe, Brenden Garcia, Anoosheh Heidarzadeh, Salim Y. El Rouayheb, Alex Sprintson:
Private Information Retrieval With Side Information. IEEE Trans. Inf. Theory 66(4): 2032-2043 (2020) - [c33]Vipul Gupta, Swanand Kadhe, Thomas A. Courtade, Michael W. Mahoney, Kannan Ramchandran:
OverSketched Newton: Fast Convex Optimization for Serverless Systems. IEEE BigData 2020: 288-297 - [c32]Steven Cao, Swanand Kadhe, Kannan Ramchandran:
CoVer: Collaborative Light-Node-Only Verification and Data Availability for Blockchains. Blockchain 2020: 45-52 - [c31]Avishek Ghosh, Raj Kumar Maity, Swanand Kadhe, Arya Mazumdar, Kannan Ramchandran:
Communication Efficient and Byzantine Tolerant Distributed Learning. ISIT 2020: 2545-2550 - [c30]Swanand Kadhe, Onur Ozan Koyluoglu, Kannan Ramchandran:
Communication-Efficient Gradient Coding for Straggler Mitigation in Distributed Learning. ISIT 2020: 2634-2639 - [c29]Avishek Ghosh, Raj Kumar Maity, Swanand Kadhe, Arya Mazumdar, Kannan Ramchandran:
Communication-Efficient and Byzantine-Robust Distributed Learning. ITA 2020: 1-28 - [i24]Swanand Kadhe, Onur Ozan Koyluoglu, Kannan Ramchandran:
Communication-Efficient Gradient Coding for Straggler Mitigation in Distributed Learning. CoRR abs/2005.07184 (2020) - [i23]Mehmet S. Aktas, Gauri Joshi, Swanand Kadhe, Fatemeh Kazemi, Emina Soljanin:
Service Rate Region: A New Aspect of Coded Distributed System Design. CoRR abs/2009.01598 (2020) - [i22]Swanand Kadhe, Nived Rajaraman, Onur Ozan Koyluoglu, Kannan Ramchandran:
FastSecAgg: Scalable Secure Aggregation for Privacy-Preserving Federated Learning. CoRR abs/2009.11248 (2020) - [i21]Steven Cao, Swanand Kadhe, Kannan Ramchandran:
CoVer: Collaborative Light-Node-Only Verification and Data Availability for Blockchains. CoRR abs/2010.00217 (2020)
2010 – 2019
- 2019
- [j1]Swanand Kadhe, Salim Y. El Rouayheb, Iwan M. Duursma, Alex Sprintson:
Codes With Locality in the Rank and Subspace Metrics. IEEE Trans. Inf. Theory 65(9): 5454-5468 (2019) - [c28]Anoosheh Heidarzadeh, Swanand Kadhe, Salim Y. El Rouayheb, Alex Sprintson:
Single-Server Multi-Message Individually-Private Information Retrieval with Side Information. ISIT 2019: 1042-1046 - [c27]Orhan Ocal, Swanand Kadhe, Kannan Ramchandran:
Low-degree Pseudo-Boolean Function Recovery Using Codes. ISIT 2019: 1207-1211 - [c26]Swanand Kadhe, Onur Ozan Koyluoglu, Kannan Ramchandran:
Gradient Coding Based on Block Designs for Mitigating Adversarial Stragglers. ISIT 2019: 2813-2817 - [c25]Swanand Kadhe, Anoosheh Heidarzadeh, Alex Sprintson, Onur Ozan Koyluoglu:
On an Equivalence Between Single-Server PIR with Side Information and Locally Recoverable Codes. ITW 2019: 1-5 - [i20]Anoosheh Heidarzadeh, Swanand Kadhe, Salim Y. El Rouayheb, Alex Sprintson:
Single-Server Multi-Message Individually-Private Information Retrieval with Side Information. CoRR abs/1901.07509 (2019) - [i19]Vipul Gupta, Swanand Kadhe, Thomas A. Courtade, Michael W. Mahoney, Kannan Ramchandran:
OverSketched Newton: Fast Convex Optimization for Serverless Systems. CoRR abs/1903.08857 (2019) - [i18]Swanand Kadhe, Onur Ozan Koyluoglu, Kannan Ramchandran:
Gradient Coding Based on Block Designs for Mitigating Adversarial Stragglers. CoRR abs/1904.13373 (2019) - [i17]Swanand Kadhe, Jichan Chung, Kannan Ramchandran:
SeF: A Secure Fountain Architecture for Slashing Storage Costs in Blockchains. CoRR abs/1906.12140 (2019) - [i16]Narayanan Rengaswamy, A. Robert Calderbank, Swanand Kadhe, Henry D. Pfister:
Logical Clifford Synthesis for Stabilizer Codes. CoRR abs/1907.00310 (2019) - [i15]Swanand Kadhe, Anoosheh Heidarzadeh, Alex Sprintson, Onur Ozan Koyluoglu:
On an Equivalence Between Single-Server PIR with Side Information and Locally Recoverable Codes. CoRR abs/1907.00598 (2019) - [i14]Avishek Ghosh, Raj Kumar Maity, Swanand Kadhe, Arya Mazumdar, Kannan Ramchandran:
Communication-Efficient and Byzantine-Robust Distributed Learning. CoRR abs/1911.09721 (2019) - [i13]Mehmet Fatih Aktas, Swanand Kadhe, Emina Soljanin, Alex Sprintson:
Analyzing the Download Time of Availability Codes. CoRR abs/1912.09765 (2019) - 2018
- [c24]Anoosheh Heidarzadeh, Brenden Garcia, Swanand Kadhe, Salim Y. El Rouayheb, Alex Sprintson:
On the Capacity of Single-Server Multi-Message Private Information Retrieval with Side Information. Allerton 2018: 180-187 - [c23]Jianhan Song, Qiaosheng Eric Zhang, Mayank Bakshi, Sidharth Jaggi, Swanand Kadhe:
Multipath Stealth Communication with Jammers. ISIT 2018: 761-765 - [c22]Narayanan Rengaswamy, A. Robert Calderbank, Henry D. Pfister, Swanand Kadhe:
Synthesis of Logical Clifford Operators via Symplectic Geometry. ISIT 2018: 791-795 - [i12]Narayanan Rengaswamy, A. Robert Calderbank, Swanand Kadhe, Henry D. Pfister:
Synthesis of Logical Clifford Operators via Symplectic Geometry. CoRR abs/1803.06987 (2018) - [i11]Jianhan Song, Qiaosheng Eric Zhang, Swanand Kadhe, Mayank Bakshi, Sidharth Jaggi:
Multipath Stealth Communication with Jammers. CoRR abs/1805.03095 (2018) - [i10]Anoosheh Heidarzadeh, Brenden Garcia, Swanand Kadhe, Salim Y. El Rouayheb, Alex Sprintson:
On the Capacity of Single-Server Multi-Message Private Information Retrieval with Side Information. CoRR abs/1807.09908 (2018) - 2017
- [c21]Mehmet S. Aktas, Sarah E. Anderson, Ann Johnston, Gauri Joshi, Swanand Kadhe, Gretchen L. Matthews, Carolyn Mayer, Emina Soljanin:
On the service capacity region of accessing erasure coded content. Allerton 2017: 17-24 - [c20]Swanand Kadhe, Alex Sprintson:
Universally weakly secure coset coding schemes for minimum storage regenerating (MSR) codes. Allerton 2017: 25-30 - [c19]Swanand Kadhe, Brenden Garcia, Anoosheh Heidarzadeh, Salim Y. El Rouayheb, Alex Sprintson:
Private information retrieval with side information: The single server case. Allerton 2017: 1099-1106 - [c18]Swanand Kadhe, A. Robert Calderbank:
Rate optimal binary linear locally repairable codes with small availability. ISIT 2017: 166-170 - [c17]Swanand Kadhe, Alex Sprintson:
Security for minimum storage regenerating codes and locally repairable codes. ISIT 2017: 1028-1032 - [i9]Swanand Kadhe, A. Robert Calderbank:
Rate Optimal Binary Linear Locally Repairable Codes with Small Availability. CoRR abs/1701.02456 (2017) - [i8]Swanand Kadhe, Salim Y. El Rouayheb, Iwan M. Duursma, Alex Sprintson:
Rank-Metric Codes with Local Recoverability. CoRR abs/1707.05944 (2017) - [i7]Swanand Kadhe, Brenden Garcia, Anoosheh Heidarzadeh, Salim Y. El Rouayheb, Alex Sprintson:
Private Information Retrieval with Side Information. CoRR abs/1709.00112 (2017) - [i6]Mehmet S. Aktas, Sarah E. Anderson, Ann Johnston, Gauri Joshi, Swanand Kadhe, Gretchen L. Matthews, Carolyn Mayer, Emina Soljanin:
On the Service Capacity Region of Accessing Erasure Coded Content. CoRR abs/1710.03376 (2017) - [i5]Swanand Kadhe, Alex Sprintson:
Universally Weakly Secure Coset Coding Schemes for Minimum Storage Regenerating (MSR) Codes. CoRR abs/1710.06753 (2017) - 2016
- [c16]Swanand Kadhe, Salim Y. El Rouayheb, Iwan M. Duursma, Alex Sprintson:
Rank-metric codes with local recoverability. Allerton 2016: 1033-1040 - [c15]Swanand Kadhe, Alex Sprintson:
Codes with unequal locality. ISIT 2016: 435-439 - [i4]Swanand Kadhe, Alex Sprintson:
Codes with Unequal Locality. CoRR abs/1601.06153 (2016) - 2015
- [c14]Swanand Kadhe, Alex Sprintson, Qiaosheng Eric Zhang, Mayank Bakshi, Sidharth Jaggi:
Reliable and secure communication over adversarial multipath networks: A survey. ICICS 2015: 1-5 - [c13]Swanand Kadhe, Emina Soljanin, Alex Sprintson:
When do the availability codes make the stored data more available? Allerton 2015: 956-963 - [c12]Swanand Kadhe, Emina Soljanin, Alex Sprintson:
Analyzing the download time of availability codes. ISIT 2015: 1467-1471 - [c11]Qiaosheng Eric Zhang, Swanand Kadhe, Mayank Bakshi, Sidharth Jaggi, Alex Sprintson:
Coding against a limited-view adversary: The effect of causality and feedback. ISIT 2015: 2530-2534 - [c10]Qiaosheng Eric Zhang, Swanand Kadhe, Mayank Bakshi, Sidharth Jaggi, Alex Sprintson:
Talking reliably, secretly, and efficiently: A "complete" characterization. ITW 2015: 1-5 - [c9]Chung Chan, Ali Al-Bashabsheh, Javad B. Ebrahimi, Tarik Kaced, Swanand Kadhe, Tie Liu, Alex Sprintson, Muxi Yan, Qiaoqiao Zhou:
Successive omniscience. NetCod 2015: 21-25 - [i3]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
- [c8]Swanand Kadhe, Alex Sprintson:
On a weakly secure regenerating code construction for minimum storage regime. Allerton 2014: 445-452 - [c7]Swanand Kadhe, Sidharth Jaggi, Mayank Bakshi, Alex Sprintson:
Reliable, deniable, and hidable communication over multipath networks. ISIT 2014: 611-615 - [c6]Pak Hou Che, Swanand Kadhe, Mayank Bakshi, Chung Chan, Sidharth Jaggi, Alex Sprintson:
Reliable, deniable and hidable communication: A quick survey. ITW 2014: 227-231 - [c5]Swanand Kadhe, Alex Sprintson:
Weakly secure regenerating codes for distributed storage. NetCod 2014: 1-6 - [i2]Swanand Kadhe, Sidharth Jaggi, Mayank Bakshi, Alex Sprintson:
Reliable, Deniable, and Hidable Communication over Multipath Networks. CoRR abs/1401.4451 (2014) - [i1]Swanand Kadhe, Alex Sprintson:
Weakly Secure Regenerating Codes for Distributed Storage. CoRR abs/1405.2894 (2014) - 2013
- [c4]Swanand Kadhe, M. Girish Chandra, Balaji Janakiram:
A Network Coding Based Framework for Construction of Systematic Minimum Bandwidth Regenerating (MBR) Codes for Distributed Storage. COMAD 2013: 45-55 - [c3]Y. G. Goutam, M. Girish Chandra, Krishnan Srinivasarengan, Swanand Kadhe:
On electrical load disaggregation using factor graphs. ICACCI 2013: 1759-1764 - [c2]Krishnan Srinivasarengan, Y. G. Goutam, M. Girish Chandra, Swanand Kadhe:
A Framework for Non Intrusive Load Monitoring Using Bayesian Inference. IMIS 2013: 427-432 - 2010
- [c1]Subramanyam G. Harihara, Balaji Janakiram, M. Girish Chandra, Aravind Kota Gopalakrishna, Swanand Kadhe, P. Balamuralidhar, B. S. Adiga:
SpreadStore: A LDPC Erasure Code Scheme for Distributed Storage System. DSDE 2010: 154-158
Coauthor Index
Alexander Sprintson
aka: Alex Sprintson
aka: Alex Sprintson
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:08 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:
