Find Academic Supervisors

• Quantum Computing
• Quantum Foundations
• ZX-calculus
• +7 more

John van de Wetering is an Assistant Professor at the Theoretical Computer Science group of the Informatics Institute, University of Amsterdam, working with the QuSoft research center. He co-authored the open-access book Picturing Quantum Software and developed the PyZX quantum compiler. His research spans quantum computation and quantum foundations, focusing on diagrammatic methods like the ZX-calculus and ZH-calculus. Quantum circuit optimization and verification Quantum foundations via algebraic/compositional methods Co-creator of PyZX His recent publications explore multi-qutrit systems, completeness of graphical calculi, and quantum state representations. Supervises students in quantum computing, including Lia Yeh and Sarah Li. Directs the new Master's program in Quantum Computer Science at UvA. Actively contributes to open-source projects and international conferences. Notable collaborations include Aleks Kissinger, Neil J. Ross, and QuSoft researchers. Uses GitHub for DiZX development (qudit extension of PyZX). No explicit scientific awards mentioned.

• Algorithmic Game Theory
• Combinatorial Optimization
• Traffic Flow Equilibria
• +4 more

Prof. Laura Vargas Koch serves as Junior Professor at RWTH Aachen University, leading the Teaching and Research Unit of Algorithmic Game Theory and Discrete Mathematics (GDM). Her interdisciplinary work bridges mathematics, computer science, and economics through rigorous theoretical frameworks. Her research focuses on: Algorithmic Game Theory : Analyzing fair pricing mechanisms and equilibrium structures in traffic flow systems Combinatorial Optimization : Developing approximation algorithms for clustering problems and graph-based optimization Analysis of her 2021-2025 publications reveals evolving expertise in dynamic traffic modeling, routing game equilibria, and auction mechanism design. Her work consistently addresses theoretical foundations while maintaining practical relevance to transportation networks and resource allocation systems. The GDM unit under her direction provides specialized coursework and fosters collaborative research at the intersection of discrete mathematics and economic modeling.

Yiting XiaView profile

Assistant Professor

• Computer Networks
• Data Center Networking
• Optical Communications
• +3 more

Dr. Yiting Xia is a tenure-track faculty member at the Max Planck Institute for Informatics (MPI-INF), leading the Network and Cloud Systems research group. She previously worked as a research scientist at Facebook and holds a PhD in Computer Science from Rice University (2018) and a B.S. in Telecommunications Engineering from Beijing University of Posts and Telecommunications and Queen Mary University of London (2011). Her research focuses on high-performance and energy-efficient networking for cloud computing, including reconfigurable data center networks, optical communications, and network protocols. Notable contributions include innovations in transport protocols, time synchronization for optical networks, and failure-resilient network design. Education: PhD in Computer Science, Rice University, 2018 M.S. in Computer Science, Rice University, 2014 B.S. in Telecommunications Engineering, BUPT & QMUL, 2011 Research Interests: Data center networking, optical communications, cloud systems, network protocols, distributed systems, and network security. Her work bridges theoretical contributions with practical implementations, addressing challenges in latency-sensitive flows, traffic engineering, and system reliability. Awards include the Ken Kennedy-Cray Fellowship and the N2Women Rising Star Award (2021). She has co-lectured courses on distributed systems and data networks at Saarland University and previously contributed to teaching at Rice University. Key projects include Aurora (for MoE inference optimization), Lighthouse (an open research framework for optical networks), and Occam (a reliable network management system). Grants & Projects: Focus on deployable optical network architectures and resilient backbone management during pandemic-driven traffic shifts. Labs/Teams: Leads the Network and Cloud Systems group at MPI-INF, collaborating with academia and industry on cutting-edge networking solutions.

• Algorithms and Complexity
• Logic
• Database Theory
• +2 more

Martin Grohe is a Professor at the School of Logic and Theory of Discrete Systems , part of the Department of Computer Science at RWTH Aachen University . His research spans Algorithms and Complexity , Logic , Database Theory , Graph Theory , and Machine Learning , with a focus on integrating logical frameworks into computational models. His recent work explores graph neural networks , Weisfeiler-Leman algorithms , and parameterized complexity , as seen in publications on isomorphism testing , database repairing , and probabilistic query evaluation . While no specific scientific awards are mentioned, his contributions to graph theory and machine learning are widely recognized through numerous peer-reviewed publications.

Tibor SzabóView profile

Professor

• Combinatorics
• Extremal Graph Theory
• Random Structures and Algorithms
• +5 more

Tibor Szabó is a Professor in the Combinatorics and Graph Theory group at the Department of Mathematics, Freie Universität Berlin. He holds a PhD from The Ohio State University, advised by Ákos Seress. Prior to his current position, he held roles at McGill University, ETH Zürich, the Institute for Advanced Study (Princeton), and the University of Illinois (UIUC) as a J.L. Doob Research Assistant Professor. Research Interests: His work focuses on combinatorics and combinatorial optimization, including extremal problems, random structures and algorithms, pseudorandom graphs, positional games, and the combinatorics of linear programming. He explores tools from algebra, probability theory, and topology applied to combinatorics. Teaching: He teaches courses such as Algorithmic Combinatorics, Extremal Combinatorics, and runs the Combinatorics Seminar. His lecture notes include works on positional games and explicit constructions in extremal combinatorics. Students & Postdocs: Notable PhD advisees include Yamaan Attwa, Silas Rathke, Simona Boyadzhiyska, and Patrick Morris. Postdoctoral fellows include Olaf Parczyk and Anurag Bishnoi. His research has involved collaborations with over 50 co-authors. Funding & Grants: Supported by grants from the Swiss National Science Foundation (SNF) and German Research Foundation (DFG), focusing on topics like positional games and extremal graph theory.

Justin SalezView profile

Professor

• Mixing Times of Markov Chains
• Stochastic Calculus
• Random Graphs
• +5 more

Justin Salez is a Professor of Mathematics at Université Paris-Dauphine & PSL University and an Institut Universitaire de France junior fellow. He serves as Principal Investigator for the ERC Consolidator Grant CUTOFF project, focusing on the cutoff phenomenon in Markov processes. His academic affiliations include editorial roles at Electronic Journal of Probability and co-organizing the CEREMADE Colloquium. Education: Mathematics Aggregation (2007-2008), Master in Probability (2006-2007), Master in Theoretical Computer Science (2005-2006), PhD (2008-2011). Professional Experience: Full Professor (2019-present) and Assistant Professor (2012-2019) at Paris Dauphine/Diderot, Postdoc at UC Berkeley (2011-2012). His research centers on Markov chain mixing times , non-negative curvature , and functional inequalities , with applications to random graphs, interacting particle systems, and MCMC algorithms. Key themes include entropy dissipation, cutoff criteria, and spectral analysis. The 15 most recent publications highlight advances in cutoff theory, curvature-entropy relationships, and functional inequalities. These span journals like Transactions of the American Mathematical Society , Annals of Probability , and Annals of Applied Probability , reflecting interdisciplinary work in probability, spectral theory, and statistical physics. Scientific Awards: ERC Consolidator Grant (2023), Marc Yor Prize (2024), Bourbaki Seminar (2024), Saint-Flour Lecture (2025), and Institut Universitaire de France fellowship (2019). As an advisor, he has supervised or is supervising PhD students including Alexandre Bristiel , Hong Quan Tran , and Guillaume Conchon-Kerjan . His lab, CEREMADE, hosts a monthly colloquium he co-organizes, fostering interdisciplinary dialogue in probability, analysis, and statistics.

Stefan GlockView profile

Assistant Professor

• Discrete Mathematics
• Extremal Combinatorics
• Probabilistic Combinatorics
• +4 more

