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

• Machine Learning
• Probability
• Mathematical Physics
• +۶ مورد دیگر

Boris Hanin is an Associate Professor at Princeton University's Department of Operations Research and Financial Engineering (ORFE) and Associated Faculty at the Program in Applied and Computational Mathematics (PACM). Prior to Princeton, he held academic positions at Texas A&M University (Assistant Professor of Mathematics), MIT (NSF Postdoctoral Fellow), and Northwestern University (PhD in Mathematics under Steve Zelditch). He works part-time at Foundry, an AI/computing startup, leading the Foundry Institute. PhD in Mathematics, Northwestern University NSF Postdoctoral Fellowship, MIT Mathematics Associate Professor, Princeton ORFE Part-Time Leader, Foundry Institute His research spans machine learning, probability theory, and mathematical physics, focusing on neural network theory (approximation power, optimization guarantees), random matrix theory, and spectral asymptotics. He has made foundational contributions to understanding gradient behavior, initialization, and infinite-width limits in deep learning. Boris has supervised numerous PhD students and postdocs, with former members securing prestigious positions at Harvard, MIT, and Huawei. He serves as Associate Editor for journals like Pure and Applied Analysis and Mathematics of Operations Research , and has taught short courses at Oxford, Luxembourg, and Tor Vergata on statistical physics of neural networks and deep learning theory. 2024 Sloan Fellowship in Mathematics NSF CAREER grant DMS-2143754 NSF grant DMS-2133806 His research group collaborates on topics including hyperparameter transfer, architecture-aware scaling, and spectral analysis of random waves and neural networks. He actively contributes to theoretical machine learning through foundational publications in venues like Probability Theory and Related Fields , Journal of Machine Learning Research , and Communications in Mathematical Physics .

Enrica Dall'Araمشاهده پروفایل

دانشیار

• Practice-based research
• Public space design
• Urban renewal
• +۳ مورد دیگر

Dr. Enrica Dall'Ara serves as the Associate Dean of Planning and Landscape Architecture and an Associate Professor at the University of Calgary's School of Architecture, Planning and Landscape. Her work bridges academic research and professional practice, exemplified through her firm PARC, which specializes in public space design, urban renewal, and the rehabilitation of industrial sites. She emphasizes interdisciplinary collaboration, integrating fields like environmental engineering and biology into landscape architecture. Education: Laurea in Architettura (Master Degree equivalent in Architecture), University of Ferrara, Italy Master in Landscape Architecture, ETSAB, Polytechnic University of Catalonia, Spain PhD in Landscape Design, University of Florence, Italy Research Interests: Dr. Dall'Ara focuses on practice-based research, public space design, service landscapes, and the integration of cultural advocacy into landscape architecture. Her work explores site-specific design solutions, the role of agriculture in urban-rural dynamics, and the preservation of traditional rural landscapes. She advocates for designs that serve life through poetic, functional, and culturally sensitive approaches. Contributions: Through her teaching, Dall'Ara encourages students to view design as research, fostering critical thinking and interdisciplinary dialogue. Her firm’s projects, such as the roundabout gardens in Imola, Italy, demonstrate her commitment to merging ecological, functional, and aesthetic considerations in landscape interventions. Professional Affiliations: Canadian Society of Landscape Architects (CSLA) Alberta Association of Landscape Architects (AALA) Associazione Italiana di Architettura del Paesaggio (AIAPP) Ordine degli Architetti, Pianificatori, Paesaggisti e Conservatori (Province of Forlì-Cesena, Italy)

Nate Fosterمشاهده پروفایل

استاد

• Programming Languages
• Networking
• Databases
• +۵ مورد دیگر

