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

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

استاد

• Cryptography
• Information Security
• Searchable Encryption
• +۳ مورد دیگر

Alexandra Boldyreva is a Professor at the Georgia Institute of Technology, holding joint appointments in the School of Cybersecurity and Privacy and the School of Computer Science. She serves as Associate Chair for Graduate Studies in the School of Cybersecurity and Privacy and coordinates the Information Security Master’s program in the College of Computing. Her affiliations include the Institute for Information Security & Privacy (IISP), the Algorithms, Combinatorics and Optimization (ACO) program, and the Algorithms and Randomness Center (ARC). She earned her Ph.D. in Computer Science from the University of California, San Diego, and holds bachelor’s and master’s degrees in applied mathematics from St. Petersburg State Technical University, Russia. Her research focuses on cryptography and information security, with notable contributions to encryption methods, authentication protocols, and privacy-preserving systems. Boldyreva’s work emphasizes provable security analysis of protocols like FIDO2 and TLS 1.3, as well as searchable encryption and data privacy techniques. Her recent studies include secure communication channel establishment, leakage quantification in encryption systems, and applications of fuzzy search in encrypted databases. She has received Test of Time Awards for foundational contributions to cryptography. Boldyreva leads initiatives in cybersecurity education and has secured grants for research in secure communication protocols and human-computing approaches to key exchange. Her interdisciplinary collaborations span computer science, mathematics, and privacy engineering.

Navid Azizanمشاهده پروفایل

استادیار

• Artificial Intelligence
• Machine Learning
• Control Systems
• +۵ مورد دیگر

Navid Azizan is the Alfred H. (1929) and Jean M. Hayes Career Development Assistant Professor at Massachusetts Institute of Technology (MIT), holding dual appointments in the Department of Mechanical Engineering (in Control, Instrumentation & Robotics) and the Schwarzman College of Computing's Institute for Data, Systems & Society (IDSS). He is also a Principal Investigator in the Laboratory for Information & Decision Systems (LIDS), and a faculty member of the MIT Statistics and Data Science Center, the Center for Computational Science and Engineering, and the Operations Research Center. Dr. Azizan received his PhD in Computing and Mathematical Sciences from the California Institute of Technology (Caltech) in 2020, his MSc in Electrical Engineering from the University of Southern California in 2015, and his BSc in Electrical Engineering with a minor in Physics from Sharif University of Technology in 2013. Prior to joining MIT, he completed a postdoc at Stanford University's Autonomous Systems Laboratory and was a research scientist intern at Google DeepMind. His research spans the intersection of machine learning, systems and control, mathematical optimization, and network science. Dr. Azizan's work focuses on developing principled learning and optimization algorithms for reliable intelligent systems, with applications to autonomy and sociotechnical systems. His research has significant implications for creating trustworthy AI systems that can operate effectively in complex, uncertain environments. Dr. Azizan's recent publications demonstrate a strong focus on uncertainty quantification, reliable AI systems, constrained optimization, and control-oriented learning. His work bridges theoretical foundations with practical applications, particularly in autonomous systems where safety and reliability are paramount. His research group has made notable contributions to areas including neural network verification, multi-agent reinforcement learning, and adaptive inference techniques for large language models, with several papers featured on MIT News and selected for oral presentations at top conferences. Alfred H. (1929) and Jean M. Hayes Career Development Professorship (2025-present) Frank E. Perkins Award for Excellence in Graduate Advising (2025) List of Outstanding Academic Leaders in Data from the CDO Magazine (2024, 2023) Amazon Science Hub Research Award (2023) Outstanding UROP Faculty Mentor (2023) Esther and Harold E. Edgerton (1927) Career Development Chair (2022-2025) Information Theory and Applications (ITA) Gold Graduation Award (2020) Dr. Azizan has been recognized for his excellence in graduate advising, receiving the Frank E. Perkins Award for Excellence in Graduate Advising in 2025. During the pandemic, he founded and co-organized the 'Control meets Learning' virtual seminar series, connecting researchers across disciplines. His work has attracted significant research funding from industry partners including Google, Amazon, and MathWorks, supporting both fundamental research and practical applications in reliable intelligent systems. The Azizan Lab at MIT brings together researchers from mechanical engineering, computer science, and applied mathematics to tackle challenges at the intersection of learning and control. The lab emphasizes both theoretical foundations and practical implementations, with a particular focus on developing algorithms that provide guarantees of performance and safety. Current research directions include uncertainty quantification in AI systems, constrained optimization for neural networks, and control-oriented learning for autonomous systems, with applications spanning robotics, transportation, and complex sociotechnical systems.

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 .

