Find Academic Supervisors

James MaynardView profile

Professor

• Analytic Number Theory
• Prime Numbers
• Sieve Methods
• +1 more

James Maynard is a Professor of Number Theory at the University of Oxford , holding a Title IV Professorship equivalent to a UK chair or US full professor. He has held prestigious positions including Membership at the Institute for Advanced Study (Princeton, 2017), Research Membership at MSRI (Berkeley, 2017), and a Clay Research Fellowship (2015-2018). His research focuses on analytic number theory , particularly prime numbers and sieve methods , with groundbreaking work on prime gaps and Diophantine approximation. EDUCATION DPhil in Mathematics (2009-2013), Balliol College, Oxford Part III Mathematics (2008-2009), Queens’ College, Cambridge BA Mathematics (2005-2008), Queens’ College, Cambridge Maynard’s research explores the structure of prime numbers, including prime distribution , digital properties of primes , and norm form representations . His work has revolutionized understanding of bounded prime gaps and extremal prime spacing using advanced sieve techniques and probabilistic methods. Maynard’s publications (15 most recent) span analytic number theory , prime distribution , and Diophantine approximation . Key subfields include Bounded Gaps Between Primes , Digital Restrictions in Primes , Probabilistic Methods in Number Theory , and Algorithmic Sieve Optimization . Scientific Awards Fields Medal (2022) Cole Prize in Number Theory (2020) ERC Starting Grant (€1.5m, 2020-2025) Compositio Prize (2019) Wolfson Merit Award (2017) EMS Prize (2016) Erdős $10,000 Problem Prize (2016) Clay Research Fellowship (2015-2018) Whitehead Prize (2015) Ramanujan Prize (2014) Maynard has advised no explicitly named students but collaborates extensively in number theory. His grants include the ERC Starting Grant (2020-2025) and Wolfson Merit Award (2018-2023) . He has contributed to collaborative projects like the Polymath group and served as a Summer Consultant at GCHQ/Heilbronn Institute (2008-2012).

Jan DreierView profile

Research Fellow

• Structural Graph Theory
• Algorithmic Meta-theorems
• Computational Complexity
• +1 more

Jan Dreier is a Research Fellow at the Institute of Logic and Computation at Vienna University of Technology. His research centers on structural graph theory and algorithmic meta-theorems, particularly exploring the boundaries of tractability for model checking problems. Dreier's work bridges theoretical computer science and discrete mathematics, focusing on graph decompositions, parameterized complexity, and logical expressiveness. Key research themes include monadic stability in graph classes, applications of model theory to computer science, and efficient algorithms for logical queries on structured graphs. His publication record shows consistent focus on graph sparsity concepts and algorithmic applications of logic, with recent work expanding into approximation methods for counting queries. Research demonstrates sophisticated applications of combinatorial methods to fundamental problems in computational complexity.

Maria ChudnovskyView profile

Professor

• Graph Theory
• Combinatorics
• Discrete Mathematics
• +3 more

Maria Chudnovsky is a Professor of Mathematics at Princeton University and a former Professor of IEOR and Mathematics at Columbia University (2006-2014). Her research focuses on graph theory and combinatorics, with significant contributions to structural graph theory, perfect graphs, and algorithmic applications. Education: B.A. Summa Cum Laude (1996) and M.Sc. (1999) from Technion, Ph.D. (2003) from Princeton University Her work addresses fundamental problems in graph coloring, forbidden induced subgraphs, and combinatorial optimization, including the proof of the Strong Perfect Graph Theorem and development of algorithms for detecting graph structures. Notable awards include the MacArthur Foundation Fellowship (2013-2017), D.R. Fulkerson Prize (2009), and Henry Burchard Fine Professor of Mathematics (2022). She has held prestigious fellowships such as the Clay Mathematics Institute Research Fellowship (2003-2008). Grants: NSF DMS-EPSRC Grant DMS-2120644 (2021-2024), US Army Research Office Grant W911NF-16-1-0404 (2016-2020), and multiple NSF grants She has advised numerous PhD/MSc students and postdocs, including Sophie Spirkl, Mingxian Zhong, and Tara Abrishami. Her outreach includes popular science communication on YouTube's Numberphile and participation in initiatives promoting women in STEM.

Wojciech RytterView profile

Professor

• Design and analysis of computer algorithms
• Automata and formal languages
• Parallel algorithms
• +5 more

