Parikshit Gopalan
Parikshit Gopalan
Verified email at - Homepage
Cited by
Cited by
Erasure coding in windows azure storage
C Huang, H Simitci, Y Xu, A Ogus, B Calder, P Gopalan, J Li, S Yekhanin
Presented as part of the 2012 {USENIX} Annual Technical Conference ({USENIX …, 2012
On the locality of codeword symbols
P Gopalan, C Huang, H Simitci, S Yekhanin
IEEE Transactions on Information theory 58 (11), 6925-6934, 2012
Random access in large-scale DNA data storage
L Organick, SD Ang, YJ Chen, R Lopez, S Yekhanin, K Makarychev, ...
Nature biotechnology 36 (3), 242-248, 2018
Erasure coding across multiple zones and sub-zones
S Yekhanin, H Simitci, AW Ogus, J Li, C Huang, PS Gopalan, BG Calder
US Patent 9,244,761, 2016
Erasure coding across multiple zones
BG Calder, PS Gopalan, C Huang, J Li, AW Ogus, H Simitci, S Yekhanin
US Patent 9,378,084, 2016
On agnostic learning of parities, monomials, and halfspaces
V Feldman, P Gopalan, S Khot, AK Ponnuswami
SIAM Journal on Computing 39 (2), 606-645, 2009
The connectivity of Boolean satisfiability: computational and structural dichotomies
P Gopalan, PG Kolaitis, E Maneva, CH Papadimitriou
SIAM Journal on Computing 38 (6), 2330-2355, 2009
Explicit maximally recoverable codes with locality
P Gopalan, C Huang, B Jenkins, S Yekhanin
IEEE Transactions on Information Theory 60 (9), 5245-5256, 2014
Bounded independence fools halfspaces
I Diakonikolas, P Gopalan, R Jaiswal, RA Servedio, E Viola
SIAM Journal on Computing 39 (8), 3441-3462, 2010
Testing Fourier dimensionality and sparsity
P Gopalan, R O'Donnell, RA Servedio, A Shpilka, K Wimmer
SIAM Journal on Computing 40 (4), 1075-1100, 2011
Matching vector codes
Z Dvir, P Gopalan, S Yekhanin
SIAM Journal on Computing 40 (4), 1154-1178, 2011
Better pseudorandom generators from milder pseudorandom restrictions
P Gopalan, R Meka, O Reingold, L Trevisan, S Vadhan
2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, 120-129, 2012
Estimating the sortedness of a data stream
P Gopalan, TS Jayram, R Krauthgamer, R Kumar
SODA 7, 318-327, 2007
Making the long code shorter
B Barak, P Gopalan, J Hĺstad, R Meka, P Raghavendra, D Steurer
SIAM Journal on Computing 44 (5), 1287-1324, 2015
An FPTAS for# knapsack and related counting problems
P Gopalan, A Klivans, R Meka, D Štefankovic, S Vempala, E Vigoda
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 817-826, 2011
List-decoding Reed-Muller codes over small fields
P Gopalan, AR Klivans, D Zuckerman
Proceedings of the fortieth annual ACM symposium on Theory of computing, 265-274, 2008
Zombie memory: Extending memory lifetime by reviving dead blocks
R Azevedo, JD Davis, K Strauss, P Gopalan, M Manasse, S Yekhanin
Proceedings of the 40th Annual International Symposium on Computer …, 2013
Flexible erasure coding with enhanced local protection group structures
BG Calder, PS Gopalan, C Huang, AW Ogus, H Simitci, SM Yekhanin
US Patent 10,187,083, 2019
Erasure coding of data within a group of storage units based on connection characteristics
RJ Jenkins Jr, PS Gopalan, C Huang, EB Nightingale, A Shamis, ...
US Patent 9,983,959, 2018
Lower bounds on streaming algorithms for approximating the length of the longest increasing subsequence
A Gál, P Gopalan
SIAM Journal on Computing 39 (8), 3463-3479, 2010
The system can't perform the operation now. Try again later.
Articles 1–20