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

Prof. Dr. Gerold Alsmeyer is a faculty member at the Institute of Mathematical Stochastics, Department of Mathematics and Computer Science, University of Münster. He is an active researcher with a focus on stochastic processes, particularly stochastic fixed-point equations and iterated function systems. His work is supported by his role as an Investigator in Mathematics Münster in the project EXC 2044 - C1: Evolution and asymptotics. His primary research interests include the theory of stochastic processes, branching processes, Markov random walks, renewal theory, and the asymptotic analysis of random structures such as random trees and polytopes. He has made significant contributions to the understanding of fluctuation theory, perpetuities, and the smoothing transform. His recent publications (2017–2023) reveal a sustained focus on theoretical probability, with recurring themes in random difference equations, iterated function systems, and limit theorems for stochastic processes. The work spans pure mathematical theory and applications in mathematical biology and combinatorics, indicating a broad yet deep research profile. Prof. Alsmeyer has supervised numerous doctoral and master’s students, including Viet Hung Hoang, Christopher Eick, Philipp Godland, and Fabian Buckmann, whose dissertations cover topics in branching processes, random walks, and stochastic fixed-point equations. He has no listed scientific awards in the provided texts. He teaches courses in probability theory, mathematical statistics, branching processes, and stochastic recursion equations, demonstrating a strong commitment to academic mentoring and education.

• Theory of stochastic processes
• Stochastic fixed-point equations
• Iterated function systems
• +۷ مورد دیگر

Nathan (Nati) Linial is a Professor at the School of Computer Science and Engineering at the Hebrew University of Jerusalem, where he has been a faculty member since completing his postdoctoral period at UCLA. He earned his undergraduate degree in mathematics from the Technion and his PhD in graph theory from the Hebrew University. His research spans multiple areas of theoretical computer science and mathematics, with primary focus on combinatorics, theoretical computer science, and bioinformatics. Linial's work has made significant contributions to high-dimensional combinatorics, expander graphs, metric embeddings, and computational molecular biology. His research often bridges geometry, analysis, and combinatorial structures, demonstrating deep connections between seemingly disparate mathematical fields. Linial's recent publications reveal a strong trend toward high-dimensional combinatorial structures, including simplicial complexes, hypertrees, and high-dimensional permutations. His work frequently employs probabilistic methods, linear programming techniques, and geometric approaches to solve fundamental combinatorial problems. The breadth of his research is evident in both pure mathematical contributions and applications to computational biology. Fellow of the American Mathematical Society ISI Highly Cited Researcher Conant Prize (2008) for the influential survey paper "Expander graphs and their applications" Linial has served on the editorial boards of several prestigious journals including the Israel Journal of Mathematics (as Chief Editor 2013-2017), Random Structures and Algorithms, and Combinatorica. His academic leadership extends to organizing conferences and workshops in combinatorics and theoretical computer science. He has mentored numerous students whose work spans theoretical computer science, combinatorics, and computational biology. Linial is associated with research projects including ProtoNet (for protein sequence classification) and EVEREST (for evolutionary conserved protein domains), demonstrating his commitment to interdisciplinary research that bridges computer science with molecular biology.

• Combinatorics
• Theoretical Computer Science
• Bioinformatics
• +۶ مورد دیگر

