CV ()

Personal Information

Name: NITIN SAXENA Address: RM203, Department of CSE, IIT , Kanpur-208016 ; +91-512-679-7588 E-address: [email protected] ; https://www.cse.iitk.ac.in/users/nitin/ Date and place of birth: 3rd MAY 1981, Allahabad/Prayagraj, India Nationality: INDIA Gender: M

S Degree Subject Year University Additional No Particulars

1 B.Tech. Computer 2002 Indian Institute of Thesis: Towards a Science & Technology deterministic polynomial- Engineering, Kanpur time (Won Algebra, the best BTech CSE Number theory Project Award 2002)

2 Ph.D. Computer 2006 Indian Institute of Thesis: Morphisms of Science & Technology Rings and Applications to Engineering, Kanpur Complexity (Won Algebra, Outstanding PhD Student Number theory Award of IBM India Research Lab 2005) Guide:

3 Post-Doc , 2006- CWI (Centrum Host: Prof.dr.Harry Research Informatics, 08 voor Wiskunde en Buhrman Quantum Informatica) complexity Amsterdam, Netherlands

Date of joining the Institution (Designation & Scale): 05-Nov-2018, Professor (CSE), AcadLevel=14A, Basic=173900/-

Positions held earlier (in chronological order):

S Period Place of Employment Designation No

1 Jul'02- CSE, IIT Kanpur Infosys PhDFellow Jul'06

2 Sep'03- CS, Princeton University, USA Visiting Student Research Aug'04 Collaborator

3 Sep'04- CS, National University of Singapore Visiting Scholar Jun'05

4 Sep'06- CWI Amsterdam, The Netherlands Scientific Researcher Mar'08

5 Apr'08- Hausdorff Center for Mathematics, Professor W2, Mar'13 University of Bonn, Germany BonnJuniorFellow

6 Dec'14 UPMC Paris-6, France Visiting Professor

7 Aug'18- Chennai Mathematical Institute, H1, Adjunct Professor Jul'21 SIPCOT IT Park, Chennai.

8 Apr'13- CSE, IIT Kanpur Associate Professor Oct'18

Teaching Courses (UG/PG) taught, new courses introduced

Teaching in CSE, IITK (2013--)

Mathematics for Computer Science - III - Probability (core for UG) 2020-21/II, CS203

Randomized methods in Computational Complexity 2020-21/I; 2018-19/I ; 2014-15/II, CS747 (New Course)

Computational Number Theory & Algebra 2019-20/II ; 2016-17/II ; 2014-15/I, CS681

Algorithms -II (core for UG) 2019-20/I, CS345

Arithmetic Circuit Complexity 2018-19/II ; 2015-16/II, CS748 (New Course)

Design & Analysis of Algorithms (core for PG) 2017-18/II, CS602

Computational Complexity Theory 2017-18/I ; 2013-14/II, CS640

Technical Communication (core for UG) 2017-18/I ; 2014-15/I, CS300 Mathematics for Computer Science - I - Discrete Maths (core for UG) 2016-17/I, CS201

Introduction to Programming (core for Institute) 2015-16/I, ESc101

Computational Arithmetic-Geometry & Applications (New Course) 2013-14/I, CS688

------

Teaching in Bonn (2008-13)

Summer Semester 2012 Graduate Seminar on Algorithms in Real Algebraic Geometry (New Course)

Winter Semester 2011/12 Graduate Seminar on Topics in Computational Algebraic Geometry (New Course)

Summer Semester 2011 Graduate Seminar on Topics in Quantum Computation (New Course)

Winter Semester 2010/11 Graduate Seminar on Topics in Modern Cryptography (New Course)

Summer Semester 2010 Graduate Seminar on Topics in Algebra & Computation (New Course)

Winter Semester 2009/10 Graduate Seminar on Topics in Computational Complexity

Summer Semester 2009 Randomized Methods in Computational Complexity (New Course)

Winter Semester 2008/09 Computational Complexity Theory (New Course)

Summer Semester 2008 Topics in Computational Algebra (New Course) ------

Supervision of Bachelor’s/Master’s thesis

Research Group at CSE, IITK (2013--)

Masters

