جست‌وجوی استاد و پژوهشگر

Florian Schäferمشاهده پروفایل

استادیار

• Numerical Analysis
• Computational Mathematics
• Machine Learning
• +۹ مورد دیگر

Florian Schäfer is an Assistant Professor at the School of Computational Science and Engineering at Georgia Tech. His research spans numerical computation, statistical inference, and competitive games, with applications in materials science, turbulence modeling, computer graphics, and computational geometry. He will join the Courant Institute at NYU in September 2025. PhD in Applied and Computational Mathematics, Caltech Bachelor’s and Master’s in Mathematics, University of Bonn His work focuses on information geometric mechanics to design structure-preserving numerical methods for continuum mechanics. This includes: State-of-the-art solvers for elliptic PDEs via Gaussian elimination and conditional independence Efficient multi-agent optimization algorithms Information geometric regularization for compressible fluid dynamics Enabling the first compressible fluid simulation exceeding 100 trillion grid cells His recent research trends integrate: Machine learning for materials science (e.g., active learning, Bayesian approaches) Stochastic modeling of microstructures and phase-field problems Neural operators for super-resolution fluid dynamics Generative models for polycrystalline material datasets Optimal transport and diffusion models for conditional density transformations High-performance computing at extreme scales Florian collaborates with researchers including Houman Owhadi, Jessie Liu, Spencer Bryngelson, Tamer Zaki, and Ali Mani. He actively presents at conferences like SIAM and UCLA seminars, and is recruiting PhD students for work at the Courant Institute starting 2025.

Supratik Chakrabortyمشاهده پروفایل

استاد

• Formal Methods
• Formal Verification
• Automated Synthesis
• +۷ مورد دیگر

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

Laura Andersonمشاهده پروفایل

دانشیار

• Combinatorics
• Topology
• Matroid Theory
• +۳ مورد دیگر

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

John F. Cannyمشاهده پروفایل

استاد

• Artificial Intelligence
• Robotics
• Human-Computer Interaction
• +۵ مورد دیگر

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.

• Scientific Machine Learning
• Numerical Linear Algebra
• Numerical Multilinear Algebra
• +۷ مورد دیگر

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.

• Numerical Modeling
• Computational Simulation
• Materials Science
• +۵ مورد دیگر

Assoc Prof Ng Teng Yong is an Associate Professor at the School of Mechanical & Aerospace Engineering (NTU), specializing in numerical modeling and simulation. With a background as Research Manager at A*STAR Institute of High Performance Computing, his work spans materials science, nanotechnology, and aerospace engineering. Current focus on graphene-based desalination membranes Expertise in molecular dynamics simulations Investigates nanoscale fluid mechanics and structural dynamics Recent publications highlight advancements in energy-efficient electrodialysis, smart robotics, and nonlinear vibration analysis. His interdisciplinary approach integrates computational methods with experimental validation in additive manufacturing and soft material mechanics.

Yiping Luمشاهده پروفایل

استادیار

• Machine Learning
• Scientific Machine Learning (AI4Science)
• Numerical Algorithms
• +۷ مورد دیگر

Yiping Lu is an Assistant Professor in the Department of Industrial Engineering and Management Sciences at Northwestern University's McCormick School of Engineering. His research focuses on developing interdisciplinary approaches combining domain knowledge (differential equations, stochastic processes), machine learning, and experiments. Key interests include scientific machine learning (AI4Science), stochastic simulation, and robust machine learning. Education: Ph.D. in Applied and Computational Mathematics, Stanford University (2023) B.S. in Computational Mathematics, Peking University (2019) Research Highlights: Hybrid research integrating ML with scientific domains like PDEs and inverse problems Development of Physics-Informed Learning frameworks Contributions to deep learning theory (ResNets, neural collapse) Advances in kernel operator learning and adversarial robustness Awards: CPAL Rising Star Award (2024) University of Chicago Data Science Rising Star (2022) Stanford Interdisciplinary Graduate Fellowship (2021) Labs/Teams: SCALE Lab (Scientific Computation and Learning at Northwestern) Collaborations with NYU's Courant Institute and Stanford

Lucas Pahlمشاهده پروفایل

مدرس

• Mathematical Game Theory
• Fixed Point Theory
• Algebraic Topology
• +۳ مورد دیگر

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.

Lucia Carichinoمشاهده پروفایل

استادیار

• Mathematical Biology
• Fluid Dynamics
• Numerical Methods
• +۵ مورد دیگر

Lucia Carichino is an Assistant Professor in the School of Mathematics and Statistics at Rochester Institute of Technology (RIT). She holds a PhD in Mathematics from Purdue University and a BS/MS in Mathematical Engineering from Politecnico di Milano, Italy. Her research focuses on mathematical and computational models of multiscale biological systems, particularly fluid-structure interaction in biological contexts like ocular blood flow and microswimmers. She emphasizes integrating experimental data with mathematical models to advance medical understanding. Carichino teaches courses such as Differential Equations, Linear Algebra, and oversees undergraduate research projects. In 2023, she received the National Science Foundation LEAPS-MPS award for her work on computational modeling of eye-contact lens interactions. Her research has been published in high-impact journals and presented at conferences. She actively collaborates on projects addressing glaucoma, ocular hemodynamics, and biomedical applications. Education: PhD in Mathematics, Purdue University BS and MS in Mathematical Engineering, Politecnico di Milano, Italy Research interests include fluid dynamics, numerical methods, and mathematical biology. Her work bridges theoretical models with biomedical applications, such as optimizing gene therapy delivery and analyzing ocular physiology under varying environmental conditions (e.g., altitude). She explores topics like sperm motility, computational simulations of biological systems, and the interplay between fluid dynamics and biological structures. Her recent articles highlight advancements in ocular pharmacokinetics, contact lens interactions, and altitude effects on intraocular pressure. These studies underscore her expertise in multiscale modeling and fluid-structure interaction. Carichino also contributes to educational initiatives, fostering a collaborative classroom environment. Notable awards include the NSF LEAPS-MPS award (2023). She advises student research projects and collaborates with colleagues, such as Maki, on interdisciplinary studies. Her work is supported by grants and has led to presentations at ophthalmology and mathematics conferences. Carichino’s lab focuses on computational modeling of biological systems, particularly in ophthalmology and microscale fluid dynamics. Her team develops tools to simulate complex physiological processes, aiding in medical diagnostics and treatment strategies.

David Perkinsonمشاهده پروفایل

استاد

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

David Perkinson is a Professor of Mathematics at Reed College, where he holds a position in the Department of Mathematics. His research focuses on combinatorics, algebraic geometry, and discrete mathematics, with a particular emphasis on sandpile models, graph theory, and matroid theory. He is the author of the textbook *Divisors and Sandpiles: An Introduction to Chip-Firing*, which explores the combinatorial theory of chip-firing on graphs. Perkinson has also developed software tools like the Sandpile Java App, which visualizes and analyzes the Abelian Sandpile Model. He organizes the Cascade Lectures in Combinatorics (CALICO), a series of conferences funded by the National Science Foundation, aimed at fostering collaboration among researchers in combinatorics. His work bridges discrete mathematics with algebraic geometry, emphasizing connections between graph theory and geometric structures. Perkinson teaches advanced courses in analysis and contributes to the academic community through his research on topics such as divisor theory on graphs, sandpile groups, and combinatorial game theory. His recent publications (2015–2024) address matroid theory, sandpile dynamics, and applications of algebraic methods to discrete systems.

John MacLaren Walshمشاهده پروفایل

استاد

• Information Theory
• Network Coding
• Distributed Computing
• +۴ مورد دیگر

John MacLaren Walsh is a Professor in the Department of Electrical and Computer Engineering at Drexel University, where he leads the Adaptive Signal Processing and Information Theory Research Group. He holds BS, MS, and PhD degrees from Cornell University, all completed under Dr. C. Richard Johnson, Jr. His research spans information theory, network coding, distributed computing, and machine learning applications in patent analysis. His work focuses on: Bounding entropic vectors and their impact on communication networks Rate region computation for network coding and distributed storage Information theory for distributed function computation Machine learning-enhanced patent processing systems Publications emphasize entropy geometry, network coding complexity, distributed algorithms, and patent analysis, with consistent themes of optimization and combinatorial methods. Recent work (2016-2019) shows increased focus on probabilistic supports and computational efficiency in network coding. Awards: 2011 NSF CAREER Award for 'Entropy Geometry in Variational Inference Signal Processing' He has advised PhD students on topics like entropy region mapping, network coding, and distributed control. Key grants include NSF CAREER and AFOSR funding for wireless network overhead control. He directs the Adaptive Signal Processing and Information Theory Research Group, which develops algorithms for network coding, distributed storage, and patent analysis systems.

Jonathan A. Kelnerمشاهده پروفایل

استاد

• Algorithms
• Spectral Graph Theory
• Combinatorial Optimization
• +۷ مورد دیگر

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.

Gil Kalaiمشاهده پروفایل

استاد

• Combinatorics
• Geometric Combinatorics
• Probabilistic Combinatorics
• +۷ مورد دیگر

Gil Kalai is a Professor of Mathematics at the Hebrew University of Jerusalem since 1992, where he holds the Henry and Manya Noskwith Chair. He also serves as an Adjunct Professor of Mathematics and Computer Science at Yale University since 2004 in a long-term part-time visiting position. His academic career includes visiting positions at prestigious institutions including MIT, Cornell, IAS Princeton, Berkeley, Bell-labs, IBM, and Microsoft. Professor Kalai's research spans multiple areas within mathematics and theoretical computer science. His work in combinatorics encompasses geometric, probabilistic, and topological approaches. He has made significant contributions to the study of convex sets and polytopes, linear programming, and theoretical computer science. His influential 1988 paper with Kahn and Linial on Boolean functions pioneered applications of Fourier analysis in theoretical computer science. Kalai's research has evolved to include the application of Fourier analysis to thresholds, influences, symmetries, noise, percolation, and social choice. He has developed theories in algebraic shifting and studied face-numbers and other combinatorial invariants of polytopes. His work on the diameter of polytopes and randomized simplex algorithms has been influential in optimization theory. In 1993, his collaboration with Kahn produced a groundbreaking counterexample to Borsuk's Conjecture in 1325 dimensions. Professor Kalai's publications reveal a consistent focus on the intersection of combinatorics, geometry, and theoretical computer science. His work shows a progression from foundational combinatorial geometry to increasingly sophisticated applications of harmonic analysis in discrete mathematics. The recurring themes across his 30+ year career include Boolean functions, polytope theory, and probabilistic methods in combinatorics, demonstrating remarkable coherence in his research trajectory. 2016 European congress of Mathematics, plenary speaker 2013 ERC advanced grant 2012 Rothschild Prize 1994 International Congress of Mathematicians invited section talk, Zurich 1994 Fulkerson Prize 1993 Erdos Prize 1992 Polya Prize Though specific details of his advising are not provided in the source material, Kalai has written over 70 scientific papers and maintains an active research blog entitled "Combinatorics and More." His 2013 ERC advanced grant indicates significant research funding for his work. His extensive collaborations with researchers across multiple institutions suggest a robust research program with numerous PhD students and postdoctoral researchers, though specific names are not mentioned in the provided texts. Professor Kalai maintains active research connections across multiple institutions including Hebrew University, Yale, and various research centers worldwide. His work bridges pure mathematics and theoretical computer science, creating a unique interdisciplinary research environment that influences both fields.

Anders Rantzerمشاهده پروفایل

استاد

• Control Systems Theory
• Scalable Control
• Adaptive Control
• +۷ مورد دیگر

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.

Ivan Dokmanicمشاهده پروفایل

استادیار

• Machine Learning
• Signal Processing
• Inverse Problems
• +۱۱ مورد دیگر

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 .