Find Academic Supervisors

Maya Ramanath is an Associate Professor in the Department of Computer Science and Engineering at Indian Institute of Technology (IIT) Delhi. She joined IIT Delhi in 2011 after a postdoctoral research stint at the Max-Planck Institute for Informatics in Germany. Her research interests focus on database systems, information retrieval, semantic web technologies, and knowledge graph construction and applications. Education: PhD in Computer Science, Indian Institute of Science, Bangalore M.Sc.(Engg.) in Computer Science, Indian Institute of Science, Bangalore B.E. in Computer Science and Engineering, Bangalore University, Bangalore Her recent work emphasizes efficient query processing over large-scale graphs, knowledge graph applications, and natural language interfaces for semantic data. Notable contributions include algorithms for reachability approximation in web-scale graphs, speculative query planning for knowledge graphs, and exploratory querying techniques. She has collaborated extensively on projects like NAGA, ESTHETE, and KlusTree, advancing the state of the art in graph-based data management and semantic search. Publications span conferences such as ICDE, ECIR, EDBT, and VLDB, reflecting a strong focus on database systems, graph algorithms, and semantic web applications. Her work bridges theoretical foundations with practical implementations, addressing scalability and efficiency challenges in modern data management systems. Research and advising activities include supervision of projects on distributed graph processing, query optimization, and knowledge representation. She has contributed to open-source tools like LegoDB and StatiX, and her lab focuses on interdisciplinary approaches to data-centric AI.

• Database Systems
• Information Retrieval
• Semantic Web Data Management
• +3 more

Stefano NASINI is an Associate Professor at the University of Lille 3, specializing in Quantitative Methods within the Economics and Mathematics Sciences. He holds a HDR (Habilitation à Diriger des Recherches) from the University of Lille 3 (2021), a Ph.D. in Statistics and Operations Research from the Polytechnic University of Catalonia (2015), and a Master in Statistics (2011). His research focuses on optimization, complex networks, statistical inference, and microeconomic applications. He has held academic positions including a post-doctoral role at IESE Business School (2014–2016) and a visiting researcher role at the University of Lisbon (2014). His work spans scheduling optimization, network analysis, financial contagion modeling, and energy system planning. Key contributions include specialized algorithms for large-scale optimization problems and frameworks for decentralized portfolio management. He is a member of the LEM research group and teaches courses in optimization, econometrics, and social network analysis at the Grande École and MSc levels. Publications highlight interdisciplinary applications, including network-based diffusion models, multi-market financial strategies, and dynamic choice analysis. His research bridges theoretical advancements in operations research with practical challenges in economics, energy, and transportation systems. No scientific awards are explicitly listed in the provided materials. His advising roles and grants are not detailed here, but his extensive publication record reflects active collaboration within academic and applied domains.

• Optimization
• Complex Networks
• Statistical Inference
• +3 more

Jean-François Le Gall is a full Professor at Université Paris-Saclay and a member of the Orsay Mathematics Laboratory (LMO) since 2006. He has held prominent positions at Pierre and Marie Curie University (1988-2006) and École Normale Supérieure (1997-2007). A Senior Member of the University Institute of France (2007-2017) and an elected member of the Academy of Sciences since 2013, he served as Vice-President of Research for the Mathematics Department at Orsay (2020–present) and led the ERC Advanced Grant GeoBrown (2017–2023). Education: Ecole Normale Supérieure (1978–1982), PhD in stochastic differential equations (1982), State Doctorate on Brownian motion (1987) Research Interests focus on probability theory , particularly Brownian motion , superprocesses , random trees , planar maps , and their connections to PDEs and geometric models. His work bridges stochastic analysis , branching processes , and coalescence phenomena . Selected Publications include foundational studies on the Brownian map , random geometry , and spatial branching processes . His 2025 paper on The area of spheres in the Brownian plane explores fractal properties of random metric spaces, while the 2020 Growth-fragmentation processes work links Brownian trees to fragmentation models. Scientific Distinctions : 1986 Rollo Davidson Prize 1997 Loève Prize in Probability 2005 Sophie Germain and Fermat Prizes 2019 Wolf Prize in Mathematics 2022 BBVA Frontiers of Knowledge Award Academic Leadership includes directing the Probability and Statistics Team (2013–2019) and the Master 2 in Probability and Statistics (2007–2015). He chairs editorial roles in Grundlehren der mathematischen Wissenschaften (since 2020) and Probability Theory and Related Fields (2005–2010).

