جستجوی استاد راهنمای دانشگاهی

• Graph Algorithms
• Optimization
• High-Dimensional Geometry
• +۳ مورد دیگر

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.

Jacob Foxمشاهده پروفایل

استاد

• Combinatorics
• Probability
• Graph Theory
• +۳ مورد دیگر

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.

James Maynardمشاهده پروفایل

استاد

• Analytic Number Theory
• Prime Numbers
• Sieve Methods
• +۱ مورد دیگر

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).

Imre Leaderمشاهده پروفایل

استاد

• Extremal Combinatorics
• Ramsey Theory
• Combinatorial Number Theory
• +۳ مورد دیگر

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

Maria Chudnovskyمشاهده پروفایل

استاد

• Graph Theory
• Combinatorics
• Discrete Mathematics
• +۳ مورد دیگر

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.

• Combinatorics
• Graph Theory
• Discrete Mathematics
• +۳ مورد دیگر

Sophie Spirkl is an Associate Professor (with tenure) in the Department of Combinatorics and Optimization at the University of Waterloo. Previously, she held postdoctoral positions at Princeton University (as an NSF postdoc and instructor, supervised by Maria Chudnovsky) and at Rutgers University (under Jeff Kahn). She earned her PhD from Princeton University under the guidance of Maria Chudnovsky and Paul Seymour. Her research focuses on graph theory and combinatorics, with notable contributions to induced subgraphs, tree decompositions, chromatic number properties, and structural graph theory. She is a recipient of the 2023 Sloan Research Fellowship and co-founded the diamond open-access journal Innovations in Graph Theory . Education: PhD in Mathematics, Princeton University (2016–2020) Postdoctoral Fellowships: Princeton (2020–2022), Rutgers (2018–2020) Research Interests: Dr. Spirkl’s work spans multiple areas of combinatorics, including structural graph theory, extremal graph theory, and algorithmic graph theory. She has published extensively on topics such as induced subgraph obstructions, χ-boundedness, tree decompositions, and the Erdős–Hajnal conjecture. Her research often intersects with theoretical computer science, particularly in parameterized complexity and graph colorings. Awards & Recognition: 2023 Sloan Research Fellowship Contributions to the Innovations in Graph Theory journal Academic Contributions: Her articles address foundational problems in graph theory, such as the Erdős–Hajnal conjecture for C₅, logarithmic treewidth in even-hole-free graphs, and induced saturation for cycles. She collaborates with leading researchers like Maria Chudnovsky and Paul Seymour, advancing the field through rigorous combinatorial analysis. Community Engagement: She coordinates the Women in Math Directed Reading Program at Waterloo, supporting underrepresented groups in mathematics. Her spouse, Logan Crew, is a Research Assistant Professor at the same institution.

Rohil Prasadمشاهده پروفایل

پژوهشگر ارشد

• Geometry
• Topology
• Dynamical Systems
• +۶ مورد دیگر

Rohil Prasad is a Miller Research Fellow at the University of California, Berkeley, appointed in 2023, and will join Princeton University as an Assistant Professor in 2025. His research lies at the intersection of geometry, topology, and dynamical systems, with a particular focus on conservative dynamics, pseudoholomorphic curves, and Floer theory. Education: PhD in Mathematics, Princeton University (2018–2023), advised by Helmut Hofer Research Interests: Prasad’s work spans several deep areas of modern mathematics, including: Conservative Dynamics: Studying systems that preserve volume or symplectic structures. Symplectic Geometry: Exploring geometric structures preserved under Hamiltonian flows. Low-Dimensional Topology: Investigating the topology of 3- and 4-dimensional manifolds. Floer Theory: Using pseudoholomorphic curves to study periodic orbits and invariants. His research has led to significant advances in understanding periodic orbits, invariant measures, and the structure of area-preserving maps. Awards and Honors: 2024 Brin Dynamical Systems Prize for Young Mathematicians Contact: rrprasad@berkeley.edu | Office: 968 Evans Hall

Shirshendu Gangulyمشاهده پروفایل

دانشیار

• Probability Theory
• Statistical Mechanics
• Markov Chains
• +۳ مورد دیگر