Nate Foster is a Professor of Computer Science at Cornell University and currently serves as the Associate Dean for Research in the Ann S. Bowers College of Computing and Information Science. He is also a Visiting Researcher at Jane Street and served as a Visiting Professor at École Polytechnique Fédérale de Lausanne during the 2023-24 academic year. His research uses ideas from programming languages to solve problems in networking, databases, and security. BA in Computer Science, Williams College (2001) MPhil in History and Philosophy of Science, University of Cambridge (2008, all work completed in 2003) PhD in Computer and Information Science, University of Pennsylvania (2009) Foster's research focuses on developing languages and tools that make it easy for programmers to build secure and reliable systems. His current work centers on the design and implementation of languages and tools for programmable networks, particularly using the P4 language. His past work includes bidirectional languages (also known as 'lenses'), database query languages, data provenance, type systems, mechanized proof, and formal semantics. His research group at Cornell has made significant contributions to network verification, software-defined networking, and formal foundations for programmable data planes. Analysis of Foster's recent publications reveals a strong focus on network verification and programming language foundations for networking. His work consistently applies formal methods to practical networking problems, with a particular emphasis on the NetKAT and P4 languages. Over the past five years, his research has evolved toward more complex network verification techniques, including infinite state verification, active learning of network models, and dependently-typed approaches to network programming. His work bridges theoretical computer science with practical networking systems, making formal methods accessible to network engineers. ACM Fellow (2025) ACM SIGPLAN Robin Milner Award (2023) ACM SIGCOMM Rising Star Award (2018) NSF CAREER Award (2013) Alfred P. Sloan Fellowship (2012) Multiple distinguished paper awards across top conferences including POPL, PLDI, and SIGCOMM Foster has advised numerous PhD and Master's students who have gone on to prominent positions in both industry and academia, with many continuing work in programming languages and networking. He has led multiple significant research grants including an NSF CAREER Award and has been involved in the P4 Language Consortium, serving as Chair of the P4 Language Governing Board. His work has been supported by various organizations including NSF, DARPA, and industry partners like Intel and Jane Street. Foster is also active in the programming languages research community, serving on numerous program committees and as Vice Chair of DARPA's Information Science and Technology (ISAT) study group. Foster leads a vibrant research group at Cornell focused on programming languages for networks, with collaborators from academia and industry. His group has developed several influential tools and frameworks including NetKAT, Petr4, and KATch. They maintain strong connections with the P4 community and work closely with industry partners to ensure their research has practical impact on real-world networking systems.

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

Prof. Peter Scholze is a leading mathematician at the Max Planck Institute for Mathematics in Bonn, specializing in algebraic geometry and arithmetic geometry. He holds the academic rank of Professor and is part of the Arbeitsgruppe Algebraische Geometrie und Darstellungstheorie. His research focuses on foundational questions in algebraic geometry, number theory, and representation theory, particularly through the lens of the Langlands program, p-adic Hodge theory, and perfectoid spaces. Scholze has pioneered geometric approaches to the local Langlands correspondence and introduced revolutionary concepts like prismatic cohomology and condensed mathematics. He actively contributes to academia through advanced courses on topics such as geometrization of the Langlands program, étale cohomology, and condensed mathematics. His work bridges algebraic geometry with representation theory, addressing fundamental problems in arithmetic geometry and p-adic analysis. Scholze’s research outputs include seminal papers on perfectoid spaces, prismatic cohomology, and the geometrization of local Langlands correspondence. He collaborates extensively with leading mathematicians globally, contributing to collaborative research initiatives like the ARGOS seminar and the Habiro ring project. His teaching engagements include advanced lectures on algebraic geometry, representation theory, and p-adic geometry, reflecting his commitment to training the next generation of researchers. Despite no explicitly listed awards in the provided text, Scholze is widely recognized as a Fields Medalist (2018) and a leading figure in modern mathematics.

Jakob Foersterمشاهده پروفایل

دانشیار

• Multi-Agent Learning
• Deep Reinforcement Learning
• Human-AI Coordination
• +۵ مورد دیگر

Jakob Foerster is an Associate Professor at the University of Oxford's Department of Engineering Science and a Supernumerary Fellow at St Anne's College. He leads the FLAIR lab, focusing on multi-agent reinforcement learning (MARL), human-AI coordination, and AI foundational research. Previously, he was a Research Scientist at Facebook AI Research (FAIR) and holds a DPhil from Oxford. His work has been cited over 5,000 times and includes seminal contributions like QMIX and the Hanabi Challenge. Research interests span compute-efficient scaling of AI, MARL applications in finance and bio, and ethical AI. He actively collaborates across academia and industry, co-organizing workshops like NeurIPS' Emergent Communication. His lab emphasizes open-ended RL, environment design, and scalable algorithms. Notable awards include the CIFAR AI Chair (2019) and NeurIPS Best Paper Runner-Up (2018). Current efforts include FLAIR's research on zero-shot coordination and the JaxMARL framework. He advises students in Oxford's Engineering DPhil and AIMS CDT programs.

Marek Locmelisمشاهده پروفایل

دانشیار

• Economic Geology
• Geochemistry
• Petrology
• +۵ مورد دیگر