Antonio De Rosa is an Associate Professor in the Department of Decision Sciences at Bocconi University, Italy. Previously, he held positions at the University of Maryland, College Park (2020–2024), and the Courant Institute of Mathematical Sciences, New York University (2017–2020). He earned his Ph.D. in Mathematics from the University of Zurich in 2017 under Camillo De Lellis and Guido De Philippis. Education: Ph.D. in Mathematics, University of Zurich (2017). His research spans Geometric Analysis , Partial Differential Equations , Calculus of Variations , Geometric Measure Theory , Optimal Transport , and Non-convex Optimization . Recent work focuses on anisotropic geometric variational problems, including existence, regularity, and uniqueness of anisotropic minimal surfaces and CMC (constant mean curvature) surfaces. He has also contributed to interdisciplinary applications in Explainable Risk Assessment and Data Analysis . The 15 most recent articles highlight advancements in anisotropic surfaces , min-max theory , optimal transport , and mathematical programming (e.g., K-means clustering, linear programming). Key trends include the intersection of geometric measure theory with nonlinear PDEs and applications in machine learning and transportation networks . Scientific Awards and Grants: 2023 Maryland Research Excellence Carlo Ciliberto Prize (2019) ERC Starting Grant ANGEVA (101076411, 2023–2028) Air Force Office of Scientific Research (AFOSR) grant (FA9550-23-1-0123) NSF CAREER Award (DMS-2143124) NSF DMS Awards (DMS-1906451, DMS-2112311) AMS Simons Travel Grant Antonio actively supervises research and teaches courses such as Optimization and Introduction to Partial Differential Equations . His work is supported by significant funding totaling approximately €3 million.

• Geometric Analysis
• Partial Differential Equations
• Geometric Measure Theory
• +۳ مورد دیگر

Nathan Kaplan is a Professor in the Department of Mathematics at the University of California, Irvine, where he conducts research in number theory, algebraic geometry, and combinatorics. His work spans rational points on varieties over finite fields, arithmetic statistics, coding theory, and the study of numerical semigroups. He is actively involved in the mathematical community, organizing seminars and conferences including the UC Irvine Number Theory Seminar and the Southern California Number Theory Day. Dr. Kaplan received his PhD from Harvard University in 2013 under the direction of Noam Elkies. Following his doctorate, he was a postdoctoral researcher at Yale University from 2013-2015 before joining the faculty at UC Irvine. His research interests focus on the intersection of number theory and algebraic geometry, with particular attention to problems involving rational points on varieties over finite fields, arithmetic statistics, and coding theory. He has made significant contributions to the study of numerical semigroups, cokernels of random p-adic and integer matrices, and quadratic forms and lattices. His work often bridges theoretical mathematics with applications in coding theory and cryptography. Analysis of his recent publications shows a strong trend toward combinatorial aspects of number theory, particularly in the study of numerical semigroups and their properties. He frequently collaborates with researchers across institutions, with recent work spanning algebraic geometry, combinatorics, and coding theory. His publications demonstrate expertise in both theoretical developments and computational aspects of number theory. Dr. Kaplan is deeply committed to undergraduate research and mentoring. He has experience as a mentor for undergraduate research projects through programs including SUMRY (a research program for Yale undergraduates), the University of Minnesota-Duluth REU program, and the Trinity University REU program. He actively encourages undergraduates to apply for summer research opportunities and has organized numerous outreach activities. He is an organizer of the UC Irvine Number Theory Seminar and the Southern California Number Theory Day conference series. In 2018, he co-organized the Conference on Open Questions in Cryptography and Number Theory in honor of Alice Silverberg's 60th Birthday. Dr. Kaplan has given numerous talks at mathematical venues including the Museum of Mathematics' Math Encounters series, where he presented "Error-Correcting Codes: The Mathematics of Communication" in July 2022. He has also spoken at the Yale Undergraduate Math Society, the UCI Math Circle, and various other outreach events.

• Number Theory
• Algebraic Geometry
• Combinatorics
• +۶ مورد دیگر

