Ramprasad Saptharishi

Employment

• Tata Institute of Fundamental Research Reader
  2016 - Present
• Tel Aviv University Postdoctoral Fellow
  2014 - 2016
• Microsoft Research (India) Research Fellow
  2013 - 2014

Education

• Chennai Mathematical Institute Ph.D in Computer Science
  2007 - 2013
• Chennai Mathematical Institute B.Sc. (Hns) Mathematics and Computer Science
  2004 - 2007

Projects & Funding

Projects & funding information is unavailable.

Publications (60)

• Towards Deterministic Algorithms for Constant-Depth Factors of Constant-Depth Circuits
  ACM Transactions on Computation Theory 2026 0 citations DOI: 10.1145/3778245
  +Save
• Closure under Factorization from a Result of Furstenberg
  2026 1 citation DOI: 10.1145/3798129.3800738
  +Save
• Constructing Faithful Homomorphisms over Fields of Finite Characteristic
  ACM Transactions on Computation Theory 2023 0 citations DOI: 10.1145/3580351
  +Save
• Identity Testing and Lower Bounds for Read-\emphk Oblivious Algebraic Branching Programs
  TOCT 2018 10 citations DOI: 10.1145/3170709
  +Save
• Near-optimal Bootstrapping of Hitting Sets for Algebraic Circuits
  CoRR 2018
  +Save
• Quasi-polynomial Hitting Sets for Circuits with Restricted Parse Trees
  Electronic Colloquium on Computational Complexity (ECCC) 2017
  +Save
• Unexpected power of low-depth arithmetic circuits
  Commun. ACM 2017 0 citations DOI: 10.1145/3065470
  +Save
• Quasi-polynomial Hitting Sets for Circuits with Restricted Parse Trees
  CoRR 2017
  +Save
• Efficiently Decoding Reed-Muller Codes From Random Errors
  IEEE Trans. Information Theory 2017 23 citations DOI: 10.1109/TIT.2017.2671410
  +Save
• An Exponential Lower Bound for Homogeneous Depth-5 Circuits over Finite Fields
  32nd Computational Complexity Conference, CCC 2017, July 6-9, 2017, Riga, Latvia 2017 5 citations DOI: 10.4230/LIPIcs.CCC.2017.31
  +Save