Find Academic Supervisors

Prof. Dr. Guido Kings is a Professor of Pure Mathematics at the Faculty of Mathematics, University of Regensburg. His research focuses on Special Values of L-functions , Tamagawa Number Conjecture , and Polylogarithms , with significant contributions to Iwasawa Theory and Arithmetic Geometry . He has held leadership roles in research projects such as the CRC Higher Invariants. Prof. Kings has authored influential papers on topics like Eisenstein-Kronecker classes , p-adic interpolation , and regulators in arithmetic geometry . He received the Frontier of Science Award in recognition of his work. His team includes doctoral students and postdoctoral researchers, such as Bernadette Melichar and Julio de Mello Bezerra. Current Affiliations: Faculty of Mathematics, University of Regensburg Recent Courses Taught: Analysis II, Advanced Seminar in Arithmetic Geometry, and Modular Forms Research Group: Comprises scientific staff (e.g., Han-Ung Kufner) and doctoral students working on number theory and algebraic geometry. His publications are widely cited in Annals of Mathematics , Duke Mathematical Journal , and Inventiones Mathematicae , reflecting his expertise in connecting motivic cohomology with p-adic analysis.

• Special Values of L-functions
• Tamagawa Number Conjecture
• Polylogarithms
• +3 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.

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

Dr. Lucas Pahl is a Lecturer in Economics at the University of Sheffield, School of Economics since 2024. His research specializes in mathematical game theory, particularly in equilibrium refinements, fixed point theory, and real algebraic geometry. He holds a PhD in Economics from the University of Rochester, an MSc in Mathematics from IMPA (Brazil), and a BSc in Social Sciences from the University of São Paulo. Previous positions: Postdoctoral Scholar at Hausdorff Institute for Mathematics and Institute for Microeconomics, University of Bonn His research interests include advanced topics like fixed point theory applications in game theory, algebraic topology intersections with economic models, and equilibrium refinement methodologies. Recent work explores information spillover in zero-sum games and polytope-form game structures. Key publications focus on O’Neill’s theorem extensions, sustainable equilibria analysis, and finite characterizations of perfect equilibria. He serves as a reviewer for top journals including Econometrica and Games and Economic Behavior. No scientific awards explicitly mentioned. His advisory and grant activities remain unspecified in current records. Labs/teams: No lab affiliations explicitly stated in provided information.

• Mathematical Game Theory
• Fixed Point Theory
• Algebraic Topology
• +3 more

John F. Canny is the Paul and Stacy Jacobs Distinguished Professor of Engineering at the University of California, Berkeley, in the Department of Electrical Engineering and Computer Science (EECS). He joined the faculty in 1987 and is affiliated with the Berkeley Artificial Intelligence Research Lab (BAIR), Berkeley Center for New Media (BCNM), and other research institutes. His research focuses on artificial intelligence, robotics, human-computer interaction, and computational geometry. Canny is renowned for developing the Canny edge detector and contributions to motion planning, privacy-preserving algorithms, and real-time simulation. Education: B.Sc. in Computer Science and Theoretical Physics (Adelaide University, 1979), B.E. (Hons) in Electrical Engineering (Adelaide University, 1980), M.S. and Ph.D. in Electrical Engineering (MIT, 1983 and 1987). Research Interests: His work spans AI, robotics (including universal planar manipulation), HCI (e.g., MultiView video conferencing), and security (privacy in collaborative filtering). He has pioneered algorithms for edge detection, non-linear FEM simulation, and computational algebra. Awards: ACM Fellow (2020), Okawa Research Grant (2003), AAAI Classic Paper Award (2002), NSF PYI (1989), Packard Fellowship (1988), and ACM Doctoral Dissertation Award (1987). Advising & Grants: Advised over 30 Ph.D. students, many of whom hold prominent roles in academia and industry. His grants include NSF and Packard funding for foundational research in robotics and computational methods. He currently teaches CS188: Introduction to Artificial Intelligence. Labs/Teams: Leads research at the Berkeley Institute of Design (BiD), focusing on RISC robotics, activity-based computing, and privacy-enhanced telepresence systems.

• Artificial Intelligence
• Robotics
• Human-Computer Interaction
• +5 more