Marek Locmelis is an Associate Professor at the Department of Earth and Planetary Sciences and the Bureau of Economic Geology within the Jackson School of Geosciences at the University of Texas at Austin. His research focuses on magmatic, hydrothermal, and sedimentary ore deposits, with an emphasis on critical mineral supply strategies, including recycling of mine waste and STEM education in economic geology. He holds a PhD from Macquarie University and prior roles at Missouri University of Science and Technology and NASA Goddard Space Flight Center. Education PhD in Earth and Planetary Sciences, Macquarie University (Australia) Diploma (MSc equivalent) and Pre-Diploma (BSc equivalent) in Geosciences, University of Hannover (Germany) Research Interests His work spans geochemistry, petrology, and planetary evolution, with a focus on critical minerals (e.g., lithium, rare earth elements) and novel exploration techniques. He investigates pathways to enhance domestic critical mineral recovery through reprocessing mine waste and optimizing production streams. His planetary research includes atmospheric toxicity studies and habitability potential of extraterrestrial environments. Awards Fellow of the Society of Economic Geology (SEG) SEG Graduate Student Fellowship Program Chair NSF CAREER Award (2020) NASA Postdoctoral Fellowship (2014) Advising & Grants Locmelis has advised postdocs and students through workshops on critical mineral resilience. His NSF CAREER project explores metal transport via magmatic-hydrothermal fluids. He co-organized conferences on critical minerals and led the Roadmaps Into the Geosciences (RIGS) program to support student career development. Labs & Teams He collaborates with the Bureau of Economic Geology and interdisciplinary teams in critical mineral research, combining fieldwork, geochemical analysis, and policy advocacy.

Benjamin Brooksمشاهده پروفایل

استاد

• Microeconomic Theory
• Mechanism Design
• Auction Theory
• +۳ مورد دیگر

Benjamin Brooks is a Professor in the Department of Economics and the College at the University of Chicago, serving as Director of Graduate Studies. He holds a Ph.D. from Princeton University (2014), an M.A. from Princeton (2010), and a B.A. in Mathematics and Quantitative Economics from Tufts University (2008). His research focuses on microeconomic theory, mechanism design, auction theory, repeated games, and computational game theory. Brooks has published extensively in top journals such as the American Economic Review, Econometrica, and the Journal of Political Economy. His work often explores informationally robust mechanisms and strategic behavior in auctions and stochastic games. Brooks has received grants from the National Science Foundation for projects on mechanism design and stochastic game algorithms. He is an Associate Editor of the American Economic Review: Insights, Theoretical Economics, and Economic Theory. His teaching spans game theory, price theory, and advanced topics in economic theory at both undergraduate and graduate levels. Brooks has also contributed to software tools like BCESolve and SGSolve for analyzing Bayesian correlated equilibria and stochastic games. Research Highlights: Contributions to auction design under incomplete information, robust mechanism design, and algorithmic solutions for stochastic games. Awards: Excellence in Refereeing Award (2017), NSF grants (2015-2025), and Fellow of the Society for the Advancement of Economic Theory (2024).

Anush Tserunyanمشاهده پروفایل

استاد

• Mathematics
• Ergodic Theory
• Combinatorics
• +۳ مورد دیگر

Anush Tserunyan is a Professor of Mathematics at McGill University, Canada, and a Visiting Professor at the Unit of Pure and Applied Mathematics (UMPA) at École normale supérieure de Lyon from December 1, 2024, to January 31, 2025. She holds a bachelor's and master's in computer science and applied mathematics from Yerevan State University (2005–2007) and a Ph.D. in Mathematics from UCLA (2013), focusing on finite generators for group actions, equivalence relations, and recursive program complexity. Research Interests: Anush Tserunyan specializes in Ergodic Theory , Combinatorics , and Group Actions , with notable contributions to graph theory, hypergraphs, and Ramsey theory. Her work bridges combinatorial structures with analytic methods, particularly in dynamical systems and descriptive set theory. Collaborations: During her visit to UMPA, she collaborates with teams in Geometry, Groups and Dynamics , and Number Theory , alongside researchers like Benjamin Schraen and Sophie Morel. Her stay includes seminars on GGD, Number Theory, and the 'Actions!' working group. Publications: Her research spans topics like ergodic theorems, disjoint matchings in graphs, and algebraic hypergraphs, reflecting a focus on foundational mathematical structures and their applications.

