default search action
Prahladh Harsha
Person information
- affiliation: Tata Institute of Fundamental Research, Mumbai, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j24]Yotam Dikstein, Irit Dinur
, Yuval Filmus, Prahladh Harsha:
Boolean Function Analysis on High-Dimensional Expanders. Comb. 44(3): 563-620 (2024) - [j23]Amey Bhangale, Prahladh Harsha, Orr Paradise, Avishay Tal:
Rigid Matrices from Rectangular PCPs. SIAM J. Comput. 53(2): 480-523 (2024) - [j22]Irit Dinur
Sparse juntas on the biased hypercube. TheoretiCS 3 (2024) - [j21]Siddharth Bhandari
Decoding Multivariate Multiplicity Codes on Product Sets. IEEE Trans. Inf. Theory 70(1): 154-169 (2024) - [j20]Siddharth Bhandari
Ideal-Theoretic Explanation of Capacity-Achieving Decoding. IEEE Trans. Inf. Theory 70(2): 1107-1123 (2024) - [i76]Nir Bitansky, Ron D. Rothblum, Prahladh Harsha, Yuval Ishai, David J. Wu:
Dot-Product Proofs and Their Applications. Electron. Colloquium Comput. Complex. TR24 (2024) - [i75]Nir Bitansky, Prahladh Harsha, Yuval Ishai, Ron D. Rothblum, David J. Wu:
Dot-Product Proofs and Their Applications. IACR Cryptol. ePrint Arch. 2024: 1138 (2024) - 2023
- [c42]Prahladh Harsha, Tulasimohan Molli
Criticality of AC⁰-Formulae. CCC 2023: 19:1-19:24 - [c41]Sumanta Ghosh, Prahladh Harsha, Simao Herdade, Mrinal Kumar, Ramprasad Saptharishi:
Fast Numerical Multivariate Multipoint Evaluation. FOCS 2023: 1426-1439 - [c40]Prahladh Harsha
Downward Self-Reducibility in TFNP. ITCS 2023: 67:1-67:17 - [c39]Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Ashutosh Shankar:
Algorithmizing the Multiplicity Schwartz-Zippel Lemma. SODA 2023: 2816-2835 - [i74]Sumanta Ghosh, Prahladh Harsha, Simão Herdade, Mrinal Kumar, Ramprasad Saptharishi:
Fast Numerical Multivariate Multipoint Evaluation. CoRR abs/2304.01191 (2023) - [i73]Prahladh Harsha, Mrinal Kumar, Ramprasad Saptharishi, Madhu Sudan:
An Improved Line-Point Low-Degree Test. CoRR abs/2311.12752 (2023) - [i72]Rohan Goyal, Prahladh Harsha, Mrinal Kumar, Ashutosh Shankar:
Fast list-decoding of univariate multiplicity and folded Reed-Solomon codes. CoRR abs/2311.17841 (2023) - [i71]Sumanta Ghosh, Prahladh Harsha, Simão Herdade, Mrinal Kumar, Ramprasad Saptharishi:
Fast Numerical Multivariate Multipoint Evaluation. Electron. Colloquium Comput. Complex. TR23 (2023) - [i70]Rohan Goyal, Prahladh Harsha, Mrinal Kumar, Ashutosh Shankar:
Fast list-decoding of univariate multiplicity and folded Reed-Solomon codes. Electron. Colloquium Comput. Complex. TR23 (2023) - [i69]Prahladh Harsha, Mrinal Kumar, Ramprasad Saptharishi, Madhu Sudan:
An Improved Line-Point Low-Degree Test. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [j19]Irit Dinur, Prahladh Harsha, Tali Kaufman, Noga Ron-Zewi:
From Local to Robust Testing via Agreement Testing. Theory Comput. 18: 1-25 (2022) - [c38]Siddharth Bhandari, Prahladh Harsha, Ramprasad Saptharishi, Srikanth Srinivasan
Vanishing Spaces of Random Sets and Applications to Reed-Muller Codes. CCC 2022: 31:1-31:14 - [c37]Amey Bhangale, Prahladh Harsha, Sourya Roy
Mixing of 3-Term Progressions in Quasirandom Groups. ITCS 2022: 20:1-20:9 - [i68]Siddharth Bhandari, Prahladh Harsha, Ramprasad Saptharishi, Srikanth Srinivasan:
Vanishing Spaces of Random Sets and Applications to Reed-Muller Codes. CoRR abs/2205.10749 (2022) - [i67]Prahladh Harsha, Daniel Mitropolsky, Alon Rosen:
Downward Self-Reducibility in TFNP. CoRR abs/2209.10509 (2022) - [i66]Prahladh Harsha, Tulasimohan Molli, Ashutosh Shankar:
Criticality of AC0 formulae. CoRR abs/2212.08397 (2022) - [i65]Siddharth Bhandari, Prahladh Harsha, Ramprasad Saptharishi, Srikanth Srinivasan:
Vanishing Spaces of Random Sets and Applications to Reed-Muller Codes. Electron. Colloquium Comput. Complex. TR22 (2022) - [i64]Prahladh Harsha, Daniel Mitropolsky, Alon Rosen:
Downward Self-Reducibility in TFNP. Electron. Colloquium Comput. Complex. TR22 (2022) - [i63]Prahladh Harsha, Tulasimohan Molli, Ashutosh Shankar:
Criticality of AC0-Formulae. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [j18]Siddharth Bhandari, Prahladh Harsha, Tulasimohan Molli
On the probabilistic degree of OR over the reals. Random Struct. Algorithms 59(1): 53-67 (2021) - [j17]Irit Dinur
List-Decoding with Double Samplers. SIAM J. Comput. 50(2): 301-349 (2021) - [c36]Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Madhu Sudan:
Ideal-Theoretic Explanation of Capacity-Achieving Decoding. APPROX-RANDOM 2021: 56:1-56:21 - [c35]Irit Dinur
Explicit SoS Lower Bounds from High-Dimensional Expanders. ITCS 2021: 38:1-38:16 - [c34]Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Madhu Sudan:
Decoding multivariate multiplicity codes on product sets. STOC 2021: 1489-1501 - [i62]Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Madhu Sudan:
Ideal-theoretic Explanation of Capacity-achieving Decoding. CoRR abs/2103.07930 (2021) - [i61]Amey Bhangale, Prahladh Harsha, Sourya Roy:
Mixing of 3-term progressions in Quasirandom Groups. CoRR abs/2109.12627 (2021) - [i60]Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Ashutosh Shankar:
Algorithmizing the Multiplicity Schwartz-Zippel Lemma. CoRR abs/2111.11072 (2021) - [i59]Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Madhu Sudan:
Ideal-theoretic Explanation of Capacity-achieving Decoding. Electron. Colloquium Comput. Complex. TR21 (2021) - [i58]Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Ashutosh Shankar:
Algorithmizing the Multiplicity Schwartz-Zippel Lemma. Electron. Colloquium Comput. Complex. TR21 (2021) - [i57]Amey Bhangale, Prahladh Harsha, Sourya Roy:
Mixing of 3-term progressions in Quasirandom Groups. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [j16]Amey Bhangale, Prahladh Harsha, Girish Varma:
A Characterization of Hard-to-Cover CSPs. Theory Comput. 16: 1-30 (2020) - [c33]Abhishek Bhrushundi, Prahladh Harsha, Pooya Hatami, Swastik Kopparty, Mrinal Kumar:
On Multilinear Forms: Bias, Correlation, and Tensor Rank. APPROX-RANDOM 2020: 29:1-29:23 - [c32]Amey Bhangale, Prahladh Harsha, Orr Paradise, Avishay Tal:
Rigid Matrices From Rectangular PCPs or: Hard Claims Have Complex Proofs. FOCS 2020: 858-869 - [i56]Siddharth Bhandari, Prahladh Harsha:
A note on the explicit constructions of tree codes over polylogarithmic-sized alphabet. CoRR abs/2002.08231 (2020) - [i55]Yotam Dikstein, Irit Dinur, Prahladh Harsha, Noga Ron-Zewi:
Locally testable codes via high-dimensional expanders. CoRR abs/2005.01045 (2020) - [i54]Amey Bhangale, Prahladh Harsha, Orr Paradise, Avishay Tal:
Rigid Matrices From Rectangular PCPs. CoRR abs/2005.03123 (2020) - [i53]Prahladh Harsha, Sandeep Juneja, Preetam Patil, Nihesh Rathod, Ramprasad Saptharishi, A. Y. Sarath, Sharad Sriram
COVID-19 Epidemic Study II: Phased Emergence From the Lockdown in Mumbai. CoRR abs/2006.03375 (2020) - [i52]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
City-Scale Agent-Based Simulators for the Study of Non-Pharmaceutical Interventions in the Context of the COVID-19 Epidemic. CoRR abs/2008.04849 (2020) - [i51]Irit Dinur, Yuval Filmus, Prahladh Harsha, Madhur Tulsiani:
Explicit SoS lower bounds from high-dimensional expanders. CoRR abs/2009.05218 (2020) - [i50]Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Madhu Sudan:
Decoding Multivariate Multiplicity Codes on Product Sets. CoRR abs/2012.01530 (2020) - [i49]Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Madhu Sudan:
Decoding Multivariate Multiplicity Codes on Product Sets. Electron. Colloquium Comput. Complex. TR20 (2020) - [i48]Siddharth Bhandari, Prahladh Harsha:
A note on the explicit constructions of tree codes over polylogarithmic-sized alphabet. Electron. Colloquium Comput. Complex. TR20 (2020) - [i47]Amey Bhangale, Prahladh Harsha, Orr Paradise, Avishay Tal:
Rigid Matrices From Rectangular PCPs. Electron. Colloquium Comput. Complex. TR20 (2020) - [i46]Yotam Dikstein, Irit Dinur, Prahladh Harsha, Noga Ron-Zewi:
Locally testable codes via high-dimensional expanders. Electron. Colloquium Comput. Complex. TR20 (2020) - [i45]Irit Dinur, Yuval Filmus, Prahladh Harsha, Madhur Tulsiani:
Explicit and structured sum of squares lower bounds from high dimensional expanders. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [j15]Prahladh Harsha
On polynomial approximations to AC. Random Struct. Algorithms 54(2): 289-303 (2019) - [j14]Prahladh Harsha
Robust Multiplication-Based Tests for Reed-Muller Codes. IEEE Trans. Inf. Theory 65(1): 184-197 (2019) - [c31]Prahladh Harsha
Improved 3LIN Hardness via Linear Label Cover. APPROX-RANDOM 2019: 9:1-9:16 - [c30]Irit Dinur
From Local to Robust Testing via Agreement Testing. ITCS 2019: 29:1-29:18 - [c29]Irit Dinur
Analyzing Boolean functions on the biased hypercube via higher-dimensional agreement tests: [Extended abstract]. SODA 2019: 2124-2133 - [c28]Irit Dinur
List Decoding with Double Samplers. SODA 2019: 2134-2153 - [i44]Prahladh Harsha, Ramprasad Saptharishi:
A note on the elementary HDX construction of Kaufman-Oppenheim. CoRR abs/1912.11225 (2019) - [i43]Prahladh Harsha, Subhash Khot, Euiwoong Lee, Devanathan Thiruvenkatachari:
Improved 3LIN Hardness via Linear Label Cover. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [c27]Yotam Dikstein, Irit Dinur
Boolean Function Analysis on High-Dimensional Expanders. APPROX-RANDOM 2018: 38:1-38:20 - [c26]Siddharth Bhandari, Prahladh Harsha, Tulasimohan Molli
On the Probabilistic Degree of OR over the Reals. FSTTCS 2018: 5:1-5:12 - [i42]Yotam Dikstein, Irit Dinur, Yuval Filmus, Prahladh Harsha:
Boolean functions on high-dimensional expanders. CoRR abs/1804.08155 (2018) - [i41]Abhishek Bhrushundi, Prahladh Harsha, Pooya Hatami, Swastik Kopparty, Mrinal Kumar:
On Multilinear Forms: Bias, Correlation, and Tensor Rank. CoRR abs/1804.09124 (2018) - [i40]Irit Dinur, Prahladh Harsha, Tali Kaufman, Inbal Livni Navon, Amnon Ta-Shma:
List Decoding with Double Samplers. CoRR abs/1808.00425 (2018) - [i39]Siddharth Bhandari, Prahladh Harsha, Tulasimohan Molli, Srikanth Srinivasan:
On the Probabilistic Degree of OR over the Reals. CoRR abs/1812.01982 (2018) - [i38]Siddharth Bhandari, Prahladh Harsha, Tulasimohan Molli, Srikanth Srinivasan:
On the Probabilistic Degree of OR over the Reals. Electron. Colloquium Comput. Complex. TR18 (2018) - [i37]Abhishek Bhrushundi, Prahladh Harsha, Pooya Hatami, Swastik Kopparty, Mrinal Kumar:
On Multilinear Forms: Bias, Correlation, and Tensor Rank. Electron. Colloquium Comput. Complex. TR18 (2018) - [i36]Irit Dinur, Yotam Dikstein, Yuval Filmus, Prahladh Harsha:
Boolean function analysis on high-dimensional expanders. Electron. Colloquium Comput. Complex. TR18 (2018) - [i35]Irit Dinur, Prahladh Harsha, Tali Kaufman, Inbal Livni Navon, Amnon Ta-Shma:
List Decoding with Double Samplers. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [j13]Venkatesan Guruswami, Prahladh Harsha
Super-Polylogarithmic Hypergraph Coloring Hardness via Low-Degree Long Codes. SIAM J. Comput. 46(1): 132-159 (2017) - [j12]Prahladh Harsha
Special Issue: CCC 2016: Guest Editor's Foreword. Theory Comput. 13(1): 1-3 (2017) - [c25]Irit Dinur, Prahladh Harsha
Multiplayer Parallel Repetition for Expanding Games. ITCS 2017: 37:1-37:16 - [c24]Abhishek Bhrushundi, Prahladh Harsha
On Polynomial Approximations Over Z/2^kZ*. STACS 2017: 12:1-12:12 - [i34]Abhishek Bhrushundi, Prahladh Harsha, Srikanth Srinivasan:
On polynomial approximations over Z/2kZ. CoRR abs/1701.06268 (2017) - [i33]Irit Dinur, Yuval Filmus, Prahladh Harsha:
Agreement tests on graphs and hypergraphs. CoRR abs/1711.09426 (2017) - [i32]Irit Dinur, Yuval Filmus, Prahladh Harsha:
Low degree almost Boolean functions are sparse juntas. CoRR abs/1711.09428 (2017) - [i31]Abhishek Bhrushundi, Prahladh Harsha, Srikanth Srinivasan:
On polynomial approximations over ℤ/2kℤ. Electron. Colloquium Comput. Complex. TR17 (2017) - [i30]Irit Dinur, Yuval Filmus, Prahladh Harsha:
Low degree almost Boolean functions are sparse juntas. Electron. Colloquium Comput. Complex. TR17 (2017) - [i29]Irit Dinur, Yuval Filmus, Prahladh Harsha:
Agreement tests on graphs and hypergraphs. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [c23]Prahladh Harsha
On Polynomial Approximations to AC^0. APPROX-RANDOM 2016: 32:1-32:14 - [c22]Amit Deshpande, Prahladh Harsha
Embedding Approximately Low-Dimensional l_2^2 Metrics into l_1. FSTTCS 2016: 10:1-10:13 - [c21]Prahladh Harsha
Robust Multiplication-Based Tests for Reed-Muller Codes. FSTTCS 2016: 17:1-17:14 - [c20]Prahladh Harsha
Partition Bound Is Quadratically Tight for Product Distributions. ICALP 2016: 135:1-135:13 - [r1]Prahladh Harsha
Locally Testable Codes. Encyclopedia of Algorithms 2016: 1152-1156 - [i28]Prahladh Harsha, Srikanth Srinivasan:
On Polynomial Approximations to ${AC}^0$. CoRR abs/1604.08121 (2016) - [i27]Irit Dinur, Prahladh Harsha, Rakesh Venkat, Henry Yuen:
Multiplayer parallel repetition for expander games. CoRR abs/1610.08349 (2016) - [i26]Prahladh Harsha, Srikanth Srinivasan:
Robust Multiplication-based Tests for Reed-Muller Codes. CoRR abs/1612.03086 (2016) - [i25]Irit Dinur, Prahladh Harsha, Rakesh Venkat, Henry Yuen:
Multiplayer parallel repetition for expander games. Electron. Colloquium Comput. Complex. TR16 (2016) - [i24]Prahladh Harsha, Srikanth Srinivasan:
Robust Multiplication-based Tests for Reed-Muller Codes. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [c19]Amey Bhangale, Prahladh Harsha
A Characterization of Hard-to-cover CSPs. CCC 2015: 280-303 - [c18]Irit Dinur
Derandomized Graph Product Results Using the Low Degree Long Code. STACS 2015: 275-287 - [c17]Irit Dinur
Polynomially Low Error PCPs with polyloglog n Queries via Modular Composition. STOC 2015: 267-276 - [e1]Prahladh Harsha, G. Ramalingam:
35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, FSTTCS 2015, December 16-18, 2015, Bangalore, India. LIPIcs 45, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2015, ISBN 978-3-939897-97-2 [contents] - [i23]Irit Dinur, Prahladh Harsha, Guy Kindler:
Polynomially Low Error PCPs with polyloglog n Queries via Modular Composition. CoRR abs/1505.06362 (2015) - [i22]Prahladh Harsha, Rahul Jain, Jaikumar Radhakrishnan:
Relaxed partition bound is quadratically tight for product distributions. CoRR abs/1512.01968 (2015) - [i21]Amit Deshpande, Prahladh Harsha, Rakesh Venkat:
Embedding approximately low-dimensional ℓ22 metrics into ℓ1. CoRR abs/1512.04170 (2015) - [i20]Irit Dinur, Prahladh Harsha, Guy Kindler:
Polynomially Low Error PCPs with polyloglogn Queries via Modular Composition. Electron. Colloquium Comput. Complex. TR15 (2015) - [i19]Prahladh Harsha, Rahul Jain, Jaikumar Radhakrishnan:
Relaxed partition bound is quadratically tight for product distributions. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [j11]Prahladh Harsha
Bounding the Sensitivity of Polynomial Threshold Functions. Theory Comput. 10: 1-26 (2014) - [c16]Venkatesan Guruswami, Prahladh Harsha
Super-polylogarithmic hypergraph coloring hardness via low-degree long codes. STOC 2014: 614-623 - [i18]Irit Dinur, Prahladh Harsha, Srikanth Srinivasan, Girish Varma:
Derandomized Graph Product Results using the Low Degree Long Code. CoRR abs/1411.3517 (2014) - [i17]Amey Bhangale, Prahladh Harsha, Girish Varma:
A Characterization of hard-to-cover CSPs. CoRR abs/1411.7747 (2014) - 2013
- [j10]Irit Dinur
Composition of Low-Error 2-Query PCPs Using Decodable PCPs. SIAM J. Comput. 42(6): 2452-2486 (2013) - [c15]Prahladh Harsha
A Strong Direct Product Theorem for the Tribes Function via the Smooth-Rectangle Bound. FSTTCS 2013: 141-152 - [i16]Prahladh Harsha, Rahul Jain:
A strong direct product theorem for the tribes function via the smooth-rectangle bound. CoRR abs/1302.0275 (2013) - [i15]Venkatesan Guruswami, Johan Håstad, Prahladh Harsha, Srikanth Srinivasan, Girish Varma:
Super-polylogarithmic hypergraph coloring hardness via low-degree long codes. CoRR abs/1311.7407 (2013) - [i14]Venkatesan Guruswami, Prahladh Harsha, Johan Håstad, Srikanth Srinivasan, Girish Varma:
Super-polylogarithmic hypergraph coloring hardness via low-degree long codes. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [j9]Prahladh Harsha
An invariance principle for polytopes. J. ACM 59(6): 29:1-29:25 (2012) - [i13]Venkat Chandrasekaran, Nathan Srebro, Prahladh Harsha:
Complexity of Inference in Graphical Models. CoRR abs/1206.3240 (2012) - 2011
- [c14]Steve Chien, Prahladh Harsha
Almost settling the hardness of noncommutative determinant. STOC 2011: 499-508 - [i12]Steve Chien, Prahladh Harsha, Alistair Sinclair, Srikanth Srinivasan:
Almost Settling the Hardness of Noncommutative Determinant. CoRR abs/1101.1169 (2011) - 2010
- [j8]Prahladh Harsha
The communication complexity of correlation. IEEE Trans. Inf. Theory 56(1): 438-449 (2010) - [j7]Eli Ben-Sasson, Prahladh Harsha
Lower bounds for bounded depth Frege proofs via Pudlák-Buss games. ACM Trans. Comput. Log. 11(3): 19:1-19:17 (2010) - [c13]Ilias Diakonikolas, Prahladh Harsha
Bounding the average sensitivity and noise sensitivity of polynomial threshold functions. STOC 2010: 533-542 - [c12]Prahladh Harsha
An invariance principle for polytopes. STOC 2010: 543-552 - [p1]Irit Dinur
Composition of Low-Error 2-Query PCPs Using Decodable PCPs. Property Testing 2010: 280-288 - [i11]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)
2000 – 2009
- 2009
- [j6]Eli Ben-Sasson, Prahladh Harsha
Sound 3-Query PCPPs Are Long. ACM Trans. Comput. Theory 1(2): 7:1-7:49 (2009) - [c11]Irit Dinur
Composition of Low-Error 2-Query PCPs Using Decodable PCPs. FOCS 2009: 472-481 - [i10]Prahladh Harsha, Adam R. Klivans, Raghu Meka:
Bounding the Sensitivity of Polynomial Threshold Functions. CoRR abs/0909.5175 (2009) - [i9]Prahladh Harsha, Adam R. Klivans, Raghu Meka:
An Invariance Principle for Polytopes. CoRR abs/0912.4884 (2009) - [i8]Irit Dinur, Prahladh Harsha:
Composition of low-error 2-query PCPs using decodable PCPs. Electron. Colloquium Comput. Complex. TR09 (2009) - [i7]Prahladh Harsha, Adam R. Klivans, Raghu Meka:
An Invariance Principle for Polytopes. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [c10]Eli Ben-Sasson, Prahladh Harsha
Sound 3-Query PCPPs Are Long. ICALP (1) 2008: 686-697 - [c9]Prahladh Harsha, Thomas P. Hayes, Hariharan Narayanan, Harald Räcke, Jaikumar Radhakrishnan:
Minimizing average latency in oblivious routing. SODA 2008: 200-207 - [c8]Venkat Chandrasekaran, Nathan Srebro, Prahladh Harsha:
Complexity of Inference in Graphical Models. UAI 2008: 70-78 - 2007
- [j5]Prahladh Harsha
Communication vs. Computation. Comput. Complex. 16(1): 1-33 (2007) - [c7]Prahladh Harsha
The Communication Complexity of Correlation. CCC 2007: 10-23 - [i6]Arie Matsliah, Eli Ben-Sasson, Prahladh Harsha, Oded Lachish:
Sound 3-query PCPPs are Long. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [j4]Eli Ben-Sasson, Oded Goldreich
Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding. SIAM J. Comput. 36(4): 889-974 (2006) - [c6]Kamala Krithivasan, Prahladh Harsha, Muralidhar Talupur:
Communicating Distributed H systems with Simple Splicing Rules. CDES 2006: 107-111 - [i5]Prahladh Harsha, Rahul Jain, David A. McAllester, Jaikumar Radhakrishnan:
The communication complexity of correlation. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [j3]Eli Ben-Sasson, Prahladh Harsha
Some 3CNF Properties Are Hard to Test. SIAM J. Comput. 35(1): 1-21 (2005) - [c5]Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan:
Short PCPs Verifiable in Polylogarithmic Time. CCC 2005: 120-134 - 2004
- [b1]Prahladh Harsha:
Robust Probabilistically Checkable Proofs of proximity and shorter Robust Probabilistically Checkable Proofs. Massachusetts Institute of Technology, Cambridge, MA, USA, 2004 - [c4]Prahladh Harsha
Communication Versus Computation. ICALP 2004: 745-756 - [c3]Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha
Robust pcps of proximity, shorter pcps and applications to coding. STOC 2004: 1-10 - [i4]Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan:
Robust PCPs of Proximity, Shorter PCPs and Applications to Coding. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [c2]Eli Ben-Sasson, Prahladh Harsha, Sofya Raskhodnikova:
Some 3CNF properties are hard to test. STOC 2003: 345-354 - [i3]Eli Ben-Sasson, Prahladh Harsha:
Lower Bounds for Bounded-Depth Frege Proofs via Buss-Pudlack Games. Electron. Colloquium Comput. Complex. TR03 (2003) - [i2]Eli Ben-Sasson, Prahladh Harsha, Sofya Raskhodnikova:
3CNF Properties are Hard to Test. Electron. Colloquium Comput. Complex. TR03 (2003) - 2001
- [c1]Prahladh Harsha
Small PCPs with Low Query Complexity. STACS 2001: 327-338 - 2000
- [j2]Prahladh Harsha
Small PCPs with low query complexity. Comput. Complex. 9(3-4): 157-201 (2000) - [i1]Prahladh Harsha, Madhu Sudan:
Small PCPs with low query complexity. Electron. Colloquium Comput. Complex. TR00 (2000)
1990 – 1999
- 1999
- [j1]Kamala Krithivasan, M. Sakthi Balan, Prahladh Harsha:
Distributed Processing in Automata. Int. J. Found. Comput. Sci. 10(4): 443-464 (1999)
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 21:23 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: