Find Academic Supervisors

Pradeesha AshokView profile

Associate Professor

• Theoretical Computer Science
• Algorithms
• Graph Theory
• +3 more

Dr. Pradeesha Ashok is an Associate Professor and Controller of Examinations at IIIT Bangalore. She holds a Ph.D. from the Indian Institute of Science, Bangalore, and previously worked as a Postdoctoral Fellow at the Institute of Mathematical Sciences, Chennai. Her research focuses on Theoretical Computer Science, with specializations in Algorithms, Graph Theory, Combinatorics, and Parameterized Complexity. Her research interests include geometric problems such as polygon guarding, covering, and packing, as well as conflict-free coloring in graphs and hypergraphs. She has contributed to developing exact and parameterized algorithms for these problems. Dr. Ashok has also taught courses like Exact and Parameterized Algorithms, Graph Theory, and Design and Analysis of Algorithms. Her publications span conferences like IWOCA, CSR, and COCOON, as well as journals such as Discrete Applied Mathematics and SIAM Journal on Discrete Mathematics. Her work emphasizes algorithmic efficiency and combinatorial optimization in geometric and graph-theoretic contexts. Dr. Ashok has advised several students, including PhD candidates and MTech thesis students, focusing on topics like the chromatic art gallery problem and parameterized complexity of coloring problems. She is affiliated with the Department of Computer Science & Engineering at IIIT Bangalore and contributes to the institute's academic governance through her role as Controller of Examinations. Her research also extends to geometric separability, bichromatic covering problems, and experimental studies of the Steiner Tree problem. She collaborates on projects involving theoretical and applied aspects of computational geometry and algorithms.

Sourav ChakrabortyView profile

Professor

• Theoretical Computer Science
• Boolean Functions
• Quantum Complexity
• +4 more

Sourav Chakraborty is a Professor in the Advanced Computing and Microelectronics Unit (ACMU) of the Computer and Communication Sciences Division at the Indian Statistical Institute (ISI), Kolkata, India. He joined ISI in July 2018 after serving as faculty at Chennai Mathematical Institute from 2010-2018. Previously, he held postdoctoral positions at Centrum Wiskunde & Informatica (CWI) in Amsterdam and Technion in Israel. Education: Ph.D. in Computer Science, University of Chicago (2008) M.S. in Computer Science, University of Chicago (2005) B.Sc. in Mathematics, Chennai Mathematical Institute (2003) Research Focus: Professor Chakraborty specializes in Theoretical Computer Science with emphasis on classical and quantum complexity of Boolean functions, including sensitivity analysis, property testing, and quantum database search. His work extends to graph algorithms, electronic commerce mechanisms, and coding theory. His research explores fundamental questions in computational complexity through innovative mathematical frameworks. Publication Trends: Recent work demonstrates a strong focus on property testing, sampling algorithms, and complexity theory, with significant contributions to streaming algorithms, Boolean function analysis, and quantum query complexity. His publications frequently appear in top theoretical computer science venues and exhibit consistent innovation in algorithm design and complexity boundaries. Awards & Honors: Praise from Donald E. Knuth for streaming algorithms research Inclusion in Oded Goldreich's 'my choices' list for Conditional Sampling and Huge-Object Model work Chakraborty's function named in his honor for Sensitivity Conjecture contributions Academic Service: Teaches courses in discrete mathematics and theoretical computer science, with detailed course materials available through institutional pages. Organized workshops including the 2020 Workshop on Sensitivity and Query Complexity at ISI.

Somindu Chaya RamannaView profile

Assistant Professor

• Cryptography
• Cryptographic Protocols
• Algorithmic Game Theory
• +3 more

Somindu Chaya Ramanna is an Assistant Professor in the Department of Computer Science and Engineering at IIT Kharagpur. Previously, he held a postdoctoral position at ENS de Lyon (2015–2016) and served as an assistant professor on contract at IIT Bhubaneswar. His research focuses on cryptography, computational number theory, and algorithmic game theory. He completed his Ph.D. at the Indian Statistical Institute under Prof. Palash Sarkar. Education: Ph.D. in Cryptography, Indian Statistical Institute, Kolkata (Advisor: Prof. Palash Sarkar) Postdoc at ENS de Lyon, France (2015–2016) Research Interests: Design and analysis of cryptographic primitives Functional encryption schemes Algorithmic game theory applications Computational number theory algorithms Efficient cryptographic protocols Teaching & Courses: Algorithmic Game Theory (CS60025) Foundations of Cryptography (CS60088) Computational Number Theory (CS60094) Randomised Algorithm Design (CS60029)

