☰

Parikshit Gopalan, Ph.D. - Publications

Affiliations: 
2006 Georgia Institute of Technology, Atlanta, GA 
Area:
Computer Science
Tree Info Similar researchers PubMed Report error

17 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2015 Gopalan P, Kane D, Meka R. Pseudorandomness via the Discrete Fourier Transform Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 2015: 903-922. DOI: 10.1137/16M1062132  0.3
2015 Gopalan P, Karloff H, Mehta A, Mihail M, Vishnoi N. Caching with expiration times for internet applications Internet Mathematics. 2: 165-184. DOI: 10.1080/15427951.2005.10129102  0.556
2013 Gopalan P, Meka R, Reingold O, Zuckerman D. Pseudorandom generators for combinatorial shapes Siam Journal On Computing. 42: 1051-1076. DOI: 10.1137/110854990  0.309
2013 Gopalan P. A fourier-analytic approach to reed-muller decoding Ieee Transactions On Information Theory. 59: 7747-7760. DOI: 10.1109/Tit.2013.2274007  0.315
2013 Gopalan P, Meka R, Reingold O. DNF sparsification and a faster deterministic counting algorithm Computational Complexity. 22: 275-310. DOI: 10.1007/S00037-013-0068-6  0.341
2012 Gopalan P, Huang C, Simitci H, Yekhanin S. On the locality of codeword symbols Ieee Transactions On Information Theory. 58: 6925-6934. DOI: 10.1109/Tit.2012.2208937  0.318
2011 Gopalan P, O'Donnell R, Servedio RA, Shpilka A, Wimmer K. Testing fourier dimensionality and sparsity Siam Journal On Computing. 40: 1075-1100. DOI: 10.1137/100785429  0.347
2011 Gopalan P, Guruswami V, Raghavendra P. List decoding tensor products and interleaved codes Siam Journal On Computing. 40: 1432-1462. DOI: 10.1137/090778274  0.316
2010 Diakonikolas I, Gopalan P, Jaiswal R, Servedio RA, Viola E. Bounded independence fools halfspaces Siam Journal On Computing. 39: 3441-3462. DOI: 10.1137/100783030  0.308
2010 Gopalan P, Khot S, Saket R. Hardness of reconstructing multivariate polynomials over finite fields Siam Journal On Computing. 39: 2598-2621. DOI: 10.1137/070705258  0.302
2009 Gopalan P, Kolaitis PG, Maneva E, Papadimitriou CH. The connectivity of Boolean satisfiability: Computational and structural dichotomies Siam Journal On Computing. 38: 2330-2355. DOI: 10.1137/07070440X  0.308
2008 Gopalan P, Guruswami V. Hardness amplification within NP against deterministic algorithms Proceedings of the Annual Ieee Conference On Computational Complexity. 19-30. DOI: 10.1016/J.Jcss.2010.06.008  0.357
2008 Gopalan P, Guruswami V, Lipton RJ. Algorithms for modular counting of roots of multivariate polynomials Algorithmica (New York). 50: 479-496. DOI: 10.1007/S00453-007-9097-3  0.319
2008 Basu S, Bhatnagar N, Gopalan P, Lipton RJ. Polynomials that Sign Represent Parity and Descartes' Rule of Signs Computational Complexity. 17: 377-406. DOI: 10.1007/S00037-008-0244-2  0.338
2007 Gál A, Gopalan P. Lower bounds on streaming algorithms for approximating the length of the longest increasing subsequence Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 294-304. DOI: 10.1137/090770801  0.365
2006 Gopalan P. Query-efficient algorithms for polynomial interpolation over composites Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 908-917. DOI: 10.1137/060661259  0.354
2003 Bhatnagar N, Gopalan P, Lipton RJ. Symmetric polynomials over ℤm and simultaneous communication protocols Annual Symposium On Foundations of Computer Science - Proceedings. 450-459. DOI: 10.1016/J.Jcss.2005.06.007  0.332
Show low-probability matches.