Jeff Linderoth is the Harvey D. Spangler Professor in the Department of Industrial and Systems Engineering at the University of Wisconsin-Madison. His research focuses on large-scale numerical optimization, mixed-integer nonlinear programming, and stochastic programming, with applications in energy systems, global routing, and industrial processes. Education: BS in General Engineering (highest honors) from University of Illinois at Urbana-Champaign, MS in Operations Research from Georgia Institute of Technology, PhD in Industrial Engineering from Georgia Institute of Technology. Linderoth's work addresses theoretical and applied challenges in optimization, including developing algorithms for mixed-integer programming, analyzing knapsack polytopes, and creating tools like the Minotaur optimization toolkit. His recent publications explore integer programming techniques for subspace clustering, complementarity constraints, and customized coverage instrumentation. Selected trends in his research include advancements in stochastic programming, orbital branching for symmetric integer programs, and congestion analysis in power systems. His group contributes to optimization software and data-driven libraries like MIPLIB. Scientific Award: Harvey D. Spangler Professor.

• Large-Scale Numerical Optimization
• Mixed-Integer Nonlinear Programming
• Operations Research
• +۵ مورد دیگر

Lauren K. Williams is the Dwight Parker Robinson Professor of Mathematics at Harvard University and the Sally Starling Seaver Professor at the Radcliffe Institute. Her research focuses on algebraic combinatorics, cluster algebras, and mathematical physics, with notable contributions to the study of the positive Grassmannian, amplituhedron geometry, and integrable systems. She holds affiliations with Harvard’s Department of Mathematics and the Radcliffe Institute for Advanced Study. Her work bridges combinatorics, algebraic geometry, and physics, particularly in understanding geometric structures like the amplituhedron, which encode scattering amplitudes in quantum field theory. Key areas include cluster algebras, Schubert varieties, and applications of combinatorial methods to stochastic processes such as the asymmetric exclusion process (ASEP). Recent activities include organizing conferences on combinatorics, mathematical physics, and the legacy of mathematicians like Richard P. Stanley. Her research often explores connections between discrete structures and continuous systems, with a focus on positivity and geometric positivity principles. Awards and grants are not explicitly listed in the provided texts, but her contributions have been recognized through invitations to major international conferences and leadership in the field. She actively mentors students and postdocs in combinatorics and algebraic geometry.

• Algebraic Combinatorics
• Cluster Algebras
• Mathematical Physics
• +۴ مورد دیگر

June Huh is a Mathematics Professor at Princeton University's Department of Mathematics. His research focuses on the interplay between algebraic geometry, combinatorics, and matroid theory, with notable contributions to Hodge theory, tropical geometry, and log-concavity phenomena. He is actively involved in collaborative projects such as the FRG initiative on matroids, graphs, and algebraic geometry. Key research interests include matroid polytopes, Chow rings, Lagrangian geometry, and combinatorial applications of Hodge-Riemann relations. His work bridges discrete and continuous mathematics, with implications for enumerative geometry and geometric combinatorics. Recent publications explore topics like volume polynomials, Bergman fans, and singular Hodge theory in combinatorial geometries. He has received funding for interdisciplinary research through grants like the FRG Collaborative Research program. His contributions highlight innovative methods in geometric and algebraic combinatorics.

• Algebraic Geometry
• Combinatorics
• Matroid Theory
• +۵ مورد دیگر

Greta Panova is a Gabilan Distinguished Professor of Science and Engineering and a Professor of Mathematics at the University of Southern California (USC). Her research focuses on Algebraic Combinatorics, with connections to representation theory, statistical mechanics, probability, and computational complexity theory. She also engages in molecular biology modeling. Panova holds editorial roles at journals including the Electronic Journal of Combinatorics, Arnold Mathematical Journal, and Communications of the American Mathematical Society. She is a writer/editor for the Putnam Mathematical Competition (2023-2025) and is currently supported by NSF grants in the CCF division. Her research interests span Algebraic Combinatorics, Representation Theory, Statistical Mechanics, Probability, and Computational Complexity Theory. Specific areas include Kronecker and Littlewood-Richardson coefficients, asymptotic behavior of combinatorial structures, and the interplay between algebraic structures and computational complexity. She also explores applications in molecular biology, particularly protein dynamics in DNA lesions. NSF grants in CCF division (current) Editorial roles at Electronic Journal of Combinatorics, Arnold Mathematical Journal, and others Contributor to the Putnam Mathematical Competition Panova's research is supported by NSF grants, focusing on computational complexity and algebraic combinatorics. She has advised students in areas related to her research, though specific names aren’t listed here. Grants have funded explorations into geometric complexity theory, asymptotic combinatorics, and molecular biology modeling. Her work involves collaborations across disciplines, including statistical mechanics and integrability, as highlighted in her white paper contributions.

