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

• Machine Learning
• Artificial Intelligence
• Data Science
• +۷ مورد دیگر

Pan Xu is a tenure-track assistant professor with joint appointments in the Department of Biostatistics & Bioinformatics, Department of Computer Science, and Department of Electrical & Computer Engineering at Duke University. Previously, Xu was a Postdoctoral Scholar Research Associate at Caltech's Department of Computing and Mathematical Science and earned a Ph.D. in Computer Science from UCLA. Xu's research focuses on developing computationally- and data-efficient machine learning algorithms with strong empirical performance and theoretical guarantees. Xu's research interests center around Machine Learning with broad applications in Artificial Intelligence, Data Science, Optimization, Reinforcement Learning, and High Dimensional Statistics. The research specifically targets real-world problems in Bioinformatics and Healthcare, with recent work emphasizing distributionally robust decision making, efficient exploration strategies, and multi-agent systems. Xu has developed novel algorithms that address the challenges of exploration in sequential decision making and robustness to distributional shifts between training and deployment environments. Xu's recent publications demonstrate a strong trend toward developing theoretically grounded yet practical algorithms for reinforcement learning and bandit problems, with particular emphasis on distributionally robust methods, efficient exploration techniques, and applications to healthcare. The work spans both theoretical analysis (providing minimax optimal regret bounds) and practical implementations (validated on benchmarks like Atari games and real healthcare datasets). Whitehead Scholar award from Duke University School of Medicine (2023) Best Paper Award at ACM FAccT 2023 for Queer In AI paper PIMCO Postdoctoral Fellowship in Data Science (2022) TMLR Featured Certification (2023) NSF award on approximate sampling based exploration (2023) Xu actively mentors multiple Ph.D. students across Duke's Biostatistics & Bioinformatics, Computer Science, and Electrical & Computer Engineering programs, with several alumni now pursuing doctoral studies at top institutions. The research group has secured competitive funding including an NSF award for approximate sampling based exploration for sequential decision making. Xu serves as an action editor for TMLR and as an area chair for major conferences including ICML, NeurIPS, AAAI, ICLR, and AISTATS. Xu leads a dynamic research group focused on sequential decision making, with projects spanning theoretical algorithm development, implementation of practical systems, and applications to healthcare and bioinformatics. The group maintains active collaborations across Duke's medical and engineering schools, with recent work applying machine learning to epidemic forecasting during the pandemic.

Jonathan Shihao Jiمشاهده پروفایل

دانشیار

• Deep Learning
• Computer Vision
• Natural Language Processing
• +۵ مورد دیگر

Jonathan Shihao Ji is an Associate Professor in the School of Computing at the University of Connecticut (UConn), leading the Intelligent Systems Lab. He holds a Ph.D. in Electrical and Computer Engineering from Duke University and previously served as an Associate Professor at Georgia State University and Director of the DoD Center of Excellence (CiARE). His research focuses on deep learning applications in computer vision, NLP, robotics, and high-performance computing, with over 50 publications in top venues like CVPR, NeurIPS, and IEEE journals. He has secured grants from NSF, NIH, DoD, and industry partners including VMware and Nvidia. His work emphasizes efficient algorithms for large-scale data processing, parameter-efficient model fine-tuning (e.g., VB-LoRA), and 3D perception benchmarks for UAVs (UAV3D). Notable contributions include sparse network optimization (Dep-L0), energy-based models (M-EBM), and robust defenses against adversarial attacks (Defense-VAE). He is a Senior Member of IEEE and has developed open-source tools like Parallel Word2Vec and WordRank. Recent projects include accelerating Llama2 models on FPGAs (LlamaF) and improving text-to-image synthesis via contrastive learning. His research spans theoretical advancements and practical applications, with industry collaborations in healthcare, robotics, and embedded systems.

Bryon Aragamمشاهده پروفایل

دانشیار

• Causality
• Statistical Machine Learning
• Probabilistic Modeling
• +۶ مورد دیگر

Bryon Aragam is an Associate Professor of Econometrics and Statistics and Robert H. Topel Faculty Scholar at the University of Chicago Booth School of Business. His research focuses on the intersection of causality, statistical machine learning, and probabilistic modeling, with particular emphasis on applications to artificial intelligence systems including large language models like ChatGPT and generative models like DALL-E. Dr. Aragam completed his PhD in Statistics and a Masters in Applied Mathematics at UCLA, where he was an NSF graduate research fellow. Prior to joining the University of Chicago, he was a project scientist and postdoctoral researcher in the Machine Learning Department at Carnegie Mellon University. Research Focus: Causal structure learning in probabilistic generative models Key Areas: Causal machine learning, deep generative models, latent variable models, statistical learning theory Applications: AI interpretability, ethics, and fairness in artificial intelligence systems Teaching: Business Statistics, Econometrics and Statistics Colloquium His recent publications demonstrate a strong theoretical foundation combined with practical applications, particularly in understanding and improving AI systems. His work spans causal discovery, graphical models, deep learning, and latent variable modeling, with particular attention to the theoretical properties of these methods and their applications to real-world AI challenges. The research shows a progression toward increasingly complex problems in causal representation learning and AI interpretability. Scientific Awards: Robert H. Topel Faculty Scholar NSF Graduate Research Fellow Dr. Aragam's work has been published in top statistics and machine learning venues including the Annals of Statistics, Neural Information Processing Systems (NeurIPS), the International Conference on Machine Learning (ICML), and the Journal of Machine Learning Research (JMLR). His research group publishes broadly across both statistical and machine learning communities, demonstrating the interdisciplinary nature of his work at the intersection of statistics, machine learning, and causal inference. As a data science consultant for technology and marketing firms, Dr. Aragam has applied his expertise to problems in survey design, customer retention, logistics, and ranking, bridging the gap between theoretical research and practical applications.

Roummel F. Marciaمشاهده پروفایل

استاد

• Optimization
• Signal Processing
• Data Science
• +۵ مورد دیگر

Roummel F. Marcia is a Professor and current Chair of the Department of Applied Mathematics at the University of California, Merced, within the School of Natural Sciences. He received his Ph.D. from UC San Diego under Professor Philip Gill and previously held postdoctoral positions at the San Diego Supercomputer Center and University of Wisconsin-Madison, as well as a research scientist position in electrical engineering at Duke University. His research spans multiple areas in optimization and its applications, with a focus on signal processing, data science, machine learning, linear algebra, and mathematical biology. Dr. Marcia's work has significant interdisciplinary impact, particularly in biomedical imaging, computational biology, and quantum computing applications. His research methodology often combines theoretical optimization approaches with practical applications in data-intensive fields. Dr. Marcia's recent publications demonstrate a strong trend toward integrating optimization theory with deep learning architectures, particularly in applications requiring sparse data handling, biomedical imaging, and quantum computing. His work shows increasing focus on developing novel optimization algorithms specifically designed for machine learning contexts, including quasi-Newton methods adapted for deep learning and specialized techniques for handling non-convex optimization problems. School of Natural Sciences Faculty Award for 'Developing or Improving Academic Programs and Tracks' (2021-22) Leadership roles in SIAM Activity Group on Applied Mathematics Education Recognition as a Math Alliance Mentor for supporting underrepresented students Dr. Marcia has successfully mentored numerous doctoral students to completion, with graduates moving to positions at Meta, Johns Hopkins University Applied Physics Laboratory, Lawrence Livermore National Laboratory, and other prestigious institutions. His research has been consistently funded by major agencies including NSF (with grants IIS 1741490, DMS 1840265, DMS 2229495, CCF 2343610), DARPA, and ARPA-E. As the current graduate chair of the Applied Math Graduate Program, he plays a key role in shaping the next generation of mathematical scientists. His work with the SMaRT (Scientific Mathematics Research and Training) team demonstrates his commitment to collaborative, interdisciplinary research.

• Business Process Management
• Process Mining
• Complex Event Processing
• +۵ مورد دیگر

Prof. Dr. Matthias Weidlich is a faculty member at Humboldt University of Berlin within the Institute of Computer Science under the Faculty of Mathematics and Natural Sciences . His research focuses on Process Mining , Complex Event Processing , and Data Privacy with applications in Business Process Management and Scientific Workflows . Research Interests: Business Process Management and Process Mining Complex Event Processing and Stream Data Analysis Data Privacy and Security in Process Systems Scientific Workflow Systems and User Behavior Heterogeneous Network Embeddings Algorithm Design and Optimization Recent Publications (2023-2025) demonstrate expertise in: Efficient stream processing techniques Privacy-preserving process mining frameworks Scientific workflow analysis tools Graph neural network applications Multi-modal data integration Adaptive querying systems Contact: Office: Unter den Linden 6, 10099 Berlin Phone: 030 2093-41277 Email: matthias.weidlich@hu-berlin.de Web: hu.berlin/data

