Find Academic Supervisors

Oscar Randal-WilliamsView profile

Professor

• Algebraic Topology
• Geometric Topology
• Mapping Class Groups
• +8 more

Oscar Randal-Williams is the Sadleirian Professor of Pure Mathematics at the University of Cambridge, where he is affiliated with the Faculty of Mathematics and the Department of Pure Mathematics and Mathematical Statistics (DPMMS). His work is centered in the Differential Geometry & Topology research group, where he contributes to advancing knowledge in geometric and algebraic topology. Professor Randal-Williams specializes in Algebraic and Geometric Topology, with particular expertise in mapping class groups, moduli spaces, cobordism categories, spaces of manifolds, surgery theory, configuration spaces, characteristic classes, and K-theory. His research explores the deep connections between homotopy theory and geometric structures, with applications across various mathematical domains. His work often bridges abstract algebraic structures with concrete geometric problems, creating new frameworks for understanding topological phenomena. An analysis of Professor Randal-Williams' recent publications reveals a strong focus on homological stability phenomena, mapping class groups of high-dimensional manifolds, and the interplay between algebraic structures and geometric topology. His work frequently involves E ∞ -algebras, general linear groups, and the topology of diffeomorphism groups. A significant portion of his research investigates the structure of moduli spaces of manifolds and their connections to algebraic K-theory, with recent work extending to applications in mathematical physics through studies of symmetries in quantum field theories. Professor Randal-Williams maintains active collaborations with leading mathematicians worldwide, including Søren Galatius, Alexander Kupers, and Jeremy Miller, among others. His research has been published in top-tier mathematical journals including the Annals of Mathematics, Inventiones Mathematicae, and the Journal of the American Mathematical Society.

Stephen S. KudlaView profile

Professor

• Automorphic Forms
• Arithmetic Geometry
• Theta Functions
• +4 more

Stephen S. Kudla is a Professor in the Department of Mathematics at the University of Toronto, located in the Bahen Centre for Information Technology. He holds the prestigious distinction of being a Fellow of the Royal Society of Canada (FRSC), reflecting his significant contributions to mathematical research. Professor Kudla's research focuses on the deep connections between number theory and geometry, with particular expertise in automorphic forms, arithmetic geometry, and theta functions. His work bridges abstract mathematical theory with concrete geometric structures, exploring how modular forms can encode arithmetic information about algebraic varieties. Analysis of Kudla's publication record reveals a sustained research program centered on the relationship between derivatives of Eisenstein series and arithmetic geometry. His work consistently explores how modular and automorphic forms can be used to study arithmetic cycles on Shimura varieties. A notable pattern in his research is the interplay between analytic objects (like Eisenstein series) and geometric structures (such as arithmetic cycles), with applications to understanding heights, intersection theory, and special values of L-functions. Fellow of the Royal Society of Canada (FRSC) While specific details about Kudla's advising activities aren't provided in the available materials, his extensive publication record with prominent collaborators like Michael Rapoport and Tonghai Yang suggests he has likely mentored numerous graduate students and postdoctoral researchers throughout his career. His participation in major mathematical conferences including the International Congress of Mathematicians (ICM) indicates recognition by the broader mathematical community. Kudla's research has clearly been supported by significant funding, as evidenced by his ability to maintain a sustained publication record in top mathematical journals.

Tasho KalethaView profile

Professor

• Number Theory
• Representation Theory
• Algebraic Geometry
• +3 more

Tasho Kaletha is a Professor in the Department of Mathematics at the University of Michigan. His research focuses on the Langlands program, intersecting number theory, representation theory, algebraic geometry, and analysis. He holds a Ph.D. from the University of Chicago (2010). Key research interests include representation theory of reductive groups, harmonic analysis, Galois cohomology, and automorphic representations. Education: Ph.D., University of Chicago (2010). Research interests revolve around the Langlands conjectures, endoscopy, and the structure of reductive groups. His work addresses representation theory of real/p-adic groups, cohomology of Galois groups, and automorphic spectra. Recent publications explore Bruhat-Tits theory, discrete series L-packets, and global rigid inner forms. He has authored a monograph with Gopal Prasad and contributed to foundational papers in Duke Mathematical Journal and Inventiones Mathematicae . Notable contributions include studies on supercuspidal L-packets, endoscopic classification, and commensurability growth in algebraic groups. His work bridges abstract algebraic structures with analytic techniques, advancing the Langlands program's goals.

Nate FosterView profile

Professor

• Programming Languages
• Networking
• Databases
• +5 more

Nate Foster is a Professor of Computer Science at Cornell University and currently serves as the Associate Dean for Research in the Ann S. Bowers College of Computing and Information Science. He is also a Visiting Researcher at Jane Street and served as a Visiting Professor at École Polytechnique Fédérale de Lausanne during the 2023-24 academic year. His research uses ideas from programming languages to solve problems in networking, databases, and security. BA in Computer Science, Williams College (2001) MPhil in History and Philosophy of Science, University of Cambridge (2008, all work completed in 2003) PhD in Computer and Information Science, University of Pennsylvania (2009) Foster's research focuses on developing languages and tools that make it easy for programmers to build secure and reliable systems. His current work centers on the design and implementation of languages and tools for programmable networks, particularly using the P4 language. His past work includes bidirectional languages (also known as 'lenses'), database query languages, data provenance, type systems, mechanized proof, and formal semantics. His research group at Cornell has made significant contributions to network verification, software-defined networking, and formal foundations for programmable data planes. Analysis of Foster's recent publications reveals a strong focus on network verification and programming language foundations for networking. His work consistently applies formal methods to practical networking problems, with a particular emphasis on the NetKAT and P4 languages. Over the past five years, his research has evolved toward more complex network verification techniques, including infinite state verification, active learning of network models, and dependently-typed approaches to network programming. His work bridges theoretical computer science with practical networking systems, making formal methods accessible to network engineers. ACM Fellow (2025) ACM SIGPLAN Robin Milner Award (2023) ACM SIGCOMM Rising Star Award (2018) NSF CAREER Award (2013) Alfred P. Sloan Fellowship (2012) Multiple distinguished paper awards across top conferences including POPL, PLDI, and SIGCOMM Foster has advised numerous PhD and Master's students who have gone on to prominent positions in both industry and academia, with many continuing work in programming languages and networking. He has led multiple significant research grants including an NSF CAREER Award and has been involved in the P4 Language Consortium, serving as Chair of the P4 Language Governing Board. His work has been supported by various organizations including NSF, DARPA, and industry partners like Intel and Jane Street. Foster is also active in the programming languages research community, serving on numerous program committees and as Vice Chair of DARPA's Information Science and Technology (ISAT) study group. Foster leads a vibrant research group at Cornell focused on programming languages for networks, with collaborators from academia and industry. His group has developed several influential tools and frameworks including NetKAT, Petr4, and KATch. They maintain strong connections with the P4 community and work closely with industry partners to ensure their research has practical impact on real-world networking systems.

Ravi RamakrishnaView profile

Professor

• Algebra
• Galois Theory
• Algebraic Number Theory
• +2 more

Ravi Ramakrishna is a Professor of Mathematics at Cornell University, affiliated with the College of Arts and Sciences. He holds the Stephen H. Weiss Presidential Fellowship and specializes in algebraic number theory, particularly Galois theory. His research explores symmetries of equation solutions, focusing on the absolute Galois group of rational numbers and its connections to number theory, including contributions to the resolution of Fermat's Last Theorem. Education: Ph.D. (1992) in Mathematics from Princeton University. His teaching includes supervising graduate research through courses like MATH 4900 and 4901 in both Spring and Fall 2025 semesters. Research Interests: His work centers on Galois theory, algebraic number theory, and modular forms. Notable contributions include studies on class field towers, supercongruences in hypergeometric series, and deformation theory of Galois representations. His publications appear in top journals like the Annals of Mathematics and Advances in Mathematics. Scientific Awards: Stephen H. Weiss Presidential Fellow. Advising & Grants: Advises graduate students through supervised research programs. Active in mentoring through Cornell's Mathematics Department initiatives. Labs/Teams: Engaged in collaborative research within the Cornell Mathematics Department, contributing to interdisciplinary projects in number theory and algebra.

Aise Johan de JongView profile

Professor

• Algebraic Geometry
• Arithmetic Geometry
• Stacks Theory
• +4 more

Aise Johan de Jong is a Professor in the Department of Mathematics at Columbia University, where he teaches courses including representations of finite groups and organizes the algebraic geometry seminar. He is a leading figure in algebraic geometry with a particular focus on stacks theory and arithmetic aspects of algebraic varieties. Institution: Columbia University, Department of Mathematics Research Focus: Algebraic stacks, arithmetic geometry, moduli spaces Major Project: The Stacks Project (open-source collaborative textbook) De Jong's research primarily centers on algebraic stacks, arithmetic geometry, and the foundations of algebraic geometry. His work bridges abstract theoretical frameworks with concrete computational aspects, particularly in positive characteristic. He has made significant contributions to understanding Brauer groups, period-index problems, and the geometry of moduli spaces. His research often connects number theory with geometric structures, exploring how arithmetic properties manifest in geometric settings. His publication record shows a consistent focus on fundamental structures in algebraic geometry, with particular emphasis on stacks theory (evident in The Stacks Project), Brauer groups, rational connectivity, and arithmetic properties of algebraic varieties. The trajectory of his work demonstrates increasing sophistication in handling complex geometric structures while maintaining connections to arithmetic questions. His most recent work continues to explore the interplay between algebraic geometry and number theory, particularly through the lens of stacks and moduli spaces. De Jong actively mentors graduate students, with numerous descendants listed in the Mathematics Genealogy Project. His academic lineage includes researchers working across various subfields of algebraic geometry. He has organized multiple conferences including "Moduli spaces and moduli stacks" (2012) and "Spaces of curves and their interaction with diophantine problems" (2009), demonstrating his leadership in the field. He leads The Stacks Project, a major collaborative open-source initiative that has become an essential reference for algebraic geometers worldwide. This project provides comprehensive foundations for algebraic stacks and related concepts, with regular updates and community contributions. De Jong also maintains the Stacks Project Blog where he discusses mathematical topics related to the project and shares updates.

Jelena GrbicView profile

Professor

• Topology
• Algebra
• Combinatorics
• +6 more

Professor Jelena Grbic is a distinguished mathematician serving as Professor of Mathematics within the School of Mathematical Sciences at the University of Southampton since 2012. Her academic journey began with a B.Sc. in Mathematics from the University of Belgrade, Serbia in 1997, followed by a Ph.D. in Algebraic Topology from the University of Aberdeen in 2004. Prior to her current position, she held academic appointments at the University of Manchester (2007-2012) as Lecturer and Senior Lecturer, and at the University of Aberdeen (2004-2006) as Lecturer. Professor Grbic's research spans multiple interconnected domains of pure mathematics, with a primary focus on modern homotopy theory, particularly unstable homotopy theory, and its applications across topology, algebra, and geometry. Her work centers on decompositions and exponent problems in homotopy theory, homotopy aspects of Toric Topology, Hopf algebras, and geometric problems related to cobordisms and string topology. This research bridges abstract mathematical theory with potential applications in data science and computational topology. Analysis of her recent publications (2020-2025) reveals a consistent research trajectory in algebraic topology with increasing interdisciplinary connections. Her work demonstrates sophisticated mathematical techniques applied to complex topological structures, particularly moment-angle complexes and polyhedral products. Notably, her 2022 paper 'Aspects of topological approaches for data science' indicates growing interest in applying topological methods to contemporary data analysis problems, suggesting an expanding research horizon beyond pure mathematics. Professor Grbic actively supervises PhD students, including current student Salvatore Elia in Mathematical Sciences, and teaches modules covering algebraic topology and homotopy theory. She serves as a reviewer for prestigious journals including Homology, Homotopy and Application (2019), Transactions of the London Mathematical Society (2021), and The LMS Newsletter (2017), contributing to the scholarly community through peer review and academic service.

Paul LarsonView profile

Professor

• Set Theory
• Topology
• Model Theory
• +3 more

Paul Larson is a Professor of Mathematics at Miami University. His research focuses on set theory, topology, and model theory, with particular expertise in forcing axioms, descriptive set theory, and infinitary logic. He holds a Ph.D. in Mathematics from the University of California, Berkeley. His work bridges foundational mathematical logic with applications in topology and combinatorics. Key contributions include studies on canonical models under fragments of the Axiom of Choice, polar forcings, and cardinal characteristics. Larson has collaborated extensively with leading researchers such as Saharon Shelah and Jindřich Zapletal. His publications span prestigious journals like the Annals of Pure and Applied Logic and Transactions of the American Mathematical Society. Beyond research, he contributes to the academic community through editorial work and expository writings on historical developments in determinacy theory. Education: Ph.D., Mathematics, University of California, Berkeley Research interests emphasize foundational questions in set theory with applications to topology and model theory. His recent work explores advanced forcing techniques, square principles in Pmax extensions, and combinatorial properties of cardinal invariants. Publications reflect interdisciplinary engagement, including crystal structure prediction in high-pressure chemistry and operator theory in functional analysis. Despite an extensive publication record, no specific scientific awards are documented here. His advising and grant activities remain unspecified in the provided texts. Collaborations span international institutions, reflecting his role as a central figure in contemporary set theory research.

Sanjit A. SeshiaView profile

Professor

• Formal Methods
• Cyber-Physical Systems
• Computer Security
• +10 more

Sanjit A. Seshia is the Cadence Founders Chair Professor in the Department of Electrical Engineering and Computer Sciences at the University of California, Berkeley . He is affiliated with the Group in Logic and the Methodology of Science and participates in centers like the Industrial Cyber-Physical Systems Center , Berkeley AI Research , and the Simons Institute for the Theory of Computing . Research interests include formal methods for automated verification and synthesis of dependable systems, with applications to cyber-physical systems , AI-based autonomy , and computer security . His work spans SMT solving, model counting, syntax-guided synthesis, and algorithmic improvisation, with tools like UCLID5 , VerifAI , and Scenic for verifying autonomous systems and educational platforms like CPSGrader . Students and collaborators include notable researchers such as Dorsa Sadigh (Stanford), Daniel Fremont (UC Santa Cruz), and Hazem Torfah (Chalmers). He has co-founded startups like Decyphir and 20ⁿ Labs based on his research.

Supratik ChakrabortyView profile

Professor

• Formal Methods
• Formal Verification
• Automated Synthesis
• +7 more

Supratik Chakraborty serves as the Bajaj Group Chair Professor in the Department of Computer Science and Engineering at Indian Institute of Technology Bombay. He maintains dual affiliations with the Centre for Formal Design and Verification of Software and the Centre for Liberal Education at IIT Bombay, demonstrating his cross-disciplinary engagement. Professor Chakraborty's research spans formal methods with focus on formal verification, rigorous analysis of system models, and automated synthesis of systems from specifications. His work bridges theoretical foundations with practical applications, particularly in developing mathematically provable guarantees for increasingly complex hardware, software, and intelligent systems. Current research interests include constrained counting and sampling, scalable formal verification of software and hardware systems, automated synthesis of programs and circuits, and applications of automata, logic and finite model theory to practical verification challenges. His publication trajectory shows a significant evolution from traditional hardware and software verification toward addressing verification challenges in machine learning and AI systems. Recent work increasingly focuses on interpretability of black-box models, verification of neural networks, and synthesis techniques applicable to intelligent systems. The research demonstrates strong interdisciplinary connections between formal methods, programming languages, and artificial intelligence. IIT Bombay Excellence in Thesis (CSE) Award 2011 (for Bhargav Gulavani's thesis) IIT Bombay Excellence in Thesis (CSE) Award 2017 (for Abhisekh Sankaran's thesis) Best Paper in Algorithms and Architecture track at IEEE International Conference on Computer Design: VLSI in Computers and Processors, 1998 Professor Chakraborty has successfully supervised 11 doctoral students, with research spanning formal verification techniques, Boolean functional synthesis, constrained counting, and applications to hardware and software systems. His students have gone on to positions at major institutions including Microsoft Research, TCS Research, Georgia Tech, and BARC, reflecting the strong industry and academic impact of his mentorship. Current research directions show increasing emphasis on verification challenges posed by machine learning systems and AI. His research group at IIT Bombay, while not explicitly named in the materials, appears to focus on formal methods with strong connections to the Centre for Formal Design and Verification of Software. The group maintains active collaborations with international researchers including Moshe Y. Vardi at Rice University, and has made significant contributions to verification tools like VeriAbs that bridge theoretical advances with practical applications.

Laura AndersonView profile

Associate Professor

• Combinatorics
• Topology
• Matroid Theory
• +3 more

Laura Anderson is an Associate Professor in the Department of Mathematics at Binghamton University. She holds a Ph.D. from MIT (1994) and has been affiliated with Binghamton since 2001. Her research focuses on Combinatorics and Topology, with a specialization in matroid theory, hyperplane transversals, and topological combinatorics. She teaches advanced courses such as Introduction to Combinatorics (Math 511) and Discrete Mathematics (Math 314). Her academic contributions include groundbreaking work on oriented matroids, combinatorial Grassmannians, and hyperfield applications. Anderson has advised multiple Ph.D. students, including Olakunle Abawonse, Ulysses Alvarez, and Leandro Junes, whose theses explore topics like matroid extensions and tropical phased matroids. She actively participates in academic conferences, co-organizing the Binghamton University Graduate Conference in Algebra and Topology (BUGCAT). Anderson’s research integrates algebraic topology with discrete mathematics, addressing geometric realizations, hyperfield structures, and topological invariants. Her pedagogical innovations include experimenting with flipped classroom methods in calculus education. She maintains an active presence in academic service, contributing to journal reviews and editorial work in combinatorial geometry.

• Programming Language Theory
• Semantics of Programming Languages
• Domain Theory
• +7 more

Gordon Plotkin is a Professor at the School of Informatics, University of Edinburgh, where he is affiliated with the Laboratory for Foundations of Computer Science (LFCS). His research lies at the intersection of theoretical computer science and programming language semantics, with a profound influence on the formal understanding of computation. His research interests include Programming Language Theory, Semantics of Programming Languages, Domain Theory, Operational Semantics, Lambda Calculus, Type Theory, Concurrency Theory, and Algebraic Effects. His seminal work on structural operational semantics and domain theory has laid the foundation for modern semantics of programming languages. His publications span over five decades, showing a sustained and evolving research trajectory from foundational work in lambda calculus and domain theory to recent contributions in algebraic effects, probabilistic computation, and biochemical systems modeling. The articles demonstrate a consistent focus on formal methods, mathematical rigor, and the algebraic structure of computational effects. He has collaborated with leading researchers including Martín Abadi, John Power, Glynn Winskel, and John Reynolds. His work continues to influence both theoretical and practical developments in programming languages and systems. Gordon Plotkin has made foundational contributions to computer science, particularly through his development of structural operational semantics and domain-theoretic models of computation. He has advised numerous researchers and supervised many influential PhD theses, though specific student names are not listed in the provided text. His work has been supported by long-standing affiliations with the Laboratory for Foundations of Computer Science and the University of Edinburgh, and he has contributed to major collaborative projects in programming language design and verification. He is associated with several research groups and labs, most notably the Laboratory for Foundations of Computer Science (LFCS), which serves as a hub for theoretical research in programming languages, semantics, and logic at the University of Edinburgh.

Wolfgang KunzView profile

Professor

• Hardware Safety and Security
• Formal Hardware Verification
• Embedded Computing Systems
• +5 more

Wolfgang Kunz is a Full Professor (C4, W3) and Chair of Electronic Design Automation at the Technische Universität Kaiserslautern since 2001. His academic career spans multiple prestigious institutions, including Goethe-University Frankfurt/Main and the University of Massachusetts, Amherst. He has held leadership roles such as Dean (2005-2007) and Vice-Dean (2007-2009) at TU Kaiserslautern. Habilitation (Dr. rer. nat. habil.), Computer Science, University of Potsdam (1996) Doctoral degree (Dr.-Ing.), Electrical Engineering, University of Hannover (1992) Dipl.-Ing. degree, Karlsruhe Institute of Technology (1989) His research focuses on hardware verification, security, and optimization, particularly in embedded systems and processors. His work on formal verification methods has been commercialized by companies like Synopsys, Mentor Graphics, and Siemens EDA. His 2016-2021 publications address critical security issues such as Spectre/Meltdown and introduce innovative verification frameworks adopted by industry leaders like Infineon and OneSpin Solutions. Scientific awards include the IEEE Fellow (2006), German IT Society Award (2005), and TU Kaiserslautern Distinguished Teaching Award (2016). He has served on editorial boards of major journals and coordinated the Erasmus Mundus European Master Program in Embedded Computing Systems since 2010. Key students: Jörg Bormann, Raik Brinkmann, Tobias Ludwig Collaborations: Siemens EDA, Infineon, AbsInt, Intel SCAP Spin-offs: LUBIS EDA, OneSpin Solutions

Alex BlumenthalView profile

Assistant Professor

• Dynamical Systems
• Smooth Ergodic Theory
• Chaos Theory
• +3 more

Alex Blumenthal is an Assistant Professor in the School of Mathematics at the Georgia Institute of Technology since Fall 2020. His academic background includes a Ph.D. from New York University (2016) with a dissertation titled 'Nonuniformly hyperbolic theory for Banach space mappings.' Prior to joining Georgia Tech, he held positions as an instructor at the University of Maryland, teaching courses in probability theory, linear algebra, and precalculus, and served as a recitation leader at New York University for courses in chaos theory, differential equations, and analysis. Blumenthal's research focuses on dynamical systems and ergodic theory, with specialization in: Chaotic behavior in deterministic and stochastic systems Smooth ergodic theory and SRB measures Lyapunov exponents in random dynamical systems Stochastic fluid mechanics and turbulence modeling Infinite-dimensional dynamical systems on Banach spaces Statistical properties of complex systems His work bridges abstract mathematical theory with physical applications like fluid dynamics and statistical mechanics. Analysis of his recent publications shows strong emphasis on stochastic dynamics, Lyapunov exponents, and fluid mechanical systems, with mathematical techniques drawn from ergodic theory, functional analysis, and probability theory. His publications frequently appear in top mathematical physics and dynamics journals. No scientific awards or honors are mentioned in the source materials. Similarly, no information is available regarding research grants, student advising, or laboratory affiliations.

• Arithmetic Geometry
• Algebraic Geometry
• Number Theory
• +4 more

Dr. Niranjan Ramachandran is a Professor of Mathematics at the University of Maryland, College Park, specializing in the deep structural connections between Arithmetic Geometry and Number Theory. His work centers on motives, zeta functions, and algebraic cycles, with significant contributions to foundational conjectures in modern mathematics. His primary research domains include: Arithmetic Geometry Algebraic Geometry Number Theory Motives Zeta Functions Cohomology K-theory Prof. Ramachandran's research explores the intricate relationships between algebraic cycles, special values of L-functions, and motivic cohomology, advancing understanding of the Birch and Swinnerton-Dyer conjecture, Artin-Tate conjecture, and higher Euler characteristics through innovative approaches to zeta functions and motivic complexes. Analysis of his 15 most recent publications reveals sustained focus on zeta function special values (2023), derived categories of elliptic curves (2022), and Artin-Tate conjecture proofs (2022), with recurring themes in fiber integration of gerbes (2020), higher Euler characteristics (2016), and motivic measure exponentiation (2014). His work consistently bridges abstract motivic frameworks with concrete arithmetic problems. No scientific awards were documented in the provided materials. Information regarding academic advising, Ph.D. students, or research grants was not specified in the available text.