Manoj M. PrabhakaranView profile

Professor

• Cryptography
• Secure Multi-Party Computation
• Theoretical Computer Science
• +9 more

Manoj M. Prabhakaran is the Vijay and Sita Vashee Chair Professor at the Indian Institute of Technology Bombay in the Department of Computer Science and Engineering , and an Adjunct Professor at the University of Illinois, Urbana-Champaign . His research spans Cryptography, Theoretical Computer Science, Algorithms, and Complexity Theory , with a focus on Secure Multi-Party Computation (MPC) and Zero-Knowledge Proofs . As Principal Investigator of the IITB Trust Lab , he has organized major events like the 2017 MPC School and Workshop . Education: Ph.D. in Computer Science His work explores foundational questions in Cryptography , including Randomness Complexity , Non-malleable Codes , and Homomorphic Encryption . Recent publications address Leakage-Resilient Cryptography and Interactive Proofs . He advises Ph.D. students like Debasish Ray Chawdhuri and Kaartik Bhushan , and his email is publicly listed.

SurajView profile

Assistant Professor

• Data Management
• Fairness
• Computational Geometry
• +3 more

Suraj is an Assistant Professor in the Department of Computer Science and Engineering at the Indian Institute of Technology Bombay, where he joined on January 31, 2024. He completed his PhD from the University of Texas at Arlington under the supervision of Dr. Gautam Das. His educational background includes: PhD in Computer Science and Engineering, University of Texas at Arlington Suraj's research spans Data Management, Fairness, Computational Geometry, Graph Algorithms, and Metric Space, with a focus on designing efficient algorithms for complex systems. His work bridges theoretical computer science with practical applications in data-intensive domains, emphasizing ethical considerations in algorithmic design and geometric problem-solving approaches. Analysis of his recent publications reveals a strong interdisciplinary trajectory merging computer science with active matter physics. Key trends include topological defect dynamics in biological systems, geometric control of physical phenomena, and pattern formation in non-equilibrium active matter - demonstrating significant crossover between algorithmic thinking and biophysical modeling. No scientific awards or fellowships are mentioned in the available materials. Suraj advises graduate students in the Department of Computer Science and Engineering, with research supported by institutional grants enabling his dual focus on data management systems and active matter physics. His collaborative work spans computer science and biophysics laboratories. He is actively integrated into IIT Bombay's research ecosystem, collaborating across departments on projects that unite computational theory with physical modeling of complex systems.

• Algorithms
• Combinatorics
• Complexity Theory
• +3 more

Sundar Vishwanathan is a Professor in the Department of Computer Science and Engineering at Indian Institute of Technology Bombay (IIT Bombay), where he has established himself as a leading researcher in theoretical computer science. His academic career spans over three decades with consistent contributions to algorithms, combinatorics, and complexity theory. His research interests form a cohesive body of work focused on theoretical foundations of computing: Algorithms (particularly approximation algorithms, online algorithms, and randomized algorithms) Combinatorics and extremal set theory Complexity theory and circuit lower bounds Graph theory and graph algorithms Combinatorial optimization problems Vishwanathan's publication record demonstrates remarkable consistency and depth, with publications spanning from 1990 to 2024. His recent work focuses on graph algorithms (particularly maximum matching problems), approximation algorithms for combinatorial optimization, and circuit complexity. He has developed innovative techniques using linear algebra, combinatorial methods, and probabilistic analysis to solve challenging theoretical problems. His approach often bridges theoretical insights with practical algorithmic considerations. His collaborative work spans multiple research groups, with frequent co-authorships with researchers such as Ashish Chiplunkar, Sumedh Tirodkar, and Sreyash Kenkre. His research has evolved from foundational work in online graph coloring in the 1990s to more specialized topics in combinatorics and recently to circuit lower bounds, showing both depth in core areas and adaptability to evolving research landscapes.

Ashutosh TrivediView profile

Associate Professor

• Formal Methods
• Cyber-Physical Systems
• Reinforcement Learning
• +5 more