Professor Stefan Glock is an Assistant Professor of Discrete Mathematics at the University of Passau's Faculty of Computer Science and Mathematics, a position he has held since September 2022. Prior to this appointment, he spent three years as a Junior Fellow at the Institute for Theoretical Studies at ETH Zurich, following the completion of his doctorate at the University of Birmingham. Stefan Glock received his mathematics education at Technische Universität Ilmenau from 2009 to 2014, then pursued his PhD at the University of Birmingham, which he completed in 2018. His doctoral dissertation, "Decompositions of Graphs and Hypergraphs," was the runner-up for the Richard-Rado-Preis 2018. Professor Glock's research focuses on discrete mathematical structures, with particular emphasis on their asymptotic properties. His work spans several interconnected fields of combinatorics: Extremal Combinatorics : Investigating the maximum or minimum possible size of mathematical structures satisfying certain properties Probabilistic Combinatorics : Applying probability theory to solve combinatorial problems Graph Theory : Studying properties of graphs and networks Ramsey Theory : Examining conditions under which order must appear in large structures Design Theory : Creating arrangements of elements satisfying specific balance properties Discrete Geometry : Analyzing geometric problems with discrete structures Analysis of Professor Glock's recent publications reveals a consistent focus on solving long-standing open problems in combinatorics using innovative methods that combine probabilistic techniques with structural insights. His work often bridges theoretical mathematics with applications in theoretical computer science, particularly in the analysis of algorithms and network structures. A significant portion of his research addresses fundamental questions about graph and hypergraph decompositions, which have implications for coding theory, cryptography, and network design. Professor Glock has received notable recognition for his contributions to mathematics: Runner-up for the Richard-Rado-Preis 2018 for his dissertation "Decompositions of Graphs and Hypergraphs" Awarded funding through the prestigious DFG Emmy Noether Programme in 2024 for his research group on "the interplay of structure and randomness in mathematics" As a faculty member at the University of Passau, Professor Glock leads the Discrete Mathematics research group and actively collaborates with mathematicians worldwide. He has established a strong research program that has attracted funding for academic visitors and supports multiple research projects. His approach to mathematical problems emphasizes developing new methods that have far-reaching implications beyond the specific problems being solved. Professor Glock's research group at the University of Passau focuses on the interplay between structure and randomness in discrete mathematics. The group maintains active collaborations with leading institutions including ETH Zurich, University of Birmingham, and various research centers across Europe. Through the DFG Emmy Noether Programme funding, his group is expanding its research on combinatorial structures and their applications.

Riddhipratim BasuView profile

Associate Professor

• Probability Theory
• First Passage Percolation
• Last Passage Percolation
• +5 more

Riddhipratim Basu is an Associate Professor at the International Centre for Theoretical Sciences (ICTS-TIFR) in Bengaluru, India, since September 2017. Previously, he was a Szegö Assistant Professor of Mathematics at Stanford University (2015–2017) and a Ph.D. graduate in Statistics from UC Berkeley (2015), supervised by Allan Sly. Research focuses on Probability Theory, with emphasis on First/Last Passage Percolation, Interacting Particle Systems, Large Deviations, and Random Matrix Theory. Key collaborators include Allan Sly, Shirshendu Ganguly, Mahan Mj, and Manan Bhatia. Publications span journals like Communications on Pure and Applied Mathematics , Annals of Probability , and Comm. Math. Phys. His work explores geodesic structures in percolation models, scaling exponents in KPZ universality, and geometric properties of stochastic processes. Recent studies include Liouville Quantum Gravity and Airy process fluctuations.

• Applied Geometry
• Discrete Differential Geometry
• Numerical Analysis
• +3 more

Max Wardetzky is a Professor at the Institute for Numerical and Applied Mathematics within the Faculty of Mathematics and Computer Science at the University of Göttingen, Germany. His office is located at Lotzestraße 16-18, 37083 Göttingen, and he can be reached via email at wardetzky@math.uni-goettingen.de or by phone at +49 551 39 26778. Professor Wardetzky leads the Discrete Differential Geometry Lab at the University of Göttingen, where he conducts research at the intersection of mathematics, computer science, and geometry processing. His work bridges theoretical foundations with practical applications in computer graphics and scientific computing. His primary research interests include: Applied Geometry Discrete Differential Geometry Numerical Analysis Geometry Processing Physical Simulation Computer Graphics Professor Wardetzky's extensive publication record demonstrates significant contributions to the field of discrete differential geometry and its applications. His work shows a consistent focus on developing mathematically rigorous yet computationally efficient methods for geometric problems. Key trends in his research include the development of discrete analogues of smooth geometric objects, the study of convergence properties between discrete and continuous models, and the application of these methods to problems in computer graphics and physical simulation. Professor Wardetzky has made substantial contributions to the theoretical foundations of discrete differential geometry while maintaining strong connections to practical applications. His work on discrete Laplacians, curvature approximations, and geometric flows has influenced both theoretical mathematics and practical geometry processing algorithms.

Rupert FrankView profile

Professor

• Analysis
• Mathematical Physics
• Spectral Theory
• +8 more