• Probability
• Brownian motion
• Lévy processes
• +8 more

Alastair F. Donaldson is a Professor and Director of Research in the Department of Computing at Imperial College London, where he leads the FastPL research group. His work bridges formal methods, software testing, and programming languages, with a focus on enhancing the reliability of high-performance and parallel software systems. He has held key roles including Director of Research (since 2023) and previously served as Lecturer (2011–2014), Senior Lecturer (2014–2017), and Reader (2017–2020) before being promoted to Professor in 2020. His research interests include formal verification, compiler testing, GPU programming, concurrency, and fuzzing. He has made significant contributions to the verification of GPU kernels, metamorphic testing of graphics drivers, and the development of tools like GPUVerify and GraphicsFuzz. His work combines theoretical rigor with practical impact, demonstrated by the acquisition of his startup GraphicsFuzz by Google in 2018 and his subsequent roles as Senior Software Engineer and Visiting Researcher at Google. His recent publications reflect a sustained focus on compiler and system reliability, with trends in fuzzing, formal specification, and automated testing of complex systems such as WebGPU, CXL cache coherence, and large language models for code generation. His work increasingly integrates empirical validation with formal techniques to uncover subtle bugs in real-world systems. Scientific awards and recognitions include: 2017 BCS Roger Needham Award EPSRC Early Career Fellowship Fellow of the British Computer Society Best Paper awards at EuroSys 2024, MET 2021, IISWC 2019, IWOCL 2019, and ICST 2016 Best Industry Paper at ICST 2024 ACM SIGSOFT Distinguished Paper at ISSTA 2023 ACM SIGPLAN Most Influential OOPSLA Paper Award (2012 paper), awarded in 2022 Best Student Paper at PPoPP 2014 He has advised numerous PhD students and leads a vibrant research group. He has secured significant research funding and collaborates extensively with industry and academia. His service includes leadership roles such as General Chair of PLDI 2020, PC Chair of ECOOP 2019, and Steering Committee Chair of PLDI (2022–2025). He also serves on the advisory board of PACM-PL and on program committees for top venues including POPL, OOPSLA, PLDI, ICSE, and ISSTA. He leads the FastPL research group, which focuses on the design and implementation of programming tools and techniques for reliable software. The group conducts cutting-edge research in compiler testing, formal methods, and high-performance systems, fostering collaboration across academia and industry.

• Formal Verification
• Software Testing
• Programming Languages
• +12 more

Igor Kortchemski is a CNRS researcher at the Department of Mathematics and Applications (DMA) at École Normale Supérieure, Paris, and a lecturer in the Department of Applied Mathematics at École Polytechnique. His primary research focuses on the continuous limits of random discrete models, particularly examining how discrete combinatorial structures converge to continuous objects under appropriate scaling. His educational background includes a PhD in Mathematics (2012) under Jean-François Le Gall at École Normale Supérieure and a Habilitation à diriger des recherches (HDR) in Mathematics (2016). Kortchemski's research spans several interconnected areas: Random trees and Galton-Watson processes with heavy-tailed distributions Random planar maps and their geometric properties Growth-fragmentation processes and their connections to Lévy processes Scaling limits of combinatorial structures and their continuous counterparts His publication record shows a consistent focus on the geometric properties of random discrete structures, with recent work (2023-2025) exploring uniform attachment processes with freezing, critical tree phenomena, and the mesoscopic geometry of sparse random maps. His research often involves sophisticated probabilistic analysis combined with combinatorial insights. Scientific recognition includes: prix de thèse solennel Perrissin-Pirasset / Schneider de la chancellerie des Universités de Paris (2012) Kortchemski actively contributes to academic service: Examiner for the minor math exam at École Polytechnique (FUF) since 2023 Member of the mathematics jury for ENS International Selection (2023) Member of the jury for the external mathematics competitive examination (Agrégation) since 2021 Member of the jury for the Arts and Economic and Social Sciences Bank (B/L) mathematics exams (2015-2018) He mentors the next generation of researchers as co-director of Antoine Aurillard's and Vanessa Dan's theses (both since 2023), and previously directed Etienne Bellin's (2020-2023) and Paul Thevenin's (2017-2020) theses.

