Papers

• Simplified inapproximability of hypergraph coloring via t-agreeing families.[eccc]
  • with Per Austrin, Aditya Potukuchi
  • (manuscript)
• Improved Inapproximability of Rainbow Coloring.[arxiv]
  • with Per Austrin, Aditya Potukuchi
  • (manuscript)
• UG-hardness to NP-hardness by Losing Half.[eccc]
  • with Subhash Khot
  • CCC 19
• NP-hardness of coloring 2-colorable hypergraph with poly-logarithmically many colors.[eccc]
  • ICALP 18
• A short note on the joint entropy of n/2-wise independence.[arxiv]
  • with Aditya Potukuchi
  • ISIT 18
• Near-optimal approximation algorithm for simultaneous Max-Cut.[arxiv]
  • with Subhash Khot Swastik Kopparty, Sushant Sachdeva and Devanathan Thiruvenkatachari
  • SODA 18
• An Improved Dictatorship Test with Perfect Completeness.[eccc]
  • with Subhash Khot and Devanathan Thiruvenkatachari
  • FSTTCS 17
• Cube vs Cube Low Degree Test.[eccc]
  • with Irit Dinur and Inbal Livni Navon
  • ITCS 17
• Bicovering: Covering edges with two small subsets of vertices. [eccc]
  • with R. Gandhi, M. T. Hajiaghayi, R.Khandekar and G. Kortsarz
  • ICALP 16
• On Fortification of Projection Games. [eccc]
  • with Ramprasad Saptharishi, Girish Varma and Rakesh Venkat
  • RANDOM 15
• A Characterization of hard-to-cover CSPs. [arxiv]
  • with Prahladh Harsha and Girish Varma
  • CCC 15
• Simultaneous approximation of constraint satisfaction problems.[arxiv]
  • with Swastik Kopparty and Sushant Sachdeva
  • ICALP 15
• The complexity of computing the minimum rank of a sign pattern matrix.[arxiv]
  • with Swastik Kopparty