Rupert Frank is a Professor of Mathematics at the University of Munich (LMU Munich) . He has held academic positions at Caltech (2013–2021) and Princeton University (2009–2013). His research spans Mathematical Physics , Spectral Theory , and Functional Inequalities , with a focus on quantum many-body systems, stability of matter, and nonlocal operators. Research Themes : Analysis of eigenvalues for Schrödinger and Pauli operators with complex potentials Semi-classical spectral asymptotics and effective theories for quantum systems Matrix inequalities and quantum information theory Calculus of variations in models like the liquid drop problem Geometric inequalities and their applications to quantum mechanics Magnetic field effects on spectral properties Recent Publications : 2025: Sharp stability for Sobolev/log-Sobolev inequalities with dimensional dependence 2025: Endpoint Schatten class properties of commutators 2024: Degenerate stability of Caffarelli-Kohn-Nirenberg inequality 2024: Hardy inequalities for large fermionic systems 2023: Review on Scott conjecture for Coulomb systems Scientific Awards : Young Scientist Prize in Mathematical Physics (2009) Grants and Collaborations : Principal Investigator in CRC TRR 352 (2023–) PI in Munich Center for Quantum Science and Technology (2019–) Multiple NSF grants (2009–2020) DFG and DAAD grants Editorial and Conference Leadership : Editorial boards: Communications in Mathematical Physics , Journal in Mathematical Physics , Journal of Spectral Theory , SIAM Journal on Mathematical Analysis , Springer Lecture Notes Organized conferences/workshops on quantum many-body systems, spectral methods, and functional inequalities (2018–2025)

• Complex Systems Modeling
• Computational Mathematics
• Applied Mathematics
• +7 more

Yannis Kevrekidis is a Professor at Princeton University with a distinguished career in computational mathematics and chemical engineering. He is currently a Hans Fischer Senior Fellow at the Technical University of Munich (TUM-IAS) and has held visiting positions at institutions like the Zuse Institute Berlin and Caltech. Education : National Technical University of Athens (Chemical Engineering) University of Minnesota (PhD in dynamical systems) Research Interests : Equation-Free and Variable-Free Modeling Complex Systems Dynamics Multiscale Computation Integration of Machine Learning with Scientific Computing Pattern Formation & Instability Analysis Key Article Trends : Advanced data-driven modeling of dynamical systems Manifold learning for reaction coordinates Projective integration methods Coarse-grained modeling across disciplines Applications in epidemiology, neuroscience, and fluid dynamics Scientific Awards : Guggenheim Fellowship Humboldt Research Award Computing in Chemical Engineering Award (AIChE) Bodossaki Academic Award Allan P. Colburn Award Collaborations : Extensive international collaborations with institutions in Germany, Austria, and the UK Key role in the Complex Systems Modeling and Computation focus group at TUM-IAS

László KozmaView profile

Assistant Professor

• Data Structures
• Algorithms
• Algorithmic Adaptivity
• +7 more

László Kozma is an Assistant Professor at the Theoretical Computer Science group of the Institute of Computer Science (Freie Universität Berlin). He obtained his PhD from Saarland University under Raimund Seidel, followed by postdoctoral positions at Tel Aviv University and TU Eindhoven. His research focuses on self-adjusting data structures , adaptive algorithms , and combinatorial optimization with applications to problems like the Traveling Salesman Problem, binary search trees, and geometric data structures. Academic Affiliation: Freie Universität Berlin (since 2018) Education: PhD in Computer Science (Saarland University, 2016); postdoc at Tel Aviv University and TU Eindhoven. His work explores the intersection of data structures, combinatorial algorithms, and geometric methods. He has made significant contributions to problems involving pattern-avoidance in inputs, saddlepoint detection , and self-adjusting heaps . Key areas include: Adaptive algorithms for pattern-avoiding inputs Optimal tree and heap structures Geometric and stochastic approaches to optimization Complexity analysis of classical algorithms Recent publications highlight efficient solutions for exponential cut problems (ESA 2025), balanced TSP partitioning (EuroCG 2025), and randomized saddlepoint algorithms (ESA 2024). His research often bridges theory and practice, exemplified by the smooth heap implementation and fun projects like Recursi and Cuckoo Hashing visualization.

• Theoretical Computer Science
• Algorithms and Data Structures
• Computational Geometry
• +5 more