Wojciech Rytter is a full professor at the Institute of Informatics, Department of Mathematics and Informatics at the University of Warsaw, Poland, holding this position continuously since October 1971. His academic career includes significant international appointments as full professor at New Jersey Institute of Technology (2002-2004), Liverpool University (1997-2002), and Bonn University (1994-1995), and as visiting professor at University of California, Riverside (1992-1993) and University of Warwick (1985-1986). He earned his MSc in 1971, PhD in 1975, habilitation in 1985, and was awarded the scientific degree of professor in 1997, all from Warsaw University. Professor Rytter's research focuses on the design and analysis of computer algorithms, with particular expertise in automata and formal languages, parallel algorithms, and text algorithms. His work spans efficient sequential and parallel algorithms, automata theory, complexity of recognition and parsing of context-free languages, pattern matching, algorithmics of WWW, parallel combinatorial computing, graph-theoretic algorithms, and algorithmics of highly compressible objects. His theoretical contributions have practical applications in computational biology, bioinformatics, and text processing systems. His recent publications (2022-2025) demonstrate continued activity in string algorithms, particularly in pattern matching, string covers, and combinatorics on words, with a strong focus on theoretical computer science with applications in bioinformatics. 200 problems on automata, languages, computations (Cambridge University Press 2023) 125 Problems in Text Algorithms (Cambridge University Press, 2021) Jewels of Stringology (World Scientific, 2002) Fast parallel algorithms for matching problems in graphs (Oxford University Press 1998) Text algorithms (Oxford University Press 1994) Professor Rytter has collaborated extensively with researchers including Jakub Radoszewski, Tomasz Walen, Tomasz Kociumaka, and Maxime Crochemore. He is a member of the Academy of Europe (elected 2011, Informatics section) and has authored or co-authored more than 130 publications. He maintains an active research laboratory focused on string algorithms and combinatorics on words at the University of Warsaw.

Gil KalaiView profile

Professor

• Combinatorics
• Geometric Combinatorics
• Probabilistic Combinatorics
• +7 more

Gil Kalai is a Professor of Mathematics at the Hebrew University of Jerusalem since 1992, where he holds the Henry and Manya Noskwith Chair. He also serves as an Adjunct Professor of Mathematics and Computer Science at Yale University since 2004 in a long-term part-time visiting position. His academic career includes visiting positions at prestigious institutions including MIT, Cornell, IAS Princeton, Berkeley, Bell-labs, IBM, and Microsoft. Professor Kalai's research spans multiple areas within mathematics and theoretical computer science. His work in combinatorics encompasses geometric, probabilistic, and topological approaches. He has made significant contributions to the study of convex sets and polytopes, linear programming, and theoretical computer science. His influential 1988 paper with Kahn and Linial on Boolean functions pioneered applications of Fourier analysis in theoretical computer science. Kalai's research has evolved to include the application of Fourier analysis to thresholds, influences, symmetries, noise, percolation, and social choice. He has developed theories in algebraic shifting and studied face-numbers and other combinatorial invariants of polytopes. His work on the diameter of polytopes and randomized simplex algorithms has been influential in optimization theory. In 1993, his collaboration with Kahn produced a groundbreaking counterexample to Borsuk's Conjecture in 1325 dimensions. Professor Kalai's publications reveal a consistent focus on the intersection of combinatorics, geometry, and theoretical computer science. His work shows a progression from foundational combinatorial geometry to increasingly sophisticated applications of harmonic analysis in discrete mathematics. The recurring themes across his 30+ year career include Boolean functions, polytope theory, and probabilistic methods in combinatorics, demonstrating remarkable coherence in his research trajectory. 2016 European congress of Mathematics, plenary speaker 2013 ERC advanced grant 2012 Rothschild Prize 1994 International Congress of Mathematicians invited section talk, Zurich 1994 Fulkerson Prize 1993 Erdos Prize 1992 Polya Prize Though specific details of his advising are not provided in the source material, Kalai has written over 70 scientific papers and maintains an active research blog entitled "Combinatorics and More." His 2013 ERC advanced grant indicates significant research funding for his work. His extensive collaborations with researchers across multiple institutions suggest a robust research program with numerous PhD students and postdoctoral researchers, though specific names are not mentioned in the provided texts. Professor Kalai maintains active research connections across multiple institutions including Hebrew University, Yale, and various research centers worldwide. His work bridges pure mathematics and theoretical computer science, creating a unique interdisciplinary research environment that influences both fields.

Noga AlonView profile

Professor

• Combinatorics
• Graph Theory
• Theoretical Computer Science
• +7 more

