Find Academic Supervisors

Jinhyung Park is an Associate Professor in the Department of Mathematical Sciences at KAIST, Daejeon, Korea. He obtained his Ph.D. from KAIST in 2014 under Prof. Sijong Kwak and was mentored as a CMC Fellow at KIAS (2014–2019). His research focuses on Algebraic Geometry , particularly syzygies of algebraic varieties , secant varieties , and positivity of line bundles . Education: Ph.D., KAIST (2014); MS/BS, KAIST and University of Chicago (2002/2001). Research Interests: His work explores geometric properties of projective manifolds, singularities in algebraic geometry, and applications of Okounkov bodies to divisors and syzygies. Recent trends include Castelnuovo-Mumford regularity bounds (e.g., for threefolds with rational singularities) and subadditivity of Okounkov bodies in fiber spaces. Teaching: Courses include Matrix Groups, Algebraic Geometry, and Calculus. He previously taught at Sogang University and Purdue University. Professional Affiliations: Member of the Korean Mathematical Society, American Mathematical Society, and other international societies. Organized the 8th East Asia Number Theory Conference at KAIST (2019).

• Algebraic Geometry
• Syzygies of Algebraic Varieties
• Secant Varieties
• +6 more

Peter Benner is a Professor and Director at the Max Planck Institute for Dynamics of Complex Technical Systems in Magdeburg, where he leads the Computational Methods in Systems and Control Theory group. He also holds an Honorarprofessor position for Mathematics at Otto-von-Guericke Universität Magdeburg since 2011. Benner has previously served as Managing Director of the Max Planck Institute during multiple periods (2013-2014, 2021-2022, and 2025-2026), demonstrating his leadership in the field. Benner's research focuses on Scientific Machine Learning, Numerical Linear and Multilinear Algebra, Model Order Reduction and Reduced-order Modeling, Numerical Methods in Systems and Control Theory, PDE Constrained Optimization, High-performance and Power-aware Computing, and Mathematical Software development. His work bridges theoretical mathematics with practical engineering applications, particularly addressing challenges in large-scale dynamical systems. Analysis of his recent publications reveals a strong emphasis on developing efficient computational methods for complex systems. Benner has pioneered approaches combining model order reduction with tensor methods to tackle high-dimensional problems in uncertainty quantification and PDE-constrained optimization. His work shows a consistent trend toward integrating data-driven techniques with traditional model-based approaches, particularly for nonlinear and parametric systems. Throughout his career, Benner has actively mentored students and collaborated with researchers worldwide, delivering numerous invited talks at prestigious institutions and conferences across Europe, North America, and Asia. His research has received significant funding, supporting the development of mathematical software and computational methods for industrial applications. Benner leads the Computational Methods in Systems and Control Theory department at the Max Planck Institute, which focuses on developing and implementing advanced numerical methods for large-scale dynamical systems. The group maintains strong connections with both theoretical mathematics and practical engineering applications, particularly in fluid dynamics, energy systems, and control theory.

• Scientific Machine Learning
• Numerical Linear Algebra
• Numerical Multilinear Algebra
• +7 more

Anders Rantzer is a Professor of Automatic Control at the Department of Control Engineering, Faculty of Engineering, Lund University, Sweden. He has held visiting positions at Caltech (2004–2005) and the University of Minnesota (2015–2016) as the Taylor Family Distinguished Visiting Professor. His academic journey began with a PhD from KTH Stockholm in 1991, followed by a postdoc at the Institute for Mathematics and its Applications (IMA), University of Minnesota. His research interests center on modeling, analysis, and synthesis of control systems , with a strong focus on scalability, adaptation, and applications in energy networks . He is particularly known for foundational work in positive systems and integral quadratic constraints (IQCs) . These theoretical frameworks are critical in analyzing stability and robustness of large-scale interconnected systems. His work bridges mathematical rigor with practical engineering applications, especially in sustainable energy and networked systems. The recent publications and lecture materials reflect a consistent trajectory in scalable and robust control, optimization, and distributed systems. Themes such as large-scale convex optimization , nonlinear and stochastic control , and network dynamics dominate his scholarly output, indicating a sustained commitment to advancing control theory for complex, real-world systems. Scientific honors include: Fellow of IEEE Member of the Royal Swedish Academy of Engineering Sciences (IVA) Chairman of the Swedish Scientific Council for Natural and Engineering Sciences Chairman of the Royal Physiographic Society of Lund Rantzer has supervised numerous students and contributed extensively to academic leadership and education. He has been involved in major national and international research initiatives such as WASP (Wallenberg AI, Autonomous Systems and Software Program) and ELLIIT. His work includes developing educational tools and courses in control, optimization, and machine learning. He leads and contributes to research projects on autonomous systems, cloud control, and smart energy networks. He is affiliated with the Control Lab at LTH and participates in collaborative efforts such as the Nordic University Hub on Industrial Internet of Things (HI2OT). His work integrates theoretical advances with practical implementations in robotics, biomedical systems, and industrial automation.

