جست‌وجوی استاد و پژوهشگر

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

Daniel M. Kaneمشاهده پروفایل

استاد

• Number Theory
• Combinatorics
• Complexity Theory
• +۳ مورد دیگر

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.

• Data Science
• Numerical Optimisation
• Medical Imaging
• +۳ مورد دیگر

Raphael Hauser is an Associate Professor in Numerical Mathematics at the University of Oxford's Mathematical Institute, Director of Graduate Studies - Teaching, and Tanaka Fellow in Applied Mathematics at Pembroke College. His affiliations include membership in the Data Science, Numerical Analysis, and Mathematical and Computational Finance research groups, as well as a fellowship at the Alan Turing Institute. Education: PhD in Operations Research, Cornell University, Ithaca, USA Dipl. Math. ETH, Swiss Federal Institute of Technology (ETH Zurich), Switzerland Research interests span data science, numerical optimisation, medical imaging, distributed computing, and applied probability/statistics. His work integrates mathematical rigor with practical applications, particularly in optimization algorithms, machine learning theory, and medical imaging technology. Publications focus on optimization theory, stochastic processes, medical imaging systems, and computational finance, with recurring themes in non-convex optimization guarantees, PCA variants, and X-ray tomography innovations. Awards: Oxford University Teaching Award (2007) SIAM Optimization Prize (2005) SIAM Student Paper Prize (2000) Advising includes 15+ DPhil students and 40+ MSc students, with projects in optimization, finance, imaging, and machine learning. Current postdocs and students are affiliated with the Alan Turing Institute and industrial partners like Siemens and Macquarie Group. He leads teams in the Mathematical Institute's research groups and collaborates with the Alan Turing Institute on large-scale data science initiatives.

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.

Laura Andersonمشاهده پروفایل

دانشیار

• Combinatorics
• Topology
• Matroid Theory
• +۳ مورد دیگر

Laura Anderson is an Associate Professor in the Department of Mathematics at Binghamton University. She holds a Ph.D. from MIT (1994) and has been affiliated with Binghamton since 2001. Her research focuses on Combinatorics and Topology, with a specialization in matroid theory, hyperplane transversals, and topological combinatorics. She teaches advanced courses such as Introduction to Combinatorics (Math 511) and Discrete Mathematics (Math 314). Her academic contributions include groundbreaking work on oriented matroids, combinatorial Grassmannians, and hyperfield applications. Anderson has advised multiple Ph.D. students, including Olakunle Abawonse, Ulysses Alvarez, and Leandro Junes, whose theses explore topics like matroid extensions and tropical phased matroids. She actively participates in academic conferences, co-organizing the Binghamton University Graduate Conference in Algebra and Topology (BUGCAT). Anderson’s research integrates algebraic topology with discrete mathematics, addressing geometric realizations, hyperfield structures, and topological invariants. Her pedagogical innovations include experimenting with flipped classroom methods in calculus education. She maintains an active presence in academic service, contributing to journal reviews and editorial work in combinatorial geometry.

Quanquan Liuمشاهده پروفایل

استادیار

• Algorithms for Large Data
• Dynamic Graph Algorithms
• Parallel and Distributed Computing
• +۴ مورد دیگر

Quanquan Liu is an Assistant Professor of Computer Science at Yale University. His research focuses on algorithms for large data, dynamic and distributed graph algorithms, parallel computing, differential privacy, and Byzantine-resilient systems. He holds a PhD in Computer Science from MIT's Theory Group and has held postdoctoral positions at Northwestern University and MIT. Education: PhD in Computer Science, MIT (Advisors: Erik Demaine and Julian Shun) MEng in Computer Science, MIT B.S. in Computer Science and Math, MIT (Advisor: David Karger) Research Interests: Theory and practice of algorithms for large-scale data, dynamic/distributed graph algorithms, parallel and high-performance computing, differential privacy, and Byzantine-resilient algorithms. Recent Highlights: His work includes practical differentially private graph algorithms, efficient parallel algorithms for graph problems, and fair course allocation mechanisms. Notably, he received the Best Paper Award at SPAA 2022 for parallel dynamic graph algorithms. Service: PC member for PPoPP, ESA, SPAA, and ALENEX Coach for USA Computing Olympiad (USACO) and Northwestern's ICPC team Current Group: Advising PhD students Felix Zhou and Pranay Mundra, and Master's student Jinghua Sun.

Clyde Kruskalمشاهده پروفایل

دانشیار

• Parallel Computing
• Algorithms
• Computer Architecture
• +۳ مورد دیگر

Clyde Kruskal is an Associate Professor in the Department of Computer Science at the University of Maryland, College Park. His research focuses on parallel architectures, models, and algorithms. He earned a Ph.D. from New York University in 1981 and a bachelor’s degree from Brandeis University in 1976. His work includes foundational contributions to parallel computing, such as the read–modify–write concept in distributed systems. Kruskal’s research spans topics like interconnection networks, synchronization mechanisms, and algorithm design for parallel systems. Education: Bachelor’s Degree: Brandeis University, 1976 Master’s Degree: New York University (Courant Institute), 1978 Ph.D.: New York University (Courant Institute), 1981 Research Interests: Parallel computing architectures, parallel algorithms design, multiprocessor synchronization, interconnection networks, and computational geometry problems like graph coloring and visibility analysis. His work emphasizes theoretical foundations and practical implementations in parallel systems. Notable Contributions: Kruskal co-authored the book Problems With A Point: Exploring Math And Computer Science (2019), and his research includes foundational papers on parallel prefix operations, sparse matrix algorithms, and synchronization protocols. His publications span over three decades, reflecting sustained contributions to parallel computing theory and practice. Advising & Outreach: He has mentored students through programs like the Summer Combinatorial Algorithms REU at UMD, fostering undergraduate research in algorithm design and parallel computing.

Tamon Stephenمشاهده پروفایل

استاد

• Operations Research
• Combinatorial Optimization
• Algorithms
• +۲ مورد دیگر

Tamon Stephen is a Professor in the Department of Mathematics at Simon Fraser University (SFU), part of the Faculty of Science. His research focuses on operations research, with an emphasis on combinatorial optimization, algorithms, discrete geometry, and computational biology. He holds a Ph.D. in Mathematics from the University of Michigan (2002). His work often bridges theoretical and computational aspects, addressing interdisciplinary applications. Stephen is affiliated with the Centre for Operations Research and Decision Sciences (CORDS) and has contributed to software tools for hypergraph transversals and colorful linear programming. He has taught courses such as Math 208W (Introduction to Operations Research) and has advised projects in metabolic network analysis and scheduling optimization. His office is located at the Surrey campus (SRYC 2886). Key research collaborations include studies on firefighter scheduling, nurse rostering, and metabolic pathway analysis. His methodologies often leverage algorithm design, polytope theory, and discrete mathematics. Stephen actively participates in academic service, organizing seminars and contributing to conferences such as the West Coast Optimization Meeting. His work emphasizes practical applications of theoretical results, with a focus on solving real-world optimization challenges.

Titu Andreescuمشاهده پروفایل

دانشیار

• Mathematics Education
• Problem Solving
• Diophantine Equations
• +۳ مورد دیگر

Titu Andreescu is a retired Associate Professor in the Science/Mathematics Education Department at the University of Texas at Dallas (UTD), affiliated with the School of Natural Sciences and Mathematics. He holds a Ph.D., M.S., and B.A. in Mathematics from the University of West Timisoara, Romania. His research focuses on enhancing mathematics education through problem-solving initiatives, particularly via AwesomeMath—a program encompassing summer camps, correspondence courses, and journals for gifted students. He specializes in Diophantine Analysis, particularly quadratic equations and their applications in advanced mathematics. Andreescu has authored numerous publications, including textbooks like Complex Numbers from A to Z and contributed to Olympiad problem design for competitions such as the IMO and W.L. Putnam. He has received prestigious awards, including the Edith May Sliffe Award and led the U.S. IMO team to historic victories, including a first-place finish in 1994. His professional roles include directing the Mathematical Olympiad Summer Program (MOSP) and serving as a coach for national teams in Romania and the U.S. Key projects include keynote speaking at international math camps and consulting for competitions. He has secured grants totaling over $800,000 for mathematics education initiatives, including funding from Akamai Technologies and the U.S. Army Research Office.

Arthur Bousquetمشاهده پروفایل

دانشیار

• Applied Mathematics
• Numerical Analysis
• Computational Fluid Dynamics
• +۳ مورد دیگر