Mona Merlingمشاهده پروفایل

دانشیار

• Algebraic K-Theory
• Equivariant Stable Homotopy Theory
• Manifold Theory
• +۳ مورد دیگر

Mona Merling is an Associate Professor in the Department of Mathematics at the University of Pennsylvania, affiliated with the School of Arts and Sciences. She holds a Ph.D. from the University of Chicago (2014) under Peter May. Prior to Penn, she was a J.J. Sylvester Assistant Professor at Johns Hopkins University. Her research focuses on algebraic K-theory, its applications to number theory and manifold theory, and equivariant stable homotopy theory. She has held research positions at institutions like the Mathematical Sciences Research Institute (MSRI) and the Max Planck Institute for Mathematics. Merling teaches advanced courses in algebraic topology, homotopy theory, and calculus, including innovative programs like the Penn Directed Reading Program and collaborations with the Prison Teaching Initiative to provide education in incarcerated settings. She organizes conferences and workshops, such as the Algebraic Topology Bridge Summer Workshop, fostering accessibility in topology education. Her research explores cutting-edge topics like scissors congruence K-theory, equivariant infinite loop space theory, and parametrized cobordism categories. Recent work includes collaborations on derived scissors congruence and multiplicative equivariant K-theory, with applications to geometric and algebraic structures. Her grants include funding for social justice initiatives in education.

Katerina Marcoulidesمشاهده پروفایل

دانشیار

• Data Mining
• Structural Equation Modeling
• Longitudinal Data Analysis
• +۳ مورد دیگر

Dr. Katerina Marcoulides is an Associate Professor in the Quantitative and Psychometric Methods Program at the University of Minnesota's Department of Psychology. She is affiliated with the Minnesota Population Center and serves as Co-Chair of the Structural Equation Modeling Special Interest Group (SEM SIG) for the American Educational Research Association. Her research focuses on advanced data mining and modeling techniques for complex longitudinal data, particularly applied to developmental processes in economically disadvantaged immigrant children. She holds a PhD in Quantitative Psychology from Arizona State University, an MA from UC Davis, and a BA from UC Santa Barbara. Education: PhD: Quantitative Psychology, Arizona State University MA: Quantitative Psychology, University of California, Davis BA: Psychology (minor in Education), University of California, Santa Barbara Research Interests: Dr. Marcoulides develops and applies statistical methods such as structural equation modeling (SEM), Bayesian synthesis, and data fusion to study developmental and educational processes. Her work emphasizes longitudinal data analysis, item response theory, and multilevel modeling. Recent projects include NIH-funded research on parenting, marginalization, and well-being during the pandemic. Awards: APS Rising Star Award (2021) NIH Grant Award Teaching & Collaboration: She teaches courses on SEM, multilevel modeling, and data analysis at the University of Minnesota. Previously at the University of Florida, she contributed to workshops on educational data mining and served as an APA Advanced Training Institute presenter. Her interdisciplinary collaborations span population studies, health inequities, and workforce research. Labs & Groups: She leads the Data Analytics and Visualization Lab and actively participates in the Minnesota Population Center, integrating computational and statistical innovations with real-world applications.

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).

• Reconfigurable Computing
• Field-Programmable Gate Arrays (FPGA)
• High-Level Synthesis
• +۳ مورد دیگر

Paolo Ienne is a Professor at the Swiss Federal Institute of Technology in Lausanne (EPFL), where he leads the Processor Architecture Laboratory (LAP) within the School of Computer and Communication Sciences. His research focuses on advancing reconfigurable computing systems through innovative FPGA architectures and high-level synthesis methodologies. His primary research domains include reconfigurable computing, FPGA architecture design, dynamically scheduled dataflow circuits, and hardware acceleration techniques. Recent work emphasizes memory system optimization for FPGAs, formal verification of circuit transformations, and rapid C-to-hardware compilation flows. He has pioneered approaches for handling thousands of outstanding memory misses in FPGA accelerators and developed novel techniques for switch-block exploration without explicit pattern enumeration. Analysis of his 2023-2025 publications reveals a strong trend toward practical FPGA deployment challenges, with increasing focus on HBM integration, virtual memory systems for PCIe-attached devices, and formally verified circuit transformations. His work consistently targets real-world bottlenecks in high-level synthesis toolchains while maintaining theoretical rigor in dataflow architecture design. Professor Ienne's laboratory receives support from the Swiss National Science Foundation and industry partners including Huawei, enabling cutting-edge research in FPGA-based acceleration. His collaborative network spans major semiconductor companies and academic institutions worldwide, with frequent co-authorship on conference proceedings and journal publications in IEEE and ACM venues.