Shirshendu Ganguly is an Associate Professor in the Department of Statistics at the University of California, Berkeley. His research focuses on probability theory, statistical physics, and their applications, including percolation models, phase transitions, Markov chains, and random graphs. He holds a PhD in Mathematics from the University of Washington and has held postdoctoral positions at UC Berkeley. Ganguly has been recognized with the 2019 Sloan Research Fellowship. Education: PhD in Mathematics, University of Washington, 2011–2016 Miller Postdoctoral Fellow, UC Berkeley, 2016–2018 Research Interests: Probability Theory, Statistical Mechanics, Markov Chains, Random Graphs, Percolation Theory, Sparse Combinatorial Structures His work explores geometric and probabilistic phenomena in disordered systems, including polymer models, self-organized criticality, and random matrix theory. He has advised multiple PhD students and contributes to teaching advanced probability courses at Berkeley. Awards: 2019 Sloan Research Fellowship

Asaf Ferberمشاهده پروفایل

استادیار

• Combinatorics
• Random Graphs
• Probabilistic Methods
• +۱ مورد دیگر

Asaf Ferber is Associate Professor in Mathematics at University of California, Irvine, School of Physical Sciences. His research spans discrete mathematics including combinatorial games, random graphs, extremal hypergraph theory, and quantum computation. Research explores Hamiltonian cycles in random graphs, structural properties of pseudorandom graphs, and quantum algorithms for combinatorial problems. Recent work develops quantum approaches to graph learning and sparse recovery in random matrices. Awards: NSF CAREER Award Sloan Fellowship Distinguished Early Career Faculty Award for Research Air Force Research Grant NSF-BSF Grant Organizes conferences including SoCalDM Symposium and Desert Discrete Math Workshop, mentoring graduate students through UCI's Probability and Combinatorics Seminar.

Gil Kalaiمشاهده پروفایل

استاد

• Combinatorics
• Geometric Combinatorics
• Probabilistic Combinatorics
• +۷ مورد دیگر

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.

Paata Ivanisviliمشاهده پروفایل

دانشیار

• Analysis
• Partial Differential Equations
• Probability
• +۵ مورد دیگر

Paata Ivanisvili is an Associate Professor at the University of California, Irvine (UCI), Department of Mathematics, School of Physical Sciences. His research focuses on Analysis, Probability, Harmonic Analysis, and Functional Analysis, with a particular emphasis on isoperimetric inequalities, functional inequalities, and discrete structures such as the Hamming cube. He has held visiting positions at institutions including the Hausdorff Research Institute for Mathematics and Princeton University. Ivanisvili has organized conferences such as the Dual Trimester Program at the Hausdorff Institute on Boolean Analysis in Computer Science (2024) and annual Summer/Fall Schools since 2021. He earned his PhD in Mathematics from Michigan State University (2015) and a BS from Saint Petersburg State University (2011). His research interests include sharp inequalities in analysis (e.g., Poincaré, Beckner, Ehrhard), hypercontractivity, and applications to discrete mathematics and probability. He has collaborated with prominent mathematicians such as Fedor Nazarov, Alexander Volberg, and Roman Vershynin. Notable awards include the NSF CAREER Award (2021–2025) and Simons Fellowship in Mathematics (2025–2026). Ivanisvili’s recent work explores the interface between harmonic analysis and discrete mathematics, including studies on additive energies, convex hulls of space curves, and learning theory. His articles frequently address foundational questions in geometric functional analysis, often using tools like Bellman functions and optimal control theory. He actively advises PhD students and has mentored visiting researchers at UCI.

Vadim Lozinمشاهده پروفایل

استاد

• Graph theory
• Combinatorics
• Discrete Mathematics
• +۴ مورد دیگر

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.

Diego Garlaschelliمشاهده پروفایل

استاد

• Network Theory
• Statistical Physics
• Econophysics
• +۷ مورد دیگر