• Control Systems Theory
• Scalable Control
• Adaptive Control
• +7 more

Prof. Dr. Martin Kronbichler is a faculty member at the Faculty of Mathematics , Ruhr University Bochum , leading the Numerics group. His research focuses on higher-order finite element methods, multigrid techniques, and high-performance computing for complex fluid and solid mechanics problems. Key Research Areas: Higher-order finite element methods, iterative solvers, multigrid algorithms, exascale mathematical software, and computational fluid dynamics. Notable Projects: EU-funded dealii-X (exascale digital twins), BMBF PDExa (optimized PDE solvers for exascale), and DFG grants for cut-discontinuous Galerkin methods and geometric multigrid. Publications Trends: Recent works emphasize matrix-free operators for hyperelasticity, diffuse-interface models for additive manufacturing, and multigrid smoothers for higher-order elements. Scientific Awards: Recipient of the Humboldt Research Award for his contributions to numerical methods and HPC. Team: Collaborates with researchers like Dr. Shubham Kumar Goswami, Dr. Richard Schussnig, and Natalia Nebulishvili.

• Higher-order finite element methods
• Numerical linear algebra
• Multigrid methods
• +3 more

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
• +7 more

Prof. Mathias Drton holds the Chair of Mathematical Statistics at the Technical University of Munich (TUM), within the Department of Mathematics and School of Computation, Information and Technology. His research focuses on graphical models, algebraic statistics, causal inference, and multivariate data analysis. He has authored numerous publications in top-tier journals and conferences, including work on conditional independence, sparse factor analysis, and causal discovery in linear models. Drton has supervised a large number of theses, mentoring students in areas like high-dimensional statistics, graphical models, and causal inference. He is actively involved in teaching advanced courses such as 'Graphical Models in Statistics' and 'Fundamentals of Mathematical Statistics.' His academic contributions span theoretical developments in statistical methodology and computational tools, including R packages like SEMID and symRC . Drton collaborates internationally, contributing to projects like the TUM-ICL Mathematical Sciences Hub and Exzellenzcluster MCQST. His work bridges algebraic methods with statistical challenges, addressing identifiability in latent variable models and robust graphical modeling under non-Gaussian assumptions. Recent research emphasizes causal structure learning under partial homoscedasticity, distribution-free independence tests, and multi-domain causal representation learning. Drton’s lab actively explores applications in genomics, epidemiology, and machine learning, leveraging both theoretical rigor and practical computational methods.

• Graphical models
• Algebraic statistics
• Causal inference
• +3 more

Prof. Dr.-Ing. Lars Linsen is a full Professor of Computer Science at the Westfälische Wilhelms-Universität (WWU) Münster, leading the VISualization & graphIX (VISIX) group. His primary affiliation is the Institute of Computer Science within the Faculty of Mathematics and Computer Science. He holds adjunct professorships at Jacobs University, Bremen, and has held previous academic roles including Full Professor at Jacobs University (2012–2017) and Associate/Assistant Professor roles in Germany and the U.S. His research focuses on interactive visual analysis, medical visualization, and scientific visualization, with applications in life sciences and engineering. Education: PhD (Dr.-Ing.) in Computer Science from Universität Karlsruhe (2001), M.Sc. (Diplom) in Computer Science (1997), B.Sc. (Vordiplom) in Computer Science (1994). Awards: IEEE Visualization Design Contest Winner (2008, 2022, 2018), Preis des Fördervereins des Forschungszentrum Informatik (2002). Research Highlights: Develops visualization tools for medical imaging (e.g., mass spectrometry imaging, MRI data analysis) and physical simulations (e.g., wildfire spread analysis, asteroid impact modeling). Active in EU-funded projects like Pig-Pro-QuO (surface coatings) and cells-in-motion initiatives. Supervised over 20 PhD/MS advisees, including notable graduates in medical visualization and simulation ensemble analysis. Publications: Over 100 peer-reviewed articles in top venues like IEEE Transactions on Visualization and Computer Graphics, Computers & Graphics, and EuroVis. Key works include SciVis contest-winning wildfire analysis frameworks and medical visualization tools for stenosis detection. Teaching: Offers courses on visualization, computer graphics, and computational science. Actively involved in thesis supervision and curriculum development at both WWU Münster and Jacobs University. Grants & Collaborations: Principal investigator on DFG-funded projects (e.g., hemodynamics simulations, ensemble visualization) and industry collaborations (e.g., Tascon GmbH for coating quality analysis). Member of the Cells-in-Motion Interfaculty Centre and CDH board at WWU.