Lars Rohwedderمشاهده پروفایل

دانشیار

• Algorithms
• Approximation Algorithms
• Online Algorithms
• +۳ مورد دیگر

Lars Rohwedder is an Associate Professor in the Algorithms Group at the University of Southern Denmark (SDU) in Odense. He previously held positions as an Assistant Professor at Maastricht University (Netherlands) and postdoc researcher at EPFL, Lausanne (Switzerland). He earned his Ph.D. in Computer Science from CAU Kiel (Germany), advised by Klaus Jansen, and is a recipient of the 2019 PhD of the year award from Förderverein der TF of Kiel University. His research focuses on algorithms for combinatorial optimization, including approximation algorithms, online algorithms, parameterized algorithms, and integer programming. He has contributed to solving scheduling problems, resource allocation, and optimization under uncertainty. Rohwedder has served on program committees for conferences like MAPSP, SODA, STACS, and ICALP. He is funded by NWO's Open Competition M1 project on quasi-polynomial time algorithms. His teaching includes courses on advanced algorithms, operations management, and optimization at SDU and Maastricht University. Key achievements include a quasi-polynomial approximation for the restricted assignment problem, FPT algorithms for scheduling, and contributions to the Submodular Santa Claus problem. His work bridges theoretical foundations and practical applications, with a focus on algorithmic efficiency and robustness.

• Programming Language Theory
• Semantics of Programming Languages
• Domain Theory
• +۷ مورد دیگر

Gordon Plotkin is a Professor at the School of Informatics, University of Edinburgh, where he is affiliated with the Laboratory for Foundations of Computer Science (LFCS). His research lies at the intersection of theoretical computer science and programming language semantics, with a profound influence on the formal understanding of computation. His research interests include Programming Language Theory, Semantics of Programming Languages, Domain Theory, Operational Semantics, Lambda Calculus, Type Theory, Concurrency Theory, and Algebraic Effects. His seminal work on structural operational semantics and domain theory has laid the foundation for modern semantics of programming languages. His publications span over five decades, showing a sustained and evolving research trajectory from foundational work in lambda calculus and domain theory to recent contributions in algebraic effects, probabilistic computation, and biochemical systems modeling. The articles demonstrate a consistent focus on formal methods, mathematical rigor, and the algebraic structure of computational effects. He has collaborated with leading researchers including Martín Abadi, John Power, Glynn Winskel, and John Reynolds. His work continues to influence both theoretical and practical developments in programming languages and systems. Gordon Plotkin has made foundational contributions to computer science, particularly through his development of structural operational semantics and domain-theoretic models of computation. He has advised numerous researchers and supervised many influential PhD theses, though specific student names are not listed in the provided text. His work has been supported by long-standing affiliations with the Laboratory for Foundations of Computer Science and the University of Edinburgh, and he has contributed to major collaborative projects in programming language design and verification. He is associated with several research groups and labs, most notably the Laboratory for Foundations of Computer Science (LFCS), which serves as a hub for theoretical research in programming languages, semantics, and logic at the University of Edinburgh.

Jelle Hellingsمشاهده پروفایل

استادیار

• Resilient Systems
• High-Performance Data Management
• Database Theory
• +۱۰ مورد دیگر

Jelle Hellings is an Assistant Professor in the Department of Computing and Software at McMaster University , Canada. His research focuses on high-performance large-scale data management systems with a strong theoretical and algorithmic component, including resilient systems (blockchains) , graph databases , and external-memory algorithms . He previously worked as a Postdoc Scholar at the University of California, Davis and earned his PhD from Hasselt University in Belgium. Education: Doctor of Sciences in Computer Science (2018), Hasselt University Master of Science in Computer Science and Engineering (2011), Eindhoven University of Technology His research interests include scalable resilient systems with Byzantine fault tolerance, database theory, graph query languages, constraints on graph data, and external-memory algorithms for large graph datasets. He has authored numerous high-impact publications on blockchain-based resilient systems, query optimization in graph databases, and theoretical advancements in relation algebra expressiveness. Hellings actively contributes to academic service through program committee memberships and tutorial organization, and he currently teaches courses on future resilient databases and foundational computer science topics.