• Algebraic Combinatorics
• Representation Theory
• Statistical Mechanics
• +۳ مورد دیگر

Tamon Stephen is a Professor in the Department of Mathematics at Simon Fraser University (SFU), part of the Faculty of Science. His research focuses on operations research, with an emphasis on combinatorial optimization, algorithms, discrete geometry, and computational biology. He holds a Ph.D. in Mathematics from the University of Michigan (2002). His work often bridges theoretical and computational aspects, addressing interdisciplinary applications. Stephen is affiliated with the Centre for Operations Research and Decision Sciences (CORDS) and has contributed to software tools for hypergraph transversals and colorful linear programming. He has taught courses such as Math 208W (Introduction to Operations Research) and has advised projects in metabolic network analysis and scheduling optimization. His office is located at the Surrey campus (SRYC 2886). Key research collaborations include studies on firefighter scheduling, nurse rostering, and metabolic pathway analysis. His methodologies often leverage algorithm design, polytope theory, and discrete mathematics. Stephen actively participates in academic service, organizing seminars and contributing to conferences such as the West Coast Optimization Meeting. His work emphasizes practical applications of theoretical results, with a focus on solving real-world optimization challenges.

• Operations Research
• Combinatorial Optimization
• Algorithms
• +۲ مورد دیگر

Ignasi Sau Valls is a Directeur de Recherche (DR2) at CNRS, affiliated with the LIRMM laboratory at Université de Montpellier, France. He is a member of the AlGCo team, focusing on algorithms for graphs and combinatorics. His academic background includes dual degrees in Mathematics and Telecommunications Engineering from UPC (Barcelona), a PhD in joint supervision between UPC and Projet Mascotte (Sophia Antipolis), and a postdoctoral position at the Technion (Israel). He has been with CNRS since 2010 and was promoted to his current role in October 2024. He also served as a Visiting Professor at UFC (Brazil) from 2016–2017. His research interests lie primarily in Graph Theory and Parameterized Complexity , with a focus on structural graph properties, kernelization, and algorithm design. He has made significant contributions to problems involving minor-closed graph classes, treewidth, and graph modification. His work bridges theoretical foundations with algorithmic applications, particularly in discrete optimization and network problems. The recent articles highlight a strong trend in parameterized algorithms, especially for graph modification, kernelization, and structural graph problems. Topics such as hitting minors, dynamic programming on tree decompositions, and edge contractions reflect a deep engagement with structural parameterizations and fixed-parameter tractability. His publications frequently appear in top-tier journals like SIAM Journal on Computing, Journal of Combinatorial Theory, and Algorithmica, as well as major conferences such as ICALP, SODA, and IPEC. Best paper award of Track C of ICALP'10 Best student paper award of WG'09 Ignasi Sau has been a principal investigator of the ANR JCJC project ELIT (ANR-20-CE48-0008-01), funded with 169k€ from 2021 to 2026. He serves as an editor for DMTCS and Information and Computation , and has held significant organizational roles, including PC member of numerous conferences (MFCS, WG, IPEC, COCOON) and as co-chair and main organizer of WG 2019, ICGT 2022, and JCALM 2023. He has delivered invited courses at international schools in France, Argentina, and Brazil. He is actively involved in the research community through editorial duties, conference organization, and collaborative research. His lab affiliation is the AlGCo team at LIRMM, a leading group in algorithmic graph theory and combinatorics.

• Graph Theory
• Parameterized Complexity
• Algorithmic Graph Theory
• +۵ مورد دیگر