Ashutosh Trivedi is an Associate Professor of Computer Science at the University of Colorado Boulder, currently on leave from his position as Assistant Professor in the Department of Computer Science and Engineering at the Indian Institute of Technology Bombay. He is affiliated with multiple research initiatives including the Centre for Formal Design and Verification of Software (CFDVS) at IIT Bombay, Free and Open Source Software for Education (FOSSEE), and the Indo-French project on Algorithmic Verification of Real-Time Systems (AVeRTS). At CU Boulder, he leads the Programming Languages and Verification (CUPLV) research group focusing on trustworthy AI systems. Trivedi's research centers on bridging formal methods with artificial intelligence to create more trustworthy systems. His work spans formal verification of cyber-physical systems, reinforcement learning with formal guarantees, and developing techniques for ensuring software fairness and accountability. He specializes in using formal languages, automata, and logic to transform vague natural-language instructions into precise specifications for AI systems. His recent projects include developing reinforcement learning algorithms for cardiac pacemaker design based on formal safety requirements, using SAT solvers to ground large language model outputs in logical reasoning, and encoding state representations in reinforcement learning using formal languages. His publication trends reveal a strong focus on neurosymbolic approaches that combine neural networks with symbolic reasoning, particularly for safety-critical applications. Recent work demonstrates increasing integration of formal methods with reinforcement learning, with applications spanning medical devices, tax preparation software, and puzzle-solving AI. His research shows a clear trajectory toward making AI systems more explainable, accountable, and verifiable through principled mathematical frameworks. Distinguished Paper Award at CAV for Regular Reinforcement Learning (2024) NeuS 2025 Disruptive Idea Award for Stochastic Neural Simulation Relations for Transferring Control under Uncertainty ACM Senior Member recognition (2024) Royal Society Wolfson Visiting Fellowship (2024) Trivedi has successfully advised multiple PhD students to completion, including Shadi Tasdighi Kalat (2025), Mateo Perez (2025), John Komp (2024), Vishnu Murali (2024), and Taylor Dohmen (2024). His teaching portfolio includes foundational courses in automata theory, digital logic design, and cyber-physical systems at both IIT Bombay and CU Boulder. He has served on program committees for major conferences including FSTTCS, HSCC, and FORMATS, and organized workshops such as ICLA 2015 and ALC 2015. As leader of the CUPLV research group, Trivedi directs projects focused on formal verification of AI systems, reinforcement learning with safety guarantees, and software fairness. His group collaborates with medical researchers on cardiac device verification and with legal scholars on tax software accountability, reflecting his commitment to applying formal methods to real-world problems with significant societal impact.

Lakshmi Prasad NatarajanView profile

Associate Professor

• Coding for Distributed Computation and Storage
• Index Coding with Side Information
• Network Coding for Wireless Systems
• +3 more

Lakshmi Prasad Natarajan is an Associate Professor in the Department of Electrical Engineering at the Indian Institute of Technology Hyderabad. His research focuses on coding techniques for distributed computation and storage, network coding, wireless communications, and applied mathematics. He earned his Ph.D. from the Indian Institute of Science (IISc) in Bengaluru. His research interests include: Coding for distributed computation and storage Index coding with side information Network coding for wireless systems Space-time codes Wireless communication & networks Applied mathematics Recent work involves developing capacity-achieving codes (BiD Codes, Recursive Subproduct Codes) for 6G communication systems. He actively mentors PhD candidates, emphasizing theoretical research in code constructions and decoder design under the Qualcomm 6G University Research India Program. He acknowledges support from: Department of Science and Technology, Government of India Science and Engineering Research Board, Government of India Qualcomm Inc. He collaborates on projects targeting next-generation communication systems, focusing on algebraic coding and channel optimization. The group provides rigorous theoretical training and academic mentorship to students.

Nitin SaurabhView profile

Assistant Professor

• Theoretical Computer Science
• Complexity Theory
• Analysis of Boolean Functions
• +2 more

Nitin Saurabh is an Assistant Professor in the Department of Computer Science & Engineering at the Indian Institute of Technology Hyderabad. His research focuses on foundational areas of theoretical computer science, including complexity theory, analysis of Boolean functions, circuit complexity, and algorithm design. Education: Ph.D. from Institute of Mathematical Sciences (IMSc), Chennai Research Interests: Theoretical Computer Science Complexity Theory Analysis of Boolean Functions Circuit Complexity Algorithms

Rakesh VenkatView profile

Assistant Professor

• Theoretical Computer Science
• Approximation Algorithms
• Hardness of Approximation
• +1 more

Rakesh Venkat is an Assistant Professor in the Department of Computer Science and Engineering at the Indian Institute of Technology Hyderabad. His research focuses on Theoretical Computer Science, including approximation algorithms, hardness of approximation, and communication complexity. Education : Ph.D., Tata Institute of Fundamental Research (TIFR), Mumbai. Research Trends : His work addresses fundamental challenges in algorithm design, such as optimizing cache misses, improving clustering algorithms, analyzing graph expansion, and exploring embedding techniques. Publications span top-tier conferences like APPROX, FSTTCS, ICALP, and ITCS, with collaborations at institutions including HUJI, TIFR, and IIT-Bombay. Teaching : Courses taught include Approximation Algorithms, Advanced Data Structures, Discrete Mathematics, and Spectral Graph Theory.

• Computer Architecture

Mainak Chaudhuri serves as a Professor in the Department of Computer Science and Engineering at the Indian Institute of Technology Kanpur, where he specializes in computer architecture research and teaching. Doctor of Philosophy, Cornell University, 2004 Master of Science, Cornell University, 2001 Bachelor of Technology, Indian Institute of Technology Kharagpur, 1999 Professor Chaudhuri's research focuses exclusively on computer architecture, with particular expertise in cache management systems, memory hierarchy optimization, and processor design. His work addresses critical challenges in modern computing systems where efficient memory access patterns significantly impact overall system performance across various computing platforms. His recent publications demonstrate consistent contributions to cache management research, particularly in last-level cache algorithms for both traditional processors and graphics processing units. The publications show an evolving research trajectory from general cache algorithms toward specialized implementations for graphics workloads, indicating strategic expansion of his research domain while maintaining core expertise in memory systems. Best paper award in the 11th IEEE International Symposium on High-Performance Computer Architecture, February 2005 While specific details about graduate student supervision aren't provided in the available documentation, his publication record suggests active research mentorship within computer architecture. The absence of explicit grant information in the source material prevents detailed commentary on funded research projects, though his award-winning work indicates successful research proposal development. Though not explicitly mentioned in the source documents, his specialization in computer architecture suggests potential involvement with computer systems laboratories at IIT Kanpur where architectural simulations and hardware implementations would be conducted, supporting both his research and educational mission in advanced computing systems.

Swarnendu BiswasView profile

Assistant Professor

• Programming Languages
• Compilers
• Runtime Systems
• +7 more

Swarnendu Biswas is an Assistant Professor in the Department of Computer Science and Engineering at the Indian Institute of Technology Kanpur. He teaches courses including Programming for Performance (CS 610), Analysis of Concurrent Programs (CS 636), and Compiler Design (CS 335), demonstrating his expertise across multiple areas of computer systems. His research interests center on Programming Languages, Compilers, Runtime Systems, and Parallel Software Systems. He leads the PROSPAR (Programming Languages and PARallel Systems) research group, which focuses on developing techniques to build efficient and correct parallel software through program analysis, compiler optimizations, and runtime systems. His recent publications reveal a strong trend in addressing fundamental challenges in parallel computing, with work spanning cache coherence, false sharing detection, data race analysis for GPUs, verification of neural networks, and thermal-aware management of heterogeneous systems. His research bridges theory and practice with significant contributions to both hardware and software aspects of parallel systems. His scientific achievements have been recognized through multiple prestigious awards: Google India Research Award 2021 Google Explore CSR 2022 Research Grant from Intel Corporation SERB Start-up Research Grant 2019 Google Cloud Platform Research Credits (2019, 2020) IITK Initiation Grant 2019 As an advisor, he mentors several PhD and MTech students working on cutting-edge research in parallel systems. His PROSPAR group has secured significant funding from industry and government sources, supporting innovative research in programming languages and parallel systems. The group actively collaborates with industry partners including Google and Intel, addressing real-world challenges in parallel computing. He leads the PROSPAR research group at IIT Kanpur, which brings together faculty, PhD students, and MTech researchers to tackle challenging problems at the intersection of programming languages, compilers, and parallel systems. The group maintains strong industry connections and focuses on practical solutions that can be deployed in real systems.

NavroseView profile

Assistant Professor

• Fluid Mechanics
• Aerodynamics
• Fluid-Structure Interaction
• +2 more