Peter Selingerمشاهده پروفایل

استاد

• Quantum Computing
• Category Theory
• Mathematical Logic
• +۴ مورد دیگر

Peter Selinger is a Professor in the Department of Mathematics and Statistics at Dalhousie University , with a cross-appointment in Computer Science. He specializes in mathematical methods in computer science, particularly quantum computing and combinatorial game theory . His work on quantum programming languages like Quipper and foundational research in category theory has garnered international recognition. Education : Ph.D. in Mathematics (University of Pennsylvania, 1997), undergraduate studies in Mathematics (Technische Universität Darmstadt). Research Interests span quantum computing, category theory, and combinatorial game theory. He has pioneered formalisms for quantum programming languages, developed categorical models for quantum mechanics, and analyzed game-theoretic structures in games like Hex. His recent work includes linear dependent type theory , quantum circuit synthesis , and combinatorial game classification . Publications demonstrate expertise in quantum programming languages, categorical semantics, and game theory. Key trends include Hamiltonian simulation , Clifford+T circuits , and monotone game realization . Scientific Honors include the Killam Professorship (2017–2022), Faculty of Science Award for Excellence in Teaching (2023), and fellowships from the Alfred P. Sloan Foundation and German National Scholarship Foundation . Students he has supervised include PhD graduates Xiaoning Bian , Francisco Rios , and Neil J. Ross , along with MSc students like Fahimeh Bayeh and Seth Greylyn . He has advised 16 postdoctoral researchers.

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.

Eric V. Mazumdarمشاهده پروفایل

استادیار

• Machine Learning
• Economics
• Optimization
• +۴ مورد دیگر

Eric V. Mazumdar is an Assistant Professor at the California Institute of Technology (Caltech), jointly appointed in the departments of Computing and Mathematical Sciences and Economics. He holds a B.S. from MIT (2015) and a Ph.D. from UC Berkeley (2021), co-advised by Michael Jordan and Shankar Sastry. His research bridges machine learning and economics, focusing on deploying algorithms into societal systems through theoretical and practical lenses. Key areas include strategic classification, multi-agent reinforcement learning, and distributionally robust optimization, with applications in healthcare, online markets, and intelligent infrastructure. Education: B.S., Electrical Engineering and Computer Science, Massachusetts Institute of Technology, 2015 Ph.D., Electrical Engineering and Computer Science, University of California, Berkeley, 2021 Research Interests: Mazumdar’s work emphasizes understanding learning algorithms in strategic environments, including min-max optimization, game theory, and multi-agent systems. He explores how algorithms interact with human and algorithmic agents in dynamic systems, with practical applications in healthcare delivery, e-commerce, and autonomous systems testing. Awards: NSF CAREER Award (2023) Simons Institute Research Fellowship in Learning in Games Grants & Funding: Supported by NSF, DARPA, Amazon, and other organizations. His NSF CAREER grant focuses on strategic interactions in societal-scale systems. Teaching: Courses include Networks: Structure & Economics (CMS/CS/EE/IDS 144) and Topics in Learning and Games (CMS/Ec 248). At UC Berkeley, he contributed to courses like Data, Inference, and Decisions (DS 102). Students & Postdocs: Current students: Lauren Conger, Tinashe Handina, Yizhou Zhang Postdocs: Zaiwei Chen, Laixi Shi, Kishan Panaganti (co-advised with Adam Wierman)

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.

Suguman Bansalمشاهده پروفایل

استادیار

• Formal Methods
• Artificial Intelligence
• Programming Languages
• +۴ مورد دیگر

