Prahladh Harsha

Available identifiers

zbMath Open harsha.prahladhMaRDI QIDQ210279

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q6126246	2024-04-09	Paper
https://portal.mardi4nfdi.de/entity/Q6090914	2023-11-20	Paper
Decoding multivariate multiplicity codes on product sets	2023-11-14	Paper
https://portal.mardi4nfdi.de/entity/Q6062153	2023-10-31	Paper
On the probabilistic degree of OR over the reals	2023-10-12	Paper
https://portal.mardi4nfdi.de/entity/Q5875460	2023-02-03	Paper
https://portal.mardi4nfdi.de/entity/Q5093398	2022-07-26	Paper
https://portal.mardi4nfdi.de/entity/Q5090936	2022-07-21	Paper
From Local to Robust Testing via Agreement Testing	2022-07-18	Paper
Algorithmizing the Multiplicity Schwartz-Zippel Lemma	2021-11-22	Paper
https://portal.mardi4nfdi.de/entity/Q5009534	2021-08-04	Paper
A Characterization of hard-to-cover CSPs	2021-04-01	Paper
List-Decoding with Double Samplers	2021-03-24	Paper
Explicit SoS lower bounds from high-dimensional expanders	2020-09-10	Paper
A note on the elementary construction of High-Dimensional Expanders of Kaufman and Oppenheim	2019-12-24	Paper
Analyzing Boolean functions on the biased hypercube via higher-dimensional agreement tests: [Extended abstract]	2019-10-15	Paper
List Decoding with Double Samplers	2019-10-15	Paper
On polynomial approximations to AC	2019-05-02	Paper
Robust Multiplication-Based Tests for Reed–Muller Codes	2019-01-18	Paper
https://portal.mardi4nfdi.de/entity/Q4638090	2018-05-03	Paper
https://portal.mardi4nfdi.de/entity/Q4636465	2018-04-19	Paper
https://portal.mardi4nfdi.de/entity/Q4636557	2018-04-19	Paper
https://portal.mardi4nfdi.de/entity/Q4636564	2018-04-19	Paper
https://portal.mardi4nfdi.de/entity/Q4636610	2018-04-19	Paper
https://portal.mardi4nfdi.de/entity/Q4601833	2018-01-24	Paper
https://portal.mardi4nfdi.de/entity/Q4598278	2017-12-19	Paper
The Communication Complexity of Correlation	2017-07-27	Paper
Super-Polylogarithmic Hypergraph Coloring Hardness via Low-Degree Long Codes	2017-03-10	Paper
https://portal.mardi4nfdi.de/entity/Q2963906	2017-02-21	Paper
https://portal.mardi4nfdi.de/entity/Q2955002	2017-01-24	Paper
Sound 3-Query PCPPs Are Long	2015-09-24	Paper
Lower bounds for bounded depth Frege proofs via Pudlák-Buss games	2015-09-17	Paper
Polynomially Low Error PCPs with polyloglog n Queries via Modular Composition	2015-08-21	Paper
Super-Polylogarithmic Hypergraph Coloring Hardness via Low-Degree Long Codes	2015-06-26	Paper
DISTRIBUTED PROCESSING IN AUTOMATA	2015-04-29	Paper
https://portal.mardi4nfdi.de/entity/Q3191612	2014-10-06	Paper
Bounding the average sensitivity and noise sensitivity of polynomial threshold functions	2014-08-13	Paper
An invariance principle for polytopes	2014-08-13	Paper
Composition of Low-Error 2-Query PCPs Using Decodable PCPs	2014-07-25	Paper
Almost settling the hardness of noncommutative determinant	2014-06-05	Paper
Composition of Low-Error 2-Query PCPs Using Decodable PCPs	2014-04-11	Paper
An invariance principle for polytopes	2014-02-17	Paper
Composition of Low-Error 2-Query PCPs Using Decodable PCPs	2010-10-12	Paper
Some 3CNF properties are hard to test	2010-08-16	Paper
Robust pcps of proximity, shorter pcps and applications to coding	2010-08-15	Paper
https://portal.mardi4nfdi.de/entity/Q3579444	2010-08-06	Paper
Sound 3-Query PCPPs Are Long	2008-08-28	Paper
Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding	2007-09-07	Paper
Some 3CNF Properties Are Hard to Test	2005-10-28	Paper
https://portal.mardi4nfdi.de/entity/Q2762515	2002-01-09	Paper
Small PCPs with low query complexity	2001-10-14	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Prahladh Harsha