Jonathan A. Kelner is a Professor of Applied Mathematics in the Department of Mathematics at the Massachusetts Institute of Technology (MIT) and a member of the MIT Computer Science and Artificial Intelligence Laboratory (CSAIL). His research focuses on applying techniques from pure mathematics to solve fundamental problems in algorithms and complexity theory, with the goal of developing practical algorithms for real-world questions. Dr. Kelner received his undergraduate degree from Harvard University and his Ph.D. in Computer Science from MIT in 2006. Before joining the MIT faculty, he spent a year as a member of the Institute for Advanced Study. His educational background has provided a strong foundation for his interdisciplinary research spanning mathematics and computer science. His research interests include combinatorial optimization, mathematical programming, spectral graph theory, distributed computing, machine learning, computational geometry and topology, computational biology, signal processing, and random matrix theory. Kelner's work demonstrates how deep theoretical insights can lead to practical algorithmic improvements, particularly in graph algorithms and optimization problems. His approach often involves connecting seemingly disparate areas of mathematics to create novel algorithmic techniques. Analysis of his recent publications reveals a strong focus on spectral graph theory, optimization algorithms, and the Sum-of-Squares method. His work frequently addresses fundamental questions in theoretical computer science with practical implications for algorithm design. A notable trend in his research is the development of nearly-linear-time algorithms for various graph problems, which represents significant improvements over previous approaches. NSF CAREER Award Alfred P. Sloan Research Fellowship NEC Award for Research in Computers and Communication Sprowls Doctoral Dissertation Award Best Student Paper Award at STOC 2004 Best Paper Award at STOC 2011 Kokusai Denshin Denwa Junior Faculty Chair 2008 Harold E. Edgerton Faculty Achievement Award 2011 School of Science Award for Excellence in Undergraduate Education 2012 Professor Kelner has been actively involved in mentoring students and has received recognition for his teaching excellence, including the School of Science Award for Excellence in Undergraduate Education in 2012. His research has been supported by prestigious grants including the NSF CAREER Award. He has collaborated extensively with researchers across multiple institutions, often working with other leading figures in theoretical computer science to produce groundbreaking results in algorithm design. At MIT, Kelner is part of both the Mathematics Department and CSAIL, positioning him at the intersection of theoretical mathematics and practical computer science. This dual affiliation reflects the interdisciplinary nature of his work, which bridges pure mathematical theory with concrete algorithmic applications.

• Algorithms
• Spectral Graph Theory
• Combinatorial Optimization
• +7 more

Ivan Dokmanic is an Assistant Professor at the Coordinated Science Laboratory (CSL) within the University of Illinois . His research bridges signal processing , machine learning , and applied inverse problems , with a focus on acoustics, biomedical imaging, and distance geometry. Current Role : Assistant Professor, CSL Email : dokmanic@illinois.edu Research Interests : Dokmanic explores machine learning applications in inverse problems , particularly distance geometry for molecular imaging and acoustics . His work includes unlabeled sensing , where distances between points are known but their arrangement is not. This has implications for powder diffraction , indoor localization , and echo modeling . Article Trends : His recent publications emphasize distance geometry in machine learning , acoustic signal processing , and inverse problem theory . Key areas include molecular imaging , audio encryption , and sensor positioning . Collaborative work spans medical imaging , cyberphysical systems , and geometric invariants . 2016 Google Faculty Award NSF Grant (1 year, $157,079) Students and Grants : Dokmanic mentors PhD students like Puoya, Shuai, and Anadi. His research is funded by the National Science Foundation , Google , VISA , and nVidia .

• Machine Learning
• Signal Processing
• Inverse Problems
• +11 more