Suguman Bansal is an Assistant Professor in the School of Computer Science at Georgia Institute of Technology. Her research focuses on formal methods and their applications to artificial intelligence, programming languages, and machine learning. Previously, she held an NSF/CRA Computing Innovation Postdoctoral Fellowship at the University of Pennsylvania (2020-2022) and completed her PhD at Rice University (2016-2020). Education: PhD in Computer Science, Rice University (2016-2020) MS in Computer Science, Rice University (2014-2016) BSc (Honors) in Mathematics and Computer Science, Chennai Mathematical Institute (2011-2014) Research Interests: Formal methods, reinforcement learning, reactive synthesis, quantitative verification, and trustworthy AI systems. Her work bridges logic-based formal methods with modern AI challenges, emphasizing safety, reliability, and generalization in AI systems. Key Contributions: Pioneering work on specification-guided reinforcement learning, compositional synthesis algorithms, and formal verification of AI systems. Notable tools include Lisa (LTLf synthesis tool) and DiRL (compositional reinforcement learning framework). Awards: 2020 NSF CI Fellowship, 2021 MIT EECS Rising Star, 2023 ATVA Best Paper Award, and Keynote Speaker at SAS 2022. Advising & Grants: Advises PhD and Master’s students in reinforcement learning and formal methods. Lead PI on a collaboration grant with IIT Bombay (2024) and recipient of a ~$250K NSF/CRA postdoctoral grant. Labs/Teams: Leads the BansalLab at Georgia Tech, focusing on trustworthy AI through formal methods and algorithmic innovation.

Matthew Emertonمشاهده پروفایل

استاد

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

Matthew Emerton is a Professor in the Department of Mathematics at the University of Chicago, part of the Physical Sciences Division. He specializes in number theory, arithmetic geometry, and the Langlands program. His research focuses on automorphic forms, Galois representations, and p-adic methods in arithmetic geometry. Education: BSc (Hons) from the University of Melbourne (1993), PhD in Mathematics from Harvard University (1998), advised by Barry Mazur. Research Highlights: Pioneered work on the p-adic Langlands program, moduli stacks of Galois representations, and prismatic cohomology. Authored over 50 publications, including foundational works on p-adic Hodge theory and local-global compatibility. Awards: Alfred P. Sloan Doctoral Dissertation Fellowship (1997-98), Rackham Summer Faculty Fellowship (1999). Grants: Multiple NSF awards (e.g., DMS-2201242 for 'Arithmetic Aspects of the Langlands Program', DMS-1952705 for geometric aspects of the p-adic Langlands program). Students: Mentored 25+ PhD students and postdocs, many contributing to number theory and representation theory.

Joseph Eremondiمشاهده پروفایل

استادیار

• Programming Languages
• Type Theory
• Dependent Types
• +۱۲ مورد دیگر

Joseph Eremondi is an Assistant Professor in the Department of Computer Science at the University of Regina, Faculty of Science, Canada. He began his tenure in 2024 after serving as a Royal Society Newton International Fellow at the University of Edinburgh, where he conducted postdoctoral research with Ohad Kammar in the Laboratory for Foundations of Computer Science. He earned his PhD from the University of British Columbia (UBC) under the supervision of Ron Garcia at the UBC Software Practices Laboratory. His research is centered on programming languages theory, with a strong focus on type systems that enhance software reliability and usability. He is particularly known for his work in dependent types, gradual typing, and the integration of both paradigms. His research interests include: Dependent pattern matching and its semantic foundations Gradual dependent types and approximate normalization Error message generation and usability in dependently typed languages Static analysis using set constraints and SMT solvers Theoretical properties of reversal-bounded counter automata and shuffle operations His recent publications, appearing in premier venues like POPL, ICFP, and CPP, reflect a consistent trajectory toward making advanced type systems more accessible and practical. Key themes include coverage semantics for dependent pattern matching, formal models of gradual dependent typing, and improving the developer experience through better tooling and error diagnostics. Notable scientific recognitions include the NSERC Discovery Grant (awarded in 2025) and the prestigious Royal Society Newton International Fellowship. These awards underscore the impact and promise of his research program on the usability of dependently typed programming languages. Joseph is actively mentoring and recruiting graduate students, particularly in areas such as dependently typed programming (Lean, Agda, Idris, Coq), gradual typing, live programming environments, and static analysis. He emphasizes close collaboration within a small, focused research group. He has also served on program committees, including for TyDe and POPL Artifact Evaluation, demonstrating active engagement in the programming languages community. His work bridges theoretical rigor with practical implementation, evident in his artifact releases on GitHub and integration with tools like Ott and DrRacket. He maintains a personal website and open-source repositories that support reproducibility and community involvement.

Marco Platznerمشاهده پروفایل

استاد