Sebastian Cioabaمشاهده پروفایل

استاد

• Spectral Graph Theory
• Algebraic Combinatorics
• Graph Theory
• +۳ مورد دیگر

Sebastian Cioaba is a Professor in the Department of Mathematical Sciences at the University of Delaware (UD), part of the College of Arts & Sciences. His research focuses on spectral graph theory, algebraic combinatorics, and their applications. He earned his Ph.D. from Queen’s University (2005) and joined UD in 2009 after postdoctoral work at UC San Diego and the University of Toronto. Cioaba has advised 8 Ph.D., 4 M.Sc., and numerous undergraduate researchers, with current advisees including John Byrne and Isabel Byrne. His work is supported by NSF, NSA, and international grants. Education - B.Sc. Mathematics & Computer Science, University of Bucharest (Undergraduate) - Ph.D. Mathematics, Queen’s University (2005) Research & Awards - 2024 College of Arts & Sciences Award - Co-editor of Discrete Mathematics and Linear Algebra and its Applications - Over 70 publications and two books: A Bridge to Advanced Mathematics (2023) and A First Course in Graph Theory and Combinatorics (2022, 2nd ed.) Teaching & Service - Organized conferences in discrete mathematics - Supervised over 25 undergraduate and high school students in research projects Advising - Current Ph.D. students: John Byrne, Isabel Byrne, Colby Sherwood - Notable past advisees include Vishal Gupta (Ph.D. 2025, Rochester) and Dheer Noal (Ph.D. 2022, Memphis postdoc)

Alexandra Kjuchukovaمشاهده پروفایل

استادیار

• Topology
• Knot Theory
• Geometric Topology
• +۳ مورد دیگر

Alexandra Kjuchukova is an Assistant Professor in the Department of Mathematics at the University of Notre Dame, affiliated with the College of Science. Her research focuses on topology with an emphasis on knot theory, branched covers, and geometric structures in low-dimensional topology. She holds a Ph.D. in Mathematics from the University of Pennsylvania, an M.F.A. in Poetry from New York University, and a B.A. in Mathematics from Harvard College. Education: Ph.D., Mathematics, University of Pennsylvania (2015) M.F.A., Poetry, New York University (2010) A.B., Mathematics, Harvard College (2008) Research Interests: Dr. Kjuchukova’s work explores topological branched covers of manifolds, knot invariants, and geometric topology. She investigates relationships between knot groups, bridge numbers, and meridional ranks, with applications to 4-manifold topology and exotic structures. Recent projects include studies on dihedral covers, Coxeter quotients, and the Gordian graph filtration. Publications: Her work appears in journals like Advances in Mathematics , Communications in Analysis and Geometry , and Mathematische Annalen . Key themes include dihedral branched covers, symmetric quotients of knot groups, and the interplay between knot theory and algebraic geometry. Affiliations & Office: Based at 152A Hurley Bldg, she contributes to the Regular Faculty roster in the Notre Dame Mathematics Department. No awards are explicitly listed in her profile.

• Machine Learning
• Artificial Intelligence
• Data Science
• +۵ مورد دیگر