• Interactive Visual Analysis
• Medical Visualization
• Scientific Visualization
• +4 more

Manfred Droste is a Professor at the Institute of Computer Science of the University of Leipzig, where he leads the Research Group on Automata and Formal Languages. He serves as Director of the Graduate Centre Mathematics, Computer Science and Natural Sciences and is Vice-speaker of the DFG-Research Training Group Quantitative Logics and Automata. His academic career spans decades of research and leadership in theoretical computer science and algebra. Prof. Droste's research focuses on theoretical computer science, particularly automata theory, logic, algebraic models for concurrent systems, and domain theory. In algebra, his interests include model theory, automorphism groups, and ordered algebraic structures. His work bridges theoretical foundations with practical applications in formal language theory and quantitative systems. His extensive publication record demonstrates a consistent focus on weighted automata, formal languages, and their logical characterizations. Over the years, his research has evolved to address increasingly complex quantitative models, with recent work focusing on weighted complexity classes, weighted linear dynamic logic, and decidability boundaries for weighted automata. Prof. Droste has received significant recognition including election to Academia Europaea, an honorary doctorate from Immanuel Kant Baltic Federal University, and fellowship in the Asia-Pacific Artificial Intelligence Association. These honors reflect his substantial contributions to theoretical computer science. He has supervised numerous PhD students including Dietrich Kuske, Paolo Boldi, and Karin Quaas, many of whom have become prominent researchers. His extensive grant portfolio includes multiple DFG projects on weighted automata and international collaborations through DAAD funding. Prof. Droste leads a vibrant research team including Andrea Hesse, Karin Quaas, Erik Paul, and others. He has organized the international workshop series "Weighted Automata: Theory and Applications" since 2002, fostering global collaboration in this specialized field.

• Theoretical Computer Science
• Automata Theory
• Logic
• +6 more

Christopher Deninger is a distinguished Professor in the Mathematical Institute at the University of Münster, Germany, where he leads research in Arithmetic Geometry and Representation Theory. His office is located in Room 413 of the Einsteinstr. 62 building, and he maintains active teaching responsibilities including courses in Representation Theory of Finite Groups, Linear Algebra, and specialized topics like Adic Spaces. Deninger's research spans multiple interconnected domains of modern mathematics, with a consistent focus on the deep connections between number theory and geometry. His work has evolved from classical arithmetic geometry to incorporate increasingly sophisticated connections with p-adic analysis, dynamical systems, and more recently proalgebraic fundamental groups. A unifying theme throughout his career has been exploring analogies between different mathematical structures, particularly those connecting analytic number theory with dynamical systems on foliated spaces. His recent publications reveal a continued expansion of his research program into new territories while maintaining connections to his foundational work. The most recent papers show increasing integration of algebraic topology concepts with arithmetic geometry, particularly through proalgebraic fundamental groups and their applications. The consistent thread throughout his decades of publications is the search for deeper structural connections between seemingly disparate areas of mathematics, particularly those bridging analysis, geometry and number theory. Professor Deninger has mentored an extensive number of doctoral students and postdoctoral researchers, as evidenced by the comprehensive list of former members in his working group. His collaborations span the international mathematical community, with numerous joint publications with leading mathematicians across Europe and beyond. While specific grant information isn't detailed in the available materials, his sustained publication record across decades suggests consistent research support for his mathematical investigations. The Mathematical Institute at Münster provides the institutional home for Deninger's research activities, where he maintains an active working group focused on arithmetic geometry and related fields. His office environment includes support staff and colleagues working in closely related mathematical domains, creating a vibrant research community centered around advanced topics in pure mathematics.

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