• Reconfigurable Computing
• Approximate Computing
• Self-Aware Computing
• +۷ مورد دیگر

Marco Platzner is a Professor for Computer Engineering at Paderborn University , Germany. He serves as the Dean of Research for the Faculty of Computer Science, Electrical Engineering and Mathematics and heads the Department of Computer Science. Previously, he held research positions at ETH Zurich, Stanford University, GMD (now Fraunhofer IAIS), and Graz University of Technology. Education: Diploma and PhD in Telematics (Graz University of Technology, 1991 and 1996), Habilitation in Hardware-Software Co-Design (ETH Zurich, 2002) Research Interests focus on reconfigurable computing, approximate computing, self-* computing, and embedded systems. His work addresses hardware security, FPGA design, and sustainable AI in data centers. Current projects include energy-efficient AI through deep neural network approximation for FPGAs (EKI-App) and lifecycle sustainability of socio-technical systems (SAIL). Publication Trends show expertise in FPGA security, approximate circuit synthesis, robotics, and hardware acceleration. Collaborations span robotics (ROS 2 integration), AI (transformer optimization), and cybersecurity (Trojan detection). Scientific Awards: ACM SIGDA Hall of Fame (2020) Significant Paper Award (FPL 2015) Best Paper Awards at IEEE ISVLSI (2024), ARC (2018), IEEE ReConFig (2015), and others Weierstraß Prize for Teaching (2008) Leadership Roles include membership in the board of Paderborn Center for Parallel Computing (PC2) and the Jenny Aloni Centre for Early Career Researchers. He has contributed to EU FP7 FET project EPiCS and German priority programs on embedded systems and organic computing.

• Poisson Geometry
• Contact Geometry
• Jacobi Geometry
• +۴ مورد دیگر

Alfonso Giuseppe Tortorella is a Tenure Track Assistant Professor in the Department of Mathematics at the University of Salerno since October 31, 2022. Previously, he held research positions at CMUC (Center of Mathematics of the University of Coimbra), CMUP (Center of Mathematics of the University of Porto), and KU Leuven. He received his PhD in Mathematics from the University of Florence in 2017 under the supervision of Luca Vitagliano and Paolo de Bartolomeis. His educational background includes an MSc in Mathematics from the University of Salerno (2013) with honors, where he completed his thesis titled "Geometric methods of Hamiltonian mechanics" under Luca Vitagliano's guidance. Tortorella's research focuses on Poisson geometry in the broadest sense, with particular emphasis on deformation theory of coisotropic submanifolds in Jacobi manifolds, multiplicative structures on Lie groupoids, and VB-groupoids. His work explores the intersection of differential geometry, mathematical physics, and algebraic structures, developing sophisticated theoretical frameworks to understand geometric structures and their deformations. He has made significant contributions to understanding symplectic foliations, contact dual pairs, and the algebraic structures underlying Jacobi geometry. His most recent publications (2023-2025) demonstrate a consistent focus on deformation problems in Poisson and related geometries, with particular attention to coisotropic submanifolds in contact geometry, symplectic foliations, and the application of L∞ algebras to geometric deformation problems. His work shows increasing sophistication in handling higher structures and their applications to geometric problems. Abilitazione Scientifica Nazionale for Professore Associato in Geometria e Algebra (01/A2 - II Fascia) (May 24, 2021 - May 24, 2030) Qualification aux fonctions de Maître de conférences, section 25 - Mathématiques (December 31, 2018 - December 31, 2022) PhD internship at IM PAN awarded by WCMCS (December 2014) PhD scholarship from INdAM (October 2013) Scholarship from SMI (June 2013) Tortorella has advised multiple PhD, MSc, and BSc students, including Vanessa Oliveira (PhD, University of Porto), Antonio Maglio (PhD, University of Salerno), and Rodrigo de Oliveira Baptista (MSc, University of Porto). He has served on examination committees and as a reviewer for numerous prestigious mathematics journals. His collaborative work extends across international boundaries, with research stays at institutions in Italy, Portugal, Belgium, Poland, France, Germany, and Brazil. He is an active organizer of conferences and workshops, particularly in the field of Poisson geometry, serving on the organizing committees for events like Poisson 2024 and the INdAM Intensive Period on Poisson Geometry & Mathematical Physics.

Konstantin (Kostia) M. Zuevمشاهده پروفایل

استاد آموزشی