Arthur Bousquet is an Associate Professor of Mathematics at Lake Forest College, affiliated with the Math and Computer Science department. He holds a PhD in Applied Mathematics from Indiana University (Bloomington, IN) and a MS in Engineering in applied mathematics and scientific computing from SuP Galilee Engineering School (Paris, France). His research focuses on numerical methods for partial differential equations, including finite volume and finite element techniques, with applications to geophysical fluid dynamics, climate modeling, and biomedical problems like viral shell mechanics. Notable areas include shallow water equations, phase field modeling, and computational methods for atmospheric dynamics. Bousquet has published extensively on topics such as numerical weather prediction, electrokinetic equations, and virus nanoindentation modeling. His work often combines theoretical analysis with computational simulations to address complex systems in fluid dynamics and materials science. He has received the Rothrock Award for teaching excellence (2014) and held research fellowships including an NSF Graduate Fellowship (2009-2013). His teaching includes courses like Computational Mathematics, Multivariable Calculus, and Real Analysis.

Lionel Levineمشاهده پروفایل

استاد

• Applied Mathematics
• Combinatorics and Discrete Geometry
• Probability and Statistics
• +۴ مورد دیگر

Lionel Levine is a Professor in the Department of Mathematics at Cornell University, affiliated with the College of Arts and Sciences. His academic research focuses on abelian networks, interacting particle systems, and the emergence of complex patterns from simple rules. He has held prestigious fellowships, including the Simons Fellowship and Sloan Research Fellowship, and has been honored with an endowed professorship. Levine's work bridges probability theory, combinatorics, and statistical physics, with notable contributions to the study of sandpile models and internal diffusion-limited aggregation (IDLA). Education: Ph.D. in Mathematics (2007), University of California, Berkeley. Research Interests: Applied Mathematics, Combinatorics, Probability, Abelian Networks, Sandpile Models, and their intersections with computer science and statistical physics. His research explores how local rules generate large-scale structures, such as in abelian networks and sandpile models. Awards and Honors: Simons Fellowship, Sloan Research Fellowship, Endowed Professorship in the College of Arts and Sciences. Teaching: Courses include Probability Theory (MATH 6710/6720), Topics in Probability: Math for AI Safety (MATH 7710), and undergraduate mathematics courses like Strategy, Cooperation, and Conflict (MATH 1340). Grants and Funding: Supported by the National Science Foundation (NSF), Simons Foundation, Sloan Foundation, and Institute for Advanced Study. Collaborations: Collaborates with prominent researchers such as Yuval Peres, Cris Moore, and Jim Propp. His work has been published in leading journals like the Annals of Probability and Duke Mathematical Journal. Future Work: Continues investigating AI safety, causal models, and multi-agent learning, including research on mathematical frameworks for transformer circuits and hidden incentives in AI systems.

Nikhil Srivastavaمشاهده پروفایل

دانشیار

• theoretical computer science
• algebraic graph theory
• spectral graph theory
• +۵ مورد دیگر

Nikhil Srivastava is an Associate Professor of Mathematics at the University of California, Berkeley, and a Senior Scientist at the Simons Institute. He received his PhD in Computer Science from Yale University in 2010 under the supervision of Daniel Spielman, following his undergraduate studies at Union College. After postdoctoral positions at the Institute for Advanced Study (Princeton), MSRI, and a research position at Microsoft Research India, he joined UC Berkeley in 2015. His research spans theoretical computer science and mathematics, with particular focus on spectral graph theory, random matrices, the geometry of polynomials, asymptotic convex geometry, and numerical analysis . His work often bridges the gap between pure mathematics and theoretical computer science, developing deep connections between polynomial methods, linear algebra, and combinatorial structures. Srivastava's research has been recognized with several prestigious awards including the SIAM Polya Prize , the NAS Held Prize , and the AMS Foias Prize , highlighting his significant contributions to the field. His most recent work focuses on numerical linear algebra, spectral theory, and computational mathematics, with publications spanning from algorithmic foundations to applications in mathematical physics. He actively mentors graduate students, currently advising Rikhav Shah, Zack Stier, and Isabel Detherage. His past students include Jorge Garza Vargas (co-advised with Dan Voiculescu), Theo McKenzie, Jess Banks, Satyaki Mukherjee, Archit Kulkarni, Nick Ryder, and Aaron Schild (co-advised with Satish Rao). His research has been supported by the NSF and the Sloan Foundation. At Berkeley, Srivastava has been actively involved with the Simons Institute, participating in numerous programs including Complexity and Linear Algebra (Fall 2025), Sublinear Algorithms (Summer 2024), and several others dating back to 2013. He regularly teaches courses in mathematics, including Discrete Mathematics (Math 55) and Multivariable Calculus (Math 53), and runs a seminar on Discrete Analysis in Evans Hall.