Raimund Seidel is a Professor in the Department of Computer Science at Universität des Saarlandes, leading the Chair of Theoretical Computer Science. He is actively involved in research and teaching, focusing on foundational aspects of algorithms and data structures, particularly in computational geometry. His primary research interests include theoretical computer science , design and analysis of efficient algorithms , geometric data structures , randomized algorithms , and combinatorial geometry . His work addresses fundamental problems such as planar point location, convex hull computation, and efficient encoding of triangulations. He also investigates geometric algorithms under the transdichotomous model, leveraging word-level parallelism. The selected publications reflect a long-standing contribution to computational geometry and data structure theory , with a focus on randomized methods and exact complexity analysis. His research combines theoretical rigor with practical implications for algorithm design. Award or honor not found in the provided text. Prof. Seidel has advised several students, including Alexander Malkis , Ralf Osbild , Udo Adamy , Christian Sohler , and others, many of whom have gone on to academic and research careers. No explicit information about grants or funding is available in the text. He leads a research group within the Department of Computer Science at Universität des Saarlandes, mentoring current staff such as László Kozma , Giorgi Nadiradze , and Lavinia Dinu . The group maintains active research in theoretical computer science and computational geometry.

• Algorithms for Big Data
• Parallel Computing
• External-Memory Algorithms
• +5 more

Ulrich Meyer is a Professor at the Institute for Computer Science at Goethe University Frankfurt. He serves as a prominent researcher in algorithms for big data, with extensive contributions to parallel and external-memory graph algorithms. His work spans theoretical foundations and practical implementations for processing large-scale data sets. Spokesperson of the DFG priority program (SPP 1736) on Algorithms for Big Data in Germany SEA23 Symposium on Experimental Algorithms, Steering Committee Chair ALENEX23 Algorithm Engineering and Experiments, Program Committee Member Professor Meyer's research interests focus on the theoretical and experimental aspects of processing large data sets on advanced computational models. His work particularly emphasizes parallel and external-memory graph algorithms, with recent focus on efficient large-scale network generation according to various stochastic models. His research has produced significant contributions including the parallel Delta-Stepping algorithm (which received the ESA Test of Time Award in 2019) and the first BFS approach with sublinear I/O. He has also explored more specialized topics like energy-efficient sorting (with records in the JouleSort competition 2009/10 and the Germany Land of Ideas Award) and fragile computing (which earned him a best-paper award at ESA 2019). His recent publications demonstrate a strong focus on graph algorithms, network generation, and parallel computing techniques. The research trends show consistent advancement in scalable algorithms for massive graphs, with particular emphasis on efficient sampling methods, shortcutting techniques, and communication-free distributed approaches. His work bridges theoretical computer science with practical engineering considerations for real-world big data applications. ESA Test of Time Award 2019 for Parallel Delta-Stepping algorithm Records in the JouleSort competition 2009/10 Germany Land of Ideas Award Best-paper award at ESA 2019 for fragile computing research Professor Meyer has made substantial contributions to the academic community through his leadership in the DFG priority program on Algorithms for Big Data, which has fostered significant research collaborations across Germany. His extensive publication record in top venues demonstrates sustained research productivity and impact in the algorithms community. While specific grant details aren't provided in the text, his role as spokesperson for a major DFG priority program indicates substantial research funding and leadership responsibilities. His work appears to be conducted within collaborative research environments focused on algorithm engineering and experimental evaluation. His research appears to be conducted within the Institute for Computer Science at Goethe University Frankfurt, likely involving collaborations with other researchers in the Algorithms for Big Data priority program. The extensive list of co-authored publications suggests active participation in research teams focused on parallel algorithms, graph processing, and network generation.

Almut Sophia KoepkeView profile

Researcher

• Multi-Modal Learning
• Computer Vision
• Audio-Visual Processing
• +3 more

Dr. Almut Sophia Koepke is a junior research group leader and TUM Junior Fellow at the Technical University of Munich (TUM) and University of Tübingen. She leads the multi-modal learning research group focusing on video understanding through sound, vision, and text integration. University: Technical University of Munich School: TUM School of Computation, Information and Technology Department: Informatics 9 Academic Rank: Researcher Her research spans multi-modal learning, audio-visual foundation models, and cross-modal attention mechanisms. Key themes include: Advancing zero-shot learning through language-guided audio-visual models Developing explainable AI systems via attention pattern translation in VQA Exploring temporal understanding in video-adverb retrieval Building robust multi-modal representations for self-driving applications Recent publications analyze foundation model capabilities in audio-visual tasks (ICCV 2025), temporal reasoning (ACMMM 2024), and cross-modal attention frameworks (ECCV 2022). She co-organizes CVPR workshops on foundation model evaluations and serves as area chair/reviewer for major conferences.