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

Professor Petros Elia is a faculty member at EURECOM, holding the position of Professor within the Department of Communications systems. He specializes in Information Theory , Coding Theory , Caching , Distributed Computing , and Wireless Networks , with additional research in Biometrics . His work focuses on advancing theoretical foundations and practical applications in distributed systems and wireless communication efficiency. He received a prestigious ERC Consolidator Grant for his DUALITY project (2016) and a four-year Fulbright Scholarship (1993-1997). He is also a recipient of the Newcom++ Network of Excellence Distinguished Achievement Award (2008-2011) and the Best Student Paper Award at SPAWC 2011, awarded to his advisee Arun Singh. His research explores cutting-edge topics such as tessellated distributed computing , hypergraph decomposition , and topology-aware caching , with recent contributions presented at venues like the IEEE International Symposium on Information Theory (ISIT 2025). His work bridges theoretical advancements with real-world applications in wireless networks and distributed systems. Education: Supported by his Fulbright Scholarship, he pursued studies in the U.S. during 1993-1997. Grants: ERC Consolidator Grant (2016), and others. Advising: Mentor to Arun Singh , whose work earned a student paper award. He actively contributes to teaching Mobile Communications at EURECOM and remains a key figure in advancing the field through interdisciplinary collaborations and leadership in the Communication Systems department.

• Information Theory
• Coding Theory
• Caching
• +۳ مورد دیگر

Youness Lamzouri is a Professor of Mathematics at the Université de Lorraine, France, affiliated with the Institut Elie Cartan de Lorraine (IECL) and a Junior Member of the Institut Universitaire de France (IUF). His research focuses on analytic and probabilistic number theory, particularly character sums, L-functions, prime number distributions, and random multiplicative functions. PhD in Mathematics from Université de Montréal (2009) B.Sc. in Pure Mathematics from Université de Montréal (2004) He has contributed extensively to understanding extreme values in character sums, biases in prime number races, and statistical properties of L-functions. His recent work explores GCD graphs, random walks in number theory, and probabilistic models for prime distributions. He has received prestigious awards including the CMS Blair Spearman Doctoral Prize and NSERC Postdoctoral Fellowship. Currently, he supervises doctoral and master students and contributes to editorial boards of leading journals.

• Analytic Number Theory
• Probabilistic Number Theory
• Character Sums and Exponential Sums
• +۷ مورد دیگر

Lisa Sauermann is a Professor at the University of Bonn's Institute of Applied Mathematics, specializing in extremal and probabilistic combinatorics. She holds affiliations with the Institute of Mathematics and has been recognized with prestigious awards including the Richard-Rado Prize (2020), European Prize in Combinatorics (2021), and von Kaven Award (2023). PhD from Stanford University (2019), supervised by Jacob Fox Postdoc at Stanford University and Institute for Advanced Study (IAS), Princeton Assistant Professor at MIT (2021-2023) Her research focuses on additive combinatorics, discrete geometry, and polynomial methods, particularly the slice rank polynomial method. This technique was instrumental in deriving new bounds for three-term progression-free sets in F_pⁿ and solving problems like the Erdős-Ginzburg-Ziv conjecture in high dimensions. Her work bridges theoretical combinatorics with applications in finite field geometry and extremal set theory. The four lectures she presented at Collège de France in 2025 highlight her innovative use of the slice rank polynomial method to tackle longstanding problems in additive combinatorics, including three-term progression-free subsets and zero-sum configurations. Richard-Rado Prize (2020) European Prize in Combinatorics (2021) von Kaven Award (2023) Gauß Lectures (2024) Cours Peccot International laureate (2024-2025) Lisa Sauermann's career spans institutions like Stanford, MIT, and the IAS, with current leadership in advancing combinatorial methodologies at the University of Bonn. Her work continues to influence both theoretical and applied mathematical domains.

• Extremal Combinatorics
• Probabilistic Combinatorics
• Additive Combinatorics
• +۲ مورد دیگر

