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

Martin Hairerمشاهده پروفایل

استاد

• Stochastic Analysis
• Stochastic Partial Differential Equations
• Malliavin Calculus
• +۵ مورد دیگر

Martin Hairer is Professor of Pure Mathematics at École Polytechnique Fédérale de Lausanne (EPFL) in the School of Basic Sciences, Department of Mathematics, and also holds a position at Imperial College London. His research focuses on stochastic analysis, particularly stochastic partial differential equations, where he developed the groundbreaking theory of regularity structures. His research interests span multiple areas within stochastic analysis: Stochastic Partial Differential Equations (SPDEs) Regularity Structures and Renormalization Malliavin Calculus Rough Paths Theory Markov Processes and Ergodic Theory Hypoelliptic Operators Applications to Mathematical Physics Professor Hairer's publication record shows consistent high-impact contributions, with recent work focusing on singular SPDEs, quantum field theory models, and extending regularity structures to new contexts. His research has created fundamental connections between probability theory, analysis, and theoretical physics. Notable awards include: Fields Medal (2014) Fermat Prize (2014) Euler Medal (2014) Loève Prize (2014) Professor Hairer actively supervises graduate students and postdoctoral researchers, with funding available for both PhD and postdoc positions starting in 2026. He contributes to the academic community through the Probability and Stochastic Analysis Seminar at EPFL and by making his lecture notes publicly available. His dual appointments at EPFL and Imperial College London provide unique opportunities for international collaboration and student exchange.

Johannes Krebsمشاهده پروفایل

استاد

• Topological Data Analysis
• Persistent Homology
• Spatial Statistics
• +۳ مورد دیگر

Prof. Dr. Johannes Krebs holds the Chair of Mathematics - Statistics at the Faculty of Mathematics and Geography, Catholic University of Eichstätt-Ingolstadt since 2021. His academic service includes membership on the editorial board of Statistics , the tenure track board, examination committees for B.Sc. Mathematics and Data Science programs, and the faculty council. His research focuses on topological data analysis, persistent homology, and spatial statistics with applications in stochastic geometry. Funded by Deutsche Forschungsgemeinschaft (KR 4977/2-1 and KR 4977/1-1), his work bridges theoretical statistics with computational topology to develop novel methods for analyzing complex data structures. His methodological contributions span wavelet analysis, functional data, and bootstrap techniques for dependent data. Analysis of his recent publications reveals strong emphasis on topological inference (persistent homology, Betti numbers), spatial statistics, and wavelet methods across multiple high-impact journals including Bernoulli , Annals of Statistics , and Stochastic Processes and their Applications . His work demonstrates consistent innovation in applying topological concepts to statistical problems with theoretical guarantees. Academic service highlights include: Editorial Board Member, Statistics journal Member of Tenure Track Board Examination Committee for B.Sc. Mathematics & Data Science Faculty Council Member His research program is supported by significant DFG funding for projects on Topological Data Analysis (2021-2023) and Dynamic Objects on Random Fields (2017-2020), reflecting sustained contribution to advancing statistical methodology through topological frameworks. He maintains active collaborations with researchers at UC Davis, KU Leuven, and Heidelberg University.

Gary Tanمشاهده پروفایل

استاد

• computer security
• formal methods
• programming languages
• +۳ مورد دیگر

Gang (Gary) Tan is a Professor in the Computer Science and Engineering Department at Pennsylvania State University, co-directing the Institute for Networking and Security Research (INSR). His research bridges computer security, formal methods, and programming languages to develop practical solutions for software vulnerabilities and AI fairness. Education: B.E. in Computer Science from Tsinghua University Ph.D. in Computer Science from Princeton University Dr. Tan specializes in applying compiler techniques and formal verification to security challenges, with seminal work on cache side-channel attacks and fairness in machine learning. His Security of Software (SOS) Group develops frameworks that integrate theoretical guarantees into real-world systems, emphasizing measurable security outcomes and ethical AI. Recent projects focus on quantifying bias in neural networks and mitigating speculative execution vulnerabilities. Analysis of his 2021-2025 publications reveals a strategic pivot toward AI security, where he pioneers methods for fairness testing (e.g., information-theoretic debugging) and repair (e.g., NeuFair). Concurrently, his security work evolves from foundational side-channel research (SpecSafe, 2021) toward hardware-software co-design solutions, demonstrating consistent innovation across theoretical and applied domains. Scientific Awards: James F. Will Career Development Professorship NSF CAREER Award Google Research Award (two instances) Distinguished Reviewer Award at 2018 IEEE Symposium on Security and Privacy Outstanding Research Award at Penn State Ruth and Joel Spira Excellence in Teaching Award Best Paper Award at PLDI 2024 Dr. Tan leads the SOS Group with funding from NSF (including CAREER), DARPA (ISAT study group membership), and industry partners like Google. His grants support interdisciplinary projects spanning secure compilation, fairness engineering, and hardware security, while his teaching excellence award reflects commitment to pedagogy in core systems courses. He co-directs Penn State's Institute for Networking and Security Research (INSR), fostering collaboration between systems, security, and AI researchers. The SOS Group maintains active partnerships with industry security teams and contributes to open-source tools for vulnerability detection, with recent work expanding into fairness certification for machine learning pipelines.

Sébastien Bardinمشاهده پروفایل

پژوهشگر

• Program Analysis
• Formal Methods
• Security
• +۵ مورد دیگر

Sébastien Bardin is a Senior Researcher and CEA Fellow at the Software Safety and Security Laboratory of Commissariat à l'Energie Atomique (CEA) in Paris-Saclay, France, with affiliation to University Paris-Saclay. He leads significant research initiatives including the BINSEC group on binary-level security analysis (since 2012) and the QBricks group on quantum program verification (since 2020), and served as Head of the Software Quantum Program at CEA LIST from 2021-2023. His research focuses on formal methods and automatic program analysis with applications in software security. Key areas include binary-level security analyses such as vulnerability detection & assessment, reverse engineering, and malware deobfuscation, as well as quantum programming and verification. His methodological expertise spans symbolic execution, abstract interpretation, software model checking, and SMT solving. Bardin's publications demonstrate consistent impact across top venues in security and formal methods, with notable papers at ESOP, CAV, ICSE, NDSS, and S&P. His work on robust symbolic execution, directed fuzzing, and binary-level analysis has established him as a leading researcher in security-oriented program analysis. Recent publications show growing emphasis on quantum program verification alongside continued contributions to binary security analysis. Scientific Awards: ICSE 2021 ACM SIGSOFT Distinguished Paper Award RTAS 2021 Best Paper Award CAV 2021 Selected Paper CEA Fellow (2021-present) ACM Senior Member (2021-present) Bardin actively mentors PhD students and has advised numerous researchers who have received recognition including GDR Sécurité and GDR GPL PhD awards. His service to the community is extensive, with leadership roles in GDR Sécurité, RESSI, and organizing major conferences including CAV 2023 (sponsor co-chair) and FIC 2023 (scientific program chair). He also contributes to multiple program committees across security and formal methods venues.