Haruzo HIDA is a Distinguished Research Professor of Mathematics at the University of California, Los Angeles (UCLA). His work spans advanced topics in Number Theory, Modular Forms, Galois Representations, and Arithmetic Geometry. HIDA has held significant positions globally, including lectures and research visits at institutions in India, China, Japan, and Europe. University: University of California, Los Angeles Department: Mathematics Academic Rank: Research Professor Research Interests: HIDA’s research focuses on complex and p-adic Number Theory, Modular Forms, and their connections to Galois Representations, Iwasawa Theory, L-functions, and Automorphic Forms. His recent work addresses adjoint L-values, Selmer groups, and the interplay between arithmetic invariants and geometric structures. Publications: HIDA’s recent articles (2014-2025) explore themes like Hecke algebras, anticyclotomic Iwasawa theory, Tate-Shafarevich groups, and p-adic rigidity. His work often bridges modular forms with arithmetic geometry and automorphic representations. Students: He has supervised numerous PhD students, including Koji Kitagawa, Chandrashekhar Khare, Eknath Ghate, Ashay Burungale, and Jaclyn Lang, contributing to their research in topics like modular forms and arithmetic geometry. Grants: His research has been partially supported by NSF grants, documented across multiple publications and lecture notes.

• Number Theory
• Modular Forms
• Galois Representations
• +5 more

Henri Darmon is a Distinguished James McGill Professor in the Department of Mathematics and Statistics at McGill University, affiliated with the Centre Interuniversitaire en Calcul Mathématique Algébrique (CICMA) and the Centre de Recherches Mathématiques (CRM). He holds citizenships of Canada, France, and Switzerland. His research focuses on algebraic number theory, particularly elliptic curves, modular forms, and L-functions, with contributions to the Birch and Swinnerton-Dyer conjecture and Stark conjectures. Education: B.Sc. Mathematics & Computer Science, McGill University (1987) Ph.D. Mathematics, Harvard University (1991) Key Positions: Director of CICMA (1998–2024) Editorial roles at journals like Commentarii Mathematici Helvetici and Transactions of the AMS Organizer of major conferences including CNTA, ICM satellite events, and thematic programs at MSRI and CRM Research Interests: Stark-Heegner points and Euler systems p-adic L-functions and Iwasawa theory Arithmetic of modular curves and Shimura varieties His work bridges analytic and algebraic approaches to number theory, emphasizing computational and geometric methods.

• Number Theory
• Algebraic Geometry
• Elliptic Curves
• +3 more

Jose Israel Rodriguez is an Associate Professor in the Department of Mathematics at the University of Wisconsin-Madison. His research bridges applied algebraic geometry and algebraic statistics, focusing on nonlinear algebra, maximum likelihood estimation, monodromy, and polynomial systems in engineering and science applications. Primary Affiliation: Department of Mathematics , UW-Madison Additional Affiliations: Department of Electrical & Computer Engineering , Institute for Foundations of Data Science Research Interests : Applied algebraic geometry for nonlinear eigenvalue problems and kinematics Algebraic statistics in nearest point problems and likelihood geometry Numerical methods for monodromy, Galois groups, and polynomial optimization Teaching and Mentorship : Co-organized the Collaborative Undergraduate Research Laboratory (CURL) for Spring 2020 Advises PhD students Julia Lindberg and Zinan Wang , with Bernd Sturmfels as his own PhD advisor Developed software tools like Multiregeneration and Decomposable Sparse Polynomial Systems Academic Contributions : Authored over 20 peer-reviewed publications in journals like SIAM Journal on Applied Algebra and Geometry, Foundations of Computational Mathematics, and Journal of Symbolic Computation Organized international conferences including Monodromy and Galois Groups in Enumerative Geometry and SIAM AG19 Active member of the SIAM community and developer of the Matroids Day seminar

• Applied Algebraic Geometry
• Algebraic Statistics
• Nonlinear Algebra
• +7 more

Euiwoong Lee is an Assistant Professor in the Computer Science and Engineering Division at the University of Michigan. He holds a PhD from Carnegie Mellon University, advised by Venkatesan Guruswami, and has held postdoctoral positions at New York University and the Simons Institute for the Theory of Computing. His research focuses on approximation algorithms, hardness of approximation, and parameterized complexity. **Education:** PhD in Computer Science, Carnegie Mellon University (2017), advised by Venkatesan Guruswami Postdoctoral Fellowships: NYU (2017–2020), Simons Institute (2017–2020) **Research Interests:** Approximation Algorithms & Hardness of Approximation Convex Hierarchies (e.g., Sum-of-Squares) Clustering Algorithms (e.g., Correlation Clustering) Parameterized Complexity Facility Location & Metric Optimization **Awards:** Edmund M. Clarke Doctoral Dissertation Award (2017) Simons Award for Graduate Students in Theoretical Computer Science **Advising & Grants:** PhD Students: Anthony Della Pella, Aditya Anand, Amatya Sharma, Ian DeHaan Co-organizes the Michigan Theory Seminar **Labs/Teams:** Collaborates with researchers in approximation algorithms, optimization, and theoretical computer science at the University of Michigan and beyond.

