default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDParikshit Gopalan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c54]Parikshit Gopalan, Lunjia Hu, Guy N. Rothblum:
On Computationally Efficient Multi-Class Calibration. COLT 2024: 1983-2026- [c53]Parikshit Gopalan, Princewill Okoroafor, Prasad Raghavendra, Abhishek Sherry, Mihir Singhal:
Omnipredictors for regression and the approximate rank of convex functions. COLT 2024: 2027-2070 - [c52]Jaroslaw Blasiok, Parikshit Gopalan, Lunjia Hu, Adam Tauman Kalai, Preetum Nakkiran:
Loss Minimization Yields Multicalibration for Large Neural Networks. ITCS 2024: 17:1-17:21 - [i62]Parikshit Gopalan, Princewill Okoroafor, Prasad Raghavendra, Abhishek Shetty, Mihir Singhal:
Omnipredictors for Regression and the Approximate Rank of Convex Functions. CoRR abs/2401.14645 (2024) - [i61]Parikshit Gopalan, Lunjia Hu, Guy N. Rothblum:
On Computationally Efficient Multi-Class Calibration. CoRR abs/2402.07821 (2024) - 2023
- [c51]Parikshit Gopalan, Lunjia Hu
, Michael P. Kim, Omer Reingold, Udi Wieder:
Loss Minimization Through the Lens Of Outcome Indistinguishability. ITCS 2023: 60:1-60:20 - [c50]Jaroslaw Blasiok, Parikshit Gopalan, Lunjia Hu, Preetum Nakkiran:
When Does Optimizing a Proper Loss Yield Calibration? NeurIPS 2023 - [c49]Aravind Gollakota, Parikshit Gopalan, Adam R. Klivans, Konstantinos Stavropoulos:
Agnostically Learning Single-Index Models using Omnipredictors. NeurIPS 2023 - [c48]Parikshit Gopalan, Michael P. Kim, Omer Reingold:
Swap Agnostic Learning, or Characterizing Omniprediction via Multicalibration. NeurIPS 2023 - [c47]Jaroslaw Blasiok, Parikshit Gopalan, Lunjia Hu, Preetum Nakkiran:
A Unifying Theory of Distance from Calibration. STOC 2023: 1727-1740 - [i60]Parikshit Gopalan, Michael P. Kim, Omer Reingold:
Characterizing notions of omniprediction via multicalibration. CoRR abs/2302.06726 (2023) - [i59]Jaroslaw Blasiok, Parikshit Gopalan, Lunjia Hu, Adam Tauman Kalai, Preetum Nakkiran:
Loss minimization yields multicalibration for large neural networks. CoRR abs/2304.09424 (2023) - [i58]Jaroslaw Blasiok, Parikshit Gopalan, Lunjia Hu, Preetum Nakkiran:
When Does Optimizing a Proper Loss Yield Calibration? CoRR abs/2305.18764 (2023) - [i57]Aravind Gollakota, Parikshit Gopalan, Adam R. Klivans, Konstantinos Stavropoulos:
Agnostically Learning Single-Index Models using Omnipredictors. CoRR abs/2306.10615 (2023) - 2022
- [j27]Mihai Budiu, Pratiksha Thaker, Parikshit Gopalan, Udi Wieder, Matei Zaharia:
Overlook: Differentially Private Exploratory Visualization for Big Data. J. Priv. Confidentiality 12(1) (2022) - [c46]Parikshit Gopalan, Omer Reingold, Vatsal Sharan, Udi Wieder:
Multicalibrated Partitions for Importance Weights. ALT 2022: 408-435 - [c45]Parikshit Gopalan, Michael P. Kim, Mihir Singhal, Shengjia Zhao:
Low-Degree Multicalibration. COLT 2022: 3193-3234 - [c44]Parikshit Gopalan, Adam Tauman Kalai, Omer Reingold, Vatsal Sharan, Udi Wieder:
Omnipredictors. ITCS 2022: 79:1-79:21 - [i56]Parikshit Gopalan, Nina Narodytska, Omer Reingold, Vatsal Sharan, Udi Wieder:
KL Divergence Estimation with Multi-group Attribution. CoRR abs/2202.13576 (2022) - [i55]Parikshit Gopalan, Michael P. Kim, Mihir Singhal, Shengjia Zhao:
Low-Degree Multicalibration. CoRR abs/2203.01255 (2022) - [i54]Parikshit Gopalan, Lunjia Hu, Michael P. Kim, Omer Reingold, Udi Wieder:
Loss Minimization through the Lens of Outcome Indistinguishability. CoRR abs/2210.08649 (2022) - [i53]Jaroslaw Blasiok, Parikshit Gopalan, Lunjia Hu, Preetum Nakkiran:
A Unifying Theory of Distance from Calibration. CoRR abs/2211.16886 (2022) - 2021
- [i52]Parikshit Gopalan, Omer Reingold, Vatsal Sharan, Udi Wieder:
Multicalibrated Partitions for Importance Weights. CoRR abs/2103.05853 (2021) - [i51]Parikshit Gopalan, Adam Tauman Kalai, Omer Reingold, Vatsal Sharan, Udi Wieder:
Omnipredictors. CoRR abs/2109.05389 (2021) - 2020
- [j26]Parikshit Gopalan, Amir Yehudayoff:
Concentration for Limited Independence via Inequalities for the Elementary Symmetric Polynomials. Theory Comput. 16: 1-29 (2020) - [c43]Parikshit Gopalan, Roie Levin, Udi Wieder:
Finding Skewed Subcubes Under a Distribution. ITCS 2020: 84:1-84:30 - [i50]Pratiksha Thaker, Mihai Budiu, Parikshit Gopalan, Udi Wieder, Matei Zaharia:
Overlook: Differentially Private Exploratory Visualization for Big Data. CoRR abs/2006.12018 (2020)
2010 – 2019
- 2019
- [j25]Mihai Budiu, Parikshit Gopalan, Lalith Suresh, Udi Wieder, Han Kruiger, Marcos K. Aguilera:
Hillview: A trillion-cell spreadsheet for big data. Proc. VLDB Endow. 12(11): 1442-1457 (2019) - [c42]Parikshit Gopalan, Vatsal Sharan, Udi Wieder:
PIDForest: Anomaly Detection via Partial Identification. NeurIPS 2019: 15783-15793 - [i49]Mihai Budiu, Parikshit Gopalan, Lalith Suresh, Udi Wieder, Han Kruiger, Marcos K. Aguilera:
Hillview: A trillion-cell spreadsheet for big data. CoRR abs/1907.04827 (2019) - [i48]Parikshit Gopalan, Roie Levin, Udi Wieder:
Finding Skewed Subcubes Under a Distribution. CoRR abs/1911.07378 (2019) - [i47]Parikshit Gopalan, Vatsal Sharan, Udi Wieder:
PIDForest: Anomaly Detection via Partial Identification. CoRR abs/1912.03582 (2019) - 2018
- [j24]Parikshit Gopalan, Daniel M. Kane, Raghu Meka:
Pseudorandomness via the Discrete Fourier Transform. SIAM J. Comput. 47(6): 2451-2487 (2018) - [j23]Parikshit Gopalan, Noam Nisan, Tim Roughgarden:
Public Projects, Boolean Functions, and the Borders of Border's Theorem. ACM Trans. Economics and Comput. 6(3-4): 18:1-18:21 (2018) - [c41]Vatsal Sharan, Parikshit Gopalan, Udi Wieder:
Efficient Anomaly Detection via Matrix Sketching. NeurIPS 2018: 8080-8091 - [c40]Lalith Suresh, Dahlia Malkhi, Parikshit Gopalan, Ivan Porto Carreiro, Zeeshan Lokhandwala:
Stable and Consistent Membership at Scale with Rapid. USENIX ATC 2018: 387-400 - [i46]Lalith Suresh, Dahlia Malkhi, Parikshit Gopalan, Ivan Porto Carreiro, Zeeshan Lokhandwala:
Stable and Consistent Membership at Scale with Rapid. CoRR abs/1803.03620 (2018) - [i45]Parikshit Gopalan, Vatsal Sharan, Udi Wieder:
Faster Anomaly Detection via Matrix Sketching. CoRR abs/1804.03065 (2018) - 2017
- [c39]Parikshit Gopalan, Guangda Hu, Swastik Kopparty, Shubhangi Saraf, Carol Wang, Sergey Yekhanin:
Maximally Recoverable Codes for Grid-like Topologies. SODA 2017: 2092-2108 - 2016
- [c38]Parikshit Gopalan, Rocco A. Servedio, Avi Wigderson:
Degree and Sensitivity: Tails of Two Distributions. CCC 2016: 13:1-13:23 - [c37]Parikshit Gopalan, Noam Nisan, Rocco A. Servedio, Kunal Talwar, Avi Wigderson:
Smooth Boolean Functions are Easy: Efficient Algorithms for Low-Sensitivity Functions. ITCS 2016: 59-70 - [i44]Parikshit Gopalan, Rocco A. Servedio, Avishay Tal, Avi Wigderson:
Degree and Sensitivity: tails of two distributions. CoRR abs/1604.07432 (2016) - [i43]Parikshit Gopalan, Guangda Hu, Shubhangi Saraf, Carol Wang, Sergey Yekhanin:
Maximally Recoverable Codes for Grid-like Topologies. CoRR abs/1605.05412 (2016) - [i42]Parikshit Gopalan, Rocco A. Servedio, Avishay Tal, Avi Wigderson:
Degree and Sensitivity: tails of two distributions. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [j22]Boaz Barak, Parikshit Gopalan, Johan Håstad, Raghu Meka, Prasad Raghavendra, David Steurer:
Making the Long Code Shorter. SIAM J. Comput. 44(5): 1287-1324 (2015) - [c36]Parikshit Gopalan, Daniel M. Kane, Raghu Meka:
Pseudorandomness via the Discrete Fourier Transform. FOCS 2015: 903-922 - [c35]Parikshit Gopalan, Noam Nisan, Tim Roughgarden:
Public Projects, Boolean Functions, and the Borders of Border's Theorem. EC 2015: 395 - [i41]Parikshit Gopalan, Noam Nisan, Tim Roughgarden:
Public projects, Boolean functions and the borders of Border's theorem. CoRR abs/1504.07687 (2015) - [i40]Parikshit Gopalan, Daniel M. Kane, Raghu Meka:
Pseudorandomness via the discrete Fourier transform. CoRR abs/1506.04350 (2015) - [i39]Parikshit Gopalan, Noam Nisan, Rocco A. Servedio, Kunal Talwar, Avi Wigderson:
Smooth Boolean functions are easy: efficient algorithms for low-sensitivity functions. CoRR abs/1508.02420 (2015) - [i38]Parikshit Gopalan, Noam Nisan, Rocco A. Servedio, Kunal Talwar, Avi Wigderson:
Smooth Boolean functions are easy: efficient algorithms for low-sensitivity functions. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [j21]Parikshit Gopalan:
Constructing Ramsey graphs from Boolean function representations. Comb. 34(2): 173-206 (2014) - [j20]Parikshit Gopalan, Cheng Huang, Bob Jenkins, Sergey Yekhanin:
Explicit Maximally Recoverable Codes With Locality. IEEE Trans. Inf. Theory 60(9): 5245-5256 (2014) - [c34]Parikshit Gopalan, Salil P. Vadhan, Yuan Zhou:
Locally testable codes and cayley graphs. ITCS 2014: 81-92 - [i37]Parikshit Gopalan, Amir Yehudayoff:
Inequalities and tail bounds for elementary symmetric polynomial. CoRR abs/1402.3543 (2014) - [i36]Parikshit Gopalan, Daniel M. Kane, Raghu Meka:
Pseudorandomness for concentration bounds and signed majorities. CoRR abs/1411.4584 (2014) - [i35]Parikshit Gopalan, Amir Yehudayoff:
Inequalities and tail bounds for elementary symmetric polynomials. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [j19]Parikshit Gopalan, Raghu Meka, Omer Reingold:
DNF sparsification and a faster deterministic counting algorithm. Comput. Complex. 22(2): 275-310 (2013) - [j18]Parikshit Gopalan, Raghu Meka, Omer Reingold, David Zuckerman:
Pseudorandom Generators for Combinatorial Shapes. SIAM J. Comput. 42(3): 1051-1076 (2013) - [j17]Parikshit Gopalan:
A Fourier-Analytic Approach to Reed-Muller Decoding. IEEE Trans. Inf. Theory 59(11): 7747-7760 (2013) - [c33]Rodolfo Azevedo, John D. Davis, Karin Strauss, Parikshit Gopalan, Mark S. Manasse, Sergey Yekhanin:
Zombie memory: extending memory lifetime by reviving dead blocks. ISCA 2013: 452-463 - [i34]Parikshit Gopalan, Cheng Huang, Bob Jenkins, Sergey Yekhanin:
Explicit Maximally Recoverable Codes with Locality. CoRR abs/1307.4150 (2013) - [i33]Parikshit Gopalan, Salil P. Vadhan, Yuan Zhou:
Locally Testable Codes and Cayley Graphs. CoRR abs/1308.5158 (2013) - [i32]Parikshit Gopalan, Cheng Huang, Bob Jenkins, Sergey Yekhanin:
Explicit Maximally Recoverable Codes with Locality. Electron. Colloquium Comput. Complex. TR13 (2013) - [i31]Parikshit Gopalan, Salil P. Vadhan, Yuan Zhou:
Locally Testable Codes and Cayley Graphs. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [j16]Parikshit Gopalan, Cheng Huang, Huseyin Simitci, Sergey Yekhanin:
On the Locality of Codeword Symbols. IEEE Trans. Inf. Theory 58(11): 6925-6934 (2012) - [c32]Parikshit Gopalan, Raghu Meka, Omer Reingold:
DNF Sparsification and a Faster Deterministic Counting Algorithm. CCC 2012: 126-135 - [c31]Parikshit Gopalan, Raghu Meka, Omer Reingold, Luca Trevisan, Salil P. Vadhan:
Better Pseudorandom Generators from Milder Pseudorandom Restrictions. FOCS 2012: 120-129 - [c30]Boaz Barak, Parikshit Gopalan, Johan Håstad, Raghu Meka, Prasad Raghavendra, David Steurer:
Making the Long Code Shorter. FOCS 2012: 370-379 - [c29]Cheng Huang, Huseyin Simitci, Yikang Xu, Aaron Ogus, Brad Calder, Parikshit Gopalan, Jin Li, Sergey Yekhanin:
Erasure Coding in Windows Azure Storage. USENIX ATC 2012: 15-26 - [c28]Parikshit Gopalan, Adam R. Klivans, Raghu Meka:
Learning Functions of Halfspaces using Prefix Covers. COLT 2012: 15.1-15.10 - [i30]Parikshit Gopalan, Raghu Meka, Omer Reingold:
DNF Sparsification and a Faster Deterministic Counting Algorithm. CoRR abs/1205.3534 (2012) - [i29]Parikshit Gopalan, Raghu Meka, Omer Reingold, Luca Trevisan, Salil P. Vadhan:
Better Pseudorandom Generators from Milder Pseudorandom Restrictions. CoRR abs/1210.0049 (2012) - [i28]Parikshit Gopalan, Raghu Meka, Omer Reingold:
DNF Sparsification and a Faster Deterministic Counting. Electron. Colloquium Comput. Complex. TR12 (2012) - [i27]Parikshit Gopalan, Raghu Meka, Omer Reingold, Luca Trevisan, Salil P. Vadhan:
Better pseudorandom generators from milder pseudorandom restrictions. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [j15]Parikshit Gopalan, Venkatesan Guruswami:
Hardness amplification within NP against deterministic algorithms. J. Comput. Syst. Sci. 77(1): 107-121 (2011) - [j14]Parikshit Gopalan, Ryan O'Donnell, Rocco A. Servedio, Amir Shpilka, Karl Wimmer:
Testing Fourier Dimensionality and Sparsity. SIAM J. Comput. 40(4): 1075-1100 (2011) - [j13]Zeev Dvir, Parikshit Gopalan, Sergey Yekhanin:
Matching Vector Codes. SIAM J. Comput. 40(4): 1154-1178 (2011) - [j12]Parikshit Gopalan, Venkatesan Guruswami, Prasad Raghavendra:
List Decoding Tensor Products and Interleaved Codes. SIAM J. Comput. 40(5): 1432-1462 (2011) - [c27]Parikshit Gopalan, Adam R. Klivans, Raghu Meka, Daniel Stefankovic, Santosh S. Vempala, Eric Vigoda:
An FPTAS for #Knapsack and Related Counting Problems. FOCS 2011: 817-826 - [c26]Parikshit Gopalan, Raghu Meka, Omer Reingold, David Zuckerman:
Pseudorandom generators for combinatorial shapes. STOC 2011: 253-262 - [i26]Parikshit Gopalan, Cheng Huang, Huseyin Simitci, Sergey Yekhanin:
On the Locality of Codeword Symbols. CoRR abs/1106.3625 (2011) - [i25]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 abs/1111.0405 (2011) - [i24]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. Electron. Colloquium Comput. Complex. TR11 (2011) - [i23]Parikshit Gopalan, Cheng Huang, Huseyin Simitci, Sergey Yekhanin:
On the Locality of Codeword Symbols. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [j11]Parikshit Gopalan, Amir Shpilka, Shachar Lovett:
The Complexity of Boolean Functions in Different Characteristics. Comput. Complex. 19(2): 235-263 (2010) - [j10]Parikshit Gopalan, Subhash Khot, Rishi Saket:
Hardness of Reconstructing Multivariate Polynomials over Finite Fields. SIAM J. Comput. 39(6): 2598-2621 (2010) - [j9]Ilias Diakonikolas, Parikshit Gopalan, Ragesh Jaiswal, Rocco A. Servedio, Emanuele Viola:
Bounded Independence Fools Halfspaces. SIAM J. Comput. 39(8): 3441-3462 (2010) - [j8]Anna Gál, Parikshit Gopalan:
Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence. SIAM J. Comput. 39(8): 3463-3479 (2010) - [c25]Parikshit Gopalan, Rocco A. Servedio:
Learning and Lower Bounds for AC0 with Threshold Gates. APPROX-RANDOM 2010: 588-601 - [c24]Parikshit Gopalan, Ryan O'Donnell, Yi Wu, David Zuckerman:
Fooling Functions of Halfspaces under Product Distributions. CCC 2010: 223-234 - [c23]Parikshit Gopalan:
A Fourier-Analytic Approach to Reed-Muller Decoding. FOCS 2010: 685-694 - [c22]Zeev Dvir, Parikshit Gopalan, Sergey Yekhanin:
Matching Vector Codes. FOCS 2010: 705-714 - [i22]Parikshit Gopalan, Ryan O'Donnell, Yi Wu, David Zuckerman:
Fooling functions of halfspaces under product distributions. CoRR abs/1001.1593 (2010) - [i21]Parikshit Gopalan, Adam R. Klivans, Raghu Meka:
Polynomial-Time Approximation Schemes for Knapsack and Related Counting Problems using Branching Programs. CoRR abs/1008.3187 (2010) - [i20]Zeev Dvir, Parikshit Gopalan, Sergey Yekhanin:
Matching Vector Codes. Electron. Colloquium Comput. Complex. TR10 (2010) - [i19]Parikshit Gopalan, Adam R. Klivans, Raghu Meka:
Polynomial-Time Approximation Schemes for Knapsack and Related Counting Problems using Branching Programs. Electron. Colloquium Comput. Complex. TR10 (2010) - [i18]Parikshit Gopalan, Raghu Meka, Omer Reingold, David Zuckerman:
Pseudorandom Generators for Combinatorial Shapes. Electron. Colloquium Comput. Complex. TR10 (2010) - [i17]Parikshit Gopalan, Rocco A. Servedio:
Learning and Lower Bounds for AC0 with Threshold Gates. Electron. Colloquium Comput. Complex. TR10 (2010) - [i16]Yi Wu, Ryan O'Donnell, David Zuckerman, Parikshit Gopalan:
Fooling functions of halfspaces under product distributions. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [j7]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) - [j6]Vitaly Feldman, Parikshit Gopalan, Subhash Khot, Ashok Kumar Ponnuswami:
On Agnostic Learning of Parities, Monomials, and Halfspaces. SIAM J. Comput. 39(2): 606-645 (2009) - [c21]Parikshit Gopalan, Shachar Lovett, Amir Shpilka:
On the Complexity of Boolean Functions in Different Characteristics. CCC 2009: 173-183 - [c20]Ilias Diakonikolas, Parikshit Gopalan, Ragesh Jaiswal, Rocco A. Servedio, Emanuele Viola:
Bounded Independence Fools Halfspaces. FOCS 2009: 171-180 - [c19]Parikshit Gopalan, Ryan O'Donnell, Rocco A. Servedio, Amir Shpilka, Karl Wimmer:
Testing Fourier Dimensionality and Sparsity. ICALP (1) 2009: 500-512 - [c18]Parikshit Gopalan, Jaikumar Radhakrishnan:
Finding duplicates in a data stream. SODA 2009: 402-411 - [c17]Parikshit Gopalan, Venkatesan Guruswami, Prasad Raghavendra:
List decoding tensor products and interleaved codes. STOC 2009: 13-22 - [i15]Ilias Diakonikolas, Parikshit Gopalan, Ragesh Jaiswal, Rocco A. Servedio, Emanuele Viola:
Bounded Independence Fools Halfspaces. CoRR abs/0902.3757 (2009) - [i14]Ilias Diakonikolas, Parikshit Gopalan, Ragesh Jaiswal, Rocco A. Servedio, Emanuele Viola:
Bounded Independence Fools Halfspaces. Electron. Colloquium Comput. Complex. TR09 (2009) - [i13]Parikshit Gopalan:
A Fourier-analytic approach to Reed-Muller decoding. Electron. Colloquium Comput. Complex. TR09 (2009) - [i12]Parikshit Gopalan:
A note on Efremenko's Locally Decodable Codes. Electron. Colloquium Comput. Complex. TR09 (2009) - [i11]Parikshit Gopalan, Shachar Lovett, Amir Shpilka:
On the Complexity of Boolean Functions in Different Characteristics. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [j5]Parikshit Gopalan, Venkatesan Guruswami, Richard J. Lipton:
Algorithms for Modular Counting of Roots of Multivariate Polynomials. Algorithmica 50(4): 479-496 (2008) - [j4]Saugata Basu, Nayantara Bhatnagar, Parikshit Gopalan, Richard J. Lipton:
Polynomials that Sign Represent Parity and Descartes' Rule of Signs. Comput. Complex. 17(3): 377-406 (2008) - [j3]Parikshit Gopalan:
Query-Efficient Algorithms for Polynomial Interpolation over Composites. SIAM J. Comput. 38(3): 1033-1057 (2008) - [c16]Parikshit Gopalan, Venkatesan Guruswami:
Hardness Amplification within NP against Deterministic Algorithms. CCC 2008: 19-30 - [c15]Parikshit Gopalan, Adam Kalai, Adam R. Klivans:
A Query Algorithm for Agnostically Learning DNF?. COLT 2008: 515-516 - [c14]Parikshit Gopalan, Adam R. Klivans, David Zuckerman:
List-decoding reed-muller codes over small fields. STOC 2008: 265-274 - [c13]Parikshit Gopalan, Adam Tauman Kalai, Adam R. Klivans:
Agnostically learning decision trees. STOC 2008: 527-536 - [i10]Parikshit Gopalan, Venkatesan Guruswami, Prasad Raghavendra:
List Decoding Tensor Products and Interleaved Codes. CoRR abs/0811.4395 (2008) - [i9]Parikshit Gopalan, Venkatesan Guruswami, Prasad Raghavendra:
List Decoding Tensor Products and Interleaved Codes. Electron. Colloquium Comput. Complex. TR08 (2008) - 2007
- [c12]Anna Gál, Parikshit Gopalan:
Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence. FOCS 2007: 294-304 - [c11]Parikshit Gopalan, Subhash Khot, Rishi Saket:
Hardness of Reconstructing Multivariate Polynomials over Finite Fields. FOCS 2007: 349-359 - [c10]Parikshit Gopalan, T. S. Jayram, Robert Krauthgamer, Ravi Kumar:
Estimating the sortedness of a data stream. SODA 2007: 318-327 - [i8]Parikshit Gopalan, Venkatesan Guruswami:
Deterministic Hardness Amplification via Local GMD Decoding. Electron. Colloquium Comput. Complex. TR07 (2007) - [i7]Parikshit Gopalan, Subhash Khot, Rishi Saket:
Hardness of Reconstructing Multivariate Polynomials over Finite Fields. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [j2]Nayantara Bhatnagar, Parikshit Gopalan, Richard J. Lipton:
Symmetric polynomials over Zm and simultaneous communication protocols. J. Comput. Syst. Sci. 72(2): 252-285 (2006) - [c9]Parikshit Gopalan:
Constructing Ramsey Graphs from Boolean Function Representations. CCC 2006: 115-128 - [c8]Vitaly Feldman, Parikshit Gopalan, Subhash Khot, Ashok Kumar Ponnuswami:
New Results for Learning Noisy Parities and Halfspaces. FOCS 2006: 563-574 - [c7]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 - [c6]Parikshit Gopalan, Venkatesan Guruswami, Richard J. Lipton:
Algorithms for Modular Counting of Roots of Multivariate Polynomials. LATIN 2006: 544-555 - [c5]Parikshit Gopalan:
Query-efficient algorithms for polynomial interpolation over composites. SODA 2006: 908-917 - [i6]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) - [i5]Vitaly Feldman, Parikshit Gopalan, Subhash Khot, Ashok Kumar Ponnuswami:
New Results for Learning Noisy Parities and Halfspaces. Electron. Colloquium Comput. Complex. TR06 (2006) - [i4]Parikshit Gopalan, Phokion G. Kolaitis, Elitza N. Maneva, Christos H. Papadimitriou:
The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [j1]Parikshit Gopalan, Howard J. Karloff, Aranyak Mehta, Milena Mihail, Nisheeth K. Vishnoi:
Caching with Expiration Times for Internet Applications. Internet Math. 2(2): 165-184 (2005) - [i3]Parikshit Gopalan:
Constructing Ramsey Graphs from Boolean Function Representations. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [c4]Saugata Basu, Nayantara Bhatnagar, Parikshit Gopalan, Richard J. Lipton:
Polynomials That Sign Represent Parity and Descartes Rule of Signs. CCC 2004: 223-235 - [i2]Nayantara Bhatnagar, Parikshit Gopalan, Richard J. Lipton:
The Degree of Threshold Mod 6 and Diophantine Equations. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [c3]Nayantara Bhatnagar, Parikshit Gopalan, Richard J. Lipton:
Symmetric Polynomials over Zm and Simultaneous Communication Protocol. FOCS 2003: 450-459 - [c2]Parikshit Gopalan, Richard J. Lipton, Aranyak Mehta:
Randomized Time-Space Tradeoffs for Directed Graph Connectivity. FSTTCS 2003: 208-216 - [i1]Nayantara Bhatnagar, Parikshit Gopalan, Richard J. Lipton:
Symmetric Polynomials over Zm and Simultaneous Communication Protocols. Electron. Colloquium Comput. Complex. TR03 (2003) - 2002
- [c1]Parikshit Gopalan, Howard J. Karloff, Aranyak Mehta, Milena Mihail, Nisheeth K. Vishnoi:
Caching with expiration times. SODA 2002: 540-547
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
