The SCEAS System
| |||||||

## Search the dblp DataBase
Parikshit Gopalan:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Saugata Basu, Nayantara Bhatnagar, Parikshit Gopalan, Richard J. Lipton
**Polynomials That Sign Represent Parity and Descartes Rule of Signs.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2004, pp:223-235 [Conf] - Parikshit Gopalan
**Constructing Ramsey Graphs from Boolean Function Representations.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2006, pp:115-128 [Conf] - Nayantara Bhatnagar, Parikshit Gopalan, Richard J. Lipton
**Symmetric Polynomials over Z**[Citation Graph (0, 0)][DBLP]_{m}and Simultaneous Communication Protocol. FOCS, 2003, pp:450-0 [Conf] - Vitaly Feldman, Parikshit Gopalan, Subhash Khot, Ashok Kumar Ponnuswami
**New Results for Learning Noisy Parities and Halfspaces.**[Citation Graph (0, 0)][DBLP] FOCS, 2006, pp:563-574 [Conf] - Parikshit Gopalan, Richard J. Lipton, Aranyak Mehta
**Randomized Time-Space Tradeoffs for Directed Graph Connectivity.**[Citation Graph (0, 0)][DBLP] FSTTCS, 2003, pp:208-216 [Conf] - Parikshit Gopalan, Phokion G. Kolaitis, Elitza N. Maneva, Christos H. Papadimitriou
**The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies.**[Citation Graph (0, 0)][DBLP] ICALP (1), 2006, pp:346-357 [Conf] - Parikshit Gopalan, Venkatesan Guruswami, Richard J. Lipton
**Algorithms for Modular Counting of Roots of Multivariate Polynomials.**[Citation Graph (0, 0)][DBLP] LATIN, 2006, pp:544-555 [Conf] - Parikshit Gopalan
**Query-efficient algorithms for polynomial interpolation over composites.**[Citation Graph (0, 0)][DBLP] SODA, 2006, pp:908-917 [Conf] - Parikshit Gopalan, Howard J. Karloff, Aranyak Mehta, Milena Mihail, Nisheeth K. Vishnoi
**Caching with expiration times.**[Citation Graph (0, 0)][DBLP] SODA, 2002, pp:540-547 [Conf] - Nayantara Bhatnagar, Parikshit Gopalan, Richard J. Lipton
**Symmetric Polynomials over Z**[Citation Graph (0, 0)][DBLP]_{m}and Simultaneous Communication Protocols Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:047, pp:- [Journal] - Nayantara Bhatnagar, Parikshit Gopalan, Richard J. Lipton
**The Degree of Threshold Mod 6 and Diophantine Equations**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:022, pp:- [Journal] - Parikshit Gopalan
**Constructing Ramsey Graphs from Boolean Function Representations**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:143, pp:- [Journal] - Nayantara Bhatnagar, Parikshit Gopalan, Richard J. Lipton
**Symmetric polynomials over Z**[Citation Graph (0, 0)][DBLP]_{m}and simultaneous communication protocols. J. Comput. Syst. Sci., 2006, v:72, n:2, pp:252-285 [Journal] - Parikshit Gopalan, T. S. Jayram, Robert Krauthgamer, Ravi Kumar
**Estimating the sortedness of a data stream.**[Citation Graph (0, 0)][DBLP] SODA, 2007, pp:318-327 [Conf] - Parikshit Gopalan, Phokion G. Kolaitis, Elitza N. Maneva, Christos H. Papadimitriou
**The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies**[Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp:- [Journal] **Learning and Lower Bounds for AC**[Citation Graph (, )][DBLP]^{0}with Threshold Gates.**Hardness Amplification within NP against Deterministic Algorithms.**[Citation Graph (, )][DBLP]**On the Complexity of Boolean Functions in Different Characteristics.**[Citation Graph (, )][DBLP]**Fooling Functions of Halfspaces under Product Distributions.**[Citation Graph (, )][DBLP]**A Query Algorithm for Agnostically Learning DNF?.**[Citation Graph (, )][DBLP]**Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence.**[Citation Graph (, )][DBLP]**Hardness of Reconstructing Multivariate Polynomials over Finite Fields.**[Citation Graph (, )][DBLP]**Bounded Independence Fools Halfspaces.**[Citation Graph (, )][DBLP]**Testing Fourier Dimensionality and Sparsity.**[Citation Graph (, )][DBLP]**Finding duplicates in a data stream.**[Citation Graph (, )][DBLP]**List-decoding reed-muller codes over small fields.**[Citation Graph (, )][DBLP]**List decoding tensor products and interleaved codes.**[Citation Graph (, )][DBLP]**Agnostically learning decision trees.**[Citation Graph (, )][DBLP]**Algorithms for Modular Counting of Roots of Multivariate Polynomials.**[Citation Graph (, )][DBLP]**Polynomials that Sign Represent Parity and Descartes' Rule of Signs.**[Citation Graph (, )][DBLP]**The Complexity of Boolean Functions in Different Characteristics.**[Citation Graph (, )][DBLP]**List Decoding Tensor Products and Interleaved Codes**[Citation Graph (, )][DBLP]**Bounded Independence Fools Halfspaces**[Citation Graph (, )][DBLP]**Fooling functions of halfspaces under product distributions**[Citation Graph (, )][DBLP]**Polynomial-Time Approximation Schemes for Knapsack and Related Counting Problems using Branching Programs**[Citation Graph (, )][DBLP]**List Decoding Tensor Products and Interleaved Codes.**[Citation Graph (, )][DBLP]**Hardness of Reconstructing Multivariate Polynomials over Finite Fields.**[Citation Graph (, )][DBLP]**Deterministic Hardness Amplification via Local GMD Decoding.**[Citation Graph (, )][DBLP]**The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies.**[Citation Graph (, )][DBLP]**New Results for Learning Noisy Parities and Halfspaces.**[Citation Graph (, )][DBLP]
Search in 0.021secs, Finished in 0.024secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |