Prahladh Harsha

160 papers A* 20A 14B 1Journal 110Unranked 11

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Agreement Tests on Graphs and Hypergraphs. SIAM J. Comput. Irit Dinur, Yuval Filmus, Prahladh Harsha
2025	J	`jnl`	Algorithmizing the Multiplicity Schwartz-Zippel Lemma. TheoretiCS Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Ashutosh Shankar
2025	J	`jnl`	An exposition of recent list-size bounds of FRS Codes. CoRR Abhibhav Garg, Prahladh Harsha, Mrinal Kumar, Ramprasad Saptharishi, Ashutosh Shankar
2025	J	`jnl`	An exposition of recent list-size bounds of FRS Codes. Electron. Colloquium Comput. Complex. Abhibhav Garg, Prahladh Harsha, Mrinal Kumar, Ramprasad Saptharishi, Ashutosh Shankar
2025	J	`jnl`	Deterministic list decoding of Reed-Solomon codes. CoRR Soham Chatterjee, Prahladh Harsha, Mrinal Kumar
2025	J	`jnl`	Deterministic list decoding of Reed-Solomon codes. Electron. Colloquium Comput. Complex. Soham Chatterjee, Prahladh Harsha, Mrinal Kumar
2025	J	`jnl`	Fast list recovery of univariate multiplicity and folded Reed-Solomon codes. CoRR Rohan Goyal, Prahladh Harsha, Mrinal Kumar, Ashutosh Shankar
2025	J	`jnl`	Fast list recovery of univariate multiplicity and folded Reed-Solomon codes. Electron. Colloquium Comput. Complex. Rohan Goyal, Prahladh Harsha, Mrinal Kumar, Ashutosh Shankar
2025	B	`conf`	Optimal Online Bipartite Matching in Degree-2 Graphs. ISAAC Amey Bhangale, Arghya Chakraborty, Prahladh Harsha
2025	J	`jnl`	Optimal Online Bipartite Matching in Degree-2 Graphs. CoRR Amey Bhangale, Arghya Chakraborty, Prahladh Harsha
2024	A*	`conf`	An Improved Line-Point Low-Degree Test. FOCS Prahladh Harsha, Mrinal Kumar, Ramprasad Saptharishi, Madhu Sudan
2024	J	`jnl`	Boolean Function Analysis on High-Dimensional Expanders. Comb. Yotam Dikstein, Irit Dinur, Yuval Filmus, Prahladh Harsha
2024	J	`jnl`	Decoding Multivariate Multiplicity Codes on Product Sets. IEEE Trans. Inf. Theory Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Madhu Sudan
2024	A*	`conf`	Dot-Product Proofs and Their Applications. FOCS Nir Bitansky, Prahladh Harsha, Yuval Ishai, Ron D. Rothblum, David J. Wu
2024	J	`jnl`	Dot-Product Proofs and Their Applications. Electron. Colloquium Comput. Complex. Nir Bitansky, Ron D. Rothblum, Prahladh Harsha, Yuval Ishai, David J. Wu
2024	J	`jnl`	Dot-Product Proofs and Their Applications. IACR Cryptol. ePrint Arch. Nir Bitansky, Prahladh Harsha, Yuval Ishai, Ron D. Rothblum, David J. Wu
2024	A*	`conf`	Fast List Decoding of Univariate Multiplicity and Folded Reed-Solomon Codes. FOCS Rohan Goyal, Prahladh Harsha, Mrinal Kumar, Ashutosh Shankar
2024	J	`jnl`	Ideal-Theoretic Explanation of Capacity-Achieving Decoding. IEEE Trans. Inf. Theory Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Madhu Sudan
2024	J	`jnl`	On the Elementary Construction of High-Dimensional Expanders by Kaufman and Oppenheim. Theory Comput. Prahladh Harsha, Ramprasad Saptharishi
2024	J	`jnl`	Rigid Matrices from Rectangular PCPs. SIAM J. Comput. Amey Bhangale, Prahladh Harsha, Orr Paradise, Avishay Tal
2024	J	`jnl`	Sparse juntas on the biased hypercube. TheoretiCS Irit Dinur, Yuval Filmus, Prahladh Harsha
2023	A*	`conf`	Algorithmizing the Multiplicity Schwartz-Zippel Lemma. SODA Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Ashutosh Shankar
2023	J	`jnl`	An Improved Line-Point Low-Degree Test. CoRR Prahladh Harsha, Mrinal Kumar, Ramprasad Saptharishi, Madhu Sudan
2023	J	`jnl`	An Improved Line-Point Low-Degree Test. Electron. Colloquium Comput. Complex. Prahladh Harsha, Mrinal Kumar, Ramprasad Saptharishi, Madhu Sudan
2023	A	`conf`	Criticality of AC⁰-Formulae. CCC Prahladh Harsha, Tulasimohan Molli, Ashutosh Shankar
2023	A	`conf`	Downward Self-Reducibility in TFNP. ITCS Prahladh Harsha, Daniel Mitropolsky, Alon Rosen
2023	A*	`conf`	Fast Numerical Multivariate Multipoint Evaluation. FOCS Sumanta Ghosh, Prahladh Harsha, Simao Herdade, Mrinal Kumar, Ramprasad Saptharishi
2023	J	`jnl`	Fast Numerical Multivariate Multipoint Evaluation. CoRR Sumanta Ghosh, Prahladh Harsha, Simão Herdade, Mrinal Kumar, Ramprasad Saptharishi
2023	J	`jnl`	Fast Numerical Multivariate Multipoint Evaluation. Electron. Colloquium Comput. Complex. Sumanta Ghosh, Prahladh Harsha, Simão Herdade, Mrinal Kumar, Ramprasad Saptharishi
2023	J	`jnl`	Fast list-decoding of univariate multiplicity and folded Reed-Solomon codes. CoRR Rohan Goyal, Prahladh Harsha, Mrinal Kumar, Ashutosh Shankar
2023	J	`jnl`	Fast list-decoding of univariate multiplicity and folded Reed-Solomon codes. Electron. Colloquium Comput. Complex. Rohan Goyal, Prahladh Harsha, Mrinal Kumar, Ashutosh Shankar
2022	J	`jnl`	Criticality of AC CoRR Prahladh Harsha, Tulasimohan Molli, Ashutosh Shankar
2022	J	`jnl`	Criticality of AC0-Formulae. Electron. Colloquium Comput. Complex. Prahladh Harsha, Tulasimohan Molli, Ashutosh Shankar
2022	J	`jnl`	Downward Self-Reducibility in TFNP. CoRR Prahladh Harsha, Daniel Mitropolsky, Alon Rosen
2022	J	`jnl`	Downward Self-Reducibility in TFNP. Electron. Colloquium Comput. Complex. Prahladh Harsha, Daniel Mitropolsky, Alon Rosen
2022	J	`jnl`	From Local to Robust Testing via Agreement Testing. Theory Comput. Irit Dinur, Prahladh Harsha, Tali Kaufman, Noga Ron-Zewi
2022	A	`conf`	Mixing of 3-Term Progressions in Quasirandom Groups. ITCS Amey Bhangale, Prahladh Harsha, Sourya Roy
2022	A	`conf`	Vanishing Spaces of Random Sets and Applications to Reed-Muller Codes. CCC Siddharth Bhandari, Prahladh Harsha, Ramprasad Saptharishi, Srikanth Srinivasan
2022	J	`jnl`	Vanishing Spaces of Random Sets and Applications to Reed-Muller Codes. CoRR Siddharth Bhandari, Prahladh Harsha, Ramprasad Saptharishi, Srikanth Srinivasan
2022	J	`jnl`	Vanishing Spaces of Random Sets and Applications to Reed-Muller Codes. Electron. Colloquium Comput. Complex. Siddharth Bhandari, Prahladh Harsha, Ramprasad Saptharishi, Srikanth Srinivasan
2021	J	`jnl`	Algorithmizing the Multiplicity Schwartz-Zippel Lemma. CoRR Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Ashutosh Shankar
2021	J	`jnl`	Algorithmizing the Multiplicity Schwartz-Zippel Lemma. Electron. Colloquium Comput. Complex. Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Ashutosh Shankar
2021	A*	`conf`	Decoding multivariate multiplicity codes on product sets. STOC Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Madhu Sudan
2021	A	`conf`	Explicit SoS Lower Bounds from High-Dimensional Expanders. ITCS Irit Dinur, Yuval Filmus, Prahladh Harsha, Madhur Tulsiani
2021	—	`conf`	Ideal-Theoretic Explanation of Capacity-Achieving Decoding. APPROX-RANDOM Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Madhu Sudan
2021	J	`jnl`	Ideal-theoretic Explanation of Capacity-achieving Decoding. CoRR Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Madhu Sudan
2021	J	`jnl`	Ideal-theoretic Explanation of Capacity-achieving Decoding. Electron. Colloquium Comput. Complex. Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Madhu Sudan
2021	J	`jnl`	List-Decoding with Double Samplers. SIAM J. Comput. Irit Dinur, Prahladh Harsha, Tali Kaufman, Inbal Livni Navon, Amnon Ta-Shma
2021	J	`jnl`	Mixing of 3-term progressions in Quasirandom Groups. CoRR Amey Bhangale, Prahladh Harsha, Sourya Roy
2021	J	`jnl`	Mixing of 3-term progressions in Quasirandom Groups. Electron. Colloquium Comput. Complex. Amey Bhangale, Prahladh Harsha, Sourya Roy
2021	J	`jnl`	On the probabilistic degree of OR over the reals. Random Struct. Algorithms Siddharth Bhandari, Prahladh Harsha, Tulasimohan Molli, Srikanth Srinivasan
2020	J	`jnl`	A Characterization of Hard-to-Cover CSPs. Theory Comput. Amey Bhangale, Prahladh Harsha, Girish Varma
2020	J	`jnl`	A note on the explicit constructions of tree codes over polylogarithmic-sized alphabet. CoRR Siddharth Bhandari, Prahladh Harsha
2020	J	`jnl`	A note on the explicit constructions of tree codes over polylogarithmic-sized alphabet. Electron. Colloquium Comput. Complex. Siddharth Bhandari, Prahladh Harsha
2020	J	`jnl`	COVID-19 Epidemic Study II: Phased Emergence From the Lockdown in Mumbai. CoRR Prahladh Harsha, Sandeep Juneja, Preetam Patil, Nihesh Rathod, Ramprasad Saptharishi, A. Y. Sarath, Sharad Shriram, Piyush Srivastava, Rajesh Sundaresan, Nidhin Koshy Vaidhiyan
2020	J	`jnl`	City-Scale Agent-Based Simulators for the Study of Non-Pharmaceutical Interventions in the Context of the COVID-19 Epidemic. CoRR Shubhada Agrawal, Siddharth Bhandari, Anirban Bhattacharjee, Anand Deo, Narendra M. Dixit, Prahladh Harsha, Sandeep Juneja, Poonam Kesarwani, Aditya Krishna Swamy, Preetam Patil, Nihesh Rathod, Ramprasad Saptharishi, Sharad Shriram, Piyush Srivastava, Rajesh Sundaresan, Nidhin Koshy Vaidhiyan, Sarath Yasodharan
2020	J	`jnl`	Decoding Multivariate Multiplicity Codes on Product Sets. CoRR Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Madhu Sudan
2020	J	`jnl`	Decoding Multivariate Multiplicity Codes on Product Sets. Electron. Colloquium Comput. Complex. Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Madhu Sudan
2020	J	`jnl`	Explicit SoS lower bounds from high-dimensional expanders. CoRR Irit Dinur, Yuval Filmus, Prahladh Harsha, Madhur Tulsiani
2020	J	`jnl`	Explicit and structured sum of squares lower bounds from high dimensional expanders. Electron. Colloquium Comput. Complex. Irit Dinur, Yuval Filmus, Prahladh Harsha, Madhur Tulsiani
2020	J	`jnl`	Locally testable codes via high-dimensional expanders. CoRR Yotam Dikstein, Irit Dinur, Prahladh Harsha, Noga Ron-Zewi
2020	J	`jnl`	Locally testable codes via high-dimensional expanders. Electron. Colloquium Comput. Complex. Yotam Dikstein, Irit Dinur, Prahladh Harsha, Noga Ron-Zewi
2020	—	`conf`	On Multilinear Forms: Bias, Correlation, and Tensor Rank. APPROX-RANDOM Abhishek Bhrushundi, Prahladh Harsha, Pooya Hatami, Swastik Kopparty, Mrinal Kumar
2020	A*	`conf`	Rigid Matrices From Rectangular PCPs or: Hard Claims Have Complex Proofs. FOCS Amey Bhangale, Prahladh Harsha, Orr Paradise, Avishay Tal
2020	J	`jnl`	Rigid Matrices From Rectangular PCPs. CoRR Amey Bhangale, Prahladh Harsha, Orr Paradise, Avishay Tal
2020	J	`jnl`	Rigid Matrices From Rectangular PCPs. Electron. Colloquium Comput. Complex. Amey Bhangale, Prahladh Harsha, Orr Paradise, Avishay Tal
2019	J	`jnl`	A note on the elementary HDX construction of Kaufman-Oppenheim. CoRR Prahladh Harsha, Ramprasad Saptharishi
2019	A*	`conf`	Analyzing Boolean functions on the biased hypercube via higher-dimensional agreement tests: [Extended abstract]. SODA Irit Dinur, Yuval Filmus, Prahladh Harsha
2019	A	`conf`	From Local to Robust Testing via Agreement Testing. ITCS Irit Dinur, Prahladh Harsha, Tali Kaufman, Noga Ron-Zewi
2019	—	`conf`	Improved 3LIN Hardness via Linear Label Cover. APPROX-RANDOM Prahladh Harsha, Subhash Khot, Euiwoong Lee, Devanathan Thiruvenkatachari
2019	J	`jnl`	Improved 3LIN Hardness via Linear Label Cover. Electron. Colloquium Comput. Complex. Prahladh Harsha, Subhash Khot, Euiwoong Lee, Devanathan Thiruvenkatachari
2019	A*	`conf`	List Decoding with Double Samplers. SODA Irit Dinur, Prahladh Harsha, Tali Kaufman, Inbal Livni Navon, Amnon Ta-Shma
2019	J	`jnl`	On polynomial approximations to AC. Random Struct. Algorithms Prahladh Harsha, Srikanth Srinivasan
2019	J	`jnl`	Robust Multiplication-Based Tests for Reed-Muller Codes. IEEE Trans. Inf. Theory Prahladh Harsha, Srikanth Srinivasan
2018	—	`conf`	Boolean Function Analysis on High-Dimensional Expanders. APPROX-RANDOM Yotam Dikstein, Irit Dinur, Yuval Filmus, Prahladh Harsha
2018	J	`jnl`	Boolean function analysis on high-dimensional expanders. Electron. Colloquium Comput. Complex. Irit Dinur, Yotam Dikstein, Yuval Filmus, Prahladh Harsha
2018	J	`jnl`	Boolean functions on high-dimensional expanders. CoRR Yotam Dikstein, Irit Dinur, Yuval Filmus, Prahladh Harsha
2018	J	`jnl`	List Decoding with Double Samplers. CoRR Irit Dinur, Prahladh Harsha, Tali Kaufman, Inbal Livni Navon, Amnon Ta-Shma
2018	J	`jnl`	List Decoding with Double Samplers. Electron. Colloquium Comput. Complex. Irit Dinur, Prahladh Harsha, Tali Kaufman, Inbal Livni Navon, Amnon Ta-Shma
2018	J	`jnl`	On Multilinear Forms: Bias, Correlation, and Tensor Rank. CoRR Abhishek Bhrushundi, Prahladh Harsha, Pooya Hatami, Swastik Kopparty, Mrinal Kumar
2018	J	`jnl`	On Multilinear Forms: Bias, Correlation, and Tensor Rank. Electron. Colloquium Comput. Complex. Abhishek Bhrushundi, Prahladh Harsha, Pooya Hatami, Swastik Kopparty, Mrinal Kumar
2018	—	`conf`	On the Probabilistic Degree of OR over the Reals. FSTTCS Siddharth Bhandari, Prahladh Harsha, Tulasimohan Molli, Srikanth Srinivasan
2018	J	`jnl`	On the Probabilistic Degree of OR over the Reals. CoRR Siddharth Bhandari, Prahladh Harsha, Tulasimohan Molli, Srikanth Srinivasan
2018	J	`jnl`	On the Probabilistic Degree of OR over the Reals. Electron. Colloquium Comput. Complex. Siddharth Bhandari, Prahladh Harsha, Tulasimohan Molli, Srikanth Srinivasan
2017	J	`jnl`	Agreement tests on graphs and hypergraphs. CoRR Irit Dinur, Yuval Filmus, Prahladh Harsha
2017	J	`jnl`	Agreement tests on graphs and hypergraphs. Electron. Colloquium Comput. Complex. Irit Dinur, Yuval Filmus, Prahladh Harsha
2017	J	`jnl`	Low degree almost Boolean functions are sparse juntas. CoRR Irit Dinur, Yuval Filmus, Prahladh Harsha
2017	J	`jnl`	Low degree almost Boolean functions are sparse juntas. Electron. Colloquium Comput. Complex. Irit Dinur, Yuval Filmus, Prahladh Harsha
2017	A	`conf`	Multiplayer Parallel Repetition for Expanding Games. ITCS Irit Dinur, Prahladh Harsha, Rakesh Venkat, Henry Yuen
2017	A	`conf`	On Polynomial Approximations Over Z/2^kZ*. STACS Abhishek Bhrushundi, Prahladh Harsha, Srikanth Srinivasan
2017	J	`jnl`	On polynomial approximations over Z/2 CoRR Abhishek Bhrushundi, Prahladh Harsha, Srikanth Srinivasan
2017	J	`jnl`	On polynomial approximations over ℤ/2 Electron. Colloquium Comput. Complex. Abhishek Bhrushundi, Prahladh Harsha, Srikanth Srinivasan
2017	J	`jnl`	Special Issue: CCC 2016: Guest Editor's Foreword. Theory Comput. Prahladh Harsha
2017	J	`jnl`	Super-Polylogarithmic Hypergraph Coloring Hardness via Low-Degree Long Codes. SIAM J. Comput. Venkatesan Guruswami, Prahladh Harsha, Johan Håstad, Srikanth Srinivasan, Girish Varma
2016	—	`conf`	Embedding Approximately Low-Dimensional l_2^2 Metrics into l_1. FSTTCS Amit Deshpande, Prahladh Harsha, Rakesh Venkat
2016	—	`ch.`	Locally Testable Codes. Encyclopedia of Algorithms Prahladh Harsha
2016	J	`jnl`	Multiplayer parallel repetition for expander games. CoRR Irit Dinur, Prahladh Harsha, Rakesh Venkat, Henry Yuen
2016	J	`jnl`	Multiplayer parallel repetition for expander games. Electron. Colloquium Comput. Complex. Irit Dinur, Prahladh Harsha, Rakesh Venkat, Henry Yuen
2016	J	`jnl`	On Polynomial Approximations to ${AC}^0$. CoRR Prahladh Harsha, Srikanth Srinivasan
2016	—	`conf`	On Polynomial Approximations to AC^0. APPROX-RANDOM Prahladh Harsha, Srikanth Srinivasan
2016	A*	`conf`	Partition Bound Is Quadratically Tight for Product Distributions. ICALP Prahladh Harsha, Rahul Jain, Jaikumar Radhakrishnan
2016	—	`conf`	Robust Multiplication-Based Tests for Reed-Muller Codes. FSTTCS Prahladh Harsha, Srikanth Srinivasan
2016	J	`jnl`	Robust Multiplication-based Tests for Reed-Muller Codes. CoRR Prahladh Harsha, Srikanth Srinivasan
2016	J	`jnl`	Robust Multiplication-based Tests for Reed-Muller Codes. Electron. Colloquium Comput. Complex. Prahladh Harsha, Srikanth Srinivasan
2015	—	`ed.`	35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, FSTTCS 2015, Bangalore, India, December 16-18, 2015 FSTTCS Prahladh Harsha, G. Ramalingam
2015	A	`conf`	A Characterization of Hard-to-cover CSPs. CCC Amey Bhangale, Prahladh Harsha, Girish Varma
2015	A	`conf`	Derandomized Graph Product Results Using the Low Degree Long Code. STACS Irit Dinur, Prahladh Harsha, Srikanth Srinivasan, Girish Varma
2015	J	`jnl`	Embedding approximately low-dimensional ℓ CoRR Amit Deshpande, Prahladh Harsha, Rakesh Venkat
2015	A*	`conf`	Polynomially Low Error PCPs with polyloglog n Queries via Modular Composition. STOC Irit Dinur, Prahladh Harsha, Guy Kindler
2015	J	`jnl`	Polynomially Low Error PCPs with polyloglog n Queries via Modular Composition. CoRR Irit Dinur, Prahladh Harsha, Guy Kindler
2015	J	`jnl`	Polynomially Low Error PCPs with polyloglogn Queries via Modular Composition. Electron. Colloquium Comput. Complex. Irit Dinur, Prahladh Harsha, Guy Kindler
2015	J	`jnl`	Relaxed partition bound is quadratically tight for product distributions. CoRR Prahladh Harsha, Rahul Jain, Jaikumar Radhakrishnan
2015	J	`jnl`	Relaxed partition bound is quadratically tight for product distributions. Electron. Colloquium Comput. Complex. Prahladh Harsha, Rahul Jain, Jaikumar Radhakrishnan
2014	J	`jnl`	A Characterization of hard-to-cover CSPs. CoRR Amey Bhangale, Prahladh Harsha, Girish Varma
2014	J	`jnl`	Bounding the Sensitivity of Polynomial Threshold Functions. Theory Comput. Prahladh Harsha, Adam R. Klivans, Raghu Meka
2014	J	`jnl`	Derandomized Graph Product Results using the Low Degree Long Code. CoRR Irit Dinur, Prahladh Harsha, Srikanth Srinivasan, Girish Varma
2014	A*	`conf`	Super-polylogarithmic hypergraph coloring hardness via low-degree long codes. STOC Venkatesan Guruswami, Prahladh Harsha, Johan Håstad, Srikanth Srinivasan, Girish Varma
2013	—	`conf`	A Strong Direct Product Theorem for the Tribes Function via the Smooth-Rectangle Bound. FSTTCS Prahladh Harsha, Rahul Jain
2013	J	`jnl`	A strong direct product theorem for the tribes function via the smooth-rectangle bound CoRR Prahladh Harsha, Rahul Jain
2013	J	`jnl`	Composition of Low-Error 2-Query PCPs Using Decodable PCPs. SIAM J. Comput. Irit Dinur, Prahladh Harsha
2013	J	`jnl`	Super-polylogarithmic hypergraph coloring hardness via low-degree long codes. CoRR Venkatesan Guruswami, Johan Håstad, Prahladh Harsha, Srikanth Srinivasan, Girish Varma
2013	J	`jnl`	Super-polylogarithmic hypergraph coloring hardness via low-degree long codes. Electron. Colloquium Comput. Complex. Venkatesan Guruswami, Prahladh Harsha, Johan Håstad, Srikanth Srinivasan, Girish Varma
2012	J	`jnl`	An invariance principle for polytopes. J. ACM Prahladh Harsha, Adam R. Klivans, Raghu Meka
2012	J	`jnl`	Complexity of Inference in Graphical Models CoRR Venkat Chandrasekaran, Nathan Srebro, Prahladh Harsha
2011	J	`jnl`	Almost Settling the Hardness of Noncommutative Determinant CoRR Steve Chien, Prahladh Harsha, Alistair Sinclair, Srikanth Srinivasan
2011	A*	`conf`	Almost settling the hardness of noncommutative determinant. STOC Steve Chien, Prahladh Harsha, Alistair Sinclair, Srikanth Srinivasan
2010	A*	`conf`	An invariance principle for polytopes. STOC Prahladh Harsha, Adam R. Klivans, Raghu Meka
2010	A*	`conf`	Bounding the average sensitivity and noise sensitivity of polynomial threshold functions. STOC Ilias Diakonikolas, Prahladh Harsha, Adam R. Klivans, Raghu Meka, Prasad Raghavendra, Rocco A. Servedio, Li-Yang Tan
2010	—	`ch.`	Composition of Low-Error 2-Query PCPs Using Decodable PCPs. Property Testing Irit Dinur, Prahladh Harsha
2010	J	`jnl`	Limits of Approximation Algorithms: PCPs and Unique Games (DIMACS Tutorial Lecture Notes) CoRR 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
2010	J	`jnl`	Lower bounds for bounded depth Frege proofs via Pudlák-Buss games. ACM Trans. Comput. Log. Eli Ben-Sasson, Prahladh Harsha
2010	J	`jnl`	The communication complexity of correlation. IEEE Trans. Inf. Theory Prahladh Harsha, Rahul Jain, David A. McAllester, Jaikumar Radhakrishnan
2009	J	`jnl`	An Invariance Principle for Polytopes CoRR Prahladh Harsha, Adam R. Klivans, Raghu Meka
2009	J	`jnl`	An Invariance Principle for Polytopes. Electron. Colloquium Comput. Complex. Prahladh Harsha, Adam R. Klivans, Raghu Meka
2009	J	`jnl`	Bounding the Sensitivity of Polynomial Threshold Functions CoRR Prahladh Harsha, Adam R. Klivans, Raghu Meka
2009	A*	`conf`	Composition of Low-Error 2-Query PCPs Using Decodable PCPs. FOCS Irit Dinur, Prahladh Harsha
2009	J	`jnl`	Composition of low-error 2-query PCPs using decodable PCPs. Electron. Colloquium Comput. Complex. Irit Dinur, Prahladh Harsha
2009	J	`jnl`	Sound 3-Query PCPPs Are Long. ACM Trans. Comput. Theory Eli Ben-Sasson, Prahladh Harsha, Oded Lachish, Arie Matsliah
2008	A	`conf`	Complexity of Inference in Graphical Models. UAI Venkat Chandrasekaran, Nathan Srebro, Prahladh Harsha
2008	A*	`conf`	Minimizing average latency in oblivious routing. SODA Prahladh Harsha, Thomas P. Hayes, Hariharan Narayanan, Harald Räcke, Jaikumar Radhakrishnan
2008	—	`conf`	Sound 3-Query PCPPs Are Long. ICALP (1) Eli Ben-Sasson, Prahladh Harsha, Oded Lachish, Arie Matsliah
2007	J	`jnl`	Communication vs. Computation. Comput. Complex. Prahladh Harsha, Yuval Ishai, Joe Kilian, Kobbi Nissim, Srinivasan Venkatesh
2007	J	`jnl`	Sound 3-query PCPPs are Long. Electron. Colloquium Comput. Complex. Arie Matsliah, Eli Ben-Sasson, Prahladh Harsha, Oded Lachish
2007	A	`conf`	The Communication Complexity of Correlation. CCC Prahladh Harsha, Rahul Jain, David A. McAllester, Jaikumar Radhakrishnan
2006	—	`conf`	Communicating Distributed H systems with Simple Splicing Rules. CDES Kamala Krithivasan, Prahladh Harsha, Muralidhar Talupur
2006	J	`jnl`	Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding. SIAM J. Comput. Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan
2006	J	`jnl`	The communication complexity of correlation. Electron. Colloquium Comput. Complex. Prahladh Harsha, Rahul Jain, David A. McAllester, Jaikumar Radhakrishnan
2005	A	`conf`	Short PCPs Verifiable in Polylogarithmic Time. CCC Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan
2005	J	`jnl`	Some 3CNF Properties Are Hard to Test. SIAM J. Comput. Eli Ben-Sasson, Prahladh Harsha, Sofya Raskhodnikova
2004	A*	`conf`	Communication Versus Computation. ICALP Prahladh Harsha, Yuval Ishai, Joe Kilian, Kobbi Nissim, Srinivasan Venkatesh
2004	J	`jnl`	Robust PCPs of Proximity, Shorter PCPs and Applications to Coding Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan
2004	—	`—`	Robust Probabilistically Checkable Proofs of proximity and shorter Robust Probabilistically Checkable Proofs. Prahladh Harsha
2004	A*	`conf`	Robust pcps of proximity, shorter pcps and applications to coding. STOC Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan
2003	J	`jnl`	3CNF Properties are Hard to Test Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Prahladh Harsha, Sofya Raskhodnikova
2003	J	`jnl`	Lower Bounds for Bounded-Depth Frege Proofs via Buss-Pudlack Games Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Prahladh Harsha
2003	A*	`conf`	Some 3CNF properties are hard to test. STOC Eli Ben-Sasson, Prahladh Harsha, Sofya Raskhodnikova
2001	A	`conf`	Small PCPs with Low Query Complexity. STACS Prahladh Harsha, Madhu Sudan
2000	J	`jnl`	Small PCPs with low query complexity Electron. Colloquium Comput. Complex. Prahladh Harsha, Madhu Sudan
2000	J	`jnl`	Small PCPs with low query complexity. Comput. Complex. Prahladh Harsha, Madhu Sudan
1999	J	`jnl`	Distributed Processing in Automata. Int. J. Found. Comput. Sci. Kamala Krithivasan, M. Sakthi Balan, Prahladh Harsha