جستجوی استاد راهنمای دانشگاهی

Johnny Guzmán is a Professor of Applied Mathematics at Brown University, specializing in numerical analysis of partial differential equations and scientific computing. He holds a Ph.D. in Applied Mathematics from Cornell University (2005) and a B.S. in Mathematics from California State University, Long Beach (1999). His research focuses on numerical methods for PDEs, including discontinuous Galerkin methods, mixed finite element methods, and fluid-structure interaction problems. Key contributions include work on hybridizable and mixed finite element methods, discontinuous Galerkin discretizations, and stability analysis of numerical schemes. He has been funded by multiple NSF grants, including a Postdoctoral Fellowship (2005–2008) and awards totaling over $1M in research support. Notable recognitions include the Comfort and Urry Family Fund Prize (2013). Guzmán collaborates with institutions globally and serves on editorial boards for journals like Journal of Numerical Mathematics and Calcolo . His teaching spans computational linear algebra, numerical methods for differential equations, and finite element analysis.

• Numerical Analysis
• Partial Differential Equations
• Scientific Computing
• +۵ مورد دیگر

Brian Lawrence is an Assistant Professor in the Department of Mathematics at the University of Wisconsin–Madison, currently on leave as of 2025. Previously, he held positions at UCLA, the University of Chicago, and Columbia University, following doctoral studies at Stanford University under Akshay Venkatesh. His educational background includes: PhD in Mathematics from Stanford University (advisor: Akshay Venkatesh) Lawrence's research centers on arithmetic geometry, specializing in Diophantine problems through p-adic methods. His work develops innovative approaches to Mordell's conjecture, Shafarevich-type results, and rational point distribution using p-adic Hodge theory, étale cohomology, and period mappings. He bridges theoretical number theory with computational frameworks, particularly in algorithmic solutions for Diophantine equations. His publication trends reveal sustained focus on foundational Diophantine geometry problems, with recent work emphasizing conditional algorithms for the Mordell problem and sparsity phenomena in integral points. Collaborations with leading mathematicians like Venkatesh and Sawin demonstrate interdisciplinary engagement across number theory and algebraic geometry. Lawrence actively mentors undergraduate researchers, supervising projects on resultants, Hodge theory, and symmetric polynomials by students including Pramana Saldin, Yuchen Chen, Anuj Sakarda, and Spencer Dembner. His organizational roles include founding the Crystalline Cohomology seminar at Columbia and co-organizing the University of Chicago Number Theory Seminar, fostering collaborative research environments. He contributes extensively through expository notes on schemes, polynomials on lattices, and Fibonacci numbers modulo p, reflecting commitment to mathematical education and knowledge dissemination across multiple institutions.

• Arithmetic Geometry
• Number Theory
• Diophantine Geometry
• +۲ مورد دیگر

Ram Vasudevan is an Associate Professor and Associate Chair of Graduate Studies in the Department of Robotics at the University of Michigan. His research focuses on developing tools for safe and robust deployment of robotic systems, emphasizing optimization, nonlinear control, and real-world applications. Key areas include legged robot locomotion, shared control systems, and safety-critical autonomous systems. Research Interests: Optimization and control of nonlinear systems, locomotion of legged robots, shared control active safety systems, and automation of diagnostic/rehabilitative tasks. His ROAHM Lab prioritizes mathematical guarantees for robotic performance, with applications in medical robotics, autonomous vehicles, and soft robotics. Recent work emphasizes trajectory optimization, sensor fusion, and safety-aware control strategies. He has contributed to benchmarks for autonomous vehicle perception and novel methods in thermal image restoration using neural radiance fields. Awards: None explicitly listed in provided text. Labs/Teams: Directs the ROAHM Lab, collaborating on projects like robotic tail mechanics, real-time motion planning, and sensor data analysis. Active in academic conferences including RSS and ICRA.

• Optimization and control of nonlinear systems
• Legged robot locomotion
• Autonomous systems safety
• +۴ مورد دیگر

Kenneth McLaughlin is the Evelyn and John G. Phillips Distinguished Chair in Mathematics at Tulane University's School of Science & Engineering. He holds a Ph.D. and B.A. in Mathematics from New York University (1994 and 1989). Prior to Tulane, he served as faculty at the University of North Carolina, Chapel Hill, the University of Arizona, Universidade Federal de Brasília, and Colorado State University, where he also held leadership roles as Department Head and Chair. His research focuses on integrability, applying techniques across mathematics to study complex systems and phenomena. He has held visiting positions at institutions worldwide, including France, Italy, Brazil, Belgium, and the UK. McLaughlin’s research spans integrable systems, nonlinear dynamics, and asymptotic analysis. His work often involves the Riemann-Hilbert problem approach, orthogonal polynomials, and random matrix theory. Notable contributions include studies on soliton gases, the KdV equation, and universality in quantum operator dynamics. His recent articles explore topics such as asymptotic behavior of polynomials, soliton gas condensation, and hydrodynamic limits in integrable systems. McLaughlin’s academic career is marked by interdisciplinary collaboration and international research engagement.