• Probability Theory
• Random Discrete Structures
• Random Trees
• +6 more

Pierre Marion is a Researcher at INRIA Paris, working within the Sierra research team since September 2025. His work focuses on the theoretical foundations of deep learning and he is beginning to explore applications of AI in mathematics. Marion has established collaborations across multiple institutions including EPFL, Sorbonne Université, and Google DeepMind. His educational background includes: Engineering degree from École polytechnique (2015-2018) with specialization in Applied Mathematics Master's degree from Sorbonne Université (2019-2020) PhD from Sorbonne Université (2020-2023) under the supervision of Gérard Biau and Jean-Philippe Vert Postdoctoral research at EPFL (2024) supervised by Lénaïc Chizat Marion's research interests primarily focus on the theory of deep learning, where he investigates the optimization and statistical properties of various neural network architectures. His work spans from shallow networks to complex generative models, with a particular emphasis on understanding the mathematical foundations that govern deep learning performance. Recently, he has begun exploring applications of AI in mathematical research, aiming to bridge the gap between theoretical machine learning and mathematical discovery. His research often combines rigorous theoretical analysis with practical implications for training deep neural networks. Analysis of Marion's recent publications reveals several key trends in his research. He has made significant contributions to understanding the role of large learning rates in optimization dynamics, demonstrating how they can accelerate convergence in logistic regression and prevent memorization in score-based generative models. His work on attention mechanisms has provided theoretical guarantees for their effectiveness in specific tasks like single-location regression and clustering. Additionally, Marion has extensively studied the connections between residual networks and neural ordinary differential equations , establishing generalization bounds and exploring scaling properties in the large-depth regime. His earlier work included contributions to natural language processing and quasi-Monte Carlo methods, reflecting a broad mathematical foundation that informs his current deep learning research. Marion has received several notable scientific awards: Runner-up PhD Award of AFIA (French Association for Artificial Intelligence) in 2024 Google PhD Fellowship in 2022 Ecole polytechnique Grand Prize of Research Internships in 2018 As an advisor, Marion currently supervises PhD student Yu-Han Wu (since 2024), with whom he has co-authored multiple publications on large learning rates and denoising score matching. Previously, he co-supervised several Master's students including Seorim Park, Yerkin Yesbay, and Nathan Doumèche. Marion has been actively involved in the machine learning community through conference organization (NeurIPS@Paris meetups), session chairing (ICSDS 2022), and extensive reviewing activities. He has served as a reviewer for top journals including JASA and Annals of Statistics, and conferences including NeurIPS and ICLR, where he was recognized as a top reviewer at NeurIPS 2023. Marion is a member of the Sierra research team at INRIA Paris, which focuses on machine learning theory and applications. He has also collaborated with researchers at CREST (Center for Research in Economics and Statistics), as evidenced by his participation in seminars organized by Anna Korba and Karim Lounici. His work often bridges theoretical computer science, statistics, and applied mathematics, reflecting the interdisciplinary nature of modern machine learning research.

• Deep Learning Theory
• Optimization of Neural Networks
• Generative Models
• +2 more

