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.
Cezary Kaliszyk is a Professor in Theoretical Computer Science at the University of Melbourne, previously affiliated with the University of Innsbruck. He is actively involved in research and leadership in formal methods, automated reasoning, and machine learning for theorem proving. Research Interests: Automated Reasoning and Interactive Theorem Proving Formalized Mathematics and Proof Automation Machine Learning for Logic and Theorem Proving Integration of AI with Proof Assistants (Coq, Isabelle) Dependent Type Theory and Higher-Order Logic His recent publications (2023–2025) span topics in dependently-typed logic, learning for proof guidance, formalization of surreal numbers, and blockchain-based formal methods. The works consistently bridge formal logic with machine learning, emphasizing automation, explainability, and cross-system integration. Scientific Leadership and Projects: Principal Investigator, ERC project FormalWeb3 Lead Developer, CoqHammer , Tactician , ProofWeb WG5 Leader, COST Action EuroProofNet (until 2024) Contributor to HOL(y)Hammer , Isabelle Enigma He supervises multiple PhD students and has mentored several graduates in formal methods and AI. He teaches courses in theoretical computer science, logic, and machine learning. There are no listed awards in the provided data, but his extensive publication record and project leadership indicate significant recognition in the field. Labs and Research Groups: He leads a research group focused on formal methods and learning-based reasoning, collaborating internationally on projects involving proof automation, formal libraries, and semantic technologies.
Mingsheng Ying is a Distinguished Professor and Research Director of the Centre for Quantum Computation and Intelligent Systems (QCIS) at the Faculty of Engineering and Information Technology, University of Technology Sydney, Australia. He also holds the position of Cheung Kong Professor at the State Key Laboratory of Intelligent Technology and Systems, Department of Computer Science and Technology, Tsinghua University, Beijing, China. Professor Ying graduated from the Department of Mathematics, Fuzhou Teachers College, Jiangxi, China, in 1981. His primary research interests span quantum computation (particularly quantum programming and model-checking quantum systems), programming theory and formal methods, and the foundations of artificial intelligence (focusing on logic and uncertainty). As an author of the books "Foundations of Quantum Programming" (Elsevier - Morgan Kaufmann 2016) and "Topology in Process Calculus: Approximate Correctness and Infinite Evolution of Concurrent Programs" (Springer-Verlag, 2001), he has published over 100 papers in top international journals and conferences. His recent research publications demonstrate a strong focus on quantum programming languages, verification techniques for quantum systems, and the theoretical foundations of quantum computation. The trend in his work shows increasing emphasis on formal verification methods for quantum systems, particularly model-checking techniques for quantum Markov chains and quantum processes. His research bridges theoretical computer science with quantum information theory, creating frameworks for reliable quantum software development. Editorial Board, Artificial Intelligence, Elsevier, Amsterdam Editorial Board, Fuzzy Sets and Systems, Elsevier, Amsterdam Vice President, International Fuzzy Systems Association (elected in 2005) Program Chair, IFSA 2005, World Congress of International Fuzzy Systems Association Chairman, Chinese Association of Fuzzy Systems and Mathematics Professor Ying has secured significant research funding including multiple Australian Research Council Discovery Projects such as "Model-checking quantum Markov chains: towards verification techniques for quantum cryptographic systems" (2013-2015) and "Process algebra approach to distributed quantum computation and secure quantum communication" (2011-2013). His work has also received funding from the National Natural Science Foundation of China and Tsinghua University. At QCIS, he leads research in quantum software theory and methodology, with applications in quantum cryptography and secure communication.
Tom Schrijvers is a Professor at the Department of Computer Science in the Faculty of Engineering Science at KU Leuven, Belgium. He leads the Programming Languages Group within the Declarative Languages and Artificial Intelligence (DTAI) research group. His research focuses on programming languages, particularly functional and logic programming, with special emphasis on Haskell, type systems, and algebraic effects. His research interests include: Functional Programming, especially Haskell Type Systems and Type Theory Algebraic Effects and Handlers Logic Programming, particularly Prolog Constraint Programming Domain-Specific Languages Programming Language Theory Prof. Schrijvers' recent research has focused on effect systems, staged programming, and language composition. His work on algebraic effect handlers has been particularly influential, providing new insights into how effects can be modularly composed and handled in functional languages. He has also made significant contributions to the understanding of type classes and their implementation in Haskell. His publications demonstrate a consistent focus on practical applications of programming language theory, with work spanning from foundational type theory to applied domain-specific languages for areas like fluorescence microscopy. His research often bridges the gap between theoretical programming language concepts and practical implementation concerns. Prof. Schrijvers has supervised numerous PhD students to completion, including Pieter Wuille, Benoit Desouter, George Karachalias, Steven Keuchel, Amr Saleh, Alexander Vandenbroucke, and Ruben Pieters. He currently supervises PhD students Klara Mardirosian, César Santos, Gert-Jan Bottu, Koen Pauwels, Birthe van den Berg, and Roger Bosman. His research group has received funding from various sources including EU projects like GRACeFUL. The Programming Languages Group at KU Leuven, which he leads, focuses on functional (Haskell) and logic (Prolog, Datalog, CLP) programming languages, as well as general programming language theory. The group has been active in numerous research projects and collaborations across Europe.
Yvain Bruned is a Professor of Mathematics at Université de Lorraine, Nancy, France, where he leads research in singular stochastic partial differential equations and related fields. He serves as Principal Investigator for the ERC Starting Grant LoRDeT (2023-2028), which focuses on advancing the theory of decorated trees and Hopf algebraic structures for solving singular SPDEs and dispersive PDEs at low regularity. Previously, he was a Lecturer at the University of Edinburgh (2019-2022) and completed postdoctoral work at Imperial College London and University of Warwick under Martin Hairer. His educational background includes: PhD in Mathematics (2012-2015), UPMC (Paris 6), on "Singular KPZ type equations" under Lorenzo Zambotti Master 2 in Probability and Statistics, ENS Cachan / Rennes 1, with honors Master 1 in Mathematics, ENS Cachan, with honors Bachelor in Mathematics and Computer Science, University of Rennes 1, with honors Student at ENS Cachan Brittany extension (2009-2013) Classes Préparatoires in Mathematics and Physics (2007-2009) Bruned's research centers on singular stochastic partial differential equations, with particular focus on Regularity Structures, renormalization theory, and their connections to Hopf algebras. His work bridges theoretical mathematics with applications in quantum field theory, wave turbulence, and numerical analysis. He has developed novel approaches using decorated trees to handle renormalization procedures for singular SPDEs and has extended these methods to dispersive PDEs with random initial data. His research program aims to establish existence and uniqueness results for quasilinear and dispersive SPDEs while developing algebraic tools through deformations of Hopf algebras. His extensive publication record demonstrates consistent contributions to the field of singular SPDEs, with a clear trajectory from foundational work on Regularity Structures to more recent applications in dispersive PDEs and numerical methods. The publications reveal a strong collaborative network with leading researchers in stochastic analysis, mathematical physics, and algebra. His work shows increasing sophistication in handling renormalization procedures through algebraic structures, with recent papers exploring connections between different mathematical frameworks. His major scientific recognition includes: ERC Starting Grant LoRDeT (2023-2028) Bruned actively supervises a large group of researchers, currently advising 4 PhD students and 2 postdoctoral researchers at Université de Lorraine, with several former PhD students having completed their degrees at the University of Edinburgh. His ERC grant has enabled him to organize multiple international workshops in Nancy, fostering collaboration between researchers in singular SPDEs, algebraic structures, and numerical analysis. The grant also supports the development of software platforms for decorated trees and their Hopf algebraic structures. As Principal Investigator of the ERC LoRDeT project, Bruned leads a vibrant research team based at the Elie Cartan Institute of Lorraine, which includes postdocs, PhD students, and visiting researchers. The team regularly organizes specialized workshops on topics including operads, symmetries for quantum field theory, and normal forms for singular dynamics, creating a dynamic research environment that bridges multiple mathematical disciplines.
Damien Stehlé is a Professor at the École Normale Supérieure de Lyon (ENS Lyon), affiliated with the Laboratoire LIP (CNRS, ENSL, INRIA, UCBL, U. Lyon) and a member of the AriC team. He is also a member of the Institut Universitaire de France. His research focuses on cryptography, computational number theory, and computer algebra, particularly lattice-based cryptography and its applications in post-quantum security. He has held editorial roles at the Journal of Cryptology and Designs, Codes and Cryptography, and served on committees for major conferences like ASIACRYPT and CRYPTO. His work has led to advancements in lattice reduction algorithms, cryptographic protocols (e.g., signatures, encryption schemes), and security proofs in the quantum random oracle model. Stehlé has supervised numerous PhD students, including Alice Pellet-Mary and Miruna Rosca, and has contributed to open-source lattice reduction software like fplll. His awards include Best Paper Awards at ASIACRYPT 2021 and 2015. He teaches advanced courses on post-quantum cryptography and cryptanalysis at the Master’s level.
IIham ALLOUI is a permanent Lecturer in Computer Science (CNU 27 section) at Savoie Mont Blanc University since 1998, based at Polytech Annecy-Chambéry. She leads research in intelligent software systems at the LISTIC laboratory. Her roles include managing the Competency-Based Approach (CBA) mission for Polytech and overseeing the Pix Digital Skills project for the university. Education : PhD in Computer Science from Université Grenoble II (1992-1996), DEA in Computer Science from Université Grenoble II (1989-1990). Research Themes : Focuses on evolving software systems, model-driven engineering, distributed intelligent systems, and adaptive architectures using formal methods like modal logic, process algebra, and Markov Decision Processes. Her recent work (2015–present) involves designing adaptive 'Wise Object' frameworks for autonomous learning in software systems, with applications in fraud detection and microservice optimization. She co-supervised multiple theses on software architecture refinement, remodularization, and knowledge representation. Grants & Projects : Led or contributed to projects such as OpenCloudware (FUI), EcoCitoyen (AAP), and McWO/COMDA (USMB AAPs), addressing cloud architectures, home automation modeling, and educational innovation. Teaching : Specializes in model-driven engineering, software quality, and formal programming methods. Initiated educational projects like Reflexpro and APC By Karuta to enhance student professionalization and skill-based learning.
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.
Tilmann Wurzbacher is a Professor at the University of Lorraine, affiliated with the Department of Mathematics, Computer Science, and Mechanics. His research focuses on geometric methods in mathematical physics, including multisymplectic geometry, supermanifolds, complex Kähler manifolds, and infinite-dimensional analysis. He has contributed to the development of multisymplectic structures for classical field theories and collaborates on foundational questions in supergeometry. His recent publications emphasize multisymplectic geometry, supermanifolds, and infinite-dimensional structures, with applications to geometric quantization, conservation laws, and Hamiltonian systems. He has co-authored works on co-moments, Lagrangian submanifolds, and singular superspaces. Wurzbacher actively organizes seminars and workshops, including the weekly LieGA seminar and international workshops on multisymplectic geometry. He participates in CNRS-funded networks such as the 80Prime Project "GraNum" and the GDGR "GDM".
Oliver Nash is a researcher at Imperial College London, actively engaged in the formalisation of advanced mathematical concepts. His work bridges geometry and computational logic, with a focus on rigorous proof systems. Research Interests: Oliver's research lies at the intersection of geometry and the formalisation of mathematics. He specialises in using proof assistants to verify deep mathematical results, including topics such as the h-principle, sphere eversion, and Lie algebras. His work contributes to the growing field of certified mathematics, ensuring correctness through machine-checked proofs. Publication Trends: His recent publications at the CPP conference demonstrate a consistent focus on formalising foundational results in differential geometry and algebra. These works reflect a trend toward computational trust in mathematical proofs, particularly in complex geometric transformations and algebraic structures. Professional Activities: Oliver is an active contributor to the Certified Programs and Proofs (CPP) conference, presenting cutting-edge work in formal verification. He maintains a personal website detailing both his academic contributions and early explorations in computer graphics, such as raytracing and radiosity rendering from the early 2000s. Labs and Projects: While specific lab affiliations are not mentioned, his work is closely aligned with research groups in formal methods and interactive theorem proving, likely involving tools like Lean, Coq, or Isabelle.
Philippe Moireau is a Full Professor in the Department of Applied Mathematics at École Polytechnique, where he is also affiliated with the Center for Applied Mathematics (CMAP). He serves as the head of the Inria Project-Team MΞDISIM (Mathematical and Mechanical Modeling with Data Interaction for Simulation in Medicine) and holds the distinguished position of Ingénieur Général of The Corps des Mines. His primary research focuses on inverse problems and data assimilation for partial differential equation models, with particular emphasis on: Observer-based methods from optimal control perspectives Stabilization approaches for evolution equations Numerical analysis of time-dependent control problems Digital twin applications in cardiovascular medicine Professor Moireau's publication portfolio demonstrates consistent focus on mathematical methods for physical systems, with recurring themes in: Data assimilation techniques for PDE-based models Numerical stabilization and discretization methods Cardiovascular biomechanics and hemodynamics Stochastic modeling of biological systems Epidemiological forecasting and control He leads the ANANKΞ project-team at Inria focused on Analysis And Numerics of physical-Knowledge-based Estimation. His educational contributions include lectures on data assimilation theory at CEMRACS and courses on mathematical modeling in cardiac biomechanics at Institut Polytechnique de Paris.
Geoffroy Couteau is a CNRS research scientist at IRIF (Institut de Recherche en Informatique Fondamentale), Université Paris Cité, where he conducts research in theoretical and applied cryptography. He obtained his PhD from École Normale Supérieure de Paris in 2017 under the supervision of David Pointcheval and Hoeteck Wee, followed by a postdoctoral position at Karlsruhe Institute of Technology (KIT) from 2017 to 2019. His primary research interests include secure multiparty computation, zero-knowledge proofs, and the theoretical foundations of cryptography, with a particular emphasis on pseudorandom correlation generators and efficiency improvements in cryptographic protocols. He has made significant contributions to fine-grained cryptography, non-interactive zero-knowledge proofs, and post-quantum secure computation. The recent publications reflect a strong trend toward foundational advances in secure computation, with increasing focus on efficiency, practicality, and connections to complexity theory and learning theory. His work often bridges theoretical hardness assumptions with practical protocol design. ERC Starting Grant (2023) for project OBELiSC (Overcoming Barriers and Efficiency Limitations in Secure Computation) Geoffroy Couteau has advised numerous PhD and master’s students, including Dung Bui, Clément Ducros, Eliana Carozza, and Ulysse Léchine. He has also hosted many visiting students and postdocs, fostering a vibrant research group. He has served on the program committees of major conferences such as EUROCRYPT, CRYPTO, TCC, and PKC. He is currently leading research in cryptography at IRIF and is involved in postdoctoral hiring for projects in advanced cryptographic primitives. He maintains a research blog and resource collection for students, including LaTeX templates, a probability cheat sheet, and curated answers to common cryptography questions.
Dr. Yves Boubenec is an Associate Professor at École Normale Supérieure (ENS)-PSL University, Paris, France. He serves as Head of the LSP Neuro Platform and Director of Studies at the Department of Cognitive Studies. Academic Rank: Associate Professor Institution: ENS-PSL Departments: Cognitive Studies (ENS), LSP Neuro Platform Email: yves.boubenec@ens.psl.eu Research Focus: Boubenec investigates neural mechanisms of auditory perception and cognition using integrated methodologies spanning single-neuron electrophysiology to large-scale neuroimaging. His work reveals how context, learning, and multisensory interactions shape sound encoding in mammalian neocortex. Primary Research Themes Context-dependent auditory encoding Perceptual attention mechanisms Task-driven neural plasticity Self-supervised learning models Population-level cortical dynamics Human/ferret auditory comparisons Publication Trends: Recent work (2024-2025) examines speech production networks, premotor auditory categorization, and algebraic structures in sound learning. Earlier studies (2018-2022) focus on population gating, hierarchical auditory coding, and self-voice mechanisms. 2025 Self-voice frequency analysis Hierarchical ferret auditory cortex mapping Temporal window constraints 2024 Premotor category hemodynamics Self-supervised sound structures Human speech cortical encoding Methodological Expertise: Combines awake ferret functional UltraSound, Neuropixels recordings, and computational modeling to analyze neural representations across spatial scales. Specializes in translating animal model findings to human auditory processes.
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.
Martin Delacourt is a Lecturer at the University of Orléans, affiliated with the LIFO (Laboratoire d'informatique fondamentale d'Orléans). He earned his PhD on December 5, 2011, under the joint supervision of Bruno Durand and Victor Poupet at LIF Marseille. His research focuses on cellular automata, including directional dynamics, limit sets, and decidability of computational problems. PhD: University of Montpellier 2 (2011) ENS Lyon: Bachelor (2006), Master (2008) His research explores cellular automata through computational complexity, symbolic dynamics, and formal verification. Key themes include limit set characterization, defect dynamics, and algorithmic properties of number systems. He has published in conferences like AUTOMATA, MFCS, and CiE. Teaching responsibilities include courses in network engineering, computability, complexity theory, operating systems, and algorithm analysis at the University of Orléans. He has supervised work-study students in the MIAGE program since 2018.