• Integrable Systems
• Mathematical Physics
• Nonlinear Dynamics
• +۳ مورد دیگر

Andrew Childs is a Professor at the University of Maryland, affiliated with the Department of Computer Science and the Institute for Advanced Computer Studies (UMIACS). He serves as Director of the NSF Quantum Leap Challenge Institute for Robust Quantum Simulation (RQS) and is a Fellow at the Joint Center for Quantum Information and Computer Science (QuICS). His research focuses on quantum algorithms for simulating physical systems, algebraic problems, and quantum walk protocols, with applications in quantum computing and computational complexity. University of Maryland Institute for Advanced Computer Studies (UMIACS) Joint Center for Quantum Information and Computer Science (QuICS) NSF Quantum Leap Challenge Institute for Robust Quantum Simulation Childs' research spans quantum simulation, quantum Fourier transform, phase estimation, and Hamiltonian dynamics. He has developed techniques to reduce quantum computational resources for simulating quantum systems and explored limitations of quantum computers through hidden subgroup problems and non-unitary dynamics. His publications cover diverse areas including quantum walk optimization, Hamiltonian simulation methods, and applications to cryptography and condensed matter physics. Recent works address spatial search algorithms, product formulas for commutators, and quantum routing protocols. As an educator, Childs has taught courses on quantum algorithms and information processing at both the University of Maryland and University of Waterloo, with lecture notes and materials spanning multiple years. Contact: amchilds@umd.edu | Office: ATL 3359 | Affiliated with University of Maryland's quantum research institutes.

• Quantum Algorithms
• Quantum Information Processing
• Quantum Simulation
• +۲ مورد دیگر

Maxim Kontsevich has been a permanent professor at the Institut des Hautes Études Scientifiques (IHÉS) since 1995, holding the AXA-IHES Chair for Mathematics . He is also Professor at Rutgers University (one month per year since 1997) and was Professor at University of California, Berkeley (1993–1995). Born 25 August 1964 in Khimki, former USSR, he became a French citizen in 1999. Education: Ph.D. in Mathematics, University of Bonn, March 1992. Research Interests: Prof. Kontsevich’s work lies at the intersection of algebraic geometry , mathematical physics , and quantum theory . He introduced revolutionary ideas in mirror symmetry , non-commutative geometry , and deformation quantization , creating new algebraic structures that have found applications far beyond their original contexts. His current ERC Synergy Grant “ReNew Quantum” (2019-2025) explores recursive and exact new quantum theory . Publications & Trends: Across more than 50 influential papers, Kontsevich has consistently pushed the boundaries of enumerative geometry , motivic integration , and topological field theory . His recent work delves into symplectic aspects of homological algebra , motivic Donaldson-Thomas invariants , non-archimedean geometry , and integrable systems , revealing deep connections between geometry, algebra, and physics. Scientific Awards & Honors: Fields Medal (1998) Crafoord Prize (2008) Shaw Prize in Mathematical Sciences (2012) Breakthrough Prize in Fundamental Physics (2012) Breakthrough Prize in Mathematics (2014) ERC Synergy Grant “ReNew Quantum” (2019) AMS Moore Prize (2025) Doctor Honoris Causa: Aarhus University (2014), Universität Wien (2015), Syddansk Universitet (2023) Member of Académie des Sciences, Institut de France, Academia Europaea, National Academy of Sciences (foreign), London Mathematical Society (honorary) Grants & Leadership: As Principal Investigator of the ERC Synergy Grant “ReNew Quantum” (€10 million, 2019-2025), Kontsevich coordinates an international team advancing exact methods and resurgence in quantum field and string theories. Editorial Service & Community Roles: He serves on the editorial boards of Compositio Mathematica , Publications Mathématiques IHÉS , Journal of Noncommutative Geometry , and several other leading journals, shaping the direction of contemporary mathematical research.

• Algebraic Geometry
• Mathematical Physics
• Mirror Symmetry
• +۷ مورد دیگر