Mohit Singh is the Coca-Cola Foundation Professor at the H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology. He previously held positions at Microsoft Research (2011-2016) and as an Assistant Professor at McGill University (2010-2012). PhD in Algorithms, Combinatorics, and Optimization (ACO) at Carnegie Mellon University His research focuses on discrete optimization , approximation algorithms , and convex optimization , with applications to combinatorial optimization, submodular functions, and network design. He has contributed to topics like Sticky Brownian Rounding, integrality gaps, and online adaptive algorithms. His recent work includes theoretical advancements in matroid constraints, dimensionality reduction, and submodular maximization. He has published extensively in top conferences such as FOCS, SODA, ICML, and NeurIPS. He has been recognized with the Coca-Cola Foundation Professorship and served as Director of the Algorithms and Randomness Center at Georgia Tech (2019-2023). He has also held editorial roles and organized key academic workshops like the Bellairs Workshop on Approximation Algorithms (2011). His teaching includes advanced courses on approximation algorithms, combinatorial optimization, and linear inequalities. He has collaborated with institutions such as Microsoft Research and McGill University.

• Discrete Optimization
• Approximation Algorithms
• Combinatorial Optimization
• +۴ مورد دیگر

Calin Belta is a Professor in the College of Engineering at Boston University , with joint appointments in Mechanical Engineering, Systems Engineering, and Electrical and Computer Engineering. His research bridges control theory and formal methods, focusing on controller synthesis and automatic verification of hybrid systems with applications in robotics and systems biology . Education: Ph.D. in Control Theory, University of Pennsylvania His work emphasizes temporal logic specifications for ensuring safety and correctness in autonomous systems, particularly through control barrier functions (CBFs) , reinforcement learning , and model predictive control . Applications span from microrobotics to autonomous driving and biomolecular modeling . His recent articles (2025–2024) highlight advancements in safe control algorithms for autonomous vehicles, adaptive CBFs , temporal logic-guided learning , and microrobotics for cell manipulation. Common themes include formal verification , robustness , and human-in-the-loop safety . Scientific Awards: AFOSR Young Investigator Award (2008) NSF CAREER Award (2005) He also contributes to academia as a Senior Member of IEEE and Associate Editor for journals like SIAM Journal on Control and Optimization and IEEE Transactions on Automatic Control . His lab develops computational tools for safety-critical control in complex environments.

• Control Theory
• Formal Verification
• Hybrid Systems
• +۳ مورد دیگر

Andy McLennan is a Professor in the School of Economics at the University of Queensland since 2007, following roles at the University of Minnesota (1987–2005) and the University of Sydney. His research focuses on mathematical economics and game theory, with contributions to computational game theory, fixed point theory, and algebraic geometry. Notable collaborations include work with Richard McKelvey on the Gambit software package for game analysis. Education: B.A. in Mathematics from the University of Chicago (undergraduate), PhD in Economics from Princeton University (1982). Prior faculty positions included the University of Toronto and Cornell University. Research Interests: Explores intersections between pure mathematics and economics, including applications of topology (Vietoris-Begle theorem), differential geometry (Morse-Sard theorem), and computational complexity in markets. Recent work includes the 'Index +1 Principle' for equilibrium stability and fixed point index theory. Software & Tools: Co-developed Gambit , a widely used open-source toolkit for analyzing finite games. Authored technical software for solving systems of equations and 3D visualization tools for academic use. Books: Authored Advanced Fixed Point Theory for Economics (Springer, 2018), The Algebra of Coherent Algebraic Sheaves , and The Nature and Origins of Modern Mathematics . Personal: Lives in Brisbane with his partner Shino Takayama (also an economist) and their son Sean. Enjoys Japanese language, classical music, and strategic games like Go and chess.

• Mathematical Economics
• Game Theory
• Algebraic Geometry
• +۳ مورد دیگر

