Parikshit Gopalan

	2012
69		Parikshit Gopalan, Raghu Meka, Omer Reingold: DNF Sparsification and a Faster Deterministic Counting. Electronic Colloquium on Computational Complexity (ECCC) 19: 60 (2012)
	2011
68		Parikshit Gopalan, Adam Klivans, Raghu Meka, Daniel Stefankovic, Santosh Vempala, Eric Vigoda: An FPTAS for #Knapsack and Related Counting Problems. FOCS 2011: 817-826
67		Parikshit Gopalan, Raghu Meka, Omer Reingold, David Zuckerman: Pseudorandom generators for combinatorial shapes. STOC 2011: 253-262
66		Parikshit Gopalan, Cheng Huang, Huseyin Simitci, Sergey Yekhanin: On the Locality of Codeword Symbols CoRR abs/1106.3625: (2011)
65		Boaz Barak, Parikshit Gopalan, Johan Håstad, Raghu Meka, Prasad Raghavendra, David Steurer: Making the long code shorter, with applications to the Unique Games Conjecture CoRR abs/1111.0405: (2011)
64		Parikshit Gopalan, Cheng Huang, Huseyin Simitci, Sergey Yekhanin: On the Locality of Codeword Symbols. Electronic Colloquium on Computational Complexity (ECCC) 18: 100 (2011)
63		Boaz Barak, Parikshit Gopalan, Johan Håstad, Raghu Meka, Prasad Raghavendra, David Steurer: Making the long code shorter, with applications to the Unique Games Conjecture. Electronic Colloquium on Computational Complexity (ECCC) 18: 142 (2011)
62		Parikshit Gopalan, Venkatesan Guruswami: Hardness amplification within NP against deterministic algorithms. J. Comput. Syst. Sci. 77(1): 107-121 (2011)
61		Parikshit Gopalan, Ryan O'Donnell, Rocco A. Servedio, Amir Shpilka, Karl Wimmer: Testing Fourier Dimensionality and Sparsity. SIAM J. Comput. 40(4): 1075-1100 (2011)
60		Zeev Dvir, Parikshit Gopalan, Sergey Yekhanin: Matching Vector Codes. SIAM J. Comput. 40(4): 1154-1178 (2011)
59		Parikshit Gopalan, Venkatesan Guruswami, Prasad Raghavendra: List Decoding Tensor Products and Interleaved Codes. SIAM J. Comput. 40(5): 1432-1462 (2011)
	2010
58		Parikshit Gopalan, Rocco A. Servedio: Learning and Lower Bounds for AC0 with Threshold Gates. APPROX-RANDOM 2010: 588-601
57		Parikshit Gopalan: A Fourier-Analytic Approach to Reed-Muller Decoding. FOCS 2010: 685-694
56		Zeev Dvir, Parikshit Gopalan, Sergey Yekhanin: Matching Vector Codes. FOCS 2010: 705-714
55		Parikshit Gopalan, Ryan O'Donnell, Yi Wu, David Zuckerman: Fooling Functions of Halfspaces under Product Distributions. IEEE Conference on Computational Complexity 2010: 223-234
54		Parikshit Gopalan, Ryan O'Donnell, Yi Wu, David Zuckerman: Fooling functions of halfspaces under product distributions CoRR abs/1001.1593: (2010)
53		Parikshit Gopalan, Adam Klivans, Raghu Meka: Polynomial-Time Approximation Schemes for Knapsack and Related Counting Problems using Branching Programs CoRR abs/1008.3187: (2010)
52		Parikshit Gopalan, Amir Shpilka, Shachar Lovett: The Complexity of Boolean Functions in Different Characteristics. Computational Complexity 19(2): 235-263 (2010)
51		Zeev Dvir, Parikshit Gopalan, Sergey Yekhanin: Matching Vector Codes. Electronic Colloquium on Computational Complexity (ECCC) 17: 12 (2010)
50		Parikshit Gopalan, Adam Klivans, Raghu Meka: Polynomial-Time Approximation Schemes for Knapsack and Related Counting Problems using Branching Programs. Electronic Colloquium on Computational Complexity (ECCC) 17: 133 (2010)
49		Parikshit Gopalan, Raghu Meka, Omer Reingold, David Zuckerman: Pseudorandom Generators for Combinatorial Shapes. Electronic Colloquium on Computational Complexity (ECCC) 17: 176 (2010)
48		Yi Wu, Ryan O'Donnell, David Zuckerman, Parikshit Gopalan: Fooling functions of halfspaces under product distributions. Electronic Colloquium on Computational Complexity (ECCC) 17: 6 (2010)
47		Parikshit Gopalan, Rocco A. Servedio: Learning and Lower Bounds for AC0 with Threshold Gates. Electronic Colloquium on Computational Complexity (ECCC) 17: 74 (2010)
46		Parikshit Gopalan, Subhash Khot, Rishi Saket: Hardness of Reconstructing Multivariate Polynomials over Finite Fields. SIAM J. Comput. 39(6): 2598-2621 (2010)
45		Ilias Diakonikolas, Parikshit Gopalan, Ragesh Jaiswal, Rocco A. Servedio, Emanuele Viola: Bounded Independence Fools Halfspaces. SIAM J. Comput. 39(8): 3441-3462 (2010)
44		Anna Gál, Parikshit Gopalan: Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence. SIAM J. Comput. 39(8): 3463-3479 (2010)
	2009
