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

Tarek Sayedمشاهده پروفایل

استاد

• Transportation Engineering
• Traffic Safety Analysis
• Intelligent Transportation Systems (ITS)
• +۴ مورد دیگر

Dr. Tarek Sayed is a Professor at the University of British Columbia's Department of Civil Engineering within the Faculty of Applied Science. He specializes in Transportation Engineering, focusing on road safety analysis, traffic operations, and Intelligent Transportation Systems (ITS). He serves as the Director of the Bureau of Intelligent Transportation Systems and Freight Security (BITSAFS-Engineering) and Editor of the Canadian Journal of Civil Engineering . His research addresses three core areas: improving road safety evaluation techniques, enhancing safety through traffic operations and highway design analysis, and advancing ITS technologies. Notable contributions include frameworks for safety-audits of infrastructure projects like the Sea to Sky Highway and methodologies for evaluating transit signal priority systems in Vancouver. He has authored/co-authored over 250 publications and supervised 60 graduate students. Key Roles: Professor, BITSAFS Director, Journal Editor Awards: Tier 1 Canada Research Chair, Wilbur Smith Award, Sandford Fleming Award, Prince Michael International Road Safety Award Consulting: Global projects in traffic safety and ITS for agencies like ICBC, FHWA, and Ashghal His research integrates Bayesian statistical methods, extreme value theory, and machine learning to model traffic conflicts, pedestrian behavior, and safety interventions. Current projects include real-time safety optimization using autonomous vehicle data and analyzing shared space interactions between cyclists and pedestrians. Dr. Sayed chairs national/international committees, including the U.S. Transportation Research Board’s safety data committee. His work bridges academia and practice, influencing policy and infrastructure investment decisions worldwide.

Caterina Consaniمشاهده پروفایل

استاد

• Arithmetic Geometry
• Number Theory
• Non-Commutative Geometry
• +۳ مورد دیگر

Caterina Consani is a Professor of Mathematics at Johns Hopkins University's Krieger School of Arts & Sciences. She holds a PhD from the University of Chicago (1996) and a Dottore di Ricerca in Matematica from the Universities of Genoa and Turin (1993). Her research focuses on arithmetic geometry, non-commutative geometry, and the development of absolute geometry over the 'absolute point.' She has contributed to foundational work on the BC-system, the Arithmetic Site, and the Scaling Site, linking number theory with geometric frameworks. Education: PhD in Mathematics, University of Chicago (1996); Dottore di Ricerca in Matematica, Universities of Genoa & Turin (1993). Prior to Johns Hopkins, she taught at MIT (1996–1999) and the University of Toronto (1999–2005). Research Interests: Arithmetic geometry, non-commutative geometry, absolute geometry in characteristic one, connections to number theory and the Riemann Hypothesis. Collaborations include work with Alain Connes on adele class spaces and non-commutative algebraic geometry. Awards: Fellow of the American Mathematical Society (2024); 2025 Best Paper AOFA Award (Annals of Functional Analysis). Editorial roles include the Journal of Number Theory and Journal of Noncommutative Geometry. Teaching: Offers advanced courses in algebraic geometry and number theory, including topics like étale cohomology and the yoga of weights in 'Weil II.' Grants: Supported by the Simons Foundation. Organized major conferences such as the JAMI Conference on Riemann-Roch in Characteristic One (2019).

Joan Brunaمشاهده پروفایل

استاد

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

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.

Afonso S. Bandeiraمشاهده پروفایل

استاد

• High Dimensional Probability
• Random Matrices
• Mathematical Statistics
• +۳ مورد دیگر

Afonso S. Bandeira is a Professor in the Department of Mathematics (D-MATH) at ETH Zurich, where he conducts research at the intersection of mathematics, statistics, and computer science. He maintains strong affiliations with several interdisciplinary research centers including the Institute For Operations Research (IFOR), the Max Planck ETH Center for Learning Systems, the ETH Foundations of Data Science, and the ETH AI Center, with a courtesy appointment at D-ITET. Bandeira actively teaches courses including Mathematics of Signals, Networks, and Learning, and Mathematics of Data Science. His research focuses on High Dimensional Probability, Random Matrices, Mathematical Statistics, Theoretical Computer Science, Combinatorics, and Mathematical Optimization. Bandeira's work often explores the theoretical foundations of data science, examining phase transitions in statistical problems, computational barriers, and the geometry of high-dimensional spaces. He maintains a research group blog called Randomstrasse101 that emphasizes open problems in his field. Analysis of his recent publications reveals a strong focus on matrix and tensor concentration inequalities, synchronization problems, nonconvex optimization landscapes, and computational-statistical tradeoffs in high-dimensional inference. His work bridges theoretical mathematics with practical applications in machine learning and data analysis, particularly examining where computational limitations arise in statistical problems. Bandeira actively mentors students and researchers, currently supervising several doctoral candidates including Daniil Dmitriev, Konstantin Donhauser, Anastasia Kireeva, Kevin Lucca, Chiara Meroni, Gil Kur, Petar Nizic-Nikolac, and Almut Roedder. He emphasizes that students working with him should participate in the DACO seminar and group meetings, and encourages prospective students to have completed his Mathematics of Signals, Networks, and Learning or Mathematics of Data Science courses. He leads a research group focused on the mathematics of data science, with regular group meetings and seminars. Bandeira has developed comprehensive lecture notes including 'A Tour Through the Mathematics of Signals, Learning, and Networks' (2025) and 'Mathematics of Machine Learning' (2021), and previously authored 'Ten Lectures and Forty-Two Open Problems in the Mathematics of Data Science' (2015).

Zongyi Liمشاهده پروفایل

پژوهشگر ارشد

• Machine Learning
• Scientific Computing
• Partial Differential Equations
• +۵ مورد دیگر

Zongyi Li is a Research Fellow at Massachusetts Institute of Technology , hosted by Kaiming He. They are currently pursuing a Ph.D. in Computing and Mathematical Sciences at Caltech (2019-2025), mentored by Anima Anandkumar and Andrew Stuart. Ph.D. candidate: Computing and Mathematical Sciences, Caltech (2019-2025) B.Sc. in Computer Science and Mathematics with a Jazz minor from Washington University in St. Louis (2015-2019) They focus on Neural Operators for learning solution operators in Partial Differential Equations (PDEs) , particularly in fluid mechanics and earth science . Their work models physical simulations with chaotic behaviors and complex geometries, showing applications in weather forecasting , carbon storage , and aerodynamics simulation . Publications emphasize resolution-invariant models , chaotic systems , and zero-shot super-resolution capabilities. Their research combines Fourier analysis , graph networks , and physics-informed loss functions to achieve state-of-the-art performance in PDE solving with up to 1000x speedup over traditional solvers. Fellowships: Kortschak Scholarship PIMCO Fellowship Amazon AI4Science Fellowship Nvidia Fellowship MIT Novo Nordisk AI Fellowship Code & Open-Source: Co-developer of the NeuralOperator library Implementations for Fourier Neural Operators , Graph Neural Operators , and Tensorized Neural Operators Media Recognition: Quanta Magazine MIT Tech Review NVIDIA Features Towards Data Science

Amit Kumarمشاهده پروفایل

استاد

• Combinatorial Optimization
• Online Algorithms
• Clustering Algorithms
• +۵ مورد دیگر

Amit Kumar is the Jaswinder and Tarwinder Chadha Chair Professor in the Department of Computer Science and Engineering at IIT Delhi. His research focuses on combinatorial optimization, online algorithms, and algorithmic fairness. He has taught courses such as Approximation Algorithms (COL 754), Design and Analysis of Algorithms (COL 351), and Numerical Analysis (COL 726). His work spans theoretical computer science with applications to clustering, scheduling, and fairness in evaluation processes. Research Interests Kumar's research emphasizes developing efficient algorithms for online and dynamic settings, particularly in constrained optimization and biased evaluation systems. He explores theoretical foundations of clustering, load balancing, and resource allocation, with recent contributions to fair food delivery systems and coreset constructions. Publications His recent work includes advancements in online convex paging (STOC 2025), consensus clustering (SODA 2025), and fairness-aware algorithms (AAAI 2024). Over 70 papers across top venues like STOC, SODA, and ICML reflect his expertise in algorithm design and analysis. Awards Best Paper Award at ISAAC 2023 for 'Clustering What Matters in Constrained Settings' Teaching & Mentorship Kumar instructs graduate and undergraduate courses in algorithms, data structures, and numerical methods. He advises students through these courses and collaborates with researchers on NSF-funded projects related to approximation algorithms and streaming systems.

Anthony Rollettمشاهده پروفایل

استاد

• Additive Manufacturing
• Advanced Materials Processing and Manufacturing
• Digital Twins
• +۶ مورد دیگر

Anthony Rollett is a Professor in the Department of Materials Science and Engineering at Carnegie Mellon University , where he has been a faculty member since 1995. He serves as the Principal Investigator and Co-Director of the NASA-supported Institute for Model-Based Qualification & Certification of Additive Manufacturing (IMQCAM) and co-director of the Next Manufacturing Center . Prior to CMU, he held leadership roles at Los Alamos National Laboratory (1991-1995). Education: Ph.D., Materials Engineering, Drexel University (1987) MA, Metallurgy and Materials Science, Cambridge University (1977) Research Interests: Rollett’s work focuses on microstructural evolution and microstructure-property relationships in 3D using experiments and simulations. His expertise spans additive manufacturing , metal 3D printing , materials for energy systems , grain growth , recrystallization , and stereology , with techniques like high-energy diffraction microscopy (HEDM) and dynamic x-ray radiography (DXR) . Scientific Contributions: He has over 320 peer-reviewed publications and an h-index >80 . His recent articles highlight machine learning for laser processing , fatigue analysis of additively manufactured alloys, and design optimization for heat exchangers in supercritical CO2 and solar thermal applications . Scientific Awards: Fellow of ASM International (1996) Fellow of the Institute of Physics (UK) (2004) Fellow of The Minerals, Metals & Materials Society (TMS) (2011) Cyril Stanley Smith Award (TMS, 2014) Member of Honor, French Metallurgical Society (2015) US Steel Professor (2017) Francqui International Professor (2020-2021) International FAME Award (2023) Leadership & Impact: Rollett co-led the development of a NASA Space Technology Research Institute for additive manufacturing and established a new master’s program in additive manufacturing (2018). His research group is funded by industry , federal agencies , and Pennsylvania state grants . He also serves on the Basic Energy Science Advisory Committee and Defense Programs Advisory Committee for the Department of Energy.

Imre Leaderمشاهده پروفایل

استاد

• Extremal Combinatorics
• Ramsey Theory
• Combinatorial Number Theory
• +۳ مورد دیگر

Professor Imre Leader is a distinguished mathematician at the University of Cambridge, where he serves as Professor of Pure Mathematics in the Department of Pure Mathematics and Mathematical Statistics (DPMMS), which is part of the Faculty of Mathematics. His office is located in room C2.02 at the DPMMS building. Professor Leader's research primarily focuses on Extremal Combinatorics and Ramsey Theory , two fundamental areas of discrete mathematics. His work explores deep connections between combinatorial structures, set theory, and algebraic properties. He has made significant contributions to understanding partition regularity, monochromatic structures, extremal set theory, and combinatorial geometry. His research often bridges the gap between pure combinatorics and applications in computer science and theoretical mathematics. Over his prolific career, Professor Leader has published numerous influential papers in top mathematical journals, collaborating with leading mathematicians worldwide. His work spans various aspects of combinatorics including hypergraph theory, geometric combinatorics, additive number theory, and combinatorial game theory. He has been particularly active in advancing our understanding of Ramsey-type phenomena in infinite structures and developing new techniques in extremal combinatorics. Research Group: Combinatorics Email: I.Leader@dpmms.cam.ac.uk Telephone: 01223 765902 Personal homepage: https://www.dpmms.cam.ac.uk/~ibl10

Brian Conradمشاهده پروفایل

استاد

• Number Theory
• Arithmetic Geometry
• Algebraic Geometry
• +۳ مورد دیگر

Brian Conrad is a Professor of Mathematics at Stanford University, specializing in number theory and arithmetic geometry. He holds a position in the Department of Mathematics and has contributed extensively to algebraic geometry, algebraic number theory, and representation theory. His research encompasses foundational work on reductive groups, pseudo-reductive groups, and their applications in arithmetic contexts. Dr. Conrad is an editor for the Journal of the AMS, Algebra and Number Theory, and IMRN. He has organized numerous learning seminars, including those on étale cohomology and the BSD conjecture, and has taught advanced courses on algebraic geometry, class field theory, and modular forms. His work bridges classical algebraic geometry with modern arithmetic applications, emphasizing foundational proofs and geometric intuition. His editorial roles and seminar leadership reflect his commitment to advancing mathematical exposition and education. Education details are not explicitly provided in the texts, but his academic trajectory includes significant contributions to the field through publications and mentorship. Dr. Conrad's research has led to advancements in areas such as the classification of algebraic groups, étale cohomology, and the arithmetic of elliptic curves. His collaborative work with mathematicians like Chai, Oort, and Prasad has produced influential monographs, including Pseudo-reductive Groups and Complex Multiplication and Lifting Problems .

Marc Pollefeysمشاهده پروفایل

استاد

• Computer Vision
• 3D Reconstruction
• Robotics
• +۱۲ مورد دیگر