Diego Garlaschelli is Professor of Theoretical Physics at the IMT School for Advanced Studies in Lucca, Italy, and at the Lorentz Institute for Theoretical Physics, University of Leiden, the Netherlands. He leads the NETWORKS research unit at IMT and the Econophysics and Network Theory group at Leiden. He is also an external faculty member at the Complexity Science Hub in Vienna and an associate member of the Enrico Fermi Research Center in Rome. His affiliations reflect a strong international and interdisciplinary research profile in network science and statistical physics. He holds a master's degree in theoretical physics from the University of Rome III (2001) and a PhD in Physics from the University of Siena (2005). His postdoctoral experience includes positions at the Australian National University, the University of Siena, the University of Oxford, and the Sant’Anna School of Advanced Studies in Pisa. Garlaschelli’s research spans network theory, statistical physics, econophysics, financial complexity, ecological networks, and social dynamics. He applies maximum entropy models, information theory, and random graph frameworks to understand complex real-world systems. His teaching includes courses in Network Theory, Econophysics, and Complex Systems at both PhD and MSc levels. The 15 most recent publications highlight a consistent focus on network reconstruction, ensemble inequivalence, renormalization, and applications to financial and socio-economic systems. Key themes include statistical inference in networks, resilience, and multi-scale modeling, with publications in top journals such as Nature Reviews Physics , Physics Reports , Science , and Physical Review Letters . His scientific awards include the Best Paper Award at the 6th International Workshop on Self-Organizing Systems (2012) and the Jan Kijne Prize (2013) as supervisor. He has secured multiple grants from NWO, the European Union, and the Royal Society, and has supervised over 40 students at PhD, master’s, and bachelor’s levels. He also mentors postdocs and visiting scientists. Garlaschelli leads and organizes major international workshops and schools in network science and complex systems. He serves on scientific committees and is an active referee for journals like Nature and Physical Review Letters , as well as funding agencies including the ERC and NWO.

Chee-Wooi Tenمشاهده پروفایل

استاد

• Power systems engineering
• Power grid cybersecurity
• Cyber-informed security engineering
• +۴ مورد دیگر

Chee-Wooi Ten is a tenured Professor in the Department of Electrical and Computer Engineering at Michigan Technological University, where he has served since 2010 and achieved tenure in 2016. He concurrently holds an Affiliated Professor appointment in Applied Computing and directs both the PSERC Site and ICC CPS Center. His institutional roles emphasize cyber-physical security integration within power infrastructure. His educational background includes: PhD in Electrical Engineering from University College Dublin (2009) MSc in Electrical Engineering from Iowa State University (2001) BSc in Electrical Engineering from Iowa State University (1999) Ten's research pioneers cyber-informed security engineering strategies for bulk power systems, focusing on quantifying rare events through system risk models and data science. His work bridges power grid interactions with robotics and transportation systems to advance decarbonization and electrification. Key methodologies include validating cyber-physical security frameworks against steady-state and dynamic grid approaches, with emphasis on attack/defense combinatorics and smart home technologies. This transdisciplinary approach supports the fourth industrial revolution's resilience requirements. His publication trends reveal strong focus on risk-aggregated substation testbeds using generative adversarial networks, cyber insurance models for power systems, and cascading failure analysis from switching attacks. Recent works increasingly integrate machine learning with physics-based modeling to address cybersecurity threats in inverter-based resource integration and distribution emergency operations. Ten has secured over $6.5M in active funding including: $2M DOE grant (MTU portion $105,000) for CyDERMS Center on DERs/Microgrids cybersecurity $704,409 CyManII award for secure digitalization in smart manufacturing $1.05M DOE ARPA-E grant for decarbonized freight transportation modeling NSF CyberCorps Scholarship for Service program ($3.38M) His grants consistently address risk management through data-driven and physics-based modeling, with industry partnerships through PSERC and utility collaborations. As ICC CPS Center Director, he leads research on cyber-physical security testbeds and coordinates the PSERC Summer Transformation School. His team develops validation frameworks for NERC CIP compliance while addressing practical pain points in OT cybersecurity for grid operators.

Alexander Scottمشاهده پروفایل

استاد

• Combinatorics
• Probability
• Algorithms
• +۳ مورد دیگر

Professor Alexander Scott is a faculty member at the University of Oxford, holding positions as Professor of Mathematics and Dominic Welsh Tutor in Mathematics at Merton College. His research focuses on combinatorics, probability, algorithms, and graph theory, with a particular interest in the interplay between local and global structures in networks. He has organized the Oxford Combinatorics Seminar and co-founded the online Oxford Discrete Mathematics and Probability Seminar, fostering collaboration in these fields. Professor Scott’s work bridges theoretical foundations with applications in statistical physics and algorithmic design. He has supervised numerous graduate students in combinatorics and regularly teaches undergraduate courses in analysis and discrete mathematics. His contributions include advancements in extremal graph theory, probabilistic methods, and structural combinatorics, with over 150 publications in prestigious journals. He actively organizes academic events such as the annual One-Day Meeting in Combinatorics, hosting speakers from around the world. Despite the absence of explicit awards noted, his prolific research output and academic leadership reflect significant contributions to the field. His current interests continue to explore the Erdős-Hajnal conjecture, induced subgraph densities, and algorithmic challenges in combinatorial structures.