Srilakshmi Krishnamoorthy serves as an Associate Professor in the School of Mathematics at the Indian Institute of Science Education and Research (IISER) Thiruvananthapuram. She joined IISER TVM in 2017 as an Assistant Professor and was promoted to her current position. Her academic journey includes a PhD from the University of Sheffield, UK in Arithmetic Geometry, followed by a postdoctoral fellowship at IMSc Chennai and a visiting scientist position at the Max-Planck Institute for Mathematics in Bonn, Germany. PhD: University of Sheffield, UK (specialization in Arithmetic Geometry) Post Doctoral Fellowship: IMSc Chennai (2010-2013) Visiting Scientist: Max-Planck Institute for Mathematics, Bonn (2013-2014) Her research spans Arithmetic Geometry, Number Theory, Graph Theory, and Combinatorics, with particular focus on modular forms, elliptic curves, class field theory, and zero-sum problems. She has made significant contributions to understanding class numbers of quadratic fields, modular degrees of elliptic curves, and congruences in partition theory. Analysis of her 15 most recent publications reveals a strong concentration on class field theory problems, particularly concerning class numbers of quadratic fields and their divisibility properties. Her work frequently connects modular forms with number-theoretic questions, demonstrating expertise in both theoretical and computational aspects of modern number theory. Recent papers show increasing collaboration with junior researchers, indicating active mentoring of the next generation of mathematicians. DST-SERB Core Research Grant (2024-2027) DST-INSPIRE Faculty Award (2014-2019) Gold medal for first rank in M.Sc. Mathematical Sciences (2004) CSIR-JRF Award (2005) Multiple summer fellowships from Indian Academy of Sciences Professor Krishnamoorthy has supervised numerous students at various levels, including 4 postdoctoral researchers, 3 PhD students who have completed their degrees, and multiple masters and undergraduate research students. Her teaching portfolio includes advanced courses in Modular Forms, Algebraic Number Theory, and Number Theory and Cryptography. She has also secured multiple research grants including DST-SERB, DST-INSPIRE, and NBHM funding for conference organization and research activities. As an active member of the mathematical community, she serves as Coordinator for the Club of Mathematics at IISER TVM and has organized major events like the International Conference on Number Theory. Her research group maintains strong international connections, with regular visits from collaborators at institutions including Max-Planck Institute, TIFR Mumbai, and universities in France, Germany, and the UK. The group participates actively in the number theory seminar series and organizes workshops to foster collaboration within the Indian mathematical community.

• Arithmetic Geometry
• Number Theory
• Graph Theory
• +۱ مورد دیگر

Martino Borello is a Maître de conférences (Associate Professor) in the Département de Mathématiques at Université Paris 8, affiliated with the UFR STN and the joint research laboratory LAGA (Laboratoire Analyse, Géométrie et Applications) with Université Paris 13. He is actively involved in research, teaching, and academic service, with dual office locations in Paris 8 and Paris 13. Research Interests: His primary research lies in algebraic coding theory , finite geometry , and combinatorics . He has made significant contributions to the study of self-dual codes , G-codes (quasi-cyclic codes with symmetries), minimal and intersecting codes , and rank-metric codes . His work explores deep connections with representation theory, finite geometry, and cryptography. He also investigates Euclidean lattices, the Möbius function in subgroup lattices, and arithmetic of finite fields. Publication Trends: His recent publications (2022–2025) show a strong focus on rank-metric and sum-rank metric codes, geometric constructions of codes, covering and blocking sets, and algebraic structures in coding. There is a clear trend toward geometric methods in coding theory, especially in characterizing minimal and covering codes. His work often involves collaboration with leading researchers across Europe. Scientific Service: Organizer of the Séminaire Mathématiques Discrètes, Codes et Cryptographie (Paris 8) Co-organizer of multiple workshops and conference sessions, including: OpeRa 2024 and OpeRa 2026 (Workshops on Rank-Metric Codes) Session on Algebraic and Geometric Methods in Coding Theory at SIAM AG25 Session on Algebraic Coding Theory and Cryptography at the 29th Nordic Congress of Mathematicians Final Workshop of the ANR Barracuda project Fq15 (International Conference on Finite Fields and Their Applications) Advising and Grants: While specific students are not listed, his extensive collaboration network and PhD supervision in coding theory suggest active advising. He is likely involved in research grants, particularly through the ANR Barracuda project and collaborations with institutions in France, Italy, Germany, and Ireland. His organization of specialized workshops indicates leadership in shaping research directions in rank-metric coding. Labs and Teams: He is a member of the AGC3 team (Algèbre, Géométrie, Codage, Cryptographie) within LAGA, a major research group in algebra, geometry, and coding theory. His work is deeply embedded in the French and international mathematical community.