Prof. Felix Krahmer is a TUM Tenure Track Assistant Professor of Optimization and Data Analysis at the Department of Mathematics, Technische Universität München (TUM), part of the School of Computation, Information and Technology. Previously, he held a Junior Professorship (W1) for Mathematical Data Analysis at the University of Göttingen (2012–2015). His research focuses on mathematical foundations of data science, including compressed sensing, signal quantization, uncertainty quantification, and optimization algorithms. He has led an Emmy Noether research group and contributed to the ZeMat interdisciplinary project. Education : PhD in Mathematics (2009), New York University, advisors: Percy Deift & Sinan Güntürk MSc in Mathematics (2007), New York University BSc in Mathematics (2004), Jacobs University Bremen Research Interests : Krahmer’s work bridges theoretical mathematics and applied data science. Key areas include compressed sensing algorithms, high-dimensional signal reconstruction, quantization theory for analog-to-digital conversion, and optimization methods for inverse problems. He also explores applications in imaging (e.g., MRI reconstruction) and stochastic processes. Key Contributions : His research on phase retrieval, sigma-delta quantization, and compressed sensing recovery has advanced signal processing techniques. Recent efforts focus on uncertainty quantification for high-dimensional inverse problems and the mathematical analysis of consensus-based optimization. Grants & Awards : Emmy Noether Research Group Grant (DFG) Funding from BMBF (ZeMat project) Teaching & Outreach : Krahmer has taught advanced courses on compressed sensing, functional analysis, and random matrix theory. He co-organized workshops on probabilistic techniques and clinical risk prediction, emphasizing interdisciplinary collaboration. Labs/Teams : Member of the TUM Data Science Research Group, focusing on optimization, imaging, and uncertainty quantification. Active in the Munich Center for Quantum Science and Technology (MCQST).

• Compressed Sensing
• Signal Processing
• Optimization
• +4 more

Zachary Kincaid is an Associate Professor in the Department of Computer Science at Princeton University's School of Engineering and Applied Science. His research focuses on program analysis, logic, and programming languages, with an emphasis on making program analysis compositional and robust. He received his PhD from the University of Toronto under the supervision of Azadeh Farzan. His work has been implemented in the Duet program analyzer, and he has an Erdős number of 3. Dr. Kincaid's research interests include: Compositional program analysis techniques Algebraic approaches to program analysis Termination analysis and ranking function synthesis Verification of concurrent and parallel programs Automated reasoning and decision procedures Analysis of numerical programs and loops His recent publications show a strong focus on developing novel techniques for program analysis that bridge theoretical computer science with practical verification tools, particularly in nonlinear analysis, quantified reasoning, and compositional verification. Dr. Kincaid has received research support from ONR grant N00014-19-1-2318 for his work on robust program analysis. He has advised graduate students including: Current: Jake Silverman, Nicolas Koh, Nikhil Pimpalkhare Graduated: Shaowei Zhu (PhD 2024, Researcher at Amazon), Charlie Murphy (PhD 2023, Postdoc at University of Wisconsin–Madison) Dr. Kincaid teaches courses including: COS 320 – Compiling Techniques (Spring 2024, 2022, 2020, 2019) COS 516 / ELE 516 – Automated Reasoning about Software (Fall 2025, 2022, 2018) COS 217 – Introduction to Programming Systems (Fall 2024) COS IW – Practical Solutions to Intractable Problems (Fall 2023, Spring 2023, 2018, 2017) COS IW – Little Languages (Spring 2018) COS 597D – Reasoning about concurrent systems (Fall 2016)

• Program Analysis
• Formal Methods
• Programming Languages
• +4 more

Martin Grohe is a Professor at the School of Logic and Theory of Discrete Systems , part of the Department of Computer Science at RWTH Aachen University . His research spans Algorithms and Complexity , Logic , Database Theory , Graph Theory , and Machine Learning , with a focus on integrating logical frameworks into computational models. His recent work explores graph neural networks , Weisfeiler-Leman algorithms , and parameterized complexity , as seen in publications on isomorphism testing , database repairing , and probabilistic query evaluation . While no specific scientific awards are mentioned, his contributions to graph theory and machine learning are widely recognized through numerous peer-reviewed publications.

• Algorithms and Complexity
• Logic
• Database Theory
• +2 more

Sandra Keiper is a Lecturer at the Institute of Mathematics within Faculty II - Mathematics and Natural Sciences at Technical University of Berlin. She has held academic positions since at least 2011, including roles as Tutor, Assistant, and Lecturer, with teaching responsibilities in Analysis, Linear Algebra, and Partial Differential Equations for both mathematicians and engineers. Research interests include: Compressed Sensing and Sparse Signal Recovery Numerical Linear Algebra with applications to high-dimensional data Wavelet and curvelet transforms for geometric multiscale analysis Approximation theory for finite-valued and cartoon-like functions Deep learning and graph approximation techniques Professional activities : Active in teaching since 2011 (Analysis I-III, Functional Analysis, Integral Transforms) Supervising theses since 2015 on topics like Compressed Sensing and Deep Learning Invited lectures at Caltech, ETH Zurich, and Alan Turing Institute Research stays at Hausdorff Institute, ETH Zurich, and Duke University

• Compressed Sensing
• Sparse Signal Recovery
• Numerical Linear Algebra
• +5 more

Prof. Dr. Christian Plessl is a W3 Professor of High-Performance Computing at the Institute of Computer Science, University of Paderborn. He leads the Paderborn Center for Parallel Computing (PC²), a national HPC center within the NHR alliance. His roles include Director of PC², Board Member of the NHR association, and member of the Sonderforschungsbereich 901. Education: PhD (Dr. sc. ETH) in Computer Engineering, ETH Zürich (2006) MSc in Electrical Engineering, ETH Zürich (2001) Postdoc at ETH Zürich (2007–2011) Research Interests: Architecture and tools for high-performance parallel and reconfigurable computing, FPGA acceleration, quantum chemistry, scientific computing, adaptive systems, and energy-efficient HPC solutions. Key projects include EKI-App (FPGA-based neural networks), FPGA4XPCS (X-ray spectroscopy), and HighPerMeshes (unstructured grid frameworks). Publications: Over 100 peer-reviewed works, focusing on FPGA acceleration, HPC frameworks, and quantum computing. Recent trends emphasize energy-efficient neural networks, FPGA-based quantum computing, and scalable HPC algorithms. Awards: Best Paper Awards at HEART 2023, ReConFig 2012/2014 Paderborn University Research Awards (2018, 2009) SEW-EURODRIVE Student Award (2001) Grants & Projects: Principal investigator in DFG, BMBF, and EU-funded projects. Collaborates with AMD/Xilinx, Intel/Altera, and Fujitsu. Leads initiatives like PerficienCC (custom computing) and HighPerMeshes. Labs/Teams: Directs the High-Performance Computing group at PC², focusing on FPGA supercomputing and HPC infrastructure. Active in the NHR alliance for national HPC coordination.

• High-Performance Computing
• Reconfigurable Computing
• FPGA Acceleration
• +3 more

Matthew K. Tam is an Associate Professor at the School of Mathematics and Statistics, The University of Melbourne, specializing in Operations Research. He is also an investigator at the Melbourne Centre for Data Science and an associate investigator in the ARC Training Centre OPTIMA. PhD in Mathematics (2016) from University of Newcastle under Jonathan Borwein Postdoctoral research at University of Göttingen with RTG-2088 and Alexander von Humboldt Foundation Junior Professor at University of Göttingen (2017-2020) His research focuses on continuous optimization, monotone operator theory, and variational analysis, with applications in wavelet construction and inverse problems. Key trends include distributed algorithms, resolvent splitting, and convergence analysis for feasibility problems. Discovery Early Career Researcher Award (DECRA) Alexander von Humboldt Fellowship He collaborates with institutions like ANZIAM, Springer, and IEEE, with publications spanning mathematical optimization, harmonic analysis, and computational mathematics. His work emphasizes algorithmic design for complex data systems and real-world applications in imaging and industrial modeling.

• continuous optimisation and its applications
• monotone operator theory
• variational and convex analysis
• +3 more