• Approximation Algorithms
• Hardness of Approximation
• Discrete Optimization
• +3 more

Patrick Allen is an Associate Professor in the Department of Mathematics and Statistics at McGill University, where he contributes to research in number theory and related fields. He is affiliated with the Montreal Number Theory Group and the Centre Interuniversitaire en Calcul Mathématique Algébrique (CICMA), focusing on areas such as Galois representations, automorphic forms, and algebraic number theory. His work bridges algebraic geometry and arithmetic, with a particular emphasis on modularity lifting theorems and deformation theory. Allen's research interests include the study of CM fields, modular forms, and elliptic curves, alongside investigations into the Langlands program and p-adic methods. He has published extensively on topics such as potential automorphy, monodromy, and adjoint Selmer groups. His contributions address questions in arithmetic algebraic geometry and cohomological automorphic forms, often intersecting with representation theory. While his articles span over 20 years, recent work (2020–2023) emphasizes the modularity of Galois representations over CM fields and the application of automorphic techniques to solve problems in number theory. Allen’s research often involves collaboration with international experts in algebraic number theory and arithmetic geometry. Scientific Awards: None explicitly listed in the provided materials. Advising & Grants: No formal advisees or grant details are listed in the text. His affiliations with CICMA suggest participation in collaborative research initiatives, though specific grants are not mentioned. Labs/Teams: Active member of the Montreal Number Theory Group and CICMA, contributing to inter-university collaborative projects in algebraic number theory.

• Number Theory
• Galois Representations
• Automorphic Forms
• +3 more

Professor Laurentiu Paunescu is a faculty member in the School of Mathematics and Statistics at the University of Sydney . His research focuses on Real and Complex Singularities , Stratifications , and Real and Complex Algebraic Geometry , with particular interest in geometric criteria for ignoring higher-order terms in analytic maps and blow-analytic equivalence. University: University of Sydney School: School of Mathematics and Statistics Academic Rank: Professor Email: laurentiu.paunescu@sydney.edu.au, laurent@maths.usyd.edu.au Address: F07 - Carslaw Building, The University of Sydney Paunescu's research aligns with the University of Sydney's Understanding the Universe and Fundamental Laws of Nature strengths. He investigates topological invariance under bi-Lipschitz homeomorphisms, Lipschitz stratification, and connections between real and complex Milnor fibers. His work often involves collaborations with researchers like S. Koike, A. Parusiński, and M. Tibar. Recent publications (2024–2019) emphasize Lipschitz geometry (e.g., directional bundles, stratification), cohomology of hypersurface singularities , and polynomial function finiteness . Notable collaborations include studies on vanishing cohomology , clustered polar curves , and CAD construction validity . Grants from DVC Research and ARC Discovery Projects support his work. He supervises research students in areas like O-minimal Geometry and contributes to Metric Spaces (Advanced) teaching. Paunescu co-edits workshops such as the Australian-Japanese Real and Complex Singularities Workshop , advancing international collaboration in singularity theory.

• Real and Complex Singularities
• Stratifications
• Real and Complex Algebraic Geometry
• +3 more