• Algebraic Coding Theory
• Finite Geometry
• Combinatorics
• +۷ مورد دیگر

Chelsea Edmonds is a Postdoctoral Research Associate in the Department of Computer Science at the University of Sheffield, soon to begin as a Lecturer at the University of Western Australia in November 2025. She works on the COVERT grant EPSRC project investigating formal verification and security of concurrent programs, collaborating with Dr. Andrei Popescu and Prof. John Derrick. Her research interests focus on formalised mathematics , proof assistants (particularly Isabelle/HOL), and formal methods for security and concurrency . She develops modular libraries for formalised mathematics in combinatorics, aiming to mirror human intuitive proof techniques in formal environments. Her recent publications demonstrate expertise in applying probabilistic methods to combinatorial structures and formalising complex mathematical theorems. She has contributed significantly to the formal verification community through her work on the Lovász Local Lemma and the Balog–Szemerédi–Gowers Theorem. British Federation of Women Graduates Academic Award Distinguished Paper Award for Formal Probabilistic Methods for Combinatorial Structures using the Lovász Local Lemma Top 10% of accepted papers award As an Associate Fellow with AdvanceHE, Edmonds is a passionate educator involved in STEM outreach and gender diversity initiatives for Women in STEM. She will be lecturing at the ANU Logic Summer School in December 2025 and the Midlands Graduate School. Her research on the COVERT project aims to develop verification tools for reasoning about security of programs on advanced architectures.

• Verification
• Security
• Proof Assistants
• +۳ مورد دیگر

Cécile Dartyge is an HDR lecturer at the Faculty of Science and Technology, University of Lorraine, France, affiliated with the Institut Élie Cartan de Lorraine (IECL) and actively contributing to the Analysis and Number Theory research team. Her position reflects a permanent academic appointment with research supervision privileges granted through her Habilitation à Diriger des Recherches. Her research centers on analytic number theory with specialized focus areas including multiplicative properties of polynomial values, sums of ellipsephic digits and integers, partitions of integers, and pseudo-random sets. These investigations explore deep structural properties of integer sequences and their arithmetic behavior, often employing sophisticated analytic techniques to uncover distribution patterns and asymptotic properties. Analysis of her publication record since 2018 reveals consistent emphasis on friable (smooth) integers, prime factorization of polynomial values (particularly quartic cases), and exponential sums. Her work demonstrates strong interdisciplinary connections between combinatorial number theory, digital expansions, and cryptographic applications, frequently appearing in high-impact mathematics journals. No scientific awards are documented in available sources. Information regarding doctoral students or grant funding is not specified in current records, though her HDR qualification confirms extensive research supervision experience. Dr. Dartyge maintains active collaboration within the IECL's Analysis and Number Theory group, participating in seminars and research initiatives that advance theoretical frameworks in multiplicative and additive number theory.

• Number Theory
• Analytic Number Theory
• Multiplicative Number Theory
• +۴ مورد دیگر

Bénédicte Haas is a Professor in the Department of Mathematics at Sorbonne Paris Nord University, affiliated with the Galileo Institute and LAGA laboratory (Laboratoire Analyse, Géométrie et Applications). Her research focuses on probabilistic structures including random trees, fragmentation processes, and self-similar Markov processes, with applications spanning mathematical physics and combinatorial theory. Her academic credentials include a PhD (2005) on Fragmentation and mass loss and an Habilitation à diriger les recherches (2010) on Random trees and fragmentations , both from Sorbonne Paris Nord University. These qualifications established her expertise in stochastic processes and tree-valued structures. Haas investigates scaling limits , asymptotic behaviors , and dust formation in fragmentation models, with recent work extending to stable graphs and multi-type branching structures. Her research bridges theoretical probability with concrete applications in evolutionary biology and statistical physics, characterized by rigorous mathematical analysis of discrete-to-continuum transitions. Publication trends (2010-2023) reveal sustained focus on fragmentation kinetics and tree models, evolving toward tail asymptotics and complex graph structures. Key themes include extinction time analysis, line-breaking constructions, and multi-type branching dynamics, demonstrating increasing mathematical sophistication while maintaining core probabilistic foundations. prix des Annales de l'IHP Proba. Stat. 2010 (for work on self-similar fragmentations) As an Associate Editor for ESAIM Probability and Statistics and member of the ANR GRAAL project (GRaphes and Random Trees), Haas contributes to collaborative research networks. Her teaching spans undergraduate algebra/probability courses to graduate seminars on random trees, reflecting comprehensive pedagogical engagement. Current grants support interdisciplinary work on graph-theoretic approaches to stochastic processes. Within LAGA's Probability and Statistics Team, Haas co-leads research on continuum random trees and fragmentation kinetics, maintaining active collaboration with international probabilists through the ANR GRAAL consortium and editorial responsibilities.