Noga Alon is a Professor at Princeton University (previously at Tel Aviv University since 1985), renowned for transformative contributions to Combinatorics and Theoretical Computer Science. His work bridges deep mathematical theory with computational applications, earning him the 2024 Wolf Prize and 2022 Shaw Prize in Mathematical Sciences. Education Ph.D. in Mathematics, Hebrew University of Jerusalem, Israel (1983) Research Interests Alon pioneers combinatorial methods with profound impacts across mathematics and computer science. His expertise spans Graph Theory, Combinatorial Algorithms (including Streaming Algorithms), Circuit Complexity, and Combinatorial Geometry/Number Theory. He innovatively applies Algebraic and Probabilistic Methods to solve fundamental problems, such as necklace splitting and signrank applications, driving advancements in both pure and applied domains. Scientific Awards 1989 Erdos Prize, Israel 1991 Feher Prize, Israel 1997 Member of the Israel National Academy of Sciences 2000 Polya Prize, SIAM, USA 2001 Bruno Memorial Award, Israel 2005 Landau Prize, Israel 2005 EATCS-ACM Goedel Prize 2008 Israel Prize in Mathematics 2008 Member of the Academia Europaea 2011 EMET Prize 2015 Fellow of the American Mathematical Society 2015 Łojasiewicz Lecture at Jagiellonian University 2017 Fellow of the Association for Computing Machinery 2021 Leroy P. Steele Prize for Mathematical Exposition (with Joel Spencer) 2022 Shaw Prize in Mathematical Sciences 2024 Wolf Prize in Mathematics Advising and Grants While Alon has undoubtedly mentored numerous students during his tenure at Tel Aviv University and MIT, specific advisee names are not documented in the source material. Similarly, grant funding details remain unspecified despite his extensive research output.

Mihyun KangView profile

Professor

• Combinatorics
• Discrete Probability
• Algorithms
• +3 more

Mihyun Kang is a Professor in the Institute of Discrete Mathematics at Graz University of Technology (TU Graz), leading the Combinatorics Group. She holds significant academic positions and has been recognized with a Heisenberg Fellowship (German Research Foundation) and a Friedrich Wilhelm Bessel Research Award (Alexander von Humboldt Foundation). Her research focuses on combinatorics, discrete probability, and algorithms, with a specialization in random graph theory. She contributes to editorial boards, including Random Structures & Algorithms . Her research interests emphasize high-dimensional graphs, percolation processes, and structural properties of random graphs. She explores topics such as phase transitions, graph enumeration, and algorithmic applications in combinatorial problems. Her work bridges theoretical foundations with practical applications in algorithm design and probabilistic modeling. Dr. Kang’s scientific achievements include pioneering studies on hypergraphs, bootstrap percolation, and the evolution of random graph processes. Her recent publications highlight advancements in understanding graph components, connectivity thresholds, and universality phenomena in random structures. She collaborates widely, contributing to conferences and international initiatives like the SFB “Discrete random structures: enumeration and scaling limits.” Her professional activities include advising doctoral students and supervising research projects at TU Graz. She leads the Combinatorics Group, which hosts the Graz Combinatorics Seminar and actively engages in academic outreach. Her contributions extend to textbook authorship, including Diskrete Mathematik für die Informatik , and she maintains an active presence in discrete mathematics education and research.

Martin BridsonView profile

Professor

• Geometric Group Theory
• Topology
• Spaces of Non-Positive Curvature
• +3 more

Martin Bridson serves as President of the Clay Mathematics Institute since 2018 and holds the Whitehead Professorship of Pure Mathematics at the University of Oxford's Mathematical Institute, where he has been a Fellow of Magdalen College since 2007. Previously, he was Head of Oxford's Mathematical Institute (2015-2018), Professor of Pure Mathematics at Imperial College London (2002-2007), and Professor of Topology at Oxford (1999-2002). His academic journey began with undergraduate studies at Hertford College, Oxford, followed by PhD work at Cornell University. Bridson's research centers on Geometric Group Theory, Topology, and Spaces of Non-Positive Curvature. His work explores the deep connections between algebraic structures and geometric properties, particularly focusing on metric geometry, profinite completions, and the topology of non-positively curved spaces. His influential monograph "Metric Spaces of Non-Positive Curvature" (co-authored with André Haefliger) has become a foundational text in the field. His recent publications (2024-2025) demonstrate continued leadership in geometric group theory, with significant contributions to profinite rigidity, CAT(0) geometry, and automorphism groups. These works reveal evolving research directions toward computational aspects of group theory and deeper connections with low-dimensional topology. Steele Prize for Mathematical Exposition (2020, with Haefliger) Fellow of the Royal Society (2016) Fellow of the American Mathematical Society (2015) Royal Society Wolfson Research Merit Award (2012) London Mathematical Society Whitehead Prize (1999) Bridson has secured major research funding including EPSRC Senior Fellowships (2007-2012, 1997-2002), EPSRC Platform Grants (2010-2015), and multiple NSF grants. His leadership extends to directing the Mathematical Institute at Oxford and presiding over the Clay Mathematics Institute, where he influences global mathematical research directions. His collaborative work spans institutions including Princeton, Geneva, and Lausanne, reflecting his international research network.