Matthew Peteringمشاهده پروفایل

دانشیار

• Political Redistricting
• University Course Scheduling
• Operations Research
• +۸ مورد دیگر

Matthew Petering is an Associate Professor in the Department of Industrial and Manufacturing Engineering at the University of Wisconsin-Milwaukee. His work bridges operations research with real-world applications in logistics, transportation, and political redistricting. He holds a PhD in Industrial and Operations Engineering from the University of Michigan (2007), an MS from the same program (2003), and a BA in Mathematics from Washington University in St. Louis (1999). His research focuses on optimizing complex systems: from seaport container terminals to university course scheduling, and recently developing the FastMap algorithm for unbiased political redistricting. His algorithm was central to Wisconsin Supreme Court litigation in 2023-2024, submitting proposals for legislative maps that balanced fairness and operational efficiency. Dr. Petering has pioneered board game designs like Distrix (2020), which won international awards, and authored The Distrix Puzzle Book . His peer-reviewed work spans over 30 publications in journals like Transportation Science , European Journal of Operational Research , and International Journal of Production Economics . Key contributions include: Algorithmic solutions for container shipping and rail logistics Cyclic production planning models Real-time location management systems for distribution facilities Emergency evacuation modeling His FastMap redistricting system was recognized with the 2024 INFORMS Practitioner Poster Competition award. Dr. Petering frequently advises governmental bodies and judicial proceedings on redistricting methodology and logistics optimization.

• Algorithms
• Computational Complexity
• Convex Optimization
• +۴ مورد دیگر

James R. Lee is a Professor in the Department of Computer Science at the University of Washington. His research spans theoretical computer science, probability, and geometry. He has held visiting scientist roles at Microsoft Research (2023, 2018, 2017) and participated in programs at the Simons Institute (2023, 2020, 2018, 2017, 2014). Research Interests: Algorithms, complexity theory, convex optimization, metric embeddings, spectral graph theory, probability, stochastic processes, and the interplay between discrete and continuous analysis. Teaching: Courses on modern algorithms, quantum computing, optimization theory, and spectral methods in theoretical computer science. Scientific Contributions: Developed sparsification algorithms for generalized linear models and norms with near-linear size guarantees (STOC'24, FOCS'23). Extended Cheeger-type inequalities to higher eigenvalues (STOC'12, STOC'18). Proved super-polynomial lower bounds for LP/SDP relaxations in constraint satisfaction (STOC'15, FOCS'13). Disproved Benjamini-Papasoglou conjectures on annular separators (Discrete Comp. Geom. 2024). Advanced understanding of random walks in geometric and unimodular graphs (Israel J. Math. 2023, GAFA 2023). Scientific Awards: Best Paper Award, STOC 2015

Gourab Rayمشاهده پروفایل

دانشیار

• Probability Theory
• Statistical Physics
• Stochastic Processes
• +۳ مورد دیگر

Gourab Ray is an Associate Professor in the Department of Mathematics and Statistics at the University of Victoria, Faculty of Science. He holds a PhD from the University of British Columbia, Vancouver. His research focuses on the intersection of probability theory, geometry, and mathematical physics, particularly large-scale patterns in stochastic models inspired by physics. Key areas include random planar maps, random walks, lattice spin models, dimer models, Gaussian free field properties, and Liouville quantum gravity. Recent work emphasizes establishing Gaussian free field-like behaviors in dimer models across various graphs and surfaces. He teaches courses such as MATH 236: Introduction to Real Analysis and MATH 555: Topics in Probability. His publications span leading journals including Inventiones Mathematicae , Annals of Probability , and Probability Theory and Related Fields . Notable contributions include studies on unimodular hyperbolic triangulations, half-planar map classifications, and conformal invariance in dimer models. No specific awards are listed for Dr. Ray, though his work has been recognized in peer-reviewed venues. He actively contributes to academic service, including roles on graduate committees and research collaborations. His research group engages with theoretical and applied aspects of probability theory, often bridging discrete and continuous mathematical frameworks.