Tom Coates is a Professor of Pure Mathematics in the Department of Mathematics at Imperial College London's Faculty of Natural Sciences. He holds affiliations with the Artificial Intelligence Network, the CNRS-Imperial Abraham de Moivre UMI, and the Pure Mathematics research group. His office is located in the Huxley Building (662) on the South Kensington Campus, London SW7 2AZ, and he can be contacted via email at t.coates@imperial.ac.uk or phone at +44 (0)207 594 3607. Professor Coates' research spans pure mathematics with emphasis on algebraic geometry, mirror symmetry, and Gromov-Witten theory. He investigates quantum cohomology and Fano variety classification to construct a 'Periodic Table for shapes' through computational algebra, data mining, and machine learning. His work integrates geometric methods with cluster-scale computing to identify structural patterns in algebraic varieties, focusing on quantum periods, toric degenerations, and Laurent polynomial applications. His recent publications (2021-2024) demonstrate a strong trend toward computational classification of Fano varieties and polytopes, leveraging machine learning for dimension prediction and database construction. Key themes include mirror symmetry via Laurent inversion, toric geometry applications, and connections between Gromov-Witten invariants and modular forms. These works often utilize custom tools like PCAS and Fanosearch for large-scale algebraic computations. While specific student names are not listed, Professor Coates mentors PhD and Master's students in algebraic geometry and computational mathematics. His research is supported by the Simons Foundation, member institutions, and contributors, enabling international collaborations through networks like the CNRS-Imperial Abraham de Moivre UMI. He leads a research team developing the Periodic Table for shapes framework, utilizing high-performance computing resources. The team maintains open-source tools including PCAS (Periodic Table for Algebraic Shapes) and Fanosearch for Fano variety exploration, with code repositories hosted on Bitbucket and quantum period databases published in Scientific Data.

• Pure Mathematics
• Algebraic Geometry
• Mirror Symmetry
• +۵ مورد دیگر

Ioannis Z. Emiris is a Professor in the Department of Informatics & Telecoms at the National & Kapodistrian University of Athens and concurrently serves as President and General Director of the ATHENA Research Center in Greece. He holds a BSc in Computer Science from Princeton University (1989) and a PhD in Computer Science from UC Berkeley (1994). His research spans computational geometry, algebraic algorithms, robotics, structural bioinformatics, and optimization. He is a leading expert in sparse elimination theory, geometric modeling, and algorithmic algebra. Affiliations: ATHENA Research Center, National & Kapodistrian University of Athens, INRIA Sophia Antipolis (France via joint AROMATH team). Education: BSc (Princeton), PhD (UC Berkeley). Research Interests Emiris's work focuses on geometric algorithms, algebraic systems, and their applications. His contributions include advancements in sparse elimination theory, computational geometry for high-dimensional data, and robotics. He has developed algorithms for polynomial system solving, Voronoi diagrams, and geometric predicates for ellipses. Articles Overview His recent work bridges theoretical advances with practical applications, such as deep learning for protein structure prediction (HydraProt) and geometric algorithms for high-dimensional data analysis. He explores intersections between algebraic geometry and computational methods, with applications ranging from robotics to bioinformatics. Scientific Awards Best Paper Award at ISSAC 2003 and 2010 MSCA Network GRAPES (2019-2023) Advising & Grants Emiris has supervised numerous students and researchers, contributing to interdisciplinary projects. He has secured grants for initiatives like the GRAPES network and has led teams in algorithm design and geometric software development. His work on MARS (Maple/Matlab/C Resultant-Based Solver) exemplifies his focus on practical algorithm implementation. Labs & Teams He directs the Lab of Geometric & Algebraic Algorithms and collaborates with the AROMATH team at INRIA. His research group develops open-source tools for computational geometry and algebraic computations.

• Computational Geometry
• Algebraic Algorithms
• Robotics
• +۴ مورد دیگر