• Probabilistic Combinatorics
• Extremal Combinatorics
• Random Structures
• +1 more

Michael Krivelevich is a Full Professor at the School of Mathematical Sciences, Tel Aviv University, holding this position since 2005. He previously served as Associate Professor (2002-2005) and Senior Lecturer (1999-2002) at the same institution. From 2015 to 2020, he acted as Dean of the Faculty of Exact Sciences at Tel Aviv University. Research Interests: Probabilistic and extremal combinatorics Random structures Applications of combinatorics to computer science Scientific Contributions: Authored two books: Positional Games (2014) and Random Graphs, Geometry and Asymptotic Structure (2016) Published over 200 research papers in combinatorics and related fields Editor-in-Chief of the Journal of Combinatorial Theory Series B (JCTB) Recognitions: Clay Lecturer (2019) Fellow of the American Mathematical Society (2017) Invited Speaker at ICM (2014) Pazy Memorial Award (2007) Academic Leadership: Dean of Faculty of Exact Sciences (2015-2020) Supervised 9 PhD and 16 MSc students at Tel Aviv University

• Uniform Distribution and Discrepancy
• Diophantine Equations
• Analytic Combinatorics
• +6 more

Robert F. Tichy is a Professor at the Institute of Analysis and Number Theory , Graz University of Technology, Austria. His career spans over four decades with significant contributions to Diophantine equations , uniform distribution , and quasi-Monte Carlo methods . He has held multiple editorial board positions and administrative roles , including Dean of the Faculty of Mathematics, Physics and Geodesy (2018-2019). Research Interests : Uniform distribution, Diophantine equations, algorithmic number theory, fractal structures, quasi-Monte Carlo methods, and mathematics in finance/insurance. Awards : Austrian Mathematical Society award (1985), Honorary Doctorate (University of Debrecen, 2017), Jean-Morlet Chair (2020), and memberships in prestigious societies. Publications : Over 200 papers with recent works (2024) focusing on Diophantine problems , pseudorandom sequences , and Carlitz coefficients . Teaching : Regular courses for engineering and mathematics students, including annual lectures on insurance mathematics .

Arnold NeumaierView profile

Professor

• Global Optimization
• Heuristic Optimization
• Nonlinear Optimization
• +6 more

Arnold Neumaier is a Full Professor (Chair for Computational Mathematics) at the Faculty of Mathematics, University of Vienna, Austria. His research focuses on global optimization, heuristic optimization, nonlinear optimization, and optimization under uncertainty. He leads a research group developing state-of-the-art software for optimization, numerical analysis, and statistics. Collaborations include work on global optimization with Immanuel Bomze and Vladimir Kolmogorov, heuristic optimization with Nysret Musliu and Günther Raidl, and optimization for data analysis with Dan Alistarh and Radu Boț. Neumaier holds a Ph.D. from the Free University of Berlin (1977) and has held academic positions at the University of Freiburg (1987–1993), AT&T Bell Laboratories (1993–1994), and visiting roles at Princeton University, the University of Nice, and RWTH Aachen. His work spans computational mathematics, quantum physics, and mathematical software development. He maintains extensive web resources on optimization and numerical analysis. Research interests include algorithmic software development, verified computing, mathematical modeling languages, uncertainty modeling, and quantum physics. His group comprises 1 full professor, 1 associate professor, 1 university assistant, 3 postdocs, and multiple PhD students. Key contributions include the 'Global Optimization' WWW site and foundational work in causal perturbation theory for quantum field theory.

Benjamin SudakovView profile

Professor

• Combinatorics
• Probabilistic Methods in Discrete Mathematics
• Extremal Graph Theory
• +4 more

Benjamin Sudakov is a Professor of Mathematics at ETH Zurich, where he has held positions since 2013. Previously, he served as a Professor at UCLA (2007-2014) and as an Assistant Professor at Princeton University (2002-2007). He has also been affiliated with the Institute for Advanced Study (2005-2006) and held prestigious fellowships including the Veblen Instructorship (1999-2002). His academic journey began with a Ph.D. from Tel Aviv University in 1999 under the supervision of Noga Alon. Education: Ph.D. in Mathematics, Tel Aviv University (1999) Advisor: Noga Alon Sudakov is a leading expert in combinatorics, with primary research interests in probabilistic and extremal combinatorics, random structures, and the application of combinatorial methods to theoretical computer science and mathematics. His work spans algebraic combinatorics, Ramsey theory, and graph theory, addressing foundational questions and developing novel methodologies. His publications and talks highlight his contributions to Ramsey graphs, equiangular lines, hypergraph theory, and submodular optimization. Key themes include structural graph theory, extremal problems, and probabilistic techniques in discrete mathematics. Scientific Awards: Humboldt Research Award (2014) Fellow of the American Mathematical Society (2013) Invited Speaker, ICM 2010 David Saxon Presidential Term Chair (2007-2011) NSF CAREER Award (2006-2011) Alfred P. Sloan Fellowship (2004-2006) Sudakov has mentored 21 Ph.D. students, including prominent mathematicians like Peter Keevash, Jacob Fox, and Matija Bucic, many of whom hold academic positions globally. He has received significant funding, including the SNSF grant 200021_196965, and actively participates in editorial boards and workshops on extremal combinatorics and related fields. Notable among his collaborative efforts is a series of workshops and seminars at institutions like Banff Research Center, IPAM, DIMACS, and BIRS, focusing on probabilistic and extremal combinatorics. His teaching includes graduate-level courses such as Graph Theory, Probabilistic Methods in Combinatorics, and Algebraic Methods in Combinatorics.

• Algorithms
• Graph Neural Networks
• Problem decomposition techniques
• +4 more

Matthias Paul Lanzinger is an Assistant Professor at the Technische Universität Wien's Faculty of Informatics, Department of Database and Artificial Intelligence. His research focuses on algorithms, graph neural networks, hypergraph decomposition techniques, parameterized complexity, and computational logic. He leads projects like 'DeConquer' (Vienna Science Fund) and 'HyperTrac', exploring efficient query processing and hypergraph-based algorithms. Research interests include theoretical computer science, database systems, and applying logical frameworks to solve complex computational problems. Recent work emphasizes hypertree decompositions, fuzzy Datalog, and graph motif analysis via the Weisfeiler-Leman test. He co-edited the 2024 Datalog-2.0 workshop proceedings and has supervised students on topics like column-store performance and graph query languages. His publications span venues like ACM Transactions on Database Systems, ICLR, and IJCAI, highlighting contributions to algorithmic efficiency, database theory, and logical reasoning systems. Active in academic service, he teaches courses on database systems, scientific research, and advanced topics in informatics.

Karoński MichałView profile

Professor

• Random discrete structures
• Probabilistic combinatorics
• Graph theory
• +1 more

Michał Karoński is a Professor of Mathematics at the Faculty of Mathematics and Computer Science, Adam Mickiewicz University, Poznań, Poland, and serves as head of the Department of Discrete Mathematics. He has held visiting professorships at Emory University, The Johns Hopkins University, Purdue University, and Southern Methodist University since 1975, with ongoing engagements at Emory University since 1992. Research Focus: Discrete mathematics, random discrete structures, graph theory, and theoretical computer science. Leadership Roles: Editor-in-Chief of Random Structures & Algorithms (since 1990), Chairman of the Council of National Science Centre (2010–2016), and organizer of 17 bi-annual conferences on random structures. His research group in random structures gained international recognition in the 1970s. He has authored 60 publications, delivered over 30 plenary lectures, and collaborated globally at institutions like Microsoft Research, Bellcore, and BRICS. Scientific Awards: 2016 Medal 'Homini Vere Academico' (AMU Rector) 2013 Polonia Restituta Officer Cross (President of Poland) 1990 Minister of Science and Higher Education Prize His work spans probabilistic combinatorics, algorithm theory, and graph irregularity, with influential publications on stochastic Kronecker graphs, random intersection graphs, and distributed complexity in matchings.

• Bayesian Statistics
• Machine Learning
• Data Clustering
• +3 more

Jan Greve is a Researcher at the Institute for Statistics and Mathematics at Wirtschaftsuniversität Wien (Vienna University of Economics and Business). His research focuses on Bayesian statistical methods, including cluster analysis, mixture models, and metadata anonymization. He has contributed to both theoretical advancements and practical software tools in computational statistics. Greve's recent work includes developing novel approaches for partition structures in Bayesian nonparametrics and creating anonymization techniques for text corpora. He has authored/co-authored peer-reviewed articles and preprints, alongside software contributions like the 'fipp' package for Bayesian mixture models. He has actively participated in academic activities such as presenting on topics like 'Mixtures of finite mixtures and the telescoping sampler' at international conferences. His research bridges theoretical statistics with applied data science challenges.