Girish Varma

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
A characterization of hard-to-cover CSPs Theory of Computing	2021-04-01	Paper
\textit{Physarum} can compute shortest paths Journal of Theoretical Biology	2019-05-14	Paper
\textit{Physarum} can compute shortest paths	2019-05-10	Paper
A characterization of hard-to-cover CSPs (available as arXiv preprint)	2018-01-24	Paper
On fortification of projection games (available as arXiv preprint)	2017-08-31	Paper
Super-polylogarithmic hypergraph coloring hardness via low-degree long codes SIAM Journal on Computing	2017-03-10	Paper
Derandomized graph product results using the low degree long code (available as arXiv preprint)	2017-01-24	Paper
Reducing uniformity in Khot-Saket hypergraph coloring hardness reductions Chicago Journal of Theoretical Computer Science	2015-08-07	Paper
Super-polylogarithmic hypergraph coloring hardness via low-degree long codes Proceedings of the forty-sixth annual ACM symposium on Theory of computing	2015-06-26	Paper
Streaming algorithms for language recognition problems Theoretical Computer Science	2014-01-10	Paper
Streaming algorithms for some problems in log-space Lecture Notes in Computer Science	2010-06-17	Paper

Research outcomes over time

This page was built for person: Girish Varma