The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Parikshit Gopalan" ( http://dblp.L3S.de/Authors/Parikshit_Gopalan )

  Author page on DBLP  Author page in RDF  Community of Parikshit Gopalan in ASPL-2

Publication years (Num. hits)
2002-2006 (17) 2007-2009 (26) 2010 (15) 2011-2012 (20) 2013-2015 (21) 2016-2019 (13)
Publication types (Num. hits)
article(71) inproceedings(41)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 18 occurrences of 16 keywords

Results
Found 113 publication records. Showing 112 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Mihai Budiu, Parikshit Gopalan, Lalith Suresh, Udi Wieder, Han Kruiger, Marcos K. Aguilera Hillview: A trillion-cell spreadsheet for big data. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Parikshit Gopalan, Noam Nisan, Tim Roughgarden Public Projects, Boolean Functions, and the Borders of Border's Theorem. Search on Bibsonomy ACM Trans. Economics and Comput. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Parikshit Gopalan, Vatsal Sharan, Udi Wieder Faster Anomaly Detection via Matrix Sketching. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Lalith Suresh, Dahlia Malkhi, Parikshit Gopalan, Ivan Porto Carreiro, Zeeshan Lokhandwala Stable and Consistent Membership at Scale with Rapid. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Parikshit Gopalan, Daniel M. Kane, Raghu Meka Pseudorandomness via the Discrete Fourier Transform. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Lalith Suresh, Dahlia Malkhi, Parikshit Gopalan, Ivan Porto Carreiro, Zeeshan Lokhandwala Stable and Consistent Membership at Scale with Rapid. Search on Bibsonomy USENIX Annual Technical Conference The full citation details ... 2018 DBLP  BibTeX  RDF
1Vatsal Sharan, Parikshit Gopalan, Udi Wieder Efficient Anomaly Detection via Matrix Sketching. Search on Bibsonomy NeurIPS The full citation details ... 2018 DBLP  BibTeX  RDF
1Parikshit Gopalan, Guangda Hu, Swastik Kopparty, Shubhangi Saraf, Carol Wang, Sergey Yekhanin Maximally Recoverable Codes for Grid-like Topologies. Search on Bibsonomy SODA The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Parikshit Gopalan, Rocco A. Servedio, Avishay Tal, Avi Wigderson Degree and Sensitivity: tails of two distributions. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2016 DBLP  BibTeX  RDF
1Parikshit Gopalan, Rocco A. Servedio, Avishay Tal, Avi Wigderson Degree and Sensitivity: tails of two distributions. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Parikshit Gopalan, Guangda Hu, Shubhangi Saraf, Carol Wang, Sergey Yekhanin Maximally Recoverable Codes for Grid-like Topologies. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Parikshit Gopalan, Noam Nisan, Rocco A. Servedio, Kunal Talwar, Avi Wigderson Smooth Boolean Functions are Easy: Efficient Algorithms for Low-Sensitivity Functions. Search on Bibsonomy ITCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Parikshit Gopalan, Rocco A. Servedio, Avi Wigderson Degree and Sensitivity: Tails of Two Distributions. Search on Bibsonomy Conference on Computational Complexity The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Parikshit Gopalan, Noam Nisan, Rocco A. Servedio, Kunal Talwar, Avi Wigderson Smooth Boolean functions are easy: efficient algorithms for low-sensitivity functions. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2015 DBLP  BibTeX  RDF
1Parikshit Gopalan, Daniel M. Kane, Raghu Meka Pseudorandomness via the discrete Fourier transform. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Parikshit Gopalan, Noam Nisan, Rocco A. Servedio, Kunal Talwar, Avi Wigderson Smooth Boolean functions are easy: efficient algorithms for low-sensitivity functions. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Parikshit Gopalan, Noam Nisan, Tim Roughgarden Public projects, Boolean functions and the borders of Border's theorem. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Boaz Barak, Parikshit Gopalan, Johan Håstad, Raghu Meka, Prasad Raghavendra, David Steurer Making the Long Code Shorter. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Parikshit Gopalan, Daniel M. Kane, Raghu Meka Pseudorandomness via the Discrete Fourier Transform. Search on Bibsonomy FOCS The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Parikshit Gopalan, Noam Nisan, Tim Roughgarden Public Projects, Boolean Functions, and the Borders of Border's Theorem. Search on Bibsonomy EC The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Parikshit Gopalan Constructing Ramsey graphs from Boolean function representations. Search on Bibsonomy Combinatorica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Parikshit Gopalan, Amir Yehudayoff Inequalities and tail bounds for elementary symmetric polynomials. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2014 DBLP  BibTeX  RDF
1Parikshit Gopalan, Cheng Huang, Bob Jenkins, Sergey Yekhanin Explicit Maximally Recoverable Codes With Locality. Search on Bibsonomy IEEE Trans. Information Theory The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Parikshit Gopalan, Daniel M. Kane, Raghu Meka Pseudorandomness for concentration bounds and signed majorities. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Parikshit Gopalan, Amir Yehudayoff Inequalities and tail bounds for elementary symmetric polynomial. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Parikshit Gopalan, Salil P. Vadhan, Yuan Zhou Locally testable codes and cayley graphs. Search on Bibsonomy ITCS The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Parikshit Gopalan, Raghu Meka, Omer Reingold DNF sparsification and a faster deterministic counting algorithm. Search on Bibsonomy Computational Complexity The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Parikshit Gopalan, Salil P. Vadhan, Yuan Zhou Locally Testable Codes and Cayley Graphs. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2013 DBLP  BibTeX  RDF
1Parikshit Gopalan, Cheng Huang, Bob Jenkins, Sergey Yekhanin Explicit Maximally Recoverable Codes with Locality. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2013 DBLP  BibTeX  RDF
1Parikshit Gopalan A Fourier-Analytic Approach to Reed-Muller Decoding. Search on Bibsonomy IEEE Trans. Information Theory The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Parikshit Gopalan, Salil P. Vadhan, Yuan Zhou Locally Testable Codes and Cayley Graphs. Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Parikshit Gopalan, Cheng Huang, Bob Jenkins, Sergey Yekhanin Explicit Maximally Recoverable Codes with Locality. Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Parikshit Gopalan, Raghu Meka, Omer Reingold, David Zuckerman Pseudorandom Generators for Combinatorial Shapes. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Rodolfo Azevedo, John D. Davis, Karin Strauss, Parikshit Gopalan, Mark S. Manasse, Sergey Yekhanin Zombie memory: extending memory lifetime by reviving dead blocks. Search on Bibsonomy ISCA The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Parikshit Gopalan, Adam R. Klivans, Raghu Meka Learning Functions of Halfspaces using Prefix Covers. Search on Bibsonomy COLT The full citation details ... 2012 DBLP  BibTeX  RDF
1Parikshit Gopalan, Raghu Meka, Omer Reingold, Luca Trevisan, Salil P. Vadhan Better pseudorandom generators from milder pseudorandom restrictions. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2012 DBLP  BibTeX  RDF
1Parikshit Gopalan, Raghu Meka, Omer Reingold DNF Sparsification and a Faster Deterministic Counting. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2012 DBLP  BibTeX  RDF
1Parikshit Gopalan, Cheng Huang, Huseyin Simitci, Sergey Yekhanin On the Locality of Codeword Symbols. Search on Bibsonomy IEEE Trans. Information Theory The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Parikshit Gopalan, Raghu Meka, Omer Reingold, Luca Trevisan, Salil P. Vadhan Better Pseudorandom Generators from Milder Pseudorandom Restrictions Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Parikshit Gopalan, Raghu Meka, Omer Reingold DNF Sparsification and a Faster Deterministic Counting Algorithm Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Parikshit Gopalan, Raghu Meka, Omer Reingold, Luca Trevisan, Salil P. Vadhan Better Pseudorandom Generators from Milder Pseudorandom Restrictions. Search on Bibsonomy FOCS The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Boaz Barak, Parikshit Gopalan, Johan Håstad, Raghu Meka, Prasad Raghavendra, David Steurer Making the Long Code Shorter. Search on Bibsonomy FOCS The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Cheng Huang, Huseyin Simitci, Yikang Xu, Aaron Ogus, Brad Calder, Parikshit Gopalan, Jin Li 0001, Sergey Yekhanin Erasure Coding in Windows Azure Storage. Search on Bibsonomy USENIX Annual Technical Conference The full citation details ... 2012 DBLP  BibTeX  RDF
1Parikshit Gopalan, Raghu Meka, Omer Reingold DNF Sparsification and a Faster Deterministic Counting Algorithm. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Parikshit Gopalan, Venkatesan Guruswami Hardness amplification within NP against deterministic algorithms. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Parikshit Gopalan, Cheng Huang, Huseyin Simitci, Sergey Yekhanin On the Locality of Codeword Symbols. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2011 DBLP  BibTeX  RDF
1Boaz Barak, Parikshit Gopalan, Johan Håstad, Raghu Meka, Prasad Raghavendra, David Steurer Making the long code shorter, with applications to the Unique Games Conjecture. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2011 DBLP  BibTeX  RDF
1Boaz Barak, Parikshit Gopalan, Johan Håstad, Raghu Meka, Prasad Raghavendra, David Steurer Making the long code shorter, with applications to the Unique Games Conjecture Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Parikshit Gopalan, Cheng Huang, Huseyin Simitci, Sergey Yekhanin On the Locality of Codeword Symbols Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Parikshit Gopalan, Venkatesan Guruswami, Prasad Raghavendra List Decoding Tensor Products and Interleaved Codes. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Parikshit Gopalan, Ryan O'Donnell, Rocco A. Servedio, Amir Shpilka, Karl Wimmer Testing Fourier Dimensionality and Sparsity. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Zeev Dvir, Parikshit Gopalan, Sergey Yekhanin Matching Vector Codes. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Parikshit Gopalan, Adam R. Klivans, Raghu Meka, Daniel Stefankovic, Santosh Vempala, Eric Vigoda An FPTAS for #Knapsack and Related Counting Problems. Search on Bibsonomy FOCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Parikshit Gopalan, Raghu Meka, Omer Reingold, David Zuckerman Pseudorandom generators for combinatorial shapes. Search on Bibsonomy STOC The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Parikshit Gopalan, Amir Shpilka, Shachar Lovett The Complexity of Boolean Functions in Different Characteristics. Search on Bibsonomy Computational Complexity The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Yi Wu 0002, Ryan O'Donnell, David Zuckerman, Parikshit Gopalan Fooling functions of halfspaces under product distributions. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2010 DBLP  BibTeX  RDF
1Parikshit Gopalan, Rocco A. Servedio Learning and Lower Bounds for AC0 with Threshold Gates. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2010 DBLP  BibTeX  RDF
1Parikshit Gopalan, Adam R. Klivans, Raghu Meka Polynomial-Time Approximation Schemes for Knapsack and Related Counting Problems using Branching Programs. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2010 DBLP  BibTeX  RDF
1Parikshit Gopalan, Raghu Meka, Omer Reingold, David Zuckerman Pseudorandom Generators for Combinatorial Shapes. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2010 DBLP  BibTeX  RDF
1Zeev Dvir, Parikshit Gopalan, Sergey Yekhanin Matching Vector Codes. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2010 DBLP  BibTeX  RDF
1Parikshit Gopalan, Adam R. Klivans, Raghu Meka Polynomial-Time Approximation Schemes for Knapsack and Related Counting Problems using Branching Programs Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Parikshit Gopalan, Ryan O'Donnell, Yi Wu 0002, David Zuckerman Fooling functions of halfspaces under product distributions Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Ilias Diakonikolas, Parikshit Gopalan, Ragesh Jaiswal, Rocco A. Servedio, Emanuele Viola Bounded Independence Fools Halfspaces. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Anna Gál, Parikshit Gopalan Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Parikshit Gopalan, Subhash Khot, Rishi Saket Hardness of Reconstructing Multivariate Polynomials over Finite Fields. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Parikshit Gopalan A Fourier-Analytic Approach to Reed-Muller Decoding. Search on Bibsonomy FOCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Zeev Dvir, Parikshit Gopalan, Sergey Yekhanin Matching Vector Codes. Search on Bibsonomy FOCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Parikshit Gopalan, Rocco A. Servedio Learning and Lower Bounds for AC0 with Threshold Gates. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Parikshit Gopalan, Ryan O'Donnell, Yi Wu 0002, David Zuckerman Fooling Functions of Halfspaces under Product Distributions. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2010 DBLP  DOI  BibTeX  RDF Pseudorandness, complexity theory, halfspace
1Parikshit Gopalan, Shachar Lovett, Amir Shpilka On the Complexity of Boolean Functions in Different Characteristics. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2009 DBLP  BibTeX  RDF
1Ilias Diakonikolas, Parikshit Gopalan, Ragesh Jaiswal, Rocco A. Servedio, Emanuele Viola Bounded Independence Fools Halfspaces. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2009 DBLP  BibTeX  RDF
1Parikshit Gopalan A Fourier-analytic approach to Reed-Muller decoding. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2009 DBLP  BibTeX  RDF
1Parikshit Gopalan A note on Efremenko's Locally Decodable Codes. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2009 DBLP  BibTeX  RDF
1Ilias Diakonikolas, Parikshit Gopalan, Ragesh Jaiswal, Rocco A. Servedio, Emanuele Viola Bounded Independence Fools Halfspaces Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Vitaly Feldman, Parikshit Gopalan, Subhash Khot, Ashok Kumar Ponnuswami On Agnostic Learning of Parities, Monomials, and Halfspaces. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Parikshit Gopalan, Phokion G. Kolaitis, Elitza N. Maneva, Christos H. Papadimitriou The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Parikshit Gopalan, Jaikumar Radhakrishnan Finding duplicates in a data stream. Search on Bibsonomy SODA The full citation details ... 2009 DBLP  BibTeX  RDF
1Ilias Diakonikolas, Parikshit Gopalan, Ragesh Jaiswal, Rocco A. Servedio, Emanuele Viola Bounded Independence Fools Halfspaces. Search on Bibsonomy FOCS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF k-wise independent distributions, pseudorandomness, halfspaces
1Parikshit Gopalan, Ryan O'Donnell, Rocco A. Servedio, Amir Shpilka, Karl Wimmer Testing Fourier Dimensionality and Sparsity. Search on Bibsonomy ICALP (1) The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Parikshit Gopalan, Venkatesan Guruswami, Prasad Raghavendra List decoding tensor products and interleaved codes. Search on Bibsonomy STOC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Johnson bound, generalized hamming weights, interleaved codes, linear transformations, list decoding, tensor products
1Parikshit Gopalan, Shachar Lovett, Amir Shpilka On the Complexity of Boolean Functions in Different Characteristics. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Saugata Basu, Nayantara Bhatnagar, Parikshit Gopalan, Richard J. Lipton Polynomials that Sign Represent Parity and Descartes' Rule of Signs. Search on Bibsonomy Computational Complexity The full citation details ... 2008 DBLP  DOI  BibTeX  RDF 68Q17, Subject classification
1Parikshit Gopalan, Venkatesan Guruswami, Richard J. Lipton Algorithms for Modular Counting of Roots of Multivariate Polynomials. Search on Bibsonomy Algorithmica The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Modular counting, Polynomials, Reed-Solomon codes
1Parikshit Gopalan, Venkatesan Guruswami, Prasad Raghavendra List Decoding Tensor Products and Interleaved Codes. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2008 DBLP  BibTeX  RDF
1Parikshit Gopalan, Venkatesan Guruswami, Prasad Raghavendra List Decoding Tensor Products and Interleaved Codes Search on Bibsonomy CoRR The full citation details ... 2008 DBLP  BibTeX  RDF
1Parikshit Gopalan Query-Efficient Algorithms for Polynomial Interpolation over Composites. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Parikshit Gopalan, Adam Kalai, Adam R. Klivans A Query Algorithm for Agnostically Learning DNF?. Search on Bibsonomy COLT The full citation details ... 2008 DBLP  BibTeX  RDF
1Parikshit Gopalan, Adam Tauman Kalai, Adam R. Klivans Agnostically learning decision trees. Search on Bibsonomy STOC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF learning in the presence of noise, decision trees, agnostic learning
1Parikshit Gopalan, Adam R. Klivans, David Zuckerman List-decoding reed-muller codes over small fields. Search on Bibsonomy STOC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF fitting polynomials, self-correctors, reed-muller codes, list-decoding
1Parikshit Gopalan, Venkatesan Guruswami Hardness Amplification within NP against Deterministic Algorithms. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Hardness Amplication, Error-Correcting Codes, Derandomization, NP
1Parikshit Gopalan, Subhash Khot, Rishi Saket Hardness of Reconstructing Multivariate Polynomials over Finite Fields. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2007 DBLP  BibTeX  RDF
1Parikshit Gopalan, Venkatesan Guruswami Deterministic Hardness Amplification via Local GMD Decoding. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2007 DBLP  BibTeX  RDF
1Parikshit Gopalan, T. S. Jayram, Robert Krauthgamer, Ravi Kumar 0001 Estimating the sortedness of a data stream. Search on Bibsonomy SODA The full citation details ... 2007 DBLP  BibTeX  RDF
1Parikshit Gopalan, Subhash Khot, Rishi Saket Hardness of Reconstructing Multivariate Polynomials over Finite Fields. Search on Bibsonomy FOCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Anna Gál, Parikshit Gopalan Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence. Search on Bibsonomy FOCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Nayantara Bhatnagar, Parikshit Gopalan, Richard J. Lipton Symmetric polynomials over Zm and simultaneous communication protocols. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Parikshit Gopalan, Phokion G. Kolaitis, Elitza N. Maneva, Christos H. Papadimitriou The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2006 DBLP  BibTeX  RDF
1Vitaly Feldman, Parikshit Gopalan, Subhash Khot, Ashok Kumar Ponnuswami New Results for Learning Noisy Parities and Halfspaces. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2006 DBLP  BibTeX  RDF
1Parikshit Gopalan, Phokion G. Kolaitis, Elitza N. Maneva, Christos H. Papadimitriou The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies Search on Bibsonomy CoRR The full citation details ... 2006 DBLP  BibTeX  RDF
1Parikshit Gopalan Query-efficient algorithms for polynomial interpolation over composites. Search on Bibsonomy SODA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 112 (100 per page; Change: )
Pages: [1][2][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license