• Probability
• Random Trees
• Random Graphs
• +۳ مورد دیگر

Angeliki Koutsoukou-Argyraki is affiliated with the University of Cambridge, specifically within the Department of Computer Science and Technology under the School of Technology. She actively contributes to research in formal verification and interactive theorem proving. Her research focuses on the formalisation of deep mathematical results using proof assistants, particularly Isabelle/HOL. Her work bridges theoretical computer science and pure mathematics, enabling machine-checked proofs of complex theorems. This positions her at the intersection of logic, automated reasoning, and formal methods. The available publication demonstrates a strong trend in formalising results from additive combinatorics and theoretical mathematics, indicating a specialization in rigorous, logic-based verification of mathematical proofs using computational tools. She has served on the program committees of the CPP (Certified Programs and Proofs) conference in 2021, 2023, and 2026, highlighting her recognition and active participation in the formal methods and programming languages community. While no labs or research teams are explicitly mentioned, her work is closely aligned with the activities of formal methods research groups at the University of Cambridge, particularly those engaged in theorem proving and verification of mathematical theories.

• Formal Verification
• Interactive Theorem Proving
• Theoretical Computer Science
• +۵ مورد دیگر

Roles and Affiliations: Jean François DELMAS is a Professor at the École des Ponts ParisTech and a member of the CERMICS research center. His research focuses on probability theory, stochastic processes, and their applications in biology, computer science, and mathematical modeling. He has held administrative roles, including Director of CERMICS (2009–2017) and contributed to academic programs like the Master in Mathematics and Applications. Research Interests: DELMAS specializes in random trees (Galton-Watson, Lévy trees), branching processes, coalescent theory, and stochastic models in biology. His work bridges theoretical probability with applications in epidemiology, genetics, and statistical physics. Key areas include the study of metapopulation SIS models, vaccination strategies, and the analysis of large random networks using graphon theory. Teaching: DELMAS teaches advanced courses such as Stochastic Processes and Applications and Large Random Networks at the graduate level. He has authored textbooks on probability and statistics, including Random Models: Applications to Engineering and Life Sciences (with Benjamin Jourdain). Advising and Grants: DELMAS has supervised numerous PhD students, many of whom have contributed to groundbreaking work in probability and biology. His grants include ANR projects on continuum random trees and collaborations with institutions like EDF on risk management and stochastic modeling. Labs and Teams: Primary affiliation with CERMICS, part of the Université Gustave Eiffel . Active in interdisciplinary collaborations, including work with nuclear engineering and environmental science groups.

• Probability Theory
• Random Trees
• Mathematical Biology
• +۵ مورد دیگر