François Baccelli is a Research Director at INRIA Paris and Visiting Professor at Télécom Paris, leading the ERC Advanced Grant NEMO project on network mathematics. He holds a Doctor Honoris Causa from Heriot-Watt University and is a Member of the French Academy of Sciences. His career spans key roles including head of the Simons Center on Communication, Information and Network Mathematics (2012–2019), and faculty positions at École Polytechnique (1991–2003) and the University of Texas at Austin (2012–2021) as Simons Math+ECE Chair. Education: PhD in Applied Mathematics from Université Paris-Sud (1983), advised by Erol Gelenbe. Graduate of Télécom Paris (1977). Research Interests: Baccelli’s work bridges applied probability, stochastic geometry, and network dynamics with applications to telecommunications. He pioneered spatial stochastic networks, stochastic geometry modeling of wireless systems, and max-plus algebra for discrete-event systems. His contributions include foundational theories on queuing networks, Palm probabilities, and latency-constrained system design. Awards & Recognition: 2024 Blackwell Prize (INFORMS Applied Probability Society). 2014 ACM Sigmetrics Achievement Award. 2014 IEEE Stephen O. Rice and Leonard G. Abraham Prizes. Collaborations: Co-founder of the LINCS joint laboratory (INRIA/IMT/Nokia Bell Labs/Sorbonne/SystemX), fostering interdisciplinary research in communications and networks. Supervised numerous graduate students who now lead academic and industrial research globally. Labs & Teams: LINCS laboratory and ERC NEMO project, focused on network mathematics and large-scale system dynamics.

• Applied Probability
• Stochastic Geometry
• Wireless Networks
• +4 more

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
• +7 more

Nofar Carmeli is a researcher at Inria , affiliated with the Boreal joint project-team (LIRMM, Inria, University of Montpellier, CNRS) in Montpellier, France. Her work focuses on theoretical aspects of database query optimization, particularly through the lenses of fine-grained complexity and enumeration complexity. PhD from Technion (2015-2020), advised by Prof. Benny Kimelfeld Postdoctoral Researcher at ENS Paris (2021-2022) and Inria's Valda project-team Holds the Schmidt Postdoctoral Award (2021-2022) Her research explores optimal algorithms for database query answering, including direct access to ranked answers, quantile computation, and handling of conjunctive queries with self-joins or negation. She investigates how structural properties of queries and data constraints like functional dependencies affect computational complexity. Key contributions include: Establishing tractability boundaries for direct access to conjunctive queries Developing efficient algorithms for minimal triangulation enumeration Advancing probabilistic database representations for infinite domains Creating explainable opinion graph frameworks for review summarization Scientific awards: Google PhD Fellowship (2019) Schmidt Postdoctoral Award (2021-2022) PODS Best Student Paper (2019) She has served on program committees for STACS (2025), PODS (2023-2025), and ICDT (2022-2024), and contributed to open-access research dissemination through Arxiv and dblp.

• Database Query Optimization
• Fine-Grained Complexity
• Enumeration Complexity
• +2 more

Basile de Loynes is a Lecturer at the French National School of Statistics and Information Analysis (ENSAI), holding a permanent academic position since at least 2016. He maintains a dual affiliation as a CREST (Center for Research in Economics and Statistics) Affiliated Member, contributing to interdisciplinary economic-statistical research. His academic trajectory includes a postdoctoral position at the University of Neuchâtel (2012), followed by temporary lecturer roles at the University of Burgundy (2013-2014) and University of Strasbourg (2014-2016). His research centers on advanced probability theory with specific expertise in stochastic processes on non-Euclidean structures. Key areas include: Random walks on algebraic structures (groups, groupoids, tilings, graphs) Poisson-Martin boundary theory and potential analysis Long memory processes and invariance principles Graph signal processing with Fourier/wavelet methods His publication record shows consistent output in top-tier journals since 2012, with recent work (2021-2023) focusing on graph-based signal denoising and differential privacy applications. Analysis of his 10 most recent publications reveals a strong methodological thread connecting classical probability theory with modern graph-based signal processing. Approximately 60% of his work since 2016 involves graph-structured stochastic models, demonstrating an evolving research trajectory from theoretical random walk properties toward applied graph signal analysis. The recurring subfields across publications include Markov additive processes, spectral graph theory, and wavelet transforms on non-Euclidean domains. His academic service includes developing comprehensive teaching materials for core probability and measure theory courses at ENSAI, with publicly available lecture notes and examinations dating back to 2016.