43		Ilias Diakonikolas, Parikshit Gopalan, Ragesh Jaiswal, Rocco A. Servedio, Emanuele Viola: Bounded Independence Fools Halfspaces. FOCS 2009: 171-180
42		Parikshit Gopalan, Ryan O'Donnell, Rocco A. Servedio, Amir Shpilka, Karl Wimmer: Testing Fourier Dimensionality and Sparsity. ICALP (1) 2009: 500-512
41		Parikshit Gopalan, Shachar Lovett, Amir Shpilka: On the Complexity of Boolean Functions in Different Characteristics. IEEE Conference on Computational Complexity 2009: 173-183
40		Parikshit Gopalan, Jaikumar Radhakrishnan: Finding duplicates in a data stream. SODA 2009: 402-411
39		Parikshit Gopalan, Venkatesan Guruswami, Prasad Raghavendra: List decoding tensor products and interleaved codes. STOC 2009: 13-22
38		Ilias Diakonikolas, Parikshit Gopalan, Ragesh Jaiswal, Rocco A. Servedio, Emanuele Viola: Bounded Independence Fools Halfspaces CoRR abs/0902.3757: (2009)
37		Ilias Diakonikolas, Parikshit Gopalan, Ragesh Jaiswal, Rocco A. Servedio, Emanuele Viola: Bounded Independence Fools Halfspaces. Electronic Colloquium on Computational Complexity (ECCC) 16: 16 (2009)
36		Parikshit Gopalan: A Fourier-analytic approach to Reed-Muller decoding. Electronic Colloquium on Computational Complexity (ECCC) 16: 37 (2009)
35		Parikshit Gopalan, Shachar Lovett, Amir Shpilka: On the Complexity of Boolean Functions in Different Characteristics. Electronic Colloquium on Computational Complexity (ECCC) 16: 48 (2009)
34		Parikshit Gopalan: A note on Efremenko's Locally Decodable Codes. Electronic Colloquium on Computational Complexity (ECCC) 16: 69 (2009)
33		Parikshit Gopalan, Phokion G. Kolaitis, Elitza N. Maneva, Christos H. Papadimitriou: The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies. SIAM J. Comput. 38(6): 2330-2355 (2009)
32		Vitaly Feldman, Parikshit Gopalan, Subhash Khot, Ashok Kumar Ponnuswami: On Agnostic Learning of Parities, Monomials, and Halfspaces. SIAM J. Comput. 39(2): 606-645 (2009)
	2008
