Pranav Bisht
I am a post-doc researcher in the department of Computer Science at Boston College, under the guidance of Prof. Ilya Volkovich. I completed my PhD from the department of Computer Science & Engineering at IIT Kanpur and was fortunate enough to be advised by Professor Nitin Saxena there. I work in the area of Algebraic Complexity Theory. I am also looking for interesting problems/collaborations in the broad areas of Pseudorandomness & Derandomization, Computational Number Theory & Algebra, Cryptography and related areas. My CV can be found here (last updated on Jan. 2023).
Education:
- B.E. in IT (Information Technology) from PEC (Punjab Engineering College), 2011-15.
- M.Tech. in CSE (Computer Science & Engineering) from IIT Kanpur, 2015-2017. [M.Tech. Thesis]
- Ph.D. in CSE from IIT Kanpur, 2017- 2022. [Ph.D. Thesis]
Publications
- On Solving Sparse Polynomial Factorization Related Problems
with Ilya Volkovich.
42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS, 2022. [pdf] - Derandomization via symmetric polytopes: Poly-time factorization of certain sparse polynomials
with Nitin Saxena.
42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS, 2022. [pdf] - Blackbox identity testing for sum of special ROABPs and its border class
with Nitin Saxena.
Computational Complexity, vol30:8, 1-48, 2021. [pdf] [slides] [webinar] - High-Level Support Activities of Simulation Laboratory E&A Particles
with G. Poghosyan, S. Sharma, A. Kaur, V. Jindal, A. Streit, M. Bejger, A. Królak, T. Klaehn, S. Typel, J. Oehlschläger, T. Pierog, R. Engel.
High Performance Computing in Science and Engineering , 2014. [pdf]
Under construction...