Professor Catherine Greenhill is a faculty member at the School of Mathematics and Statistics, UNSW Sydney , where she serves as Professor and head of the Combinatorics group. Her academic career spans institutions including the University of Queensland, University of Oxford, University of Leeds, University of Melbourne, and Australian National University. D.Phil., University of Oxford (1996) M.Sc. (Research) in Combinatorics (1992) B.Sc. (Hons) in Pure Mathematics (1991) Her research focuses on the intersection of discrete mathematics , theoretical computer science , and probability , particularly in asymptotic combinatorics , probabilistic methods , and analysis of algorithms . Her work includes asymptotic enumeration of combinatorial structures and design of randomized algorithms for graph sampling and counting. Her recent publications (2025–2021) center on random graphs and hypergraphs , with key contributions to switch Markov chains , degree sequence analysis , and chromatic number bounds . These works reflect her expertise in probabilistic combinatorics and algorithmic complexity . Scientific Awards: Fellow of the Australian Academy of Science (2022) Christopher Heyde Medal in Pure Mathematics (2015) June Griffith Fellowship (2013) Hall Medal (2010) Advising and Grants: She has supervised numerous PhD/Masters students and secured multiple ARC Discovery Grants (2019–2021, 2014–2016, 2012–2014). Her grants address topics like hypergraph modeling, random discrete structures, and network analysis in illicit drug trafficking.
Yang P. Liu is an Assistant Professor at Carnegie Mellon University 's Department of Computer Science . He received his PhD from Stanford University under the supervision of Aaron Sidford and previously studied at MIT . Fields of Interest : Graph Algorithms, Optimization, High-Dimensional Geometry, Additive Combinatorics, Theoretical Computer Science. His research focuses on algorithmic design and analysis for graph problems, optimization, and combinatorics, with applications in machine learning and complexity theory. Recent work includes advancements in parallel repetition games , combinatorial lines , and dynamic graph algorithms . In 2024, his research spanned FOCS , STOC , and RANDOM conferences, addressing problems in k-CSPs , min-cost flow , and hypergraph sparsification . Earlier contributions (2023) included deterministic flow algorithms and spectral hypergraph techniques. Scientific Awards : NDSEG Fellowship (2018-2021), Google PhD Fellowship (2022-2023), FOCS Best Paper (2022), STOC Best Student Paper (2022), FOCS Best Student Paper (2021). He teaches CS 15-759 , a graduate course on convex optimization theory and applications, covering gradient descent, interior point methods, and algorithmic sparsification techniques.
Lijie Chen is an Assistant Professor in the Department of Electrical Engineering and Computer Sciences at UC Berkeley, where he is part of the Berkeley Theory Group. Previously, he was a Miller Research Fellow at UC Berkeley, hosted by Avishay Tal and Umesh Vazirani, and earned his Ph.D. from MIT under Ryan Williams. His research focuses on theoretical computer science, particularly computational complexity theory, with applications to quantum physics and AI safety. Education: Ph.D. in Computer Science from MIT (2022), B.Sc. from Yao Class at Tsinghua University. Research Interests: Complexity theory, quantum complexity, derandomization, circuit lower bounds, and foundational aspects of AI safety. Chen has made significant contributions to understanding fundamental questions in complexity theory, including circuit lower bounds and the connections between randomness and computation efficiency. His work often bridges theoretical insights with practical implications in quantum computing and algorithm design. Awards and Honors: Machtey Award for Best Student Paper (2019). Danny Lewin Best Student Paper Award (2019). Invited to SICOMP Special Issues for FOCS and STOC papers. He has organized workshops on complexity theory and derandomization, and his research has been recognized in venues like STOC, FOCS, and the Journal of the ACM.
Jacob Fox is a Professor at Stanford University, specializing in Combinatorics and Probability. His research focuses on extremal combinatorics, Ramsey theory, graph theory, and additive combinatorics. He advises students like Maya Sankar. His work explores structural and enumerative aspects of graphs, hypergraphs, and combinatorial configurations. Recent studies include advancements in Ramsey numbers, sumset theory, and probabilistic methods in discrete mathematics. Key research areas include Ramsey numbers for sparse structures, hypergraph properties, and applications of combinatorial geometry. His publications often bridge theoretical insights with algorithmic applications. No scientific awards are listed in the provided text. His advising includes Maya Sankar, with research aligned to combinatorial problems. Collaborative projects involve extremal graph theory and probabilistic combinatorics. No labs or dedicated research groups are explicitly mentioned.
Liping Liu is a Professor in the Department of Management at The University of Akron's College of Business. He holds a Ph.D. in Business from the University of Kansas (1995), Master of Engineering in Systems Engineering (1991), and dual bachelor's degrees in Applied Mathematics (1986) and River Dynamics (1987). Ph.D., University of Kansas MS, Huazhong University of Science and Technology B.E., Wuhan University BS, Huazhong University of Science and Technology His research spans Artificial Intelligence , Electronic Business , Systems Analysis , Data Quality , and Belief Function Theory . He pioneered coarse utility theory and linear belief functions , now taught in top Ph.D. programs across multiple disciplines. Key trends in his publications include Belief Function Applications (2012-2024), Medical Data Systems (2003-2015), and Decision Theory (2004-2014). Recent works focus on Gamma Belief Functions (2024) and computational improvements in linear belief function operations (2019-2016). Scientific contributions recognized via: Microsoft Azure Educator Grant (2014-2016) Inclusion in Who's Who in America (2010-2013) and Who's Who in the World (2011-2013) As an editor and committee member for major conferences (INFORMS, AMCIS, Belief Functions conferences), he bridges academic research with practical systems implementation in e-business and healthcare domains.
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).
Professor Imre Leader is a distinguished mathematician at the University of Cambridge, where he serves as Professor of Pure Mathematics in the Department of Pure Mathematics and Mathematical Statistics (DPMMS), which is part of the Faculty of Mathematics. His office is located in room C2.02 at the DPMMS building. Professor Leader's research primarily focuses on Extremal Combinatorics and Ramsey Theory , two fundamental areas of discrete mathematics. His work explores deep connections between combinatorial structures, set theory, and algebraic properties. He has made significant contributions to understanding partition regularity, monochromatic structures, extremal set theory, and combinatorial geometry. His research often bridges the gap between pure combinatorics and applications in computer science and theoretical mathematics. Over his prolific career, Professor Leader has published numerous influential papers in top mathematical journals, collaborating with leading mathematicians worldwide. His work spans various aspects of combinatorics including hypergraph theory, geometric combinatorics, additive number theory, and combinatorial game theory. He has been particularly active in advancing our understanding of Ramsey-type phenomena in infinite structures and developing new techniques in extremal combinatorics. Research Group: Combinatorics Email: I.Leader@dpmms.cam.ac.uk Telephone: 01223 765902 Personal homepage: https://www.dpmms.cam.ac.uk/~ibl10
Paolo Gardoni is the Alfredo H. Ang Family Professor and an Excellence Faculty Scholar in the Department of Civil and Environmental Engineering at the University of Illinois Urbana-Champaign, with additional professorial appointments in Industrial & Enterprise Systems Engineering and Biomedical & Translational Sciences. He also serves as Director of the MAE Center and Editor-in-Chief of Reliability Engineering & System Safety. Education Ph.D. in Civil Engineering, University of California, Berkeley (2002) M.A. in Statistics, University of California, Berkeley (2001) M.Eng. in Structural Engineering, University of Tokyo (1997) Laurea (BS+MS equivalent) in Structural Engineering, Politecnico di Milano (1997) Research Interests Gardoni’s scholarship integrates probabilistic methods with large-scale infrastructure systems to advance reliability, risk, and life-cycle analysis. His work quantifies the performance of deteriorating systems under natural and anthropogenic hazards, models societal impacts of disasters, and develops decision frameworks for sustainable and resilient infrastructure. He also examines ethical, social, and legal dimensions of risk, and investigates optimal strategies for hazard mitigation, disaster recovery, and climate adaptation. Across more than 250 refereed journal papers, he has advanced sub-fields ranging from probabilistic mechanics and earthquake engineering to catastrophe bond pricing and engineering ethics, leveraging tools such as stochastic differential equations, Bayesian networks, and physics-informed machine learning. Awards & Honors Alfredo Ang Award on Risk Analysis and Management of Civil Infrastructure (ASCE, 2021) Best Paper Awards in ASCE Journal of Sustainable Water in the Built Environment (2019) and Geotechnical Research (2018 Telford Premium Prize) Fellowships and named professorships: Alfredo H. Ang Family Professor, Excellence Faculty Scholar, and courtesy or honorary professorships at Tsinghua, IIT Guwahati, Tongji, Jianghan, and Loughborough universities. Research Leadership & Funding Gardoni has secured over $58 million in research funding from NSF, DHS, NIST, USAID, Qatar National Research Fund, and other agencies. He directs the MAE Center—formerly an NSF Engineering Research Center—focused on multi-hazard engineering approaches, and is Editor-in-Chief of Reliability Engineering & System Safety (Elsevier, IF 9.4). He founded and formerly led the journal Sustainable and Resilient Infrastructure (Taylor & Francis) and serves on editorial boards of nine additional journals. Advising & Mentorship He has graduated 27 PhD and 35 Master’s students, many of whom now hold faculty positions worldwide. His group maintains an active pipeline of doctoral and post-doctoral researchers working on resilience analytics, infrastructure monitoring, and risk-informed decision-making. Laboratories & Collaborations He leads the MAE Center and is affiliated with the Critical Infrastructure Resilience Institute (CIRI) and the Biomedical and Translational Sciences group. International collaborations span the UK (Loughborough), India (IIT Guwahati), and China (Tsinghua, Tongji, Jianghan), fostering cross-disciplinary research in reliability and resilience engineering.
Daniel M. Kane is a Professor at the University of California, San Diego (UCSD), holding a joint appointment in the Department of Mathematics and the Department of Computer Science and Engineering (CSE). His research spans mathematics and theoretical computer science, with a focus on number theory, combinatorics, complexity theory, and computational statistics. He earned a Ph.D. in Mathematics from Harvard University (2011) and dual BS degrees in Mathematics with Computer Science and Physics from MIT (2007). Prior to UCSD, he was a postdoctoral researcher at Stanford University (2011–2014) on an NSF fellowship. His research interests include robust statistics, machine learning, polynomial threshold functions, and algorithmic methods for high-dimensional data. Notable achievements include co-authoring the book Algorithmic High-Dimensional Robust Statistics (Cambridge University Press, 2023) and receiving the Best Paper Award at the Conference on Computational Complexity (2013), as well as gold medals at the International Mathematical Olympiad (2002 and 2003). Current teaching includes courses such as Math 96 (Putnam Seminar), Math 154 (Graph Theory), CSE 101 (Algorithms), and CSE 203A (Randomized Algorithms). He has consulted for companies like CASPER Labs and AIble, and his work extends to cryptographic protocols, including quantum money schemes based on quaternion algebras. Key contributions include breakthroughs in robust mean estimation, list-decodable learning, and the development of efficient algorithms for statistical problems. His research often bridges foundational theory with practical applications in machine learning and data analysis.
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.
Cong Ling is a Professor of Information Theory and Cryptography at Imperial College London's Department of Electrical and Electronic Engineering, within the Faculty of Engineering. His research focuses on lattice theory and its applications in coding, cryptography, quantum information, and number theory. Key affiliations include the Academic Centre of Excellence in Cyber Security Research and the Engineering Secure Software Systems group. Education details are not explicitly provided in the text, but his professional experience indicates advanced qualifications in electrical engineering and mathematics. Research interests span lattice-based cryptography, post-quantum security, algebraic coding theory, and quantum-resistant algorithms. His work bridges information theory and number theory, with contributions to MIMO systems, secure communication protocols, and cryptographic protocol design. Recent publications emphasize lattice reduction techniques, quantum algorithms for the shortest vector problem, and advancements in polar codes. Notable trends include exploration of non-commutative algebras for cryptography, Gaussian sampling optimizations, and hybrid quantum-classical approaches to hard integer problems. Over 50+ articles published since 2018 reflect his leadership in lattice-based research and quantum-safe technologies. Awards: None explicitly listed in the text. Grants/Advising: No specific grants or student advisees mentioned; focus remains on collaborative research outputs. Labs/Teams: Associated with Imperial's Cyber Security Research groups and quantum engineering initiatives.
Claire Donnat is an Assistant Professor in the Department of Statistics at the University of Chicago, specializing in statistical and machine learning methods for graph-structured and high-dimensional data. Her work bridges theoretical innovation with applications in biomedical research, environmental science, and public health. Education: B.S. and M.S. in Applied Mathematics from Ecole Polytechnique; Ph.D. in Statistics from Stanford University (2020). Her research focuses on three methodological directions: (1) statistical foundations for graph neural networks (GNNs), (2) structured estimation with graph constraints, and (3) multimodal data integration with uncertainty quantification. Key applications include thermotolerance in photosynthetic microbes, family network analysis for child welfare, and spatial transcriptomics. The 15 most recent publications highlight her work in GNNs, CCA, tensor modeling, and epidemic analysis, with keywords spanning statistics, machine learning, and network science. Her methodological contributions address challenges in sparsity, graph topology, and heterogeneous data fusion. Scientific Awards: Facebook Research Award (2021), C3.AI COVID Grand Challenge winner (2020), Lumiata hackathon winner (2020), Stanford Centennial Award (2019), and others. Claire's research group actively recruits postdocs and students for projects involving graph-based modeling, data integration, and biomedical applications. She also provides research consulting in statistical methodology and graph modeling for life sciences.
Professor Martin Liebeck is a Professor of Pure Mathematics and Head of the Pure Mathematics Section at the Department of Mathematics, Imperial College London. He is affiliated with the Algebra and Algebraic Combinatorics research groups and is part of the Mathematics research and teaching staff within the Faculty of Natural Sciences. His research interests span Pure Mathematics, with a focus on group theory, algebraic combinatorics, Lie groups, and representation theory. His work often involves the structure and properties of finite simple groups, algebraic groups, and their applications to permutation groups and character theory. Recent publications explore topics such as the actions of simple groups, unipotent classes in algebraic groups, character ratios, and the classification of permutation groups. His work frequently intersects with combinatorial and algebraic structures, with implications for both theoretical and applied mathematics. Professor Liebeck’s contributions include foundational studies on group generation, covering numbers, and character bounds, reflecting his deep engagement with the interplay between algebraic structures and combinatorial problems. His research has been published in leading mathematics journals, and he maintains an active academic profile through his personal webpage at http://www.ma.ic.ac.uk/~mwl/ .
Professor Marta Zofia Kwiatkowska is Professor of Computing Systems and Fellow of Trinity College at the University of Oxford, where she has held a faculty position since 2007. She previously served as Professor of Computer Science at the University of Birmingham (2001–2007), Reader and Lecturer at the University of Birmingham (1994–2001), and Lecturer at the University of Leicester (1986–1994). Her academic career began as Assistant Professor at the Jagiellonian University in Kraków, Poland (1980–1988). Education: BSc/MSc in Computer Science, Jagiellonian University, Kraków MA, University of Oxford PhD, University of Leicester Research Interests: Professor Kwiatkowska spearheaded the development of probabilistic and quantitative verification methods on the international stage. Her work bridges theory and practice through the PRISM model checker—the leading software tool in probabilistic model checking—used worldwide for research and teaching. Application domains include communication and security protocols , nanotechnology designs , power management , ubiquitous computing and systems biology . She investigates automated verification , temporal logics , semantic models for concurrency , real-time systems , and biological process modelling . Current grant funding exceeds £3.7 million from EPSRC, EU and ERC, including the prestigious ERC Advanced Grant VERIWARE. Scientific Awards & Honours: Fellow of the Royal Society Fellow of the ACM Fellow of the European Association for Theoretical Computer Science (EATCS) Fellow of the British Computer Society (BCS) Fellow of the Polish Society of Arts & Sciences Abroad ERC Advanced Grant VERIWARE (€2.046 M, 2010–2015) Top Cited Article Award, Theoretical Computer Science (2005–2010) Best Paper Award, QEST 2006 Doctoral Supervision & Grants: Professor Kwiatkowska actively supervises doctoral students (D.Phil. at Oxford) and post-doctoral researchers. She welcomes applications in areas aligned with her research interests, detailed here . Current students include Charlie Griffin, Daqian Shao, Matthew Yuan and Minghao Liu; past students and researchers number over twenty, many now in faculty or industry leadership roles. Laboratory & Teams: She leads the Oxford Quantitative Verification group within the Department of Computer Science. Ongoing projects include FUN2MODEL, ELSA, FAIR and the flagship PRISM probabilistic model checker. The group maintains strong collaborations with biological, robotics and engineering teams worldwide.
Vadim Lozin is a Professor of Mathematics at the University of Warwick, affiliated with the Department of Mathematics within the School of Mathematics. His research interests span graph theory, combinatorics, and discrete mathematics, focusing on areas such as clique-width, Ramsey numbers, and structural graph theory. He has held visiting positions at institutions including the Université Paris-Dauphine, EPFL, and KAUST. Lozin has received several accolades, including the Best Paper Award for 'Linear Ramsey numbers' in 2018 and a 2024 award at the International Symposium on Algorithms and Computation. His work involves collaborations with global researchers and contributions to conferences like IWOCA and WG. Lozin serves on editorial boards for journals such as Discrete Applied Mathematics and Electronic Notes in Discrete Mathematics . His research explores foundational problems in graph theory, with applications in algorithm design and complexity analysis. Lozin’s publications include studies on union-closed sets, functional graph properties, and algorithmic approaches to graph parameters. He has also contributed to books like Words and Graphs , bridging formal language theory with graph structures. His grants focus on clique-width and stability in graphs, reflecting his commitment to advancing theoretical and applied discrete mathematics.