Joan Bruna is a Full Professor of Computer Science, Data Science, and affiliated Mathematics at New York University's Courant Institute and Center for Data Science. He leads the CILVR group and co-founded the MaD group. His research focuses on mathematical foundations of machine learning, deep learning, signal processing, and their applications in computational science, climate modeling, and geophysics. He holds a Ph.D. in Applied Mathematics from École Polytechnique and has held roles at UC Berkeley, the Institute for Advanced Study, and the Flatiron Institute. Education: Ph.D. (2013) and M.Sc. (2005) in Applied Mathematics, École Polytechnique and ENS Cachan; dual B.Sc./M.Sc. in Telecommunications and Mathematics from UPC Barcelona (2002–2004). Awards include the NSF CAREER Award (2019) and Alfred P. Sloan Fellowship (2018). Research interests span theoretical aspects of deep learning, optimization, and statistical methods, with applications to climate science and inverse problems. He has advised numerous PhD students and postdocs, contributing to seminal work on scattering networks, geometric deep learning, and neural ODEs. Professional service includes editorial roles at TMLR, JMLR, and TPAMI, plus program chairs for major conferences. His work bridges mathematics and machine learning, emphasizing rigorous analysis and real-world impact.

• Machine Learning
• Deep Learning
• Signal Processing
• +۵ مورد دیگر

James Bremer is a Professor in the Department of Mathematics and holds a cross-appointment in the Department of Computer and Mathematical Sciences at the University of Toronto's Scarborough campus. His research focuses on developing efficient numerical algorithms for solving elliptic boundary value problems, integral equations, and special function transforms.

• Numerical Analysis
• Acoustic and Electromagnetic Scattering Problems
• Integral Equation Methods
• +۵ مورد دیگر

Daniel A. Spielman is a Sterling Professor of Computer Science, Statistics & Data Science, and Mathematics at Yale University. He serves as the inaugural James A. Attwood Director of the Institute for Foundations of Data Science (FDS) and was previously co-Director of the Yale Institute for Network Science (YINS). He is also a member of TILOS, the NSF Institute for Learning-Enabled Optimization at Scale. His research interests span Spectral Graph Theory, Algebraic Graph Theory, Laplacian Matrices, Expander Graphs, and Random Walks on Graphs. Spielman has made fundamental contributions to understanding the mathematical foundations of data science, including work on smoothed analysis of algorithms, spectral sparsification, and solutions to the Kadison-Singer problem. Spielman's publications demonstrate a consistent focus on developing efficient algorithms with strong theoretical foundations. His work bridges pure mathematics, theoretical computer science, and practical applications in network analysis and machine learning. His research has evolved from foundational work on smoothed analysis to recent contributions in experimental design using discrepancy theory. His scientific honors include: Nevanlinna Prize for contributions to mathematical aspects of computer science Two Gödel Prizes (2008 and 2015) for outstanding papers in theoretical computer science MacArthur Fellowship ('Genius Grant') Simons Investigator award Membership in the National Academy of Sciences and American Academy of Arts and Sciences Spielman has advised numerous PhD students who have gone on to prominent positions in academia and industry. His teaching includes advanced courses in Spectral Graph Theory and Computation and Optimization. He has developed important software packages like Laplacians.jl for solving Laplacian linear equations and related problems.

• Spectral Graph Theory
• Algebraic Graph Theory
• Laplacian Matrices
• +۷ مورد دیگر

Andre Wibisono serves as Assistant Professor in Yale University's Department of Computer Science with a secondary appointment in Statistics & Data Science, joining the faculty in 2021 after postdoctoral research at University of Wisconsin-Madison and Georgia Institute of Technology. His educational background includes: Ph.D. in Computer Science, UC Berkeley M.A. in Statistics, UC Berkeley M.Eng. in Computer Science, MIT S.B. in Mathematics and Computer Science, MIT Wibisono's research focuses on algorithm design for machine learning through optimization, sampling, and game theory , leveraging dynamical systems and information theory to develop accelerated discrete-time algorithms from continuous dynamics. His work provides theoretical foundations for efficient machine learning systems with applications in generative modeling and constrained optimization. Recent publications (2023-2025) demonstrate consistent innovation in Hamiltonian-based optimization , constrained-space sampling , and min-max game convergence , characterized by rigorous mathematical analysis connecting continuous dynamics to discrete algorithms. Key trends include randomized integration for acceleration, phi-divergence convergence guarantees, and symplectic geometry applications to mirror descent. Scientific recognition includes: NSF CAREER Award for developing algorithmic frameworks bridging continuous and discrete dynamics He actively mentors current students (Siddharth Mitra, Kaylee Yang, Jane Lee, Qiang Fu, Peter Wang) and has guided two postdocs to faculty positions. Research is funded through the NSF CAREER award and collaborative CIF grants focused on Hamiltonian dynamics for sampling and optimization. His Yale research group develops theoretical foundations for next-generation machine learning algorithms, emphasizing mathematical rigor in optimization and sampling with applications to generative modeling and constrained inference problems.