31		Parikshit Gopalan, Adam Kalai, Adam R. Klivans: A Query Algorithm for Agnostically Learning DNF?. COLT 2008: 515-516
30		Parikshit Gopalan, Venkatesan Guruswami: Hardness Amplification within NP against Deterministic Algorithms. IEEE Conference on Computational Complexity 2008: 19-30
29		Parikshit Gopalan, Adam R. Klivans, David Zuckerman: List-decoding reed-muller codes over small fields. STOC 2008: 265-274
28		Parikshit Gopalan, Adam Tauman Kalai, Adam R. Klivans: Agnostically learning decision trees. STOC 2008: 527-536
27		Parikshit Gopalan, Venkatesan Guruswami, Richard J. Lipton: Algorithms for Modular Counting of Roots of Multivariate Polynomials. Algorithmica 50(4): 479-496 (2008)
26		Parikshit Gopalan, Venkatesan Guruswami, Prasad Raghavendra: List Decoding Tensor Products and Interleaved Codes CoRR abs/0811.4395: (2008)
25		Saugata Basu, Nayantara Bhatnagar, Parikshit Gopalan, Richard J. Lipton: Polynomials that Sign Represent Parity and Descartes' Rule of Signs. Computational Complexity 17(3): 377-406 (2008)
24		Parikshit Gopalan, Venkatesan Guruswami, Prasad Raghavendra: List Decoding Tensor Products and Interleaved Codes. Electronic Colloquium on Computational Complexity (ECCC) 15(105): (2008)
23		Parikshit Gopalan: Query-Efficient Algorithms for Polynomial Interpolation over Composites. SIAM J. Comput. 38(3): 1033-1057 (2008)
	2007
22		Anna Gál, Parikshit Gopalan: Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence. FOCS 2007: 294-304
21		Parikshit Gopalan, Subhash Khot, Rishi Saket: Hardness of Reconstructing Multivariate Polynomials over Finite Fields. FOCS 2007: 349-359
20		Parikshit Gopalan, T. S. Jayram, Robert Krauthgamer, Ravi Kumar: Estimating the sortedness of a data stream. SODA 2007: 318-327
19		Parikshit Gopalan, Subhash Khot, Rishi Saket: Hardness of Reconstructing Multivariate Polynomials over Finite Fields. Electronic Colloquium on Computational Complexity (ECCC) 14(073): (2007)
18		Parikshit Gopalan, Venkatesan Guruswami: Deterministic Hardness Amplification via Local GMD Decoding. Electronic Colloquium on Computational Complexity (ECCC) 14(089): (2007)
	2006
17		Vitaly Feldman, Parikshit Gopalan, Subhash Khot, Ashok Kumar Ponnuswami: New Results for Learning Noisy Parities and Halfspaces. FOCS 2006: 563-574
16		Parikshit Gopalan, Phokion G. Kolaitis, Elitza N. Maneva, Christos H. Papadimitriou: The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies. ICALP (1) 2006: 346-357
15		Parikshit Gopalan: Constructing Ramsey Graphs from Boolean Function Representations. IEEE Conference on Computational Complexity 2006: 115-128
14		Parikshit Gopalan, Venkatesan Guruswami, Richard J. Lipton: Algorithms for Modular Counting of Roots of Multivariate Polynomials. LATIN 2006: 544-555
13		Parikshit Gopalan: Query-efficient algorithms for polynomial interpolation over composites. SODA 2006: 908-917
12		Parikshit Gopalan, Phokion G. Kolaitis, Elitza N. Maneva, Christos H. Papadimitriou: The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies CoRR abs/cs/0609072: (2006)
11		Vitaly Feldman, Parikshit Gopalan, Subhash Khot, Ashok Kumar Ponnuswami: New Results for Learning Noisy Parities and Halfspaces. Electronic Colloquium on Computational Complexity (ECCC) 13(059): (2006)
10		Parikshit Gopalan, Phokion G. Kolaitis, Elitza N. Maneva, Christos H. Papadimitriou: The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies. Electronic Colloquium on Computational Complexity (ECCC) 13(094): (2006)
9		Nayantara Bhatnagar, Parikshit Gopalan, Richard J. Lipton: Symmetric polynomials over Zm and simultaneous communication protocols. J. Comput. Syst. Sci. 72(2): 252-285 (2006)
	2005
8		Parikshit Gopalan: Constructing Ramsey Graphs from Boolean Function Representations Electronic Colloquium on Computational Complexity (ECCC)(143): (2005)
7		Parikshit Gopalan, Howard J. Karloff, Aranyak Mehta, Milena Mihail, Nisheeth K. Vishnoi: Caching with Expiration Times for Internet Applications. Internet Mathematics 2(2): 165-184 (2005)
	2004