Pan Xu is a tenure-track assistant professor with joint appointments in the Department of Biostatistics & Bioinformatics, Department of Computer Science, and Department of Electrical & Computer Engineering at Duke University's Pratt School of Engineering. Prior to joining Duke, he was a Postdoctoral Scholar Research Associate at the California Institute of Technology, and he earned his Ph.D. in Computer Science from UCLA. His research bridges theoretical foundations with practical applications in machine learning and artificial intelligence. Dr. Xu's research focuses on developing computationally- and data-efficient machine learning algorithms with strong theoretical guarantees, particularly in reinforcement learning, optimization, and high-dimensional statistics. His work addresses two fundamental challenges in sequential decision-making: efficient exploration with minimal interactions and robustness against distributional shifts. His research spans theoretical algorithm design, practical implementation, and real-world applications in bioinformatics and healthcare. His publication record demonstrates consistent high-impact contributions to top-tier conferences including ICML, NeurIPS, ICLR, AAAI, and AISTATS. The research trends show a progression from foundational work in non-convex optimization and multi-armed bandits toward increasingly sophisticated frameworks for robust reinforcement learning, with particular emphasis on distributional robustness, efficient exploration strategies, and practical applications. His work often bridges theoretical guarantees with empirical validation. NSF award on approximate sampling based exploration for sequential decision making Whitehead Scholar award from Duke University School of Medicine PIMCO Postdoctoral Fellowship in Data Science UCLA Outstanding Graduate Student Research Award Rising Stars in Data Science by University of Chicago Best Paper Award for Queer In AI: A Case Study in Community-Led Participatory AI at FAccT 2023 Featured Certification for Wasserstein Distributionally Robust Policy Evaluation and Learning for Contextual Bandits at TMLR Oral Presentation award at AAAI 2024 Dr. Xu actively mentors students and researchers, seeking highly motivated individuals with strong mathematical backgrounds for Ph.D. programs in Biostatistics & Bioinformatics, Computer Science, and Electrical & Computer Engineering at Duke. He has received multiple research grants including an NSF award on approximate sampling based exploration for sequential decision making. His service to the academic community includes roles as area chair for NeurIPS, ICML, ICLR, and AISTATS, as well as action editor for Transactions on Machine Learning Research. His research group develops algorithms that address fundamental challenges in sequential decision-making, with applications spanning healthcare, bioinformatics, and multi-agent systems. Current research directions include distributionally robust reinforcement learning, efficient exploration strategies, and applications of graph neural networks to biological problems.

Max Fathiمشاهده پروفایل

استاد

• Optimal Transport
• Probability Theory
• Statistical Physics
• +۹ مورد دیگر

Max Fathi is a Professor of Mathematics at Université Paris Cité, affiliated with the Laboratoire Jacques-Louis Lions (LJLL) and Laboratoire de Probabilités, Statistique et Modélisation (LPSM). He concurrently holds a part-time teaching position at the Department of Mathematics and Applications (DMA) at École Normale Supérieure (ENS). Since 2023, he has been a member of the Institut Universitaire de France (IUF), a prestigious national research fellowship in France. He completed his PhD in 2013 at Université Pierre et Marie Curie under Cédric Villani, followed by a postdoctoral position at the University of California, Berkeley with Lawrence C. Evans and Fraydoun Rezakhanlou. Previously, he was a CNRS researcher at the Institut de Mathématiques de Toulouse before joining Université Paris Cité. His habilitation thesis (2019) focuses on optimal transport applications in analysis and probability. Fathi's research centers on optimal transport theory, particularly its applications to analysis, probability, and statistical physics. Key topics include interacting particle systems, functional inequalities (e.g., Poincaré, log-Sobolev), high-dimensional phenomena, Ricci curvature in discrete/continuous spaces, Stein's method, concentration of measure, and numerical methods for stochastic dynamics. His work is supported by the ANR project 'Conviviality.' He has delivered courses on functional analysis at ENS and participated in summer schools, including an MSRI course on functional inequalities and localization techniques. His teaching materials include lecture notes on optimal transport and stochastic processes. His contributions have been recognized through awards such as the IUF membership. Notable research collaborations include work with Thomas Courtade, Matthias Erbar, and Gabriel Stoltz on topics ranging from stability estimates of inequalities to hypocoercivity and numerical analysis of stochastic systems.

Feng Chenمشاهده پروفایل

دانشیار

• AI Safety
• Ethical AI
• Machine Learning
• +۷ مورد دیگر

Feng Chen is an Associate Professor in the Department of Computer Science at The University of Texas at Dallas (UT Dallas), part of the Erik Jonsson School of Engineering & Computer Science. He directs the AI Safety Laboratory and holds tenure. His research focuses on AI safety, ethical machine learning, uncertainty quantification, and fair algorithms. He earned a Ph.D. from Virginia Tech (2012), M.S. from Beijing University of Aeronautics & Astronautics (2004), and B.S. from Hunan University (2001). His research spans AI safety frameworks, resilient AI systems, fairness in healthcare and finance, cybersecurity, and environmental AI applications. Key contributions include uncertainty-aware deep learning, causal representation learning, and adversarial vulnerability analysis. He has authored over 150 peer-reviewed publications, including top venues like NeurIPS, ICML, KDD, and ICDM. Grants: $4.2M+ in funding from NSF, Army Research Office, IARPA, and industry partners. Teaching: Courses in data mining, anomaly detection, and artificial intelligence since 2014. Notable achievements include an NSF CAREER Award (2018) and leadership in projects like EMBERS (social media event prediction). His work bridges theory and practice, addressing societal challenges through ethical AI principles. Labs/Teams: AI Safety Laboratory (UT Dallas), collaborative projects with Virginia Tech, Carnegie Mellon, and industry partners on software vulnerability analysis and causal AI. Awards: Multiple best paper nominations, including 2nd Place in NAE Security Category (2009) and UT Dallas Outstanding Research (2021-2022).

Jingbang Chenمشاهده پروفایل

عضو هیئت علمی

• Algorithms
• Graph Theory
• Data Structures
• +۳ مورد دیگر

Jingbang Chen is a Research Assistant Professor at the School of Data Science, The Chinese University of Hong Kong, Shenzhen (CUHK-Shenzhen) and holds a joint faculty position at Shenzhen Loop Area Institute (SLAI) starting September 2025. His academic journey includes a Ph.D. from the University of Waterloo, an M.S. from Georgia Institute of Technology, and a B.Eng (Honors) from Zhejiang University under the supervision of Can Wang. Education: Ph.D., Computer Science, University of Waterloo (2023-2025) M.S., Computer Science, Georgia Institute of Technology (2020-2022) B.Eng. (Honors), Pursuit Science Class, Chu Kochen Honors College (Joint Program with College of Computer Science and Technology), Zhejiang University (2016-2020) High School, Guangzhou No.2 High School (2010-2016) Dr. Chen's research focuses on the design, analysis, and implementation of provably efficient algorithms and data structures, with a particular emphasis on graph theory. He is also exploring intersections between traditional algorithm design and artificial intelligence. His work bridges theoretical computer science with practical applications in network analysis, temporal data processing, and optimization. The publication record shows a strong trajectory with papers in top venues including ICML, VLDB, KDD, and theoretical computer science conferences. Scientific Contributions: Published in premier venues including ICML 2025, VLDB 2025, KDD 2024, and multiple theoretical conferences Research spans graph algorithms, optimization techniques, network analysis, and the emerging field of learning-augmented algorithms Active contributor to the competitive programming community as both researcher and practitioner Dr. Chen is deeply involved in Competitive Programming activities, having competed in ICPC World Finals 2018 (Beijing) and 2022 (Egypt), winning regional champion titles and several gold medals. He serves as chief judge for multiple ICPC Asia regionals and coaches training camps including the North American Programming Camp (NAPC). He is also the founder and co-president of the Universal Cup, an international competitive programming contest platform. Currently, he is recruiting highly motivated PhD students with strong backgrounds in competitive programming and interest in research, collaborating with Prof. Chenhao Ma on algorithm design projects.

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

استادیار

• Theoretical Computer Science
• Algorithms on large data sets
• Sublinear algorithms
• +۵ مورد دیگر

Diptarka Chakraborty is an Assistant Professor in the Department of Computer Science at the School of Computing, National University of Singapore (NUS). He obtained his PhD from the Indian Institute of Technology Kanpur in 2016 and held postdoctoral positions at Charles University, Prague, and the Weizmann Institute of Science, Israel. His educational background includes: PhD in Computer Science and Engineering, Indian Institute of Technology Kanpur, 2016 Dr. Chakraborty's research lies at the intersection of Theoretical Computer Science and Algorithms , specializing in sublinear algorithms , approximation algorithms , graph algorithms , and data structures for massive datasets. His work addresses computational hardness in edit distance, rank aggregation, and fault-tolerant graph structures, with recent emphasis on algorithmic fairness and streaming applications. Analysis of his 2020-2025 publications reveals dominant trends in fairness-constrained algorithms (e.g., fair rank aggregation) and scalable techniques for massive data (e.g., clustering permutations in streaming models), alongside foundational contributions to equivalence testing, model counting, and reachability under failures. His scientific contributions have been recognized with: Faculty Teaching Excellence Award 2024 Google South & Southeast Asia Research Award 2022 Best Paper Award at FOCS 2018 IBM Research India Outstanding Ph.D. Student Award 2015-16 Dr. Chakraborty actively mentors two PhD students and multiple research fellows while leading three major research projects: massive data handling under edit metrics, fair rank aggregation, and fault-tolerant graph structures. His Google Research Award supports investigations into computational challenges of fairness. He maintains an active research group with international collaborations and regular seminar participation across institutions including IITs, TIFR, and UC campuses.

