| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | 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)  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Parikshit Gopalan, Cheng Huang, Huseyin Simitci, Sergey Yekhanin |
On the Locality of Codeword Symbols. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | 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 |
2011 |
DBLP BibTeX RDF |
|
| 1 | Parikshit Gopalan, Cheng Huang, Huseyin Simitci, Sergey Yekhanin |
On the Locality of Codeword Symbols |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Parikshit Gopalan, Venkatesan Guruswami |
Hardness amplification within NP against deterministic algorithms. |
J. Comput. Syst. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Parikshit Gopalan, Ryan O'Donnell, Rocco A. Servedio, Amir Shpilka, Karl Wimmer |
Testing Fourier Dimensionality and Sparsity. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Parikshit Gopalan, Venkatesan Guruswami, Prasad Raghavendra |
List Decoding Tensor Products and Interleaved Codes. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Dvir, Parikshit Gopalan, Sergey Yekhanin |
Matching Vector Codes. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Parikshit Gopalan, Adam Klivans, Raghu Meka, Daniel Stefankovic, Santosh Vempala, Eric Vigoda |
An FPTAS for #Knapsack and Related Counting Problems. |
FOCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Parikshit Gopalan, Raghu Meka, Omer Reingold, David Zuckerman |
Pseudorandom generators for combinatorial shapes. |
STOC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yi Wu, Ryan O'Donnell, David Zuckerman, Parikshit Gopalan |
Fooling functions of halfspaces under product distributions. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Parikshit Gopalan, Raghu Meka, Omer Reingold, David Zuckerman |
Pseudorandom Generators for Combinatorial Shapes. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | 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) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Zeev Dvir, Parikshit Gopalan, Sergey Yekhanin |
Matching Vector Codes. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Parikshit Gopalan, Rocco A. Servedio |
Learning and Lower Bounds for AC0 with Threshold Gates. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Parikshit Gopalan, Amir Shpilka, Shachar Lovett |
The Complexity of Boolean Functions in Different Characteristics. |
Computational Complexity |
2010 |
DBLP BibTeX RDF |
|
| 1 | Parikshit Gopalan, Ryan O'Donnell, Yi Wu, David Zuckerman |
Fooling functions of halfspaces under product distributions |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Parikshit Gopalan, Adam Klivans, Raghu Meka |
Polynomial-Time Approximation Schemes for Knapsack and Related Counting Problems using Branching Programs |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Parikshit Gopalan, Subhash Khot, Rishi Saket |
Hardness of Reconstructing Multivariate Polynomials over Finite Fields. |
SIAM J. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ilias Diakonikolas, Parikshit Gopalan, Ragesh Jaiswal, Rocco A. Servedio, Emanuele Viola |
Bounded Independence Fools Halfspaces. |
SIAM J. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Anna Gál, Parikshit Gopalan |
Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence. |
SIAM J. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Parikshit Gopalan, Rocco A. Servedio |
Learning and Lower Bounds for AC0 with Threshold Gates. |
APPROX-RANDOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Parikshit Gopalan |
A Fourier-Analytic Approach to Reed-Muller Decoding. |
FOCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Dvir, Parikshit Gopalan, Sergey Yekhanin |
Matching Vector Codes. |
FOCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Parikshit Gopalan, Ryan O'Donnell, Yi Wu, David Zuckerman |
Fooling Functions of Halfspaces under Product Distributions. |
IEEE Conference on Computational Complexity |
2010 |
DBLP DOI BibTeX RDF |
Pseudorandness, complexity theory, halfspace |
| 1 | Parikshit Gopalan |
A Fourier-analytic approach to Reed-Muller decoding. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Parikshit Gopalan, Shachar Lovett, Amir Shpilka |
On the Complexity of Boolean Functions in Different Characteristics. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Ilias Diakonikolas, Parikshit Gopalan, Ragesh Jaiswal, Rocco A. Servedio, Emanuele Viola |
Bounded Independence Fools Halfspaces. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Parikshit Gopalan |
A note on Efremenko's Locally Decodable Codes. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Ilias Diakonikolas, Parikshit Gopalan, Ragesh Jaiswal, Rocco A. Servedio, Emanuele Viola |
Bounded Independence Fools Halfspaces |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Vitaly Feldman, Parikshit Gopalan, Subhash Khot, Ashok Kumar Ponnuswami |
On Agnostic Learning of Parities, Monomials, and Halfspaces. |
SIAM J. Comput. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Parikshit Gopalan, Phokion G. Kolaitis, Elitza N. Maneva, Christos H. Papadimitriou |
The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies. |
SIAM J. Comput. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Parikshit Gopalan, Jaikumar Radhakrishnan |
Finding duplicates in a data stream. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Parikshit Gopalan, Ryan O'Donnell, Rocco A. Servedio, Amir Shpilka, Karl Wimmer |
Testing Fourier Dimensionality and Sparsity. |
ICALP |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ilias Diakonikolas, Parikshit Gopalan, Ragesh Jaiswal, Rocco A. Servedio, Emanuele Viola |
Bounded Independence Fools Halfspaces. |
FOCS |
2009 |
DBLP DOI BibTeX RDF |
k-wise independent distributions, pseudorandomness, halfspaces |
| 1 | Parikshit Gopalan, Shachar Lovett, Amir Shpilka |
On the Complexity of Boolean Functions in Different Characteristics. |
IEEE Conference on Computational Complexity |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Parikshit Gopalan, Venkatesan Guruswami, Prasad Raghavendra |
List decoding tensor products and interleaved codes. |
STOC |
2009 |
DBLP DOI BibTeX RDF |
Johnson bound, generalized hamming weights, interleaved codes, linear transformations, list decoding, tensor products |
| 1 | Parikshit Gopalan, Venkatesan Guruswami, Prasad Raghavendra |
List Decoding Tensor Products and Interleaved Codes. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Parikshit Gopalan, Venkatesan Guruswami, Richard J. Lipton |
Algorithms for Modular Counting of Roots of Multivariate Polynomials. |
Algorithmica |
2008 |
DBLP DOI BibTeX RDF |
Modular counting, Polynomials, Reed-Solomon codes |
| 1 | Saugata Basu, Nayantara Bhatnagar, Parikshit Gopalan, Richard J. Lipton |
Polynomials that Sign Represent Parity and Descartes' Rule of Signs. |
Computational Complexity |
2008 |
DBLP DOI BibTeX RDF |
68Q17, Subject classification |
| 1 | Parikshit Gopalan, Venkatesan Guruswami, Prasad Raghavendra |
List Decoding Tensor Products and Interleaved Codes |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Parikshit Gopalan |
Query-Efficient Algorithms for Polynomial Interpolation over Composites. |
SIAM J. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Parikshit Gopalan, Adam Kalai, Adam R. Klivans |
A Query Algorithm for Agnostically Learning DNF?. |
COLT |
2008 |
DBLP BibTeX RDF |
|
| 1 | Parikshit Gopalan, Venkatesan Guruswami |
Hardness Amplification within NP against Deterministic Algorithms. |
IEEE Conference on Computational Complexity |
2008 |
DBLP DOI BibTeX RDF |
Hardness Amplication, Error-Correcting Codes, Derandomization, NP |
| 1 | Parikshit Gopalan, Adam Tauman Kalai, Adam R. Klivans |
Agnostically learning decision trees. |
STOC |
2008 |
DBLP DOI BibTeX RDF |
learning in the presence of noise, decision trees, agnostic learning |
| 1 | Parikshit Gopalan, Adam R. Klivans, David Zuckerman |
List-decoding reed-muller codes over small fields. |
STOC |
2008 |
DBLP DOI BibTeX RDF |
fitting polynomials, self-correctors, reed-muller codes, list-decoding |
| 1 | Parikshit Gopalan, Subhash Khot, Rishi Saket |
Hardness of Reconstructing Multivariate Polynomials over Finite Fields. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Parikshit Gopalan, Venkatesan Guruswami |
Deterministic Hardness Amplification via Local GMD Decoding. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Parikshit Gopalan, T. S. Jayram, Robert Krauthgamer, Ravi Kumar |
Estimating the sortedness of a data stream. |
SODA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Anna Gál, Parikshit Gopalan |
Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence. |
FOCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Parikshit Gopalan, Subhash Khot, Rishi Saket |
Hardness of Reconstructing Multivariate Polynomials over Finite Fields. |
FOCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Vitaly Feldman, Parikshit Gopalan, Subhash Khot, Ashok Kumar Ponnuswami |
New Results for Learning Noisy Parities and Halfspaces. |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Parikshit Gopalan, Phokion G. Kolaitis, Elitza N. Maneva, Christos H. Papadimitriou |
The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | Nayantara Bhatnagar, Parikshit Gopalan, Richard J. Lipton |
Symmetric polynomials over Zm and simultaneous communication protocols. |
J. Comput. Syst. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Parikshit Gopalan |
Query-efficient algorithms for polynomial interpolation over composites. |
SODA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Parikshit Gopalan, Phokion G. Kolaitis, Elitza N. Maneva, Christos H. Papadimitriou |
The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies. |
ICALP |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Parikshit Gopalan, Venkatesan Guruswami, Richard J. Lipton |
Algorithms for Modular Counting of Roots of Multivariate Polynomials. |
LATIN |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Vitaly Feldman, Parikshit Gopalan, Subhash Khot, Ashok Kumar Ponnuswami |
New Results for Learning Noisy Parities and Halfspaces. |
FOCS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Parikshit Gopalan |
Constructing Ramsey Graphs from Boolean Function Representations. |
IEEE Conference on Computational Complexity |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Parikshit Gopalan |
Constructing Ramsey Graphs from Boolean Function Representations |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Parikshit Gopalan, Howard J. Karloff, Aranyak Mehta, Milena Mihail, Nisheeth K. Vishnoi |
Caching with Expiration Times for Internet Applications. |
Internet Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Nayantara Bhatnagar, Parikshit Gopalan, Richard J. Lipton |
The Degree of Threshold Mod 6 and Diophantine Equations |
Electronic Colloquium on Computational Complexity (ECCC) |
2004 |
DBLP BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Nayantara Bhatnagar, Parikshit Gopalan, Richard J. Lipton |
Symmetric Polynomials over Zm and Simultaneous Communication Protocols |
Electronic Colloquium on Computational Complexity (ECCC) |
2003 |
DBLP BibTeX RDF |
|
| 1 | Nayantara Bhatnagar, Parikshit Gopalan, Richard J. Lipton |
Symmetric Polynomials over Zm and Simultaneous Communication Protocol. |
FOCS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Parikshit Gopalan, Richard J. Lipton, Aranyak Mehta |
Randomized Time-Space Tradeoffs for Directed Graph Connectivity. |
FSTTCS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Parikshit Gopalan, Howard J. Karloff, Aranyak Mehta, Milena Mihail, Nisheeth K. Vishnoi |
Caching with expiration times. |
SODA |
2002 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")