2009 |
34 | EE | Parikshit Gopalan,
Jaikumar Radhakrishnan:
Finding duplicates in a data stream.
SODA 2009: 402-411 |
33 | EE | Ilias Diakonikolas,
Parikshit Gopalan,
Ragesh Jaiswal,
Rocco A. Servedio,
Emanuele Viola:
Bounded Independence Fools Halfspaces
CoRR abs/0902.3757: (2009) |
32 | EE | 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) |
2008 |
31 | EE | Parikshit Gopalan,
Adam Kalai,
Adam R. Klivans:
A Query Algorithm for Agnostically Learning DNF?.
COLT 2008: 515-516 |
30 | EE | Parikshit Gopalan,
Venkatesan Guruswami:
Hardness Amplification within NP against Deterministic Algorithms.
IEEE Conference on Computational Complexity 2008: 19-30 |
29 | EE | Parikshit Gopalan,
Adam R. Klivans,
David Zuckerman:
List-decoding reed-muller codes over small fields.
STOC 2008: 265-274 |
28 | EE | Parikshit Gopalan,
Adam Tauman Kalai,
Adam R. Klivans:
Agnostically learning decision trees.
STOC 2008: 527-536 |
27 | EE | Parikshit Gopalan,
Venkatesan Guruswami,
Richard J. Lipton:
Algorithms for Modular Counting of Roots of Multivariate Polynomials.
Algorithmica 50(4): 479-496 (2008) |
26 | EE | Parikshit Gopalan,
Venkatesan Guruswami,
Prasad Raghavendra:
List Decoding Tensor Products and Interleaved Codes
CoRR abs/0811.4395: (2008) |
25 | EE | 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 | EE | Parikshit Gopalan,
Venkatesan Guruswami,
Prasad Raghavendra,
Prasad Raghavendra:
List Decoding Tensor Products and Interleaved Codes.
Electronic Colloquium on Computational Complexity (ECCC) 15(105): (2008) |
23 | EE | Parikshit Gopalan:
Query-Efficient Algorithms for Polynomial Interpolation over Composites.
SIAM J. Comput. 38(3): 1033-1057 (2008) |
2007 |
22 | EE | Anna Gál,
Parikshit Gopalan:
Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence.
FOCS 2007: 294-304 |
21 | EE | Parikshit Gopalan,
Subhash Khot,
Rishi Saket:
Hardness of Reconstructing Multivariate Polynomials over Finite Fields.
FOCS 2007: 349-359 |
20 | EE | Parikshit Gopalan,
T. S. Jayram,
Robert Krauthgamer,
Ravi Kumar:
Estimating the sortedness of a data stream.
SODA 2007: 318-327 |
19 | EE | Parikshit Gopalan,
Subhash Khot,
Rishi Saket:
Hardness of Reconstructing Multivariate Polynomials over Finite Fields.
Electronic Colloquium on Computational Complexity (ECCC) 14(073): (2007) |
18 | EE | Parikshit Gopalan,
Venkatesan Guruswami:
Deterministic Hardness Amplification via Local GMD Decoding.
Electronic Colloquium on Computational Complexity (ECCC) 14(089): (2007) |
2006 |
17 | EE | Vitaly Feldman,
Parikshit Gopalan,
Subhash Khot,
Ashok Kumar Ponnuswami:
New Results for Learning Noisy Parities and Halfspaces.
FOCS 2006: 563-574 |
16 | EE | 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 | EE | Parikshit Gopalan:
Constructing Ramsey Graphs from Boolean Function Representations.
IEEE Conference on Computational Complexity 2006: 115-128 |
14 | EE | Parikshit Gopalan,
Venkatesan Guruswami,
Richard J. Lipton:
Algorithms for Modular Counting of Roots of Multivariate Polynomials.
LATIN 2006: 544-555 |
13 | EE | Parikshit Gopalan:
Query-efficient algorithms for polynomial interpolation over composites.
SODA 2006: 908-917 |
12 | EE | 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 | EE | 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 | EE | 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 | EE | 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 | EE | 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): (2005) |
2004 |
6 | EE | 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 | EE | 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 | EE | Nayantara Bhatnagar,
Parikshit Gopalan,
Richard J. Lipton:
Symmetric Polynomials over Zm and Simultaneous Communication Protocol.
FOCS 2003: 450- |
3 | EE | Parikshit Gopalan,
Richard J. Lipton,
Aranyak Mehta:
Randomized Time-Space Tradeoffs for Directed Graph Connectivity.
FSTTCS 2003: 208-216 |
2 | EE | 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 | EE | Parikshit Gopalan,
Howard J. Karloff,
Aranyak Mehta,
Milena Mihail,
Nisheeth K. Vishnoi:
Caching with expiration times.
SODA 2002: 540-547 |