• Network Science
• Applied Probability
• Computational Statistics
• +۴ مورد دیگر

Dr. Konstantin (Kostia) M. Zuev serves as Teaching Professor in the Computing + Mathematical Sciences Department at California Institute of Technology , where he has made significant contributions to network science and computational statistics since 2016. His dual PhDs in Mathematics (Moscow State University, 2008) and Civil Engineering (HKUST, 2009) underpin his interdisciplinary research spanning differential geometry, stochastic simulation, and network dynamics. Education PhD in Mathematics, Lomonosov Moscow State University (2008) PhD in Civil Engineering, Hong Kong University of Science & Technology (2009) His research focuses on network science , particularly course-prerequisite networks and complex financial systems , with recent work extending to network navigability in cosmological models and rare event simulation. Over his career, he has developed innovative Bayesian inference methods and geometric preferential attachment theories while maintaining active collaborations across mathematics, physics, and biomedical domains. Recent publications highlight network analysis in education ( 2023 ), hyperbolic graph theory ( 2024 ), and pandemic-informed cancer mortality studies ( 2023 ). His 15 most recent articles demonstrate methodological innovations across disciplines including statistics, physics, finance, and cosmology. Scientific recognition includes Humboldt Research Fellowship (2021) Carver Mead Seed Fund Grant (2023) ASCIT Teaching Award (2018, 2023) Northrop Grumman Teaching Excellence Prize (2019) As Graduate Option Representative for Information and Data Sciences at Caltech and faculty advisor for multiple student organizations including the Caltech Karate Club and Caltech Chess Club , he actively bridges academic rigor with community engagement through outreach initiatives like the virtual math education channel and university math circles for K-12 students.

Fred B. Schneiderمشاهده پروفایل

استاد

• Trustworthy Systems
• Fault-Tolerant Distributed Systems
• System Security
• +۶ مورد دیگر

Fred B. Schneider is the Samuel B. Eckert Professor of Computer Science at Cornell University , where he has been a faculty member since 1978. His career spans foundational work in trustworthy systems , fault-tolerant distributed systems , and system security . He served as department chair from 2014–2018 and previously earned a B.S. in Engineering from Cornell (1975) and a Ph.D. in Computer Science from Stony Brook University (1978).

Imogen Forbes-Macphailمشاهده پروفایل

استادیار

• Nineteenth-Century Poetry
• Mathematics and Literature
• Victorian Studies
• +۳ مورد دیگر

Imogen Forbes-Macphail is an Assistant Professor at the University of California, Davis, specializing in the interdisciplinary intersections of nineteenth-century British poetry and mathematical thought. Her current book project, Line and Number: Formal Problems in Nineteenth-Century Poetry and Mathematics , examines how Victorian poets and mathematicians engaged with analogous formal challenges. Victorian Poetry Caucus Representative, North American Victorian Studies Association Co-Editor (with Anna Henchman), Special Issue of Nineteenth-Century Gender Studies on women’s writing and scientific knowledge production (“Longing to Know”) Research Focus: Forbes-Macphail’s work bridges literary formalism and historical scientific methodologies, particularly exploring topics like computational proof, topological poetics, and the mysticism inherent in Victorian-era mathematical and poetic discourse. Her interdisciplinary approach highlights how mathematical concepts influenced poetic structures and vice versa. Scientific Contributions: Her publications span analyses of the Four-Color Theorem, Ada Lovelace’s literary-scientific legacy, and the gendered dynamics of 19th-century knowledge production. Key trends include the aestheticization of mathematical rigor, the role of formalism in shaping Victorian intellectual paradigms, and crossdisciplinary epistemological inquiries. Honorable Mention, “Expanding the Field” Essay Prize, Northeast Victorian Studies Association (2022) Susan Morgan Graduate Student Essay Prize, Interdisciplinary Nineteenth-Century Studies (2019) Sally Mitchell Prize, North American Victorian Studies Association (2018) Honorable Mention, Susan Morgan Graduate Student Essay Prize (2018) Sussex-Samuel Prize, Australasian Universities Language and Literature Association (2013) Forbes-Macphail’s teaching includes courses such as ENL 164: Writing Science Publications , emphasizing the synthesis of scientific and literary communication. She previously held a Junior Fellowship at the Harvard Society of Fellows (2022–25), underscoring her prominence in Victorian studies.