Hugo Duminil-Copin is a full professor at the University of Geneva (since 2013) and a permanent professor at the Institut des Hautes Études Scientifiques (IHES) in Bures-Sur-Yvette (since 2016). A 2022 Fields Medalist, his research lies at the intersection of probability theory, mathematical physics and combinatorics, with a focus on critical phenomena in lattice models. Education: École Normale Supérieure (ENS), Paris PhD, Université Paris-Saclay Research Interests: Duminil-Copin's work centers on probability theory and statistical physics , particularly the rigorous study of critical phenomena. He uses probabilistic methods to analyze classical lattice models—Ising, Potts, percolation, self-avoiding walks—shedding light on phase transitions and universality. A major breakthrough is his development of dependent percolation theory , which has yielded precise results on critical exponents and scaling limits. His research spans several subfields: Critical percolation and random-cluster models Conformal invariance and Schramm–Loewner evolution Mathematical theory of phase transitions Discrete geometry and combinatorial enumeration Random walks and polymers Scientific Awards & Honors: Fields Medal (2022) Dobrushin Prize (2019) European Mathematical Society Prize (2016) New Horizons in Mathematics Prize (2017) Loève Prize (2017) Jacques Herbrand Grand Prize (2017) ERC Starting Grant “CriBLaM” (2017–2022) Member, French Academy of Sciences Member, Academia Europaea Supervision & Grants: He leads an active research group comprising postdoctoral fellows and doctoral students in Geneva and at IHES. Since 2013 he has supervised 15+ PhD students and mentored numerous postdocs. The ERC Starting Grant “Critical Behavior of Lattice Models” (€1.5 M) supports his team’s work on scaling limits and critical phenomena. Research Group: At the University of Geneva he heads the “Analysis, Mathematical Physics and Probability” group, collaborating closely with colleagues such as Antti Knowles, Stanislav Smirnov, Vincent Vargas and Yvan Velenik.

• Probability Theory
• Mathematical Physics
• Statistical Physics
• +۴ مورد دیگر

Caroline Brosse is a Lecturer at the University of Orléans, affiliated with the LIFO laboratory and the GAMoC research team since 2024. Her research focuses on graph theory, particularly enumeration algorithms for structures in graphs such as induced subgraphs, minimal completions, and deletions, with additional work on digraphs and location problems. Education : PhD in Computer Science (2019–2023) at LIMOS, Université Clermont Auvergne, supervised by Vincent Limouzy, Aurélie Lagoutte, and Lucas Pastor Research : Enumeration algorithms, graph theory, digraphs, directed graph problems Teaching : Undergraduate courses in graph theory, databases, programming (C/Python), mathematical writing (LaTeX/git) Her publications reflect trends in algorithmic graph theory, including reconfiguration graphs, combinatorial games on graphs, and structural enumeration. She actively participates in scientific outreach through workshops and public engagement initiatives like Terra Numerica and Maison des Mathématiques et de l'Informatique.

• Graph Theory
• Enumeration Algorithms
• Digraphs
• +۴ مورد دیگر

David Gontier is a Lecturer in Mathematics at Paris-Dauphine University, affiliated with the CEREMADE research center. His research spans nonlinear analysis, spectral theory, and mathematical physics, with a focus on partial differential equations and quantum mechanics. Research Interests: He investigates problems in Nonlinear analysis and calculus of variations Spectral theory, including applications to condensed matter physics Extremal combinatorics and geometric packing problems Academic Contributions: David actively shares mathematical puzzles and educational content through his blog (thetatautau.fr), including problems on hat games, cake division, and Freudenthal-type logical puzzles. His work often bridges abstract mathematics with accessible problem-solving. Additional Information: He has contributed to educational seminars, such as MATh.en.JEANS (2024), and maintains a collection of problems on topics ranging from irrational number distributions to torus-based watch puzzles.

• Nonlinear analysis
• Spectral theory
• Calculus of variations
• +۷ مورد دیگر

Timothy Gowers is the Chair of Combinatorics, delivering public lectures and seminars on topics like Entropy and Combinatorics and the philosophy of mathematical practice from October to November 2025. His research spans foundational areas of mathematics, including graph theory and additive structures in number theory. Key Research Areas Combinatorics and its applications Graph theory in network modeling Additive Combinatorics Philosophy of mathematical practice Recent activities include an opening lecture on 6 January 2021 and a Spotlight article on 10 February 2025 about his contributions to mathematical thought.

• Combinatorics
• Graph Theory
• Additive Combinatorics
• +۲ مورد دیگر

Anne De Roton is a Lecturer at the Faculty of Science and Technology, University of Lorraine, specializing in Analytic Number Theory and Additive Combinatorics. Her research explores connections between additive structures of integers/real numbers, Fourier analysis, Freiman-type inverse theorems, and the distribution of zeros of L functions linked to functional analysis. Contact: anne.de-roton@univ-lorraine.fr Office: 209, Campus, Boulevard des Aiguillettes, Vandœuvre-lès-Nancy

• Analytic Number Theory
• Additive Combinatorics
• Fourier Analysis
• +۴ مورد دیگر