Marc Pollefeys is a Full Professor at the Department of Computer Science, ETH Zurich, and Director of the Microsoft Mixed Reality and AI Lab. His work focuses on advanced perception systems for HoloLens, 3D computer vision, robotics, and machine learning. Key contributions include automated 3D modeling from video, real-time reconstruction pipelines, and vision-based autonomous systems. Education: PhD from KU Leuven (1999) Previous Affiliation: Professor at UNC Chapel Hill Research interests span 3D reconstruction , computer vision , robotics , SLAM , augmented reality , and privacy-preserving mapping . His work often integrates geometric modeling , feature matching , and deep learning . Recent projects emphasize implicit 3D representations , open-vocabulary scene understanding , and robust estimation using neural-guided algorithms. Recent publications highlight advancements in neural implicit fields , line-based correspondence , and vision-language integration . Trends include hybrid point-line methods, differentiable RANSAC, and privacy-aware localization frameworks. Scientific recognition includes: IEEE Fellow (2012) David Marr Prize (ICCV 1998) DAGM Best Paper Award (1999) Advisees include current and alumni PhD students such as Yagız Aksoy, Federico Camposeco, and Sudipta Sinha. Collaborations span institutions like UNC Chapel Hill, ETH Zurich, and Microsoft Zurich. Research sponsors include Microsoft, Google, and European research initiatives.

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

دانشیار

• Applied Numerical Linear Algebra
• Eigenvalue Problems
• Network Analysis
• +۵ مورد دیگر

David Bindel is an Associate Professor in the Department of Mathematics at Cornell University, affiliated with the College of Arts and Sciences, College of Engineering, and Cornell Ann S. Bowers College of Computing and Information Science. He earned his Ph.D. in Mathematics from the University of California, Berkeley in 2006. His research focuses on applied numerical linear algebra, eigenvalue problems, and their applications in plasma physics, network analysis, and nonlinear systems. He develops methods for analyzing complex systems, including magnetic confinement in stellarators, stability of MHD systems, and community detection in networks. His work bridges theoretical foundations with practical computational tools, such as formal verification of linear algebra algorithms and scalable Gaussian process models. Bindel’s research explores the interplay between structure and computation, leveraging eigenvalue analysis to address challenges in computer vision, opinion dynamics, and engineering design. He has contributed to advancements in numerical methods for large-scale systems, including iterative solvers, spectral approximation techniques, and stochastic optimization. His interdisciplinary approach spans applied mathematics, computer science, and physics, with applications in fusion energy, machine learning, and network science. Recent work highlights include high-order expansions for magnetic confinement, adaptive filtering for dynamical systems, and Bayesian optimization strategies. His publications emphasize rigorous analysis alongside computational scalability, addressing both theoretical and practical aspects of modern scientific computing. Despite no explicitly listed awards, his contributions reflect significant impact in his fields.

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

دانشیار

• Computational Mechanics
• Fluid Dynamics
• Fluid-Structure Interaction
• +۳ مورد دیگر

John Evans is an Associate Professor and Jack Rominger Faculty Fellow in the Department of Aerospace Engineering Sciences at the University of Colorado Boulder, affiliated with the Applied Mathematics program. He serves as Associate Chair for Undergraduate Curriculum and is part of the Aerospace Mechanics Research Center (AMREC). His research focuses on computational mechanics, particularly fluid dynamics, fluid-structure interaction, and turbulence modeling using high-order and structure-preserving methods. Evans holds a PhD (2011) and MS (2008) in Computational and Applied Mathematics from the University of Texas at Austin, and dual BS/MS degrees in Mathematics and Applied Mathematics from Rensselaer Polytechnic Institute (2006). Before joining CU Boulder, he was a postdoctoral fellow at the Institute for Computational Engineering and Sciences (ICES). His research interests include isogeometric analysis, immersed methods, and data-driven turbulence modeling. Notable contributions include development of divergence-conforming discretizations for incompressible flows, stabilized collocation methods, and invariant subgrid stress models. He leads the AMREC lab and collaborates on plasma-fueled propulsion systems and geometrically sensitive simulations. Key Awards: 2021: Rocky Mountain AIAA Educator of the Year 2021: Gallagher Young Investigator Medal 2019-2021: Clarivate Highly Cited Researcher Professional Activities: Editor of Engineering Computations, Senior AIAA Member, Simons Visiting Professor (2019) Evans' work bridges advanced numerical methods with real-world engineering challenges. His lab develops open-source tools like XIGA for multi-material problems and focuses on immersive simulation environments. Current projects explore turbulence closure models, plasma propulsion, and topology optimization with B-spline-based approaches.