Raphaël Beuzart-Plessis is a CNRS Research Fellow affiliated with Aix-Marseille University and the Institute of Mathematics of Marseille (I2M) at Luminy Campus. He specializes in advanced areas of mathematics, including harmonic analysis, automorphic forms, representation theory, and number theory, with a focus on unitary groups and conjectures like Gan-Gross-Prasad. His work bridges algebraic geometry, differential geometry, and operator theory. Arithmetic, Geometry, Logic and Representations Group (AGLR) 2022-2027 ERC RELANTRA grant recipient Research interests span automorphic representations, L-functions, periods of automorphic forms, and harmonic analysis on real spherical spaces. He works extensively on the local and global Gan-Gross-Prasad conjectures, endoscopy, and supercuspidal representations. His recent publications analyze Plancher1el formulas, spherical characters, and congruences of automorphic forms. His 15 most recent publications (2014-2022) address topics such as the Gan-Gross-Prasad conjecture, Jacquet-Rallis's fundamental lemma, and the Asai Rankin-Selberg integrals. These works reflect his expertise in automorphic forms, representation theory, and number theory, often involving collaborations with leading mathematicians. 2016-2017 Peccot Prize for young mathematicians under 30 2022-2027 ERC RELANTRA grant for research in automorphic forms and representation theory Beuzart-Plessis has no listed students or laboratory teams but participates in the AGLR-RGR (Reduction Group Representations) team and has been an invited speaker at the 2022 International Congress of Mathematicians. His career includes guest lectures at Collège de France, including four sessions on Period factorizations and Plancherel formulas in 2017.

• Harmonic analysis
• Differential geometry
• Algebraic number theory
• +5 more

Jan de Gier is a Professor at the School of Mathematics and Statistics, The University of Melbourne . He is also the Founding Director of MATRIX , Australia’s residential research institute in the mathematical sciences, and a former Deputy Director and Chief Investigator in the Australian Research Council Centre of Excellence for Mathematical and Statistical Frontiers (ACEMS) . Additionally, he co-founded the Australian and New Zealand Association for Mathematical Physics (ANZAMP) in 2011 and served as its inaugural Chair. His research focuses on solvable lattice models at the intersection of mathematical physics and statistical mechanics . Key areas include the application of quantum integrability , algebraic structures like the Yang-Baxter equation, Hecke algebras, and quantum groups, as well as analytical methods such as complex analysis and elliptic curves. His work bridges pure and applied mathematics through connections between enumerative combinatorics , representation theory , and real-world phenomena like traffic flow modeling via exclusion processes . The 15 most recent articles reflect his expertise in integrable systems , non-equilibrium statistical mechanics , and algebraic combinatorics . Topics span Macdonald polynomials , stochastic duality , quantum spin chains , and traffic modeling , with methodologies involving matrix product forms , exact solutions , and critical phenomena analysis. He has contributed to editorial efforts through the AustMS Gazette and MATRIX Annals, and has been involved in public science communication via opinion pieces on mathematics funding and applications. His work emphasizes the importance of fundamental research in driving technological innovation, as highlighted in media articles discussing pi calculation , zero-knowledge proofs , and mathematics education .

• Mathematical Physics
• Statistical Mechanics
• Solvable Lattice Models
• +3 more

Gábor Somlai is a mathematics researcher at Eötvös Loránd University's Faculty of Science, affiliated with the Department of Algebra and Number Theory since 2006. He is a core member of the HUN-REN-ELTE Geometric and Algebraic Combinatorics Research Group (previously MTA-ELTE until 2023) and participates in the Asymptotic Group Theory ERC project. His institutional roles include contributions to the Mathematics Doctoral School and the Institute of Mathematics. His research spans Algebra , Combinatorics , and Number Theory , with emphasis on spectral sets, tiling problems, group theory, and finite geometry. Recent work explores cyclotomic polynomials, the generalized trifference problem, and connections between tiling and spectral properties in finite abelian groups. His publications reveal a strong focus on combinatorial number theory and algebraic methods in discrete geometry. Somlai's publication trends show sustained contributions to theoretical foundations of tiling and spectral sets (testing Fuglede's conjecture in cyclic groups) Cayley graph properties and CI-group classifications polynomial methods in finite geometry and direction problems His work bridges pure algebra with combinatorial applications, often resolving long-standing conjectures in specialized domains. As part of the HUN-REN-ELTE research group, he collaborates on geometric and algebraic combinatorics projects, leveraging ERC funding for asymptotic group theory investigations. His research infrastructure includes access to the Alfréd Rényi Institute of Mathematics (http://www.renyi.hu) resources.

• Algebra
• Combinatorics
• Number Theory
• +3 more