Prahladh Harsha

Prahladh Harsha, Rahul Jain: A strong direct product theorem for the tribes function via the smooth-rectangle bound. CoRR abs/1302.0275 (2013)

Prahladh Harsha, Adam Klivans, Raghu Meka: An invariance principle for polytopes. J. ACM 59(6): 29 (2012)

Venkat Chandrasekaran, Nathan Srebro, Prahladh Harsha: Complexity of Inference in Graphical Models. CoRR abs/1206.3240 (2012)

Steve Chien, Prahladh Harsha, Alistair Sinclair, Srikanth Srinivasan: Almost settling the hardness of noncommutative determinant. STOC 2011: 499-508

Steve Chien, Prahladh Harsha, Alistair Sinclair, Srikanth Srinivasan: Almost Settling the Hardness of Noncommutative Determinant. CoRR abs/1101.1169 (2011)

Prahladh Harsha, Rahul Jain, David A. McAllester, Jaikumar Radhakrishnan: The communication complexity of correlation. IEEE Transactions on Information Theory 56(1): 438-449 (2010)

Eli Ben-Sasson, Prahladh Harsha: Lower bounds for bounded depth Frege proofs via Pudlák-Buss games. ACM Trans. Comput. Log. 11(3) (2010)

Irit Dinur, Prahladh Harsha: Composition of Low-Error 2-Query PCPs Using Decodable PCPs. Property Testing 2010: 280-288

Ilias Diakonikolas, Prahladh Harsha, Adam Klivans, Raghu Meka, Prasad Raghavendra, Rocco A. Servedio, Li-Yang Tan: Bounding the average sensitivity and noise sensitivity of polynomial threshold functions. STOC 2010: 533-542

Prahladh Harsha, Adam Klivans, Raghu Meka: An invariance principle for polytopes. STOC 2010: 543-552

Prahladh Harsha, Moses Charikar, Matthew Andrews, Sanjeev Arora, Subhash Khot, Dana Moshkovitz, Lisa Zhang, Ashkan Aazami, Dev Desai, Igor Gorodezky, Geetha Jagannathan, Alexander S. Kulikov, Darakhshan J. Mir, Alantha Newman, Aleksandar Nikolov, David Pritchard, Gwen Spencer: Limits of Approximation Algorithms: PCPs and Unique Games (DIMACS Tutorial Lecture Notes). CoRR abs/1002.3864 (2010)

Eli Ben-Sasson, Prahladh Harsha, Oded Lachish, Arie Matsliah: Sound 3-Query PCPPs Are Long. TOCT 1(2) (2009)

Irit Dinur, Prahladh Harsha: Composition of Low-Error 2-Query PCPs Using Decodable PCPs. FOCS 2009: 472-481

Prahladh Harsha, Adam Klivans, Raghu Meka: Bounding the Sensitivity of Polynomial Threshold Functions. CoRR abs/0909.5175 (2009)

Prahladh Harsha, Adam R. Klivans, Raghu Meka: An Invariance Principle for Polytopes. CoRR abs/0912.4884 (2009)

Irit Dinur, Prahladh Harsha: Composition of low-error 2-query PCPs using decodable PCPs. Electronic Colloquium on Computational Complexity (ECCC) 16: 42 (2009)

Prahladh Harsha, Adam Klivans, Raghu Meka: An Invariance Principle for Polytopes. Electronic Colloquium on Computational Complexity (ECCC) 16: 144 (2009)

Eli Ben-Sasson, Prahladh Harsha, Oded Lachish, Arie Matsliah: Sound 3-Query PCPPs Are Long. ICALP (1) 2008: 686-697

Prahladh Harsha, Thomas P. Hayes, Hariharan Narayanan, Harald Räcke, Jaikumar Radhakrishnan: Minimizing average latency in oblivious routing. SODA 2008: 200-207

Venkat Chandrasekaran, Nathan Srebro, Prahladh Harsha: Complexity of Inference in Graphical Models. UAI 2008: 70-78

Prahladh Harsha, Yuval Ishai, Joe Kilian, Kobbi Nissim, Srinivasan Venkatesh: Communication vs. Computation. Computational Complexity 16(1): 1-33 (2007)

Prahladh Harsha, Rahul Jain, David A. McAllester, Jaikumar Radhakrishnan: The Communication Complexity of Correlation. IEEE Conference on Computational Complexity 2007: 10-23

Arie Matsliah, Eli Ben-Sasson, Prahladh Harsha, Oded Lachish: Sound 3-query PCPPs are Long. Electronic Colloquium on Computational Complexity (ECCC) 14(127) (2007)

Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan: Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding. SIAM J. Comput. 36(4): 889-974 (2006)

Kamala Krithivasan, Prahladh Harsha, Muralidhar Talupur: Communicating Distributed H systems with Simple Splicing Rules. CDES 2006: 107-111

Prahladh Harsha, Rahul Jain, David A. McAllester, Jaikumar Radhakrishnan: The communication complexity of correlation. Electronic Colloquium on Computational Complexity (ECCC) 13(151) (2006)

Eli Ben-Sasson, Prahladh Harsha, Sofya Raskhodnikova: Some 3CNF Properties Are Hard to Test. SIAM J. Comput. 35(1): 1-21 (2005)

Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan: Short PCPs Verifiable in Polylogarithmic Time. IEEE Conference on Computational Complexity 2005: 120-134

Prahladh Harsha, Yuval Ishai, Joe Kilian, Kobbi Nissim, Srinivasan Venkatesh: Communication Versus Computation. ICALP 2004: 745-756

Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan: Robust pcps of proximity, shorter pcps and applications to coding. STOC 2004: 1-10

Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan: Robust PCPs of Proximity, Shorter PCPs and Applications to Coding. Electronic Colloquium on Computational Complexity (ECCC)(021) (2004)

Eli Ben-Sasson, Prahladh Harsha, Sofya Raskhodnikova: Some 3CNF properties are hard to test. STOC 2003: 345-354

Eli Ben-Sasson, Prahladh Harsha: Lower Bounds for Bounded-Depth Frege Proofs via Buss-Pudlack Games. Electronic Colloquium on Computational Complexity (ECCC) 10(004) (2003)

Eli Ben-Sasson, Prahladh Harsha, Sofya Raskhodnikova: 3CNF Properties are Hard to Test. Electronic Colloquium on Computational Complexity (ECCC) 10(006) (2003)

Prahladh Harsha, Madhu Sudan: Small PCPs with Low Query Complexity. STACS 2001: 327-338

Prahladh Harsha, Madhu Sudan: Small PCPs with low query complexity. Computational Complexity 9(3-4): 157-201 (2000)

Prahladh Harsha, Madhu Sudan: Small PCPs with low query complexity. Electronic Colloquium on Computational Complexity (ECCC) 7(61) (2000)

Kamala Krithivasan, M. Sakthi Balan, Prahladh Harsha: Distributed Processing in Automata. Int. J. Found. Comput. Sci. 10(4): 443-464 (1999)