Prof. Dr. Nina Gantert is a distinguished Professor of Probability Theory at the Technical University of Munich (TUM) , affiliated with the TUM School of Computation, Information and Technology . She has held faculty positions at Karlsruhe Institute of Technology and the University of Münster prior to joining TUM in 2011. Her research focuses on probability theory , particularly stochastic processes , large deviations , and random media . She investigates random walks in random environments as models for transport in disordered systems and explores applications in physics and biology . Recent publications highlight her work on branching random walks , mixing times , biased random walks , and large deviation principles for complex stochastic systems. She has co-authored studies on random walks in dynamical percolation , interacting edge-reinforced processes , and extremal point processes in branching models. Scientific Awards: Elected fellow of the IMS (2016) Her academic career spans institutions including ETH Zürich, University of Bonn, Technical University of Berlin, and TUM. She has supervised numerous Bachelor’s and Master’s theses on topics ranging from mixing time analysis to percolation theory , often collaborating with international co-authors.
Nadia Polikarpova is an Associate Professor in the Department of Computer Science and Engineering at the University of California, San Diego . She earned her PhD from ETH Zurich in 2014 under Bertrand Meyer , followed by postdoctoral research at MIT CSAIL with Armando Solar-Lezama . Her academic contributions have been recognized with prestigious awards including the 2020 Sloan Fellowship , 2020 Intel Rising Stars Award , and 2020 NSF CAREER Award . Polikarpova's research focuses on program synthesis , program verification , and type systems . She leads the Programming Systems group at UCSD and contributes to the IFIP Working Group 2.8 on Functional Programming since 2022. Her work spans foundational research and practical tools, including projects like Synquid , SuSLik , and Laurel that combine formal methods with machine learning for code generation. Her recent publications in venues like OOPSLA , NeurIPS , and ICFP reveal trends in AI-assisted programming , live programming environments , and formal verification . She has advised numerous PhD and Master’s students including Shraddha Barke , Zheng Guo , and Tristan Knoth , many of whom have moved to prominent academic and industry positions. Notable artifacts from her lab include tools like ColDeco for spreadsheet inspection and Superfusion for eliminating intermediate data structures. 2020 : Sloan Fellow 2020 : Intel Rising Stars Award 2020 : NSF CAREER Award 2021 : Distinguished Paper at POPL 2023 : Distinguished Artifact at PLDI 2023 : Distinguished Paper at OOPSLA Polikarpova actively contributes to academic service, serving on program committees for PLDI , POPL , and OOPSLA , and co-chairing the OOPSLA Review Committee in 2023. She has delivered keynotes at APLAS'20 and PLDI'24 , emphasizing the integration of large language models with formal methods.
Christopher Morris is a tenure-track Assistant Professor at RWTH Aachen University and a DFG Emmy Noether fellow. He leads the Learning on Graphs (LoG) research group, focusing on machine learning methods for structured data, particularly graph neural networks. His work bridges machine learning, computer science theory, and discrete mathematics, addressing challenges in generalization, expressivity, and algorithmic efficiency. Education: PhD in Computer Science from TU Dortmund University (advised by Petra Mutzel and Kristian Kersting), postdoctoral research at Mila - Quebec AI Institute (Siamak Ravanbakhsh) and McGill University, and Polytechnique Montréal (Andrea Lodi). Research interests emphasize graph machine learning, including generalization theory, combinatorial optimization, and scalable graph embeddings. Notable contributions include analyzing Weisfeiler-Leman algorithms' impact on GNNs' expressivity and generalization (VC dimension connections). Awards: DFG Emmy Noether Fellowship. Supervises six PhD students in Aachen. Active in teaching, offering courses on graph-based machine learning foundations and applications since 2022. Labs/Teams: LoG group at RWTH Aachen, collaborating with institutions like Mila and Polytechnique Montréal. Erdős number 3 through Petra Mutzel’s collaboration network.
Leo Schwinn is a Lecturer at the Technical University of Munich (TUM) within the Department of Computer Science (I26), working in the Data Analytics and Machine Learning group supervised by Prof. Stephan Günnemann at the TUM School of Computation, Information and Technology. His research focuses on robust machine learning with particular emphasis on data-efficient learning and robustness vulnerabilities of Large Language Models (LLMs). Dr. Schwinn's research interests span multiple critical areas in contemporary machine learning including: Robustness against adversarial attacks in LLMs Embedding space vulnerabilities and defenses Model unlearning and privacy preservation Efficient training methodologies for large models Time-series forecasting with probabilistic frameworks Graph-based machine learning approaches His work bridges theoretical understanding with practical security implications of modern AI systems. Analysis of his recent publications (2023-2025) reveals a strong focus on LLM security, with multiple papers accepted at premier conferences including ICML, CVPR, ICLR, and NeurIPS. His research demonstrates consistent innovation in identifying novel attack vectors while developing practical defense mechanisms, particularly through embedding space manipulation techniques. The work shows increasing sophistication in handling both theoretical aspects of model robustness and practical deployment concerns. His notable scientific achievements include: Receiving the ATE dissertation price for his PhD work at FAU Securing an oral presentation at ICLR 2025 Organizing the ICLR BlogPost Track Becoming a member of ELLIS (European Laboratory for Learning and Intelligent Systems) Dr. Schwinn has served as review process chair for the 2024 Conference on Lifelong Learning Agents (CoLLAs) and actively collaborates with researchers at Mila Quebec AI Institute. His research group at TUM focuses on addressing fundamental challenges in machine learning robustness, particularly as they apply to real-world deployment scenarios where security and reliability are paramount. He maintains active GitHub repositories related to LLM security research, including circuit-breakers-eval and LLM_Embedding_Attack, demonstrating his commitment to open science and reproducible research in the field of AI security.
Prof. Dr. Ingo Scholtes is Chair of Machine Learning for Complex Networks at Julius-Maximilians-Universität Würzburg's Center for Artificial Intelligence and Data Science (CAIDAS). His research spans network science, graph machine learning, and computational social science, with applications in software engineering, ecology, biology, and physics. He received a Juniorfellowship from the German Informatics Society (2014) and an SNSF Professorship (CHF 1.5Mio, 2018). Current affiliations: JMU Würzburg (since 2021), University of Zurich (2018-2024), Bergische Universität Wuppertal (2019-2021) Research focus: Higher-order network modeling, temporal graph analysis, AI for collaborative systems, causality-aware machine learning His recent publications demonstrate strong trends in temporal network analysis , graph neural networks for time-series, and higher-order models across software engineering and social science domains. He co-chairs multiple international workshops on complex networks and serves as associate editor for EPJ Data Science and Advances in Complex Systems. Key scientific contributions: Foundational work on higher-order network models published in Nature Physics Methodological innovations in temporal network visualization (HOTVis) and path-based analysis (pathpy) As both educator and organizer, he leads the Computational Social Science Section at GI e.V., mentors across disciplines, and develops tools like git2net for collaboration analysis. His work bridges theoretical foundations with practical applications in network science.
Anna Levina is an Assistant Professor for Computational Neuroscience at the University of Tübingen , affiliated with the Department of Computer Science under the Faculty of Science. Her research focuses on the self-organization of neuronal activity, critical dynamics in neural networks, and the excitation/inhibition balance in cortical circuits. Current positions: Assistant Professor (since 2018), Group Leader (2017-2018), Equality Officer (Computer Science) Previous roles: IST Fellow (2015-2017), Associated Researcher (2011-2015), Postdoc/PI (2011-2015), Postdoc (2008-2011) Her research integrates mathematical modeling , statistical physics , and computational neuroscience to study criticality phenomena, neural avalanches, and adaptive network dynamics. Key interests include: Self-organized criticality in neural systems Excitation/Inhibition balance mechanisms Network topology and dynamics Timescale analysis in neural processing Stochastic modeling of neural activity Recent publications reveal trends in understanding critical dynamics across biological and artificial networks, with applications to memory systems, sensorimotor integration, and disease modeling. She has received recognition as an IST Fellow .
Kord Eickmeyer is a Lecturer at Technische Universität Darmstadt in the Department of Mathematics, specializing in the mathematical logic group. He holds a PhD in mathematics from Humboldt University Berlin and has held postdoctoral positions at TU Darmstadt (2011–2017) and the National Institute of Informatics in Tokyo (2011–2013). His research focuses on finite model theory, graph structure theory, and computational complexity, particularly in descriptive and parameterized complexity, as well as randomization and derandomization techniques. Research interests include exploring the boundaries of computational complexity through logical frameworks, analyzing graph structures for efficient algorithm design, and investigating the role of randomness in computation. His work bridges theoretical computer science and mathematical logic, with applications in algorithm design and formal methods. Publications span topics from model-checking on ordered structures to gap-planar graphs and randomized logics. Collaborations include prominent institutions like the National Institute of Informatics and Humboldt University Berlin. No scientific awards are explicitly listed, but his extensive academic contributions reflect a strong research trajectory. Advising and grants are not detailed in the provided text, though his academic career includes supervision roles during his PhD and postdoctoral phases. His involvement with the mathematical logic group at TU Darmstadt highlights collaborative research efforts in foundational areas of computer science and mathematics.
Michael Schaub is a tenure-track Assistant Professor in the Department of Computer Science at RWTH Aachen University, specializing in Computational Network Science. His research focuses on analyzing complex systems through network and graph models, integrating dynamical systems, control theory, and machine learning. He leads the Computational Network Science group, advancing methodologies for higher-order network models like simplicial complexes and hypergraphs. Schaub holds a PhD from Imperial College London and has held postdoctoral positions at MIT and Oxford. He is an ERC Starting Grant recipient (2022) and a Marie Curie Fellow, recognized for contributions to network dynamics and topological data analysis. Education: PhD in Mathematics, Imperial College London (2011-2015) MSc in Biomedical Engineering, Imperial College London (2010) BSc in Electrical Engineering, ETH Zurich (2007-2010) Research Interests: Schaub’s work spans interdisciplinary applications of network science, including biological systems, social networks, and technical infrastructures. Key areas include: Higher-order network models (hypergraphs, simplicial complexes) Graph signal processing and dynamics on networks Community detection and dynamical systems analysis Topological data analysis and machine learning Grants & Awards: ERC Starting Grant (2022): HIGH-HOPeS project Marie Skłodowska-Curie Fellowship (2017-2019) Junior Fellow, German Informatics Society (GI) Member of Junges Kolleg (North Rhine-Westphalia Academy) Labs & Teams: Leads the Computational Network Science Lab at RWTH Aachen, collaborating internationally on projects like the ELLIS Society and the European Laboratory for Learning and Intelligent Systems (ELLIS). Active in organizing workshops (e.g., Toponets, SIAM MDS).
Prof. Mathias Drton holds the Chair of Mathematical Statistics at the Technical University of Munich (TUM), within the Department of Mathematics and School of Computation, Information and Technology. His research focuses on graphical models, algebraic statistics, causal inference, and multivariate data analysis. He has authored numerous publications in top-tier journals and conferences, including work on conditional independence, sparse factor analysis, and causal discovery in linear models. Drton has supervised a large number of theses, mentoring students in areas like high-dimensional statistics, graphical models, and causal inference. He is actively involved in teaching advanced courses such as 'Graphical Models in Statistics' and 'Fundamentals of Mathematical Statistics.' His academic contributions span theoretical developments in statistical methodology and computational tools, including R packages like SEMID and symRC . Drton collaborates internationally, contributing to projects like the TUM-ICL Mathematical Sciences Hub and Exzellenzcluster MCQST. His work bridges algebraic methods with statistical challenges, addressing identifiability in latent variable models and robust graphical modeling under non-Gaussian assumptions. Recent research emphasizes causal structure learning under partial homoscedasticity, distribution-free independence tests, and multi-domain causal representation learning. Drton’s lab actively explores applications in genomics, epidemiology, and machine learning, leveraging both theoretical rigor and practical computational methods.
Günter Rote is a Professor in the Department of Computer Science at Freie Universität Berlin, specifically within the Theoretical Computer Science group (Arbeitsgruppe Theoretische Informatik). He holds a formal academic title of Professor Dr. and is affiliated with the Faculty of Mathematics and Computer Science. His research focuses on theoretical computer science, computational geometry, algorithms, and discrete mathematics. Key research interests include geometric algorithms, optimization problems (e.g., shortest paths, traveling salesman problems), and algorithm design for parallel computing systems. His work spans topics such as systolic arrays, convex hulls, and combinatorial optimization. Rote’s contributions include foundational studies on computational geometry problems, algorithmic complexity, and practical applications in energy equity and infrastructure design. Publications highlight contributions to solving extremal equations, polygon transformations, and the quadratic assignment problem. He has been active in academic leadership, mentoring students, and contributing to computational science communities. His email is rote@inf.fu-berlin.de, and his office is located at Takustraße 9 in Berlin.
Prof. Dr. Øyvind Eide is a Professor in Digital Humanities at the University of Cologne, affiliated with the Department of Digital Humanities under the Faculty of Arts and Humanities. He holds a PhD in Digital Humanities from King’s College London (2013). His research focuses on transformative digital intermedial studies, critical spatial formalization of cultural heritage information, and the relationship between texts and maps as media. He previously served as Chair of the European Association for Digital Humanities (EADH) from 2016–2019 and is actively involved in ICOM’s CIDOC committee. Eide’s work bridges theoretical and practical dimensions of digital humanities, emphasizing spatial analysis, ontology modeling, and interdisciplinary methodologies. His academic contributions include seminal works on network visualization in humanities, cultural heritage ontologies, and the application of critical formalization in media studies. Current research explores the interplay between verbal and spatial expressions of geography in historical narratives. Eide teaches courses such as 'Modelling and Digital Maps' and 'Digital Cultural Heritage,' reflecting his commitment to both research and education. Notable projects include the Ibsen Manuscripts digitization initiative, the GeoModelText tool for spatial narrative analysis, and contributions to archaeological document interconnection through the CIDOC CRM framework. He is Vice Director of the Scholarly Platform: Reflecting and Shaping the Digital Age at the University of Cologne.
Professor Katrin Tent is a distinguished mathematician specializing in mathematical logic at the University of Münster, where she holds a professorship in the Faculty of Mathematics and Computer Science within the Institute for Mathematical Logic and Foundations Research. She is an active researcher in Mathematics Münster, an investigator in CRC 1442 Geometry: Deformations and Rigidity, and contributes to multiple research projects including Topics in Mathematics Münster T3: Models and universes, T4: Groups and actions, and T8: Random discrete structures and their limits. PhD in Linguistics, Christian-Albrechts-Universität zu Kiel (1988) Diplom in Mathematics, Christian-Albrechts-Universität zu Kiel (1989) PhD in Mathematics, University of Notre Dame (1994) Habilitation, "Model theory of groups and BN-pairs" (2000) Professor Tent's research bridges model theory, group theory, and geometry, with particular focus on finite Morley rank structures, BN-pairs, and sharply multiply transitive groups. Her work often combines methods from these areas to prove unexpected results, either constructing groups or incidence geometries with surprising model theoretic properties or using model theory to construct new and interesting geometries or groups. Her recent publications reveal a consistent trajectory connecting model theory with group-theoretic structures. She has made significant contributions to understanding sharply 2- and 3-transitive groups, finite Morley rank geometries, and the model theory of generalized polygons. Her work demonstrates how model-theoretic techniques can solve deep problems in group theory and geometry, particularly through the study of BN-pairs and incidence structures. DFG Research Fellowship (1996-1998) Bayerischer Habilitationsförderpreis (1998-2001) Heisenberg-Stipendium (2001-2004) ERC Consolidator Grants expert panel (2016, 2018) Elected to DFG Senate (2019) Professor Tent leads an active research group with current members including Marco Amelio, Dr. Benjamin Brück, Anna Cascioli, Lukas Jonuska, Silke Meissner, Zahra Mohammadi Khangheshlaghi, and Dr. Sam Shepherd. Her former research group members include Dr. Simon Andre, Dr. Isabel Müller, and Dr. Tim Clausen, among others. Her supervisory work spans both theoretical foundations and specific applications in geometric group theory and model theory. Her research group operates within the Institute for Mathematical Logic and Foundations Research at the University of Münster, collaborating closely with other researchers in the Mathematics Münster cluster. The group participates in various projects including CRC 1442 - C04: Group theoretic aspects of negative curvature, contributing to the vibrant mathematical research environment at one of Germany's leading mathematics institutions.
Dr. Jay Pujara is a Research Associate Professor of Computer Science at the University of Southern California (USC) and Director of the Center on Knowledge Graphs. He is also a Principal Scientist at the Information Sciences Institute (ISI) and leads research teams in data science and AI. Ph.D., University of Maryland, College Park (2016) M.S. and B.S. in Computer Science, Carnegie Mellon University Research Interests include artificial intelligence, probabilistic models, knowledge graph construction, statistical relational learning, NLP, and streaming inference. His work focuses on scalable algorithms for big data and uncertainty modeling in dynamic environments. Recent Publications highlight advancements in knowledge graphs, LLM reasoning, and table understanding. Notable topics include non-verbal abstract reasoning , faithful conversational datasets , and KGQA re-ranking . Scientific Awards : SWSA Ten-Year Award (2023), Outstanding Paper (IUI 2019), Top Reviewer (NeurIPS 2018), Best Paper (SRL Workshop 2016) Advising & Grants : Mentored 12+ graduate students, including Ph.D. advisees on topics like causal modeling and neuro-symbolic tasks. Secured NSF funding for table understanding in paleoclimate studies.
Ron Peled is a Full Professor in the School of Mathematical Sciences at Tel Aviv University , currently on leave to serve as the Brin Professor in the Department of Mathematics at the University of Maryland starting summer 2024. During 2022–2024 he was a Member at Princeton University and the Institute for Advanced Study . Education & Career: While explicit degrees are not listed, his trajectory shows appointments at NYU (2009–2010), UC Berkeley and Tel Aviv University as a teaching assistant, followed by faculty positions culminating in full professorship. Research Interests: His work lies at the intersection of probability theory, statistical physics, and combinatorics . Key themes include: Disordered systems and random environments (random-field Ising, spin glasses) First-passage percolation and random metrics Random surfaces and height functions Loop models and critical phenomena Random matrices and band matrices Geometric probability and allocation problems Publications & Impact: With over 70 papers in top journals such as Annals of Mathematics , Annals of Probability , Inventiones Mathematicae , and Communications in Mathematical Physics , his recent work explores minimal surfaces in random environments, localization in random band matrices, and quantitative disorder effects in low-dimensional spin systems. Grants & Awards: Research has been continuously funded by: Israel Science Foundation (grants 1048/11, 861/15, 1971/19, 2340/23) ERC Starting Grant LocalOrder ERC Consolidator Grant Transitions Marie Skłodowska-Curie International Reintegration Grant SPTRF Teaching & Mentoring: Prof. Peled has taught a broad spectrum of courses at Tel Aviv University (Brownian motion, probability, percolation, random matrices, stochastic calculus) and NYU (combinatorics, discrete mathematics). He has supervised 13 post-doctoral fellows and 8 graduate students (PhD & MSc) to date. Service & Outreach: He co-organizes the Joint Israeli Probability Seminar and has organized numerous international workshops and conferences including at Oberwolfach, Technion, and Tel Aviv University.
Christopher Deninger is a distinguished Professor in the Mathematical Institute at the University of Münster, Germany, where he leads research in Arithmetic Geometry and Representation Theory. His office is located in Room 413 of the Einsteinstr. 62 building, and he maintains active teaching responsibilities including courses in Representation Theory of Finite Groups, Linear Algebra, and specialized topics like Adic Spaces. Deninger's research spans multiple interconnected domains of modern mathematics, with a consistent focus on the deep connections between number theory and geometry. His work has evolved from classical arithmetic geometry to incorporate increasingly sophisticated connections with p-adic analysis, dynamical systems, and more recently proalgebraic fundamental groups. A unifying theme throughout his career has been exploring analogies between different mathematical structures, particularly those connecting analytic number theory with dynamical systems on foliated spaces. His recent publications reveal a continued expansion of his research program into new territories while maintaining connections to his foundational work. The most recent papers show increasing integration of algebraic topology concepts with arithmetic geometry, particularly through proalgebraic fundamental groups and their applications. The consistent thread throughout his decades of publications is the search for deeper structural connections between seemingly disparate areas of mathematics, particularly those bridging analysis, geometry and number theory. Professor Deninger has mentored an extensive number of doctoral students and postdoctoral researchers, as evidenced by the comprehensive list of former members in his working group. His collaborations span the international mathematical community, with numerous joint publications with leading mathematicians across Europe and beyond. While specific grant information isn't detailed in the available materials, his sustained publication record across decades suggests consistent research support for his mathematical investigations. The Mathematical Institute at Münster provides the institutional home for Deninger's research activities, where he maintains an active working group focused on arithmetic geometry and related fields. His office environment includes support staff and colleagues working in closely related mathematical domains, creating a vibrant research community centered around advanced topics in pure mathematics.