• Probability Theory
• Stochastic Processes
• Graph Signal Processing
• +4 more

Michalis Vazirgiannis is a Professor at LIX, École Polytechnique in France, where he leads the Data Science and Mining group (DaSciM). He holds a degree in Physics and a PhD in Informatics from Athens University (Greece), and a Master's degree in AI from Heriot Watt University, Edinburgh (UK). His academic career spans multiple prestigious institutions including Fraunhofer and Max Planck MPI in Germany, INRIA/FUTURS in Paris, AUEB in Greece, Telecom-Paristech, ENS in France, Tsinghua and Jiaotong Shanghai in China, and Deusto University in Spain. Professor Vazirgiannis's research focuses on machine and deep learning methods for graph analysis, including community detection, graph clustering, node embeddings, and influence maximization. His work in text mining encompasses Graph of Words, word embeddings with applications to web advertising and marketing, event detection, and summarization. He has active collaborations with industrial partners in analytics and machine learning for large-scale data repositories across various application domains such as recommendations, meeting summarization, influence metrics for scientific and social networks, and predictive maintenance. His recent publications demonstrate a strong emphasis on Graph Neural Networks, multilingual NLP (particularly for French and Arabic), and applications of deep learning to diverse domains including social networks, legal text, and biomedical data. There's a clear trajectory toward developing more efficient, explainable, and specialized models that address real-world challenges in data analysis. ERCIM fellowship Marie Curie EU fellowship Tencent "Rhino-Bird International Academic Expert Award" (2017) Best Paper Award at IJCAI 2018 Best Paper Award at CIKM 2013 Professor Vazirgiannis has supervised 29 completed PhD theses and has attracted significant R&D funding from national and international sources, including research agencies and industrial partners such as Google, Airbus, Huawei, Deezer, BNP, and LVMH. He leads or has led several academic research chairs including DIGITEO (2013-15), ANR/HELAS (2020-25), and AXA (2015-2018). The DaSciM research group, which he leads at École Polytechnique, has extensive experience in real-world R&D projects involving large-scale data mining. The team maintains active collaborations with major industrial partners including AIRBUS, Google, BNP, Tencent, and Tradelab, working on cutting-edge machine learning projects. The group has co-organized major conferences such as ECML PKDD 2011 and ECML/PKDD 2017 and participates in the senior organization of AI and data mining events like AAAI and IJCAI.

• Machine Learning
• Deep Learning
• Graph Analysis
• +11 more

Jamal Atif is a Professor at Paris-Dauphine University and holds multiple significant leadership positions including Project Manager for 'Data Science and Artificial Intelligence' at the Institute of Information Sciences and their Interactions (INS2I) of the CNRS, Deputy Scientific Director of 3IA PRAIRIE, Head of the MILES team/project at LAMSADE (UMR CNRS-Université Paris-Dauphine), Co-leader of the Transverse Artificial Intelligence Program at PSL University, and Director of the Dauphine Numérique program. Professor Atif's primary research focuses on the foundations of responsible artificial intelligence, with specific expertise in privacy preservation in machine learning, robustness of deep learning algorithms to malicious attacks, causality, and explainability. His work bridges theoretical foundations with practical applications in security and reliability of AI systems. He has developed innovative approaches to address adversarial vulnerabilities in machine learning models and has made significant contributions to privacy-preserving techniques in data analysis. His publication record demonstrates a consistent focus on robust and trustworthy AI systems, with recent work exploring differential privacy in clustering, adversarial robustness, and explainable AI. The research spans theoretical foundations in logic and knowledge representation to practical applications in finance, healthcare, and computer vision. His publications appear in top-tier venues including Machine Learning journal, Neural Information Processing Systems, and International Joint Conferences on Artificial Intelligence. Scientific Awards: Recipient of two awards from the North American Society of Radiology for his thesis work Professor Atif has co-supervised or is currently supervising around fifteen doctoral students, demonstrating his commitment to mentoring the next generation of AI researchers. His leadership extends to directing major institutional programs including Dauphine Numérique and the Transverse Artificial Intelligence Program at PSL University, where he shapes strategic research directions in AI. He leads the MILES team/project at LAMSADE, which focuses on foundational aspects of machine learning and artificial intelligence. The team's research spans theoretical aspects of learning algorithms to practical applications requiring robust and reliable AI systems, with particular emphasis on security and privacy considerations in modern machine learning deployments.

