Swanand Kadhe
Title
Cited by
Cited by
Year
Private information retrieval with side information
S Kadhe, B Garcia, A Heidarzadeh, S El Rouayheb, A Sprintson
IEEE Transactions on Information Theory 66 (4), 2032-2043, 2019
792019
On the capacity of single-server multi-message private information retrieval with side information
A Heidarzadeh, B Garcia, S Kadhe, S El Rouayheb, A Sprintson
2018 56th Annual Allerton Conference on Communication, Control, and …, 2018
442018
Analyzing the download time of availability codes
S Kadhe, E Soljanin, A Sprintson
2015 IEEE International Symposium on Information Theory (ISIT), 1467-1471, 2015
392015
Codes with unequal locality
S Kadhe, A Sprintson
2016 IEEE International Symposium on Information Theory (ISIT), 435-439, 2016
332016
Private information retrieval with side information: The single server case
S Kadhe, B Garcia, A Heidarzadeh, S El Rouayheb, A Sprintson
2017 55th Annual Allerton Conference on Communication, Control, and …, 2017
292017
Oversketched newton: Fast convex optimization for serverless systems
V Gupta, S Kadhe, T Courtade, MW Mahoney, K Ramchandran
2020 IEEE International Conference on Big Data (Big Data), 288-297, 2020
222020
Weakly secure regenerating codes for distributed storage
S Kadhe, A Sprintson
2014 International Symposium on Network Coding (NetCod), 1-6, 2014
222014
On the service capacity region of accessing erasure coded content
M Aktaş, SE Anderson, A Johnston, G Joshi, S Kadhe, GL Matthews, ...
2017 55th Annual Allerton Conference on Communication, Control, and …, 2017
192017
Rate optimal binary linear locally repairable codes with small availability
S Kadhe, R Calderbank
2017 IEEE International Symposium on Information Theory (ISIT), 166-170, 2017
192017
Reliable, deniable, and hidable communication over multipath networks
S Kadhe, S Jaggi, M Bakshi, A Sprintson
2014 IEEE International Symposium on Information Theory, 611-615, 2014
192014
When do the availability codes make the stored data more available?
S Kadhe, E Soljanin, A Sprintson
2015 53rd Annual Allerton Conference on Communication, Control, and …, 2015
182015
Single-server multi-message individually-private information retrieval with side information
A Heidarzadeh, S Kadhe, S El Rouayheb, A Sprintson
2019 IEEE International Symposium on Information Theory (ISIT), 1042-1046, 2019
172019
SpreadStore: a LDPC erasure code scheme for distributed storage system
B Janakiram, MG Chandra, KG Aravind, S Kadhe, P Balamuralidhar, ...
2010 InTernaTional conference on DaTa STorage and DaTa engineering, 154-158, 2010
162010
Gradient coding based on block designs for mitigating adversarial stragglers
S Kadhe, OO Koyluoglu, K Ramchandran
2019 IEEE International Symposium on Information Theory (ISIT), 2813-2817, 2019
152019
Sef: A secure fountain architecture for slashing storage costs in blockchains
S Kadhe, J Chung, K Ramchandran
arXiv preprint arXiv:1906.12140, 2019
152019
Reliable, deniable and hidable communication: A quick survey
PH Che, S Kadhe, M Bakshi, C Chan, S Jaggi, A Sprintson
2014 IEEE Information Theory Workshop (ITW 2014), 227-231, 2014
152014
On a weakly secure regenerating code construction for minimum storage regime
S Kadhe, A Sprintson
2014 52nd Annual Allerton Conference on Communication, Control, and …, 2014
152014
Synthesis of logical Clifford operators via symplectic geometry
N Rengaswamy, R Calderbank, HD Pfister, S Kadhe
2018 IEEE International Symposium on Information Theory (ISIT), 791-795, 2018
142018
System and method for exact regeneration of a failed node in a distributed storage system
S Kadhe, B Janakiram, MG Chandra, B Purushothaman
US Patent 8,775,860, 2014
142014
A framework for non intrusive load monitoring using bayesian inference
K Srinivasarengan, YG Goutam, MG Chandra, S Kadhe
2013 Seventh International Conference on Innovative Mobile and Internet …, 2013
132013
The system can't perform the operation now. Try again later.
Articles 1–20