Navrose is an Assistant Professor in the Department of Aerospace Engineering at the Indian Institute of Technology Kanpur (IIT Kanpur), a premier technical institution in India. He joined IIT Kanpur as an Assistant Professor in April 2018 after working as a Researcher at ONERA from October 2016 to March 2018. His educational background is deeply rooted at IIT Kanpur: PhD in Aerospace Engineering, IIT Kanpur (2016) M.Tech in Aerospace Engineering, IIT Kanpur (2010) B.Tech in Aerospace Engineering, IIT Kanpur (2010) Navrose specializes in Fluid Mechanics and Aerodynamics, with particular expertise in Fluid-Structure Interaction, Optimization, and Computational Fluid Dynamics. His research focuses on understanding complex fluid flow phenomena, particularly vortex-induced vibrations, flow instabilities, and three-dimensional flow behaviors. He employs advanced computational techniques to model and analyze these phenomena, contributing significantly to the field of fluid dynamics. His publication record shows a strong focus on vortex-induced vibrations and fluid-structure interaction problems. Over the period from 2015 to 2019, he has published multiple high-impact papers in the Journal of Fluid Mechanics and other prestigious fluid dynamics journals. His work often involves collaboration with Professor Sanjay Mittal and other researchers in the field, demonstrating a collaborative research approach. Navrose maintains an active research program in the Department of Aerospace Engineering at IIT Kanpur, working from the Helicopter Building on campus. His work contributes to both fundamental understanding of fluid dynamics phenomena and potential applications in aerospace engineering design.

Rakesh KumarView profile

Professor

• Hypersonics
• Rarefied Gas Dynamics
• Microfluidics
• +2 more

Rakesh Kumar is a Professor in the Department of Aerospace Engineering at the Indian Institute of Technology Kanpur (IIT Kanpur), a premier technical institution in India. His academic journey includes a PhD from The Pennsylvania State University, establishing him as a recognized expert in his field. PhD, Aerospace Engineering, The Pennsylvania State University, 2011 M.Tech, Aerospace Engineering, Indian Institute of Technology Bombay, 2003 B.Tech, Mechanical Engineering, G.B. Pant University of Agriculture and Technology, 2001 Professor Kumar's research spans several critical areas in aerospace engineering, with particular focus on Hypersonics, Rarefied Gas Dynamics, Microfluidics, and Heat Transfer & Thermal Design . His work bridges theoretical concepts with practical applications in high-speed flows and thermal management systems. His research demonstrates strong computational expertise combined with experimental validation approaches. His recent publications reveal a consistent focus on computational fluid dynamics, particularly in the areas of gas dynamics, condensation phenomena, and multi-scale flow modeling. His work often involves complex numerical methods applied to challenging aerospace problems. AIAA David Weaver Outstanding Thermophysics Paper Award (2009) College of Engineering Fellowship, Penn State University (2008-09) As an educator, Professor Kumar has taught a range of courses from foundational aerospace engineering to specialized topics in molecular gas dynamics and computational methods. His teaching portfolio reflects both breadth and depth across the aerospace engineering curriculum.

• Theoretical Computer Science
• Computational Complexity Theory
• Computational Number Theory
• +2 more

Manindra Agrawal is a Professor in the Department of Computer Science and Engineering at the Indian Institute of Technology Kanpur (IIT Kanpur), where he has been a faculty member since 1996. His research focuses on theoretical aspects of computer science with particular emphasis on computational complexity theory and computational number theory. Dr. Agrawal completed his B.Tech in Computer Science from IIT Kanpur in 1986 and his PhD in Computer Science from the same institution in 1991. His doctoral thesis, titled "Towards a Characterization of NP-Complete Sets," was supervised by Professor Somenath Biswas. His research interests span computational complexity theory, computational number theory, algebra, and cryptography. Dr. Agrawal is best known for designing the first efficient and deterministic algorithm for testing if a number is prime, a groundbreaking result published in the Annals of Mathematics in 2004 as "PRIMES is in P." This work has had a profound impact on theoretical computer science and number theory, resolving a long-standing open problem in the field. His publication record shows a consistent focus on fundamental problems in theoretical computer science, particularly in complexity theory and number-theoretic algorithms. His work ranges from theoretical foundations like the isomorphism conjecture for constant depth reductions to practical applications such as designing encryption algorithms for the Indian Navy and Air Force. Padma Shri (2013) Infosys Prize (2008) Godel Prize (2006) Shanti Swarup Bhatnagar Award (2003) Clay Research Award (2002) Fellow of the Indian National Science Academy (FNA) Fellow of The World Academy of Sciences (FTWAS) Fellow of the Indian Academy of Engineering (FNAE) Fellow of the Indian Academy of Sciences (FASc) Dr. Agrawal has advised several notable students, including Nitin Saxena and Satyadev Nandkumar, who have made significant contributions to theoretical computer science. His research group has been instrumental in advancing knowledge in computational complexity and number theory. His work on primality testing has not only theoretical significance but has also influenced practical cryptographic applications.