Daniel McKenzieمشاهده پروفایل

استادیار

• Derivative-free optimization
• Implicit neural networks
• Geometric methods in data science
• +۳ مورد دیگر

Daniel McKenzie is an Assistant Professor in the Department of Applied Mathematics and Statistics at the Colorado School of Mines. His research focuses on derivative-free optimization, implicit neural networks, and geometric methods in data science. He holds a B.Sc.(hons) and M.Sc. in Mathematics from the University of Cape Town (2010, 2014) and a PhD in Mathematics from the University of Georgia (2019). B.Sc.(hons): Mathematics and Applied Mathematics, University of Cape Town, 2010 M.Sc.: Mathematics, University of Cape Town, 2014 PhD: Mathematics, University of Georgia, 2019 His research explores the intersection of optimization theory and machine learning, with applications in spatial data modeling, geometric data analysis, and high-dimensional clustering. Recent work emphasizes curvature-aware algorithms, comparison-based optimization, and implicit network architectures like LatticeVision. His methods address challenges in non-stationary spatial data and convex game equilibria prediction. Key contributions include Fermat distance metrics for clustering, Jacobian-Free Backpropagation (JFB) for implicit networks, and zeroth-order algorithms for black-box optimization. While no scientific awards are listed, his publications reflect a strong focus on advancing optimization techniques for modern data science problems. No specific grants or advising roles are detailed in the provided text. His work bridges computational mathematics and applied AI, with potential applications in robotics, spatial statistics, and algorithmic game theory.

Rémi Flamaryمشاهده پروفایل

استاد

• Machine Learning
• Optimal Transport
• Domain Adaptation
• +۷ مورد دیگر

Rémi Flamary is a Professor in the Applied Mathematics department at École Polytechnique, France, and a member of the CMAP Laboratory. Previously, he held an Associate Professor position at Université Côte d'Azur in the Department of Electronics and Lagrange Laboratory. He completed his PhD at Rouen University under Alain Rakotomamonjy, focusing on statistical signal processing and optimization. His research interests span machine learning, optimal transport, domain adaptation, and their applications in biomedical engineering, energy, and remote sensing. He leads the development of the POT (Python Optimal Transport) library and contributes to projects like SKADA for domain adaptation. Education: PhD in Applied Mathematics, Rouen University (LITIS Laboratory) Research Focus: Flamary's work emphasizes leveraging optimal transport theory for machine learning tasks such as graph prediction, signal normalization, and cross-domain adaptation. His contributions include novel algorithms for unbalanced transport, semi-relaxed Gromov-Wasserstein distances, and end-to-end graph generation frameworks. He actively collaborates on applications in neuroscience, astronomy, and energy systems. Professional Activities: He has presented at NeurIPS and other top conferences, supervised PhD students like Cédric Vincent-Cuaz, and contributed to open-source software. His teaching includes courses on signal processing and machine learning at École Polytechnique.

Shaun Fallatمشاهده پروفایل

استاد

• Combinatorial Matrix Theory
• Algebraic Graph Theory
• Matrix Positivity
• +۳ مورد دیگر

Shaun Fallat is a Professor in the Mathematics and Statistics Department at the University of Regina, within the Faculty of Science. He holds a Ph.D. in Applied Mathematics from the College of William and Mary (1999) and degrees from the University of Victoria (BSc and MSc). His research focuses on combinatorial matrix theory, algebraic graph theory, matrix positivity, and total positivity, with over 90 publications and a co-authored book on totally nonnegative matrices. He has supervised numerous graduate and undergraduate students, postdoctoral fellows, and visiting scholars, fostering a collaborative research environment. Fallat has delivered lectures globally and organized conferences, including the Western Canada Linear Algebra Meeting. His awards include the U. Regina Alumni Association Teaching Award, Olga Taussky-Todd Lecturer (2014), and Inaugural Hans Schneider Lecturer (2015). He serves as an Associate Editor for Linear Algebra and its Applications and the Canadian Journal of Mathematics . His research spans topics such as zero forcing parameters, spectral graph theory, and matrix inequalities. Recent work includes studies on hypertrees, graph complements, and applications of combinatorial matrix analysis. Fallat is actively involved in mentoring and promoting mathematics education at all levels, including outreach to K-12 students.