85 citations · 294 across the 35 of their papers we have counts for
8 papers · 1 filter
Decoding Multivariate Multiplicity Codes on Product Sets
Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar +1
The multiplicity Schwartz-Zippel lemma bounds the total multiplicity of zeroes of a multivariate polynomial on a product set. This lemma motivates the multiplicity codes of Koppart…
COVID-19 Epidemic in Mumbai: Projections, full economic opening, and containment zones versus contact tracing and testing: An Update
Prahladh Harsha, Sandeep Juneja, Daksh Mittal +1
Mumbai, amongst the most densely populated cities in the world, has witnessed the fourth largest number of cases and the largest number of deaths among all the cities in India (as…
Explicit SoS lower bounds from high-dimensional expanders
Irit Dinur, Yuval Filmus, Prahladh Harsha +1
We construct an explicit family of 3XOR instances which is hard for levels of the Sum-of-Squares hierarchy. In contrast to earlier constructions, which involve a…
City-Scale Agent-Based Simulators for the Study of Non-Pharmaceutical Interventions in the Context of the COVID-19 Epidemic
Shubhada Agrawal, Siddharth Bhandari, Anirban Bhattacharjee +14
We highlight the usefulness of city-scale agent-based simulators in studying various non-pharmaceutical interventions to manage an evolving pandemic. We ground our studies in the c…
COVID-19 Epidemic Study II: Phased Emergence From the Lockdown in Mumbai
Prahladh Harsha, Sandeep Juneja, Preetam Patil +7
The nation-wide lockdown starting 25 March 2020, aimed at suppressing the spread of the COVID-19 disease, was extended until 31 May 2020 in three subsequent orders by the Governmen…
Locally testable codes via high-dimensional expanders
Yotam Dikstein, Irit Dinur, Prahladh Harsha +1
Locally testable codes (LTC) are error-correcting codes that have a local tester which can distinguish valid codewords from words that are "far" from all codewords by probing a giv…
Rigid Matrices From Rectangular PCPs
Amey Bhangale, Prahladh Harsha, Orr Paradise +1
We introduce a variant of PCPs, that we refer to as rectangular PCPs, wherein proofs are thought of as square matrices, and the random coins used by the verifier can be partitioned…
A note on the explicit constructions of tree codes over polylogarithmic-sized alphabet
Siddharth Bhandari, Prahladh Harsha
Recently, Cohen, Haeupler and Schulman gave an explicit construction of binary tree codes over polylogarithmic-sized output alphabet based on Pudlák's construction of maximum-dista…