Sayak Chakrabarti (BT-MT, Jul'20--)

Diptajit Roy (MS, Jul'19--)

Abhibhav Garg ("Special case algorithms for Nullstellensatz and transcendence degree", 2020. BT-MT)

Abhiroop Sanyal ("Sum of powers of univariate polynomials in algebraic complexity theory", 2020. Non-degree MSc Thesis student from CMI Chennai)

Subhayan Saha ("Towards a PIT for log-variate ROABPs", 2020. Non-degree MSc Thesis student from CMI Chennai)

Pranjal Dutta ("Discovering the roots: Unifying and extending results on multivariate polynomial factoring in algebraic complexity", 2018. Non-degree MSc Thesis student from CMI Chennai, Jul'16--Jul'17)

Pranav Bisht ("On Hitting Sets for Special Depth-4 Circuits", 2017)

Ashish Dwivedi ("On the Complexity of Hilbert's Nullstellensatz over Positive Characteristic", 2017)

Kartik Kale ("Exp(n+d)-time Algorithms for Computing Division, GCD and Identity Testing of Polynomials", 2017)

Shubham Sahai Srivastava (changed to PhD & the Advisor in 2016)

Ashutosh Tiwari ("Cubic forms equivalence over complex", 2016 )

Rishabh Vaid ("Blackbox Identity Testing for Simple Depth 3 Circuits", 2015)

Anurag Pandey ("Algebraic independence: Criteria and structural results over diverse fields", 2015. BT-MT EE)

Amit K. Sinhababu ("Testing algebraic independence of polynomials over finite fields", 2014)

Pritam Majumder ("Uniqueness of factorization in quadratic fields", 2014. MSc Math)

Bachelor (UGP)

Sayak Chakrabarti ("On factorization and root counting modulo prime powers", Jul'20)

Rishabh Batra ("Integer & polynomial factoring ideas", Jul'20)

Devansh Shringi (''PIT for depth-4 bounded top & bottom fanin'', Jul'20, Jan'20)

Shubhojyoti Nath ("The Complexity of Hilbert's Nullstellensatz", 2019)

Abhibhav Garg ("On Algebraic dependence", 2018)

Tushant Mittal ("Algebraic Independence", 2017)

Shaswat Chaubey ("Lower-bounds & learning algorithms", 2016)

Abhimanyu Yadav ("Luks' graph isomorphism", 2016) ("Babai's graph isomorphism", 2016 )

Himanshu Shukla ("Generalized form of Burgess lemma", 2015) ("C-Z type algorithm for factoring over finite fields", 2016)

Vishwas Bhargav ("Square root modulo p", 2015)

Anurag Sahay ("Additive Combinatorics and Incidence Geometry: The Kakeya Problem", 2014)

Vijay Keswani ("Additive Combinatorics and Incidence Geometry: The Szemeredi-Trotter Theorem", 2014)

Kundan Kumar ("Deterministic Polynomial Factorisation Over a Finite Field", 2014)

Research assistants

Sagnik Dutta, Summer'19 Anupam Datta, Summer'19 Yashaswi Patel, Summer'19 Devashish Sonowal, Summer'18 Abhiroop Sanyal, Summer'17 Subhayan Saha, Summer'17 Shivani Kumari, Summer'17 Vishwas Bhargav, Jun'16--Jul'17 Rahul Hirwani, Summer'16 Akash Jena, Summer'16 Pranjal Dutta, Summer'15

------

Group in Bonn University, Germany (2008-2013)

Diplom (comparable to M.S.)

Manuel Arora (Theory of m-schemes and applications to polynomial factoring, 2010)

Jesse Beisegel (Additive Combinatorics, Addition Cayley graphs and Hamiltonicity, 2012)

Nils Frohberg (Sylvester-Gallai theorems and identities over R, 2010)

Jesko Hüttenhain (From Sylvester-Gallai configurations to branched coverings, 2012)

Leonhard Schneider (Equivalence of quantum and classical computation in interactive proof systems and refereed games, 2012)

Lars Wallenborn (Computing the Hilbert symbol, quadratic form equivalence and integer factoring, 2013)

Bachelor (Thesis)

Kathrin Sayk (Key Distribution, 2011)

Jens Ziegler (Smoothed analysis of the TSP algorithms, 2012)

Former research assistants

Malte Beecken, 2009-11

PhD Supervision

Research Group at CSE, IITK (2013--)

PhD (10)

Diptajit Roy ( Jul'20--)

CS Bhargav (Jul'19--)

Prateek Dwivedi (Dec'18--)

Pranjal Dutta (on Google PhD Fellowship:2018-22)

Ashish Dwivedi (Jul'17--) (with Dr. Rajat Mittal)

Pranav Bisht (Jul'17--)

Sumanta Ghosh ("Low variate polynomials: Hitting-sets and Bootstrapping", 2019) (Post-PhD: Postdoc in IIT Bombay)

Amit K. Sinhababu ("Power series in complexity: Algebraic Dependence, Factor Conjecture and Hitting Set for Closure of VP", 2019) (Post-PhD: Postdoc in Ulm, Germany)

Arpita Korwar ("Polynomial identity testing and lower bounds for sum of special arithmetic branching programs", 2016) (with Prof. Manindra Agrawal) (Post-PhD: Faculty in IIT GOA from 2019. Postdoc in Paris Diderot, France)

Rohit Gurjar ("Derandomizing PIT for ROABP and isolation lemma for special graphs", 2015) (with Prof. Manindra Agrawal) (Won ACM India Doctoral Dissertation Award 2017) (Post-PhD: Faculty in IIT BOMBAY from 2018. Postdoc in Ulm Germany, Tel-Aviv Israel, CalTech USA)

Postdoc

Zeyu Guo, 2017-19 (PhD from CalTech, USA)

------

Group in Bonn University, Germany (2008-2013)

PhD (2)

Manuel Arora ("Extensibility of association schemes and GRH-based deterministic polynomial factoring", 2013) (with Prof. Marek Karpinski) (Post-PhD: Apple, NetFlix, Twitter. Postdoc in CalTech, USA)

Johannes Mittmann ("Independence in Algebraic Complexity Theory", 2013) (Graduated with `Ausgezeichnet' - an outstanding grade given to less than 5% of the theses in Mathematics, University of Bonn) (Post-PhD: Member in Bundesamt fuer Sicherheit in der Informationstechnik, Bonn.)

Postdoc

Peter Scheiblechner, 2011-12 (Post-Postdoc: Lecturer, Lucerne University, Switzerland)

Knowledge Dissemination NPTEL/Swayam course: Randomized Methods in Complexity, 2020-21/II. NPTEL/Swayam course: Computational Number Theory & Algebra, 2020-21/I. NPTEL/Swayam course: Arithmetic Circuit Complexity, 2019-20/II.

Publications

Complete list of publications in standard refereed journals:

S.No. Authors Title Venue 1 Ashish Dwivedi, Efficiently factoring Journal of Symbolic Rajat Mittal, Nitin polynomials modulo p4 Computation, 2020 Saxena 2 Manindra Agrawal, Bootstrapping variables Proceedings of the National Sumanta Ghosh, in algebraic circuits Academy of Sciences of the Nitin Saxena USA, PNAS, 2019. 3 Zeyu Guo, Nitin Algebraic dependencies Invited in the special issue: Saxena, Amit and PSPACE algorithms Theory of Computing, Sinhababu in approximative vol.15(16), 1--30, 2019. complexity 4 Anurag Pandey, Algebraic independence Computational Complexity Nitin Saxena, Amit over positive 27(4): 617-670, 2018. Sinhababu characteristic: New criterion and applications to locally low algebraic rank circuits 5 Gábor Ivanyos, Polynomial interpolation Algorithmica, 80(2), 560-575, Marek Karpinski, and identity testing from 2018. Miklos Santha, high powers over finite Nitin Saxena, Igor fields E Shparlinski 6 Rohit Gurjar, Arpita Identity testing for Invited in the special issue of Korwar, Nitin constant-width, and the journal: Theory of Saxena commutative, read-once Computing, 13 (999), 2017, oblivious ABPs pp. 1–21. 7 Rohit Gurjar, Arpita Deterministic Identity Computational Complexity, Korwar, Nitin Testing for Sum of 26(4), 835-880, 2017. Saxena, Thomas ROABPs Thierauf 8 Manindra Agrawal, Jacobian hits circuits: Invited in the special issue of Chandan Saha, Hitting-sets, lower the journal: SIAM Journal on Ramprasad bounds for depth-D Computing: vol. 45, No. 4, Saptharishi, Nitin occur-k formulas & pp. 1533–1562, 2016 Saxena depth-3 transcendence degree-k circuits 9 Manindra Agrawal, Hitting-sets for ROABP SIAM Journal on Computing, Rohit Gurjar, Arpita and sum of set- vol.44, no.3, 669-697, 2015 Korwar, Nitin multilinear circuits Saxena 10 Johannes Mittmann, Algebraic Independence Transactions of the American Nitin Saxena, Peter in Positive Mathematical Scheiblechner Characteristic -- A p- Society, vol.366, no.7, 3425- adic Calculus 3450, 2014 11 Manuel Arora, Deterministic London Mathematical Society Gábor Ivanyos, polynomial factoring Journal Of Computation And Marek Karpinski, and association schemes Mathematics. 2014, 17(1), Nitin Saxena 123-140. 12 Malte Beecken, Algebraic Independence Invited in the special issue of Johannes Mittmann, and Blackbox Identity the journal: Information & Nitin Saxena Testing Computation, vol.222, 2-19, 2013. 13 Chandan Saha, A case of depth-3 Computational Complexity. Ramprasad identity testing, sparse 2013, 22(1), 39-69. Saptharishi, Nitin factorization and duality Saxena 14 Nitin Saxena, C. From Sylvester-Gallai Journal of the ACM, vol.60, Seshadhri Configurations to Rank no.5, article 33, 2013 Bounds: Improved Black-box Identity Test for Depth-3 Circuits 15 Nitin Saxena, C. Blackbox Identity Invited in the special issue of Seshadhri Testing for Bounded the journal: SIAM Journal on Top Fanin Depth-3 Computing, vol.41, no.5, Circuits: the field 1285-1298, 2012 doesn't matter 16 Gábor Ivanyos, Trading GRH for Marek Karpinski, algebra: algorithms for Mathematics of Computation, Lajos Rónyai, Nitin factoring polynomials vol.81, 493-531, 2012 Saxena and related structures. 17 Nitin Saxena,C. An Almost Optimal SIAM Journal on Computing, Seshadhri Rank Bound for Depth-3 vol.40, no.1, 200-224, 2011. Identities 18 Gábor Ivanyos, Deterministic SIAM Journal on Marek Karpinski, Polynomial Time Computing, vol.39, no.8, Nitin Saxena Algorithms for Matrix 3736-3751, 2010 Completion Problems 19 Nitin Saxena, Parameters of Integral International Journal of Simone Severini, Circulant Graphs and Quantum Information, volume Igor E. Shparlinski Periodic Quantum 5(3), 417-430, 2007 Dynamics 20 , Nitin Polynomial Identity Invited in the special issue of Saxena Testing for Depth 3 the journal: Computational Circuits Complexity, volume 16(2), 115-138, 2007. 21 Neeraj Kayal, Nitin On the Ring Invited in the special issue of Saxena Isomorphism & the journal: Computational Automorphism Complexity, volume 15(4), Problems 342-390, 2007 22 Manindra Agrawal, PRIMES is in P Annals of Mathematics, Neeraj Kayal, Nitin volume 160(2), 781-793, Saxena 2004. [Invited by the Editor. Won Gödel Prize 2006 and 2006]

Complete list of papers published in prestigious peer-reviewed Conferences/ Proceedings:

S.No. Authors Title Venue 1 Pranjal Dutta, A Largish Sum-of- 12th Innovations in Theoretical Nitin Saxena, Squares Implies Circuit Computer Science (ITCS), 2021. Thomas Hardness and Thierauf Derandomization 2 Abhibhav Special-case 45th International Symposium on Garg, Nitin algorithms for Symbolic and Algebraic Saxena blackbox radical Computation (ISSAC), 2020. membership, Nullstellensatz and transcendence degree 3 Ashish Computing Igusa's 14th Biannual Algorithmic Number Dwivedi, local zeta function of Theory Symposium, ANTS-XIV, Nitin Saxena univariates in 2020. deterministic polynomial-time 4 Ashish Counting basic- 34th Computational Complexity Dwivedi, Rajat irreducible factors mod Conference (CCC), 2019. Mittal, Nitin pk in deterministic Saxena poly-time and p-adic applications 5 Ashish Efficiently factoring 44th International Symposium on Dwivedi, Rajat polynomials modulo p4 Symbolic and Algebraic Mittal, Nitin Computation (ISSAC), 2019. Saxena 6 Zeyu Guo, Algebraic CCC'18, 10:1-10:21, 2018. Nitin Saxena, dependencies and [One of the selected best in the Amit PSPACE algorithms in conference] Sinhababu approximative complexity 7 Michael A. ICALP'18, 54:1-54:16, 2018. Forbes, Towards blackbox Sumanta identity testing of log- Ghosh, Nitin variate circuits Saxena 8 Pranjal Dutta, Discovering the roots: STOC'18, 1152-1165, 2018. Nitin Saxena, Uniform closure results Amit for algebraic classes Sinhababu, under factoring 9 Manindra Bootstrapping STOC'18, 1166-1179, 2018. Agrawal, variables in algebraic Sumanta circuits Ghosh, Nitin Saxena 10 Vishwas Irreducibility and 42nd International Symposium on Bhargava, deterministic r-th root Symbolic and Algebraic Gábor Ivanyos, finding over finite Computation (ISSAC), 2017, 37--44. Rajat Mittal, fields Nitin Saxena 11 Anurag Algebraic LIPIcs-Leibniz International Pandey, Nitin independence over Proceedings in Informatics, 58, 74:1- Saxena, Amit positive characteristic: 74:15, 2016 (41st International Sinhababu New criterion and Symposium on Mathematical applications to locally Foundations of Computer Science, low algebraic rank MFCS'16) circuits 12 Manindra Integer factoring using LIPIcs-Leibniz International Agrawal, Nitin small algebraic Proceedings in Informatics, 58, 6:1- Saxena, dependencies 6:14, 2016 (41st International Shubham Symposium on Mathematical Sahai Foundations of Computer Science, Srivastava MFCS'16) 13 Rohit Gurjar, Identity testing for LIPIcs-Leibniz International Arpita Korwar, constant-width, and Proceedings in Informatics, 50, 29:1- Nitin Saxena commutative, read- 29:16, 2016 (Computational once oblivious ABPs Complexity Conference, CCC'16). [One of the selected best in the conference] 14 Rohit Gurjar, Deterministic Identity LIPIcs-Leibniz International Arpita Korwar, Testing for Sum of Proceedings in Informatics, 33, 323- Nitin Saxena, ROABPs 346, 2015 (Computational Thomas Complexity Conference, CCC'15). Thierauf 15 Manindra Quasi-polynomial 45th ACM Symposium on Theory of Agrawal, Hitting-set for Set- Computing (STOC), pp.321- Chandan Saha, depth-D Formulas 330, 2013 Nitin Saxena 16 Manindra Jacobian hits circuits: 44th ACM Symposium on Theory of Agrawal, Hitting-sets, lower Computing (STOC), pp.599-614, Chandan Saha, bounds for depth-D 2012 Ramprasad occur-k formulas & [One of the selected best in the Saptharishi, depth-3 transcendence conference] Nitin Saxena degree-k circuits 17 Malte Algebraic 38th International Colloquium on Beecken, Independence and Automata, Languages and Johannes Blackbox Identity Programming (ICALP), pp.137-148, Mittmann, Testing 2011. Nitin Saxena [Awarded the Best Paper in Track A]

18 Nitin Saxena, Blackbox Identity C. Seshadhri Testing for Bounded 43rd ACM Symposium on Theory of Top Fanin Depth-3 Computing (STOC), pp.431-440, Circuits: the field 2011 doesn't matter [One of the selected best in the conference] 19 Nitin Saxena, From Sylvester-Gallai C. Seshadhri Configurations to Rank 51st Annual IEEE Symposium on Bounds: Improved Foundations of Computer Science Black-box Identity (FOCS), pp.21-29, 2010 Test for Depth-3 Circuits

20 Chandan Saha, The Power of Depth 2 29th Foundations of Software Ramprasad Circuits over Algebras Technology and Theoretical Saptharishi, Computer Nitin Saxena Science (FSTTCS), pp.371- 382, 2009 21 Nitin Saxena, An Almost Optimal 24th IEEE Conference on C. Seshadhri Rank Bound for Depth- Computational Complexity 3 Identities (CCC), pp.137-148, 2009 22 Gábor Ivanyos, Schemes for 34th International Symposium on Marek Deterministic Symbolic and Algebraic Karpinski, Polynomial Factoring Computation (ISSAC), pp.191- Nitin Saxena 198, 2009 23 Nitin Saxena Diagonal Circuit 35th International Colloquium on Identity Testing and Automata, Languages and Lower Bounds Programming (ICALP), LNCS 5125, pp.60-71, 2008 24 Neeraj Kayal, Polynomial Identity 21st IEEE Conference on Nitin Saxena Testing for Depth 3 Computational Complexity (CCC), Circuits pp.9-17, 2006. [Awarded the Best Paper and Best Student Paper Awards] 25 Manindra Equivalence of F- 23rd STACS, Springer LNCS 3884, Agrawal, Nitin algebras and cubic pp.115-126, 2006 Saxena forms 26 Manindra Automorphisms of 22nd Symposium on Theoretical Agrawal, Nitin Finite Rings and Aspects of Computer Science Saxena Applications to (STACS), Springer LNCS 3404, Complexity of pp.1-17, 2005 Problems 27 Neeraj Kayal, On the Ring 20th IEEE Conference on Nitin Saxena Isomorphism & Computational Complexity (CCC), Automorphism pp.2-12, 2005 Problems [One of the selected best in the conference]

List of the most outstanding Technical Reports/ Review Articles:

S.No. Authors Title Venue 1 Meena Mahajan, Research in Invited in: Communications of the Madhavan theoretical ACM, 62(11), 92-95, 2019 Mukund, Nitin computer science Saxena 2 Nitin Saxena Progress on Perspectives in Computational polynomial Complexity. 2014, 131-146. (Invited identity testing-II by the editor) 3 Nitin Saxena Progress on Bulletin of the European Association Polynomial for Theoretical Computer Science Identity Testing (EATCS), no.99, 49-79, October 2009. (Invited by the editor)

Development

"Polynomial time deterministic method for testing primality of numbers". with Manindra Agrawal and Neeraj Kayal. US 7,346,637 B2 (USA) (Granted)

Funding

- PI of the project entitled "Algebraic Circuits: Learning the inherent structure " funded under SERB Core Research Grant in Computer Sciences. (Duration 2021-2024, worth Rs. 50 lakhs.)

- PI of the project entitled "Three problems in Algebraic Complexity Theory" funded under DST SwarnaJayanti Fellowship Award in Mathematical Sciences. (Duration 2015-2020, worth Rs. 69 lakhs.)

- PI of the project entitled "Rank concentration, Hitting-sets and Lower Bounds" funded under SERB Fast Track Scheme for Young Scientist in Mathematical Sciences. (Duration 2013-2016, worth Rs. 12.84 lakhs) Adjudged the `Excellent' grade on completion.

- Research funding from Indian National Science Academy (INSA) with Young Scientist Medal 2015. (Not utilized yet.)

Peer Recognition

Profile in the news [Hindi] [alumni-page] [Soundbyte][AMS Notices]

S.No. Awarding Organization Award Year

1 Indian Academy of Sciences Fellow 2021 2 Awarded by IIT Kanpur for 2019- N Rama Rao Chair 2019- 24 24 3 In Mathematical Sciences. Awarded Shanti Swarup Bhatnagar 2018 by Council of Scientific & Prize Industrial Research (CSIR) India. 4 Awarded by IIT Kanpur for 2018- Young Faculty Research 2018- 21 Fellowship 21 5 DST (Ministry of Science & DST SwarnaJayanti Fellowship 2015- Technology, India) Award 2013-14 in Mathematics. 20 Comes with a 5-year research grant titled "Three problems in Algebraic Complexity Theory"

6 Indian National Science Academy Indian National Science 2015 Academy Young Scientist Medal, in Mathematical Sciences 7 Academic Senate, IIT Kanpur Letters from the Chairman for 2015- Teaching & Research 20 8 SERB, DST (Ministry of Science & Fast Track Scheme for Young 2013- Technology, India) Scientist in Mathematical 16 Sciences. Grant for duration 2013-2016. Adjudged the `Excellent' grade on completion. 9 European Association of Best Paper (Track A) at 2011 Theoretical Computer Science ICALP Conference for the joint (EATCS) paper "Algebraic independence and blackbox identity testing" 10 IEEE Conference on Computational IEEE Conference on 2006 Complexity 2006 Computational Complexity Best Paper Awards for the joint paper "Polynomial Identity Testing for Depth 3 Circuits" 11 European Association for Gödel Prize for the joint paper 2006 Theoretical Computer Science "PRIMES is in P" (EATCS), Association for Computing Machinery Special Interest Group on Algorithms and Computational Theory (ACM- SIGACT) 12 Mathematical Optimization Society Fulkerson Prize for the joint 2006 (MOS), American Mathematical paper "PRIMES is in P" Society (AMS) 13 IIT Kanpur Distinguished Alumnus Award 2003 14 Indian Business Club, Global Indus Technovators 2003 Massachusetts Institute of Award Technology, USA 15 IBM India Research Lab Outstanding PhD Student 2005 Award 16 IIT Kanpur Best BTech CSE Project Award 2002 (Convocation Ceremony) 17 Voted by the IIT-K Alumni to IITK@50 Votes. Amongst the 2010 celebrate 50 years top 50 prominent alumni 18 Infosys Technologies Ltd. Infosys PhD Fellowship 2002- 06 19 IIT Kanpur Notional Scholarship. For 1999 excellent performance in the first 2 semesters of study under the B.Tech (IIT-K) program

20 Indian National Mathematics Selected to attend the 1997- Olympiad. Bhabha Atomic International Mathematics 98 Research Center, Mumbai Olympiad Training Camp (IMOTC '97 & IMOTC '98) and awarded the Prize for ``Best Solution to a Challenging Problem'' in both the Camps

Invited Talks & Meetings

- SRMIST Ramapuram, Chennai (virtual) 2020 - ICNTDM'20, RSET Kochi (virtual) 2020 - STCS Seminar, TIFR (virtual) 2020 - NPTEL Live Special Lecture Series 2020 - OCS 2019, Hyatt Lucknow 2019 - CSE Seminar, IIT Delhi 2019 - Workshop on Algebraic Complexity Theory, ICTS, TIFR, Bengaluru 2019 - NWCNS, PSIT Kanpur 2019 - Workshop, Simons Institute for the Theory of Computing, Berkeley (USA) 2018 - MATH-STAT Colloquium, IIT Kanpur 2018 - Workshop on Algebraic Complexity Theory, Université Paris-Diderot, France 2018 - Workshop NMI, IMSc, Chennai 2017 - Workshop in Algebraic Complexity Theory, TAU, Israel 2016 - CMI Seminar, Chennai 2015 - Seminars, UPMC Paris-6 (France) 2014 - NIWC, MNNIT, Allahabad 2018, 2014 - Algebraic Graph Theory Conference, Villanova University (USA) 2014 - Big Tech Day 7, TNG Tech Consulting, Munich (Germany) 2014 - Workshops in Arithmetic Complexity, TIFR (Mumbai) and Saarbrücken (Germany) 2014 - Seminar and workshop, Bonn (Germany) and Linz (Austria) 2013 - Seminar, ENS Lyon, France 2012 - Turing Centenary Celebration, IIT Kanpur/Delhi, India 2012 - Oberseminar Logik/Informatik/Diskrete Math., Universität Bonn, Germany 2011/ 2008/2007 - Max Planck Institut für Informatik, Saarbrücken, Germany 2011 - RAND-Workshop on Association Schemes, Bonn 2011 - Number Theory Workshop, University of Warsaw, Poland 2010 - ICM Satellite Workshop, IISc Bangalore, India 2010 - DFG German-Indian Workshop, Bonn 2010 - Computational Complexity at Dagstuhl, Germany 2020, 2018, 2016, 2009, 2007 - Oberseminar Informatik, Universität Ulm, Germany 2009 - 23rd EURO Operational Research Conference, Bonn 2009 - Number Theory Seminar, MPI für Mathematik, Bonn 2008 - Complexity Theory at Oberwolfach, Germany 2007 - Algorithmic Number Theory, University of Turku, Finland 2007 - Dutch Theory Day, Utrecht, The Netherlands 2007 - Math. Colloquium, Amsterdam University, The Netherlands 2007 - IRISS, Chennai 2006 - ISI Delhi & Delhi University 2002 - Indocrypt Conference, Hyderabad, India 2002

Contributions to the institute

- Chair, UnderGraduate Academic Review Committee (2018-2020).

- Chair, IITK REACH'20 (Research Challenges) Symposium.

- Convener, CSE DUGC (Jan'16--Aug'18).

- Convener, CSE Faculty Meeting (2015-17)

- Coordinator, CSE Student Placement (2015-16).

- Member, CSE PG Admissions Committee (2016--).

- CSE DPGC/ DUGC Counseling Advisor (2014--).

- Member, Furnishings Committee for the Motwani building (2014).

- Member, Security Advisory & Executive Committee, IITK (2017-19, 2019-21)

- Member, Festival Advisory Committee, Techkriti 2016-18 (IITK Student's Technical Festival).

- Member, DoRA Advisory Group (2014-15).

- Member, IITK Website Task Force (2014-16).

- MSI/CSE Seminar Coordinator, and Math.Sci.Initiative's co-PI (2013-15).

- IR for multiple GATE/ JEE Advance examinations.

Contributions outside the Institute

- Chair of (Track A) FSTTCS 2020.

- Served on the Program Committee of--- ISSAC 2020 Posters Committee (45th International Symposium on Symbolic and Algebraic Computation), FOCS 2019 (60th IEEE Symposium on Foundations of Computer Science), FCT 2019 (22nd Symposium on Fundamentals of Computation Theory), FSTTCS 2018 (39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science), STACS 2014 (31st Symposium on Theoretical Aspects of Computer Science), CCC 2011 (26th IEEE Conference on Computational Complexity) and CSR 2011 (6th International Computer Science Symposium In Russia).

- Served on the organizing committee-- 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science FSTTCS 2017. - Member, INSA-INSPIRE Faculty Fellow Selection Committee (2021--).

- Member, Programme Advisory Committee, SERB-SUPRA Scheme (2019--).

- Member, NBHM Research Projects Committee (2019--).

- Member, Faculty Selection Committee -- IIT-BHU, Jan'20 ; IMSc, Feb'19.

- Member, Habilitation defense committee -- Herve Fournier (University Paris-Diderot, France, 2014).

- Member, PhD defense committee -- Daniel Loebenberger (BIT-Uni.Bonn, Germany, 2012) ; Bruno Grenet (ENS Lyon, France, 2012) ; Ankit Garg (CMI, India, 2015).

- Reviewer for journals: Combinatorica, Comp. Complex., Fundamenta Informaticae, IEEE. T. Inform. Theory, ACM Trans. Comp. Theory (ToCT), Inform. Process. Lett., J. Complexity, Math. Comput., SIAM J. Comp., J. Symb. Comput., Theory of Computing (ToC), TCS, Integers, Proc.Math.Sc.

- Reviewer for conferences: ANTS, CCC, ESA, FCT, FOCS, FSTTCS, ICALP, ISAAC, ISSAC, RANDOM, SODA, SPAA, STACS, STOC.

Others

- Languages: Fluent: Hindi (native), English. Basic: German (reading better than speaking), French (only reading), Dutch (only reading).

- Honorary consultant in an Amazon Prime TV Series.

- Interests: Classical Piano (basic -- intermediate). Movies, Non-fiction, Swimming, Travelling.

( ns ) Jan-2021 Signature and date