• Artificial Intelligence
• Responsible AI
• Privacy Preservation in Machine Learning
• +4 more

Petr Kuznetsov is a Professor at Telecom Paris (Institut Polytechnique de Paris), affiliated with the Department of Computer Science and Networks (INFRES). He leads the Autonomous Critical Embedded Systems (ACES) research team at the Information Processing and Communication Laboratory (LTCI). His work bridges theoretical foundations and practical applications in distributed systems. Research Focus: Kuznetsov specializes in distributed algorithms, synchronization protocols, failure detection mechanisms, and the application of algebraic topology to distributed computing. His recent work explores Byzantine fault tolerance, blockchain consensus, and concurrency in networking infrastructures. Recent Publication Trends (2015-2025): His articles predominantly focus on scalability and resilience in distributed systems, with emerging themes in blockchain technologies, Byzantine fault tolerance, and concurrency optimization. Theoretical contributions include computability theorems and complexity bounds, while applied work targets payment systems and distributed ledgers. Awards & Honors: Best Paper Award at DISC 2019 for Scalable Byzantine Reliable Broadcast Best Student Paper Award at PODC 2018 for An Asynchronous Computability Theorem for Fair Adversaries Projects & Advising: He directs the TrustShare Innovation Chair (large-scale data synchronization) and DISCMAT (mathematical foundations of distributed computing). Actively seeks PhD candidates for projects on distributed algorithms and concurrency. Laboratory & Teams: Heads the ACES team at LTCI, focusing on critical embedded systems and fault-tolerant distributed architectures. Collaborates internationally through workshops like SPTDC.

• Distributed Systems
• Algorithms
• Synchronization
• +3 more

Camille Horbez is a CNRS researcher at Laboratoire de Mathématiques d'Orsay, Université Paris-Saclay, working on geometric group theory. His research explores groups like Out(F_n) through geometric actions, subgroup classification, and rigidity problems. He leads the ERC Starting Grant 'Artin groups, mapping class groups and Out(Fn): from geometry to operator algebras via measure equivalence'. Research focuses on: Classification of subgroups of Out(F_n) Measure equivalence rigidity Random walks on groups

• Geometric group theory
• Outer automorphism groups
• Measure equivalence rigidity
• +1 more

Ammar Mian is an Associate Professor at Université Savoie Mont Blanc, affiliated with the LISTIC lab and Polytech Annecy-Chambéry. He holds a PhD from CentraleSupélec (2016-2019) and conducted postdoctoral research at Aalto University (2019-2020). His research focuses on statistical signal processing, machine learning, and Riemannian geometry with applications in remote sensing and frugal computations. He leads the Qanat project, an experiment tracking tool for reproducible research. Research interests include covariance-based methods for SAR image analysis, robust detection algorithms for sonar and GPR systems, and optimization on Riemannian manifolds. His work emphasizes reproducibility in ML and efficient computational techniques for resource-constrained environments. Key contributions include real-time SAR time-series change detection, robust classification using second-order deep learning models, and novel methods for handling missing data in EEG signals. His recent articles (2023-2025) explore reproducibility frameworks, GPR-based object classification, and Riemannian geometry applications. No awards listed, but maintains active collaborations through LISTIC and industry partnerships. Advises students via internship programs (e.g., Federated ML energy cost analysis). Lab work involves developing open-source tools like Qanat for experiment management and reproducibility.

• Statistical Signal Processing
• Machine Learning
• Riemannian Geometry
• +4 more