6		Saugata Basu, Nayantara Bhatnagar, Parikshit Gopalan, Richard J. Lipton: Polynomials That Sign Represent Parity and Descartes Rule of Signs. IEEE Conference on Computational Complexity 2004: 223-235
5		Nayantara Bhatnagar, Parikshit Gopalan, Richard J. Lipton: The Degree of Threshold Mod 6 and Diophantine Equations Electronic Colloquium on Computational Complexity (ECCC)(022): (2004)
	2003
4		Nayantara Bhatnagar, Parikshit Gopalan, Richard J. Lipton: Symmetric Polynomials over Zm and Simultaneous Communication Protocol. FOCS 2003: 450-459
3		Parikshit Gopalan, Richard J. Lipton, Aranyak Mehta: Randomized Time-Space Tradeoffs for Directed Graph Connectivity. FSTTCS 2003: 208-216
2		Nayantara Bhatnagar, Parikshit Gopalan, Richard J. Lipton: Symmetric Polynomials over Zm and Simultaneous Communication Protocols Electronic Colloquium on Computational Complexity (ECCC)(047): (2003)
	2002
1		Parikshit Gopalan, Howard J. Karloff, Aranyak Mehta, Milena Mihail, Nisheeth K. Vishnoi: Caching with expiration times. SODA 2002: 540-547

Coauthor Index

1	Boaz Barak	[63] [65]
2	Saugata Basu	[6] [25]
3	Nayantara Bhatnagar	[2] [4] [5] [6] [9] [25]
4	Ilias Diakonikolas	[37] [38] [43] [45]
5	Zeev Dvir	[51] [56] [60]
6	Vitaly Feldman	[11] [17] [32]
7	Anna Gál	[22] [44]
8	Venkatesan Guruswami	[14] [18] [24] [26] [27] [30] [39] [59] [62]
9	Johan Håstad	[63] [65]
10	Cheng Huang	[64] [66]
11	Ragesh Jaiswal	[37] [38] [43] [45]
12	T. S. Jayram (Jayram S. Thathachar)	[20]
13	Adam Tauman Kalai (Adam Kalai)	[28] [31]
14	Howard J. Karloff	[1] [7]
15	Subhash Khot	[11] [17] [19] [21] [32] [46]
16	Adam R. Klivans (Adam Klivans)	[28] [29] [31] [50] [53] [68]
17	Phokion G. Kolaitis	[10] [12] [16] [33]
18	Robert Krauthgamer	[20]
19	Ravi Kumar (S. Ravi Kumar)	[20]
20	Richard J. Lipton	[2] [3] [4] [5] [6] [9] [14] [25] [27]
21	Shachar Lovett	[35] [41] [52]
22	Elitza N. Maneva	[10] [12] [16] [33]
23	Aranyak Mehta	[1] [3] [7]
24	Raghu Meka	[49] [50] [53] [63] [65] [67] [68] [69]
25	Milena Mihail	[1] [7]
26	Ryan O'Donnell	[42] [48] [54] [55] [61]
27	Christos H. Papadimitriou	[10] [12] [16] [33]
28	Ashok Kumar Ponnuswami	[11] [17] [32]
29	Jaikumar Radhakrishnan	[40]
30	Prasad Raghavendra	[24] [26] [39] [59] [63] [65]
31	Omer Reingold	[49] [67] [69]
32	Rishi Saket	[19] [21] [46]
33	Rocco A. Servedio	[37] [38] [42] [43] [45] [47] [58] [61]
34	Amir Shpilka	[35] [41] [42] [52] [61]
35	Huseyin Simitci	[64] [66]
36	Daniel Stefankovic	[68]
37	David Steurer	[63] [65]
38	Santosh Vempala	[68]
39	Eric Vigoda	[68]
40	Emanuele Viola	[37] [38] [43] [45]
41	Nisheeth K. Vishnoi	[1] [7]
42	Karl Wimmer	[42] [61]
43	Yi Wu	[48] [54] [55]
44	Sergey Yekhanin	[51] [56] [60] [64] [66]
45	David Zuckerman	[29] [48] [49] [54] [55] [67]

Colors in the list of coauthors

Last update Wed May 30 22:34:44 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page