• Machine Learning
• Optimization
• Sampling
• +۴ مورد دیگر

Prof. Igors Gorbovickis is an Associate Professor of Mathematics at the Department of Mathematics, School of Computer Science and Engineering, Constructor University (formerly Jacobs University Bremen). His research focuses on complex dynamical systems, including topics such as renormalization theory, bifurcation analysis, Julia sets, and applications to mathematical physics. He also contributes to discrete geometry, particularly exploring conjectures like the Kneser-Poulsen problem. His work bridges pure mathematics with interdisciplinary applications, emphasizing rigorous analysis of nonlinear systems and geometric configurations. Key areas of investigation include critical point accumulations, Hausdorff dimension estimates, and equidistribution phenomena in parameter spaces. Recent publications highlight advancements in understanding chaotic systems, circle maps, and the interplay between algebraic structures and dynamical behavior. Prof. Gorbovickis collaborates internationally, with co-authored papers appearing in journals like Advances in Mathematics , Ergodic Theory and Dynamical Systems , and Nonlinearity . His office is located at Research I, Room 128 on the Constructor University campus in Bremen, Germany.

• Dynamical Systems
• Complex Analysis
• Discrete Geometry
• +۳ مورد دیگر

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
• +۵ مورد دیگر

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
• +۷ مورد دیگر

Kurt Johansson is a Full Professor of Mathematics at KTH Royal Institute of Technology, Sweden. His academic journey includes roles as Associate Professor at KTH (1993-2001) and Uppsala University (1988-1993), alongside research funded by the Swedish Natural Science Research Council (1998-2003). His primary affiliations are within the Department of Probability, Mathematical Physics & Statistics at KTH, where he also coordinates courses on Differential Equations and Fourier Analysis. Education: BSc in Physics (1982) and PhD in Mathematics (1988), both from Uppsala University. Research interests focus on Probability Theory , Mathematical Physics , and Random Matrix Theory , with contributions to stochastic models, determinantal processes, and universality in statistical mechanics. Key Awards: Wallenberg Prize (1995), Rollo Davidson Prize (2000), Göran Gustafsson Prize (2002), Fellow of the American Mathematical Society (2012), and multiple Wallenberg Scholar grants (2011-2023). Grants: Major funding from the Swedish Research Council (VR), K&A Wallenberg Foundation, and others. His research group explores Random Matrices, Stochastic Models, and Analysis , with notable work on the Arctic Circle Theorem and KPZ universality class. Recent publications analyze Brownian directed percolation and domino tilings of the Aztec diamond, reflecting his focus on interdisciplinary applications of probability and mathematical physics.

• Probability Theory
• Mathematical Physics
• Random Matrix Theory

Paata Ivanisvili is an Associate Professor at the University of California, Irvine (UCI), Department of Mathematics, School of Physical Sciences. His research focuses on Analysis, Probability, Harmonic Analysis, and Functional Analysis, with a particular emphasis on isoperimetric inequalities, functional inequalities, and discrete structures such as the Hamming cube. He has held visiting positions at institutions including the Hausdorff Research Institute for Mathematics and Princeton University. Ivanisvili has organized conferences such as the Dual Trimester Program at the Hausdorff Institute on Boolean Analysis in Computer Science (2024) and annual Summer/Fall Schools since 2021. He earned his PhD in Mathematics from Michigan State University (2015) and a BS from Saint Petersburg State University (2011). His research interests include sharp inequalities in analysis (e.g., Poincaré, Beckner, Ehrhard), hypercontractivity, and applications to discrete mathematics and probability. He has collaborated with prominent mathematicians such as Fedor Nazarov, Alexander Volberg, and Roman Vershynin. Notable awards include the NSF CAREER Award (2021–2025) and Simons Fellowship in Mathematics (2025–2026). Ivanisvili’s recent work explores the interface between harmonic analysis and discrete mathematics, including studies on additive energies, convex hulls of space curves, and learning theory. His articles frequently address foundational questions in geometric functional analysis, often using tools like Bellman functions and optimal control theory. He actively advises PhD students and has mentored visiting researchers at UCI.

• Analysis
• Partial Differential Equations
• Probability
• +۵ مورد دیگر