Sainyam Galhotraمشاهده پروفایل

استادیار

• Artificial Intelligence
• Causal Inference
• Database Systems
• +۴ مورد دیگر

Sainyam Galhotra is an Assistant Professor in the Department of Computer Science at Cornell University. His research focuses on developing data science tools for trustworthy analytics, integrating causal inference, data management, and machine learning to enhance robustness, explainability, and fairness in algorithmic systems. PhD: University of Massachusetts Amherst (2020), advised by Barna Saha B.Tech: Indian Institute of Technology Delhi (2014), advised by Amitabha Bagchi Postdoctoral Research: University of Chicago (Computing Innovation Fellow) His work spans artificial intelligence, causal inference, and responsible data science, emphasizing ethical algorithm design and reliable data integration. Recent publications highlight advancements in fair clustering, causal feature selection, and entity resolution frameworks. His research trends from 2023–2024 include contributions to spatio-temporal data correlation, community detection in geometric graphs, and distribution-aware dataset search. Key themes are fairness in machine learning, causal modeling, and scalable data management solutions. Computing Innovation Fellowship (2021) DAAD AInet Fellow (2021) ACM SIGMOD Entity Resolution Programming Contest Finalist (2021) Krithi Ramamritham Computer Science Scholarship (2019) BEST Paper Award in SIGSOFT FSE 2017 He actively seeks PhD or Master’s students interested in data science and trustworthy AI. Contact via email: sg@cs.cornell.edu .

Amir Ali Ahmadiمشاهده پروفایل

استاد

• Optimization Theory
• Control Theory
• Dynamical Systems
• +۷ مورد دیگر

Amir Ali Ahmadi is a Professor at Princeton University's Department of Operations Research and Financial Engineering (ORFE), with affiliations across multiple disciplines including PACM, Computer Science, Mechanical & Aerospace Engineering, Electrical Engineering, and the Center for Statistics and Machine Learning. He serves as Director of Princeton's Optimization and Quantitative Decision Science Certificate Program and has taken temporary roles at Citadel GQS (2021-2022) and Google Brain (2020-2021). His research bridges optimization theory , dynamical systems , and control theory , focusing on scalable algorithms for complex problems in robotics, autonomous systems, and machine learning. He has pioneered DSOS/SDSOS relaxations as alternatives to traditional sum-of-squares methods, enabling faster solutions through linear/second-order cone programming. Recent publications explore: Higher-order Newton methods for socially responsible investment Data-efficient learning of dynamical systems Computational complexity of local minima Robust-to-dynamics optimization frameworks Award highlights include: 2024 Egon Balas Prize in Optimization 2024 Princeton Engineering Council Teaching Award 2023 Distinguished Teaching Award (Princeton SEAS) 2019 NSF CAREER Award 2017 DARPA Young Faculty Award 2017 Sloan Fellowship in Computer Science He advises prominent researchers like Georgina Hall (Tucker Prize finalist) and Bachir El Khadir (Goldstine Fellow), and leads the Princeton Optimization Seminar and MURI project on Control-Oriented Learning on the Fly.

Heather Batteyمشاهده پروفایل

استاد

• Statistical Theory
• High-Dimensional Inference
• Sparsity in Statistics
• +۳ مورد دیگر

Heather Battey is a Professor in the Department of Mathematics at Imperial College London's Faculty of Natural Sciences. Her work bridges foundational statistical theory with practical scientific applications, focusing on parametrization effects, sparsity, and high-dimensional inference. Education PhD, University of Cambridge (2008-2011) Research Interests Battey's research examines how model structure and parametrization influence inferential procedures, particularly in high-dimensional settings. She investigates the equivalence between sparsity and reparametrization, and challenges traditional Fisherian statistical abstractions through modern practices. Her publications reveal a pattern of innovation in high-dimensional regression, covariance matrix analysis, and statistical methodology for complex data. Collaborations span disciplines including machine learning, economics, and biomedical research. Scientific Awards Fellow of the Institute of Mathematical Statistics (2023) EPSRC Early Career Research Fellowship (2020-2026) EPSRC Postdoctoral Research Fellowship (2017-2020) Advising and Grants Battey supervises PhD students Charlotte Edgar, Jakub Rybak, and Rebecca Lewis, with informal guidance to Henrique Hoeltgebaum. Over 15 pre-doctoral researchers have been mentored in topics ranging from support vector machines to spatial point processes. Current funding includes an EPSRC grant for theoretical foundations of inference with nuisance parameters and prior support for covariance matrix inference.