Nitin Saxena

Nitin Saxena
Name	Nitin Saxena
Nationality	Indian
Fields	Computer science, Mathematics
Workplaces	Indian Institute of Technology Kanpur, IBM Research
Alma mater	Indian Institute of Technology Kanpur, University of Rochester, IIT Kanpur
Doctoral advisor	Valerie King
Known for	Work on polynomial identity testing, computational complexity

Nitin Saxena is an Indian computer scientist and mathematician known for contributions to computational complexity theory, algebraic algorithms, and polynomial identity testing. He has worked on algorithmic aspects of symbolic computation, randomness derandomization, and arithmetic circuit complexity, collaborating with researchers across institutions such as National Science Foundation, Microsoft Research, and IBM Research. His research intersects topics studied at conferences like the Annual ACM Symposium on Theory of Computing and the IEEE Symposium on Foundations of Computer Science.

Early life and education

Saxena was educated in India and abroad, studying at Indian Institute of Technology Kanpur where he completed undergraduate studies before pursuing graduate research at the University of Rochester. At Rochester he worked under the supervision of Valerie King, engaging with problems connected to scholars from the Massachusetts Institute of Technology and Princeton University. During his formative years he was influenced by work from researchers at Bell Labs, AT&T Labs, and by foundational results from the Erdős school and the Gödel Prize-winning literature on complexity. His education connected him with networks spanning Tata Institute of Fundamental Research, Stanford University, and University of California, Berkeley through seminars and collaborations.

Research and contributions

Saxena's research centers on algorithmic algebra and derandomization. He contributed to deterministic algorithms for problems motivated by seminal results of Richard Karp and concepts advanced by Leslie Valiant; his work engages with the framework of arithmetic circuit lower bounds championed by Valiant and developments by Nisan and Wigderson. A major theme in his work is polynomial identity testing (PIT), where he developed approaches influenced by techniques from Hilbert, Noether, and modern methods used by researchers at Carnegie Mellon University and University of California, San Diego. His contributions include deterministic PIT algorithms for restricted circuit classes, connections to rank-based methods, and the exploitation of structural properties of circuits to reduce randomness dependence—a pursuit aligned with programs at Clay Mathematics Institute and initiatives similar to those underpinning the P vs NP problem.

He also worked on algebraic independence, creating tools that relate to conceptions used by investigators at Harvard University and Yale University studying algebraic geometry and its algorithmic applications. Saxena's results have interplay with investigations into identity testing by researchers at Cambridge University and ETH Zurich, and with techniques from linear algebra leveraged at California Institute of Technology and University of Illinois Urbana-Champaign. His research has informed subsequent work on derandomization proposals by scholars linked to the Simons Institute for the Theory of Computing.

Academic career and positions

Saxena has held faculty and research positions including appointments at Indian Institute of Technology Kanpur and visiting roles at institutions like Microsoft Research and IBM Research. He completed postdoctoral and collaborative stays with groups at Rutgers University, University of Toronto, and Max Planck Institute for Informatics. As a professor, he taught courses reflecting curricula found at Indian Statistical Institute and coordinated seminars in conjunction with programs run by Institute for Mathematical Sciences (India). He has served on program committees for conferences such as the International Colloquium on Automata, Languages and Programming and the IEEE Conference on Computational Complexity, and participated in editorial activities for journals akin to the Journal of the ACM and the SIAM Journal on Computing.

Saxena has supervised graduate students who have gone on to positions at universities and research labs including Tata Consultancy Services Research, Infosys, and academia at IIT Bombay and IIT Madras. He has been involved in collaborative grants with agencies comparable to the Department of Science and Technology (India) and international funding bodies.

Awards and honors

Saxena's work has been recognized through invitations to speak at prominent venues such as workshops at the Simons Institute for the Theory of Computing and plenary talks at regional symposia modeled after the International Congress of Mathematicians. He has received research fellowships and institutional awards consistent with honors bestowed by IIT Kanpur and research exchange programs affiliated with Newton Fund-style collaborations. His publications have been cited in survey articles and compendia that reference the work of laureates of the Turing Award and recipients of the Gödel Prize.

Selected publications and works

- "Efficient algorithms for polynomial identity testing" — contributions published in proceedings of the Annual ACM Symposium on Theory of Computing and cited alongside work by N. Nisan and A. Wigderson. - Papers on algebraic independence and rank methods appearing in venues connected to the IEEE Symposium on Foundations of Computer Science and the Conference on Computational Complexity. - Collaborative articles with researchers from Microsoft Research and IBM Research on derandomization and arithmetic circuits, referenced in surveys at the Simons Institute for the Theory of Computing. - Contributions to edited volumes and lecture notes in series similar to those published by Springer as part of workshop proceedings involving participants from Carnegie Mellon University and University of California, Berkeley.

Category:Indian computer scientists Category:Theoretical computer scientists Category:IIT Kanpur faculty