Searching for authors named "Parikshit Gopalan" – sorted by Relevance.
-
ABSTRACT Agnostically Learning Decision Trees
- ABSTRACT Agnostically Learning Decision Trees Parikshit Gopalan ∗ University of Washington parik
- Add To MetaCart
-
Query-efficient algorithms for polynomial interpolation over composites
- Query-Efficient Algorithms for Polynomial Interpolation over Composites ∗ Parikshit Gopalan
- Cited by 4 (2 self) – Add To MetaCart
-
Hardness of reconstructing multivariate polynomials over finite fields
- Hardness of Reconstructing Multivariate Polynomials over Finite Fields Parikshit Gopalan
- Cited by 2 (1 self) – Add To MetaCart
-
List-Decoding Reed-Muller codes over small fields, manuscript
- List-Decoding Reed-Muller Codes over Small Fields ABSTRACT Parikshit Gopalan ∗ University
- Cited by 2 (2 self) – Add To MetaCart
-
Constructing Ramsey graphs from Boolean function representations
- Constructing Ramsey Graphs from Boolean Function Representations Parikshit Gopalan College
- Cited by 8 (2 self) – Add To MetaCart
-
Estimating the sortedness of a data stream
- Estimating the Sortedness of a Data Stream Parikshit Gopalan ∗ University of Texas at Austin parik
- Cited by 9 (1 self) – Add To MetaCart
-
New results for learning noisy parities and halfspaces
- from the National Science Foundation NSF- CCR-0310882, NSF-CCF-0432037, and NSF-CCF-0427129. Parikshit
- Cited by 20 (6 self) – Add To MetaCart
-
Symmetric Polynomials over Z_m and Simultaneous Communication Protocols
- @(email omitted); Parikshit Gopalan y parik@(email omitted); College of Computing Georgia Institute of Technology Atlanta GA
- Cited by 4 (3 self) – Add To MetaCart
-
Randomized Time-Space Tradeoffs for Directed Graph Connectivity
- Randomized Time-Space Tradeos for Directed Graph Connectivity Parikshit Gopalan, Richard J. Lipton
- Cited by 1 (0 self) – Add To MetaCart
-
Professional Experience
- Curriculum Vitae Parikshit Gopalan Postdoctoral Researcher, Email: parik@(email omitted); Dept
- Add To MetaCart

