Find Academic Supervisors

Ricky Ini Liu is an Associate Professor in the Department of Mathematics at the University of Washington. Previously, he held positions at North Carolina State University, the University of Michigan, and the University of Minnesota. He earned his Ph.D. in Mathematics from MIT in 2010 under Alexander Postnikov. His research focuses on algebraic combinatorics, particularly its intersections with algebraic geometry, combinatorial geometry, and representation theory. Key interests include Schubert polynomials, polytopes, Hopf algebras, and Kronecker coefficients. He has contributed to foundational work on birational rowmotion, Gelfand-Tsetlin polytopes, and Fomin-Kirillov algebras. Liu has taught a wide range of courses at UW, including special topics in dynamical algebraic combinatorics, combinatorial theory, and problem-solving. He has also been a key instructor at the Mathematical Olympiad Summer Program since 2007 and mentored undergraduates in research programs at the University of Minnesota, Duluth. His publications span high-impact journals like Selecta Mathematica and Journal of Combinatorial Theory , with recent work addressing topics such as determinantal formulas for Schubert polynomials and applications of flow polytopes to diagonal harmonics. Though no specific awards are listed, his extensive publication record and academic roles reflect significant contributions to combinatorial mathematics.

• Algebraic Combinatorics
• Algebraic Geometry
• Combinatorial Geometry
• +5 more

Robert Ghrist is the Andrea Mitchell University Professor at the University of Pennsylvania with dual appointments in the Department of Mathematics and the Department of Electrical and Systems Engineering. He serves as Associate Dean for Undergraduate Education for Penn Engineering. His educational background includes a B.S. in Mechanical Engineering from the University of Toledo (1991), and M.S. and Ph.D. degrees in Applied Mathematics from Cornell University (1994, 1995). Ghrist's research bridges pure and applied mathematics, focusing on applied algebraic topology , dynamical systems , and geometric methods in data science. His work extends to network theory, topological data analysis, and computational geometry, with applications spanning robotics, neuroscience, and social dynamics. Key innovations include developing sheaf-theoretic approaches for networked systems and persistence homology techniques for high-dimensional data. Analysis of his recent publications reveals a strong emphasis on lattice-theoretic frameworks , topological robotics , and network dynamics , with emerging applications in neural data interpretation and geometric computing. His research consistently integrates category theory with real-world engineering challenges. Significant scientific recognition includes: Presidential Early Career Award (PECASE, 2004) Scientific American 'Top 50' Research Leader (2007) Mathematical Association of America's Chauvenet Prize (2013) University of Pennsylvania Lindback Award for Distinguished Teaching (2015) DoD National Security Science and Engineering Faculty Fellowship (NSSEFF, 2015) Ghrist leads multiple federally funded research initiatives supported by AFOSR, DARPA, NSF, and ONR. He directs the development of educational tools including the Calculus BLUE/GREEN Project video series and custom GPTs for mathematical pedagogy. His open online courses have reached over 100,000 learners globally.

• Applied Topology
• Dynamical Systems
• Algebraic Topology
• +5 more

Brian Lawrence is an Assistant Professor in the Department of Mathematics at the University of Wisconsin–Madison, currently on leave as of 2025. Previously, he held positions at UCLA, the University of Chicago, and Columbia University, following doctoral studies at Stanford University under Akshay Venkatesh. His educational background includes: PhD in Mathematics from Stanford University (advisor: Akshay Venkatesh) Lawrence's research centers on arithmetic geometry, specializing in Diophantine problems through p-adic methods. His work develops innovative approaches to Mordell's conjecture, Shafarevich-type results, and rational point distribution using p-adic Hodge theory, étale cohomology, and period mappings. He bridges theoretical number theory with computational frameworks, particularly in algorithmic solutions for Diophantine equations. His publication trends reveal sustained focus on foundational Diophantine geometry problems, with recent work emphasizing conditional algorithms for the Mordell problem and sparsity phenomena in integral points. Collaborations with leading mathematicians like Venkatesh and Sawin demonstrate interdisciplinary engagement across number theory and algebraic geometry. Lawrence actively mentors undergraduate researchers, supervising projects on resultants, Hodge theory, and symmetric polynomials by students including Pramana Saldin, Yuchen Chen, Anuj Sakarda, and Spencer Dembner. His organizational roles include founding the Crystalline Cohomology seminar at Columbia and co-organizing the University of Chicago Number Theory Seminar, fostering collaborative research environments. He contributes extensively through expository notes on schemes, polynomials on lattices, and Fibonacci numbers modulo p, reflecting commitment to mathematical education and knowledge dissemination across multiple institutions.

• Arithmetic Geometry
• Number Theory
• Diophantine Geometry
• +2 more

Hadi Meidani is a Clinical Associate Professor at the Carle Illinois College of Medicine , specifically within the Department of Biomedical and Translational Sciences at the University of Illinois at Urbana-Champaign . He teaches courses in Civil and Environmental Engineering, including topics like Systems Engineering & Economics , Machine Learning in CEE , and Uncertainty Quantification . Ph.D., Civil Engineering, University of Southern California (2012) M.S., Electrical Engineering, University of Southern California (2012) M.S., Structural Engineering, Sharif University of Technology (2005) B.S., Civil Engineering, K.N. Toosi University of Technology (2002) Dr. Meidani's research focuses on uncertainty quantification , scientific machine learning , and optimization under uncertainty for engineering systems. His work spans stochastic multiscale analysis , physics-informed machine learning , and model reduction techniques. His recent publications emphasize machine learning for infrastructure systems , graph neural networks , physics-informed models , and traffic assignment . Key trends include deep learning , multi-fidelity modeling , and neural operator transformers applied to metamaterial design , seismic reliability , and autonomous freight delivery .

• Uncertainty Quantification
• Scientific Machine Learning
• Stochastic Optimization
• +3 more

Kazuhiro Saitou is a Professor of Mechanical Engineering at the University of Michigan, affiliated with the College of Engineering. His research focuses on computational design synthesis, topology optimization, and manufacturing process integration. He leads the Algorithmic Synthesis Laboratory (ASL), advancing algorithms for automated design and optimization of mechanical systems. Education: Ph.D. (1996), MIT; M.S. (1992), MIT; B.Eng. (1990), University of Tokyo. He has held tenured positions since 1997, including roles as Founding CEO of Comnext, Inc. (2007–2012) and visiting professorships at École Centrale Paris and Donghua University. Research interests include multi-material topology optimization (M^3 TO), AI-driven design, and sustainable manufacturing. Key projects address additive manufacturing, composite structures, and energy-efficient production systems. He has pioneered methods for manufacturability-driven design and assembly optimization. Notable awards include IEEE Fellow (2018), ASME Kos-Ishii Award (2015), and NSF CAREER Award (1999). He serves as Editor-in-Chief for IEEE Transactions on Automation Science and Engineering and holds leadership roles in ASME and IEEE societies. Teaching includes courses on design optimization, CAD, and global product development. His lab has advised over 30 students, with alumni in academia and industry. Current research explores biomechanical modeling, traffic flow optimization, and medical image registration algorithms.

• Computational Design Synthesis
• Topology Optimization
• Manufacturing Process Optimization
• +7 more

Nina Balcan is a Professor at Carnegie Mellon University and holds the Cadence Design Systems Professorship in Computer Science. She is affiliated with the School of Computer Science, specifically the Machine Learning Department (MLD) and Computer Science Department (CSD). Her research spans foundational aspects of machine learning, artificial intelligence, theoretical computer science, algorithmic game theory, and interdisciplinary connections in learning theory. Machine Learning Artificial Intelligence Theoretical Computer Science Algorithmic Game Theory Multi-Agent Systems Data-Driven Algorithm Design Her recent work focuses on advancing algorithm design through machine learning, robustness in adversarial environments, and economic modeling. Key contributions include Learning to Branch (JACM 2024), Regret Minimization in Stackelberg Games (NeurIPS 2024), and Learning Accurate Decision Trees (UAI 2024, Outstanding Student Paper Award). She has pioneered novel approaches to data-driven optimization, semi-supervised learning, and privacy-preserving clustering. Nina has received prestigious accolades including ACM Fellow AAAI Fellow Simons Investigator 2019 ACM Grace Murray Hopper Award Her teaching at CMU includes graduate courses on machine learning, advanced machine learning, and specialized topics like algorithmic game theory.

• Machine Learning
• Artificial Intelligence
• Theoretical Computer Science
• +12 more

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.

• Combinatorics
• Probability
• Graph Theory
• +3 more

Tasho Kaletha is a Professor in the Department of Mathematics at the University of Michigan. His research focuses on the Langlands program, intersecting number theory, representation theory, algebraic geometry, and analysis. He holds a Ph.D. from the University of Chicago (2010). Key research interests include representation theory of reductive groups, harmonic analysis, Galois cohomology, and automorphic representations. Education: Ph.D., University of Chicago (2010). Research interests revolve around the Langlands conjectures, endoscopy, and the structure of reductive groups. His work addresses representation theory of real/p-adic groups, cohomology of Galois groups, and automorphic spectra. Recent publications explore Bruhat-Tits theory, discrete series L-packets, and global rigid inner forms. He has authored a monograph with Gopal Prasad and contributed to foundational papers in Duke Mathematical Journal and Inventiones Mathematicae . Notable contributions include studies on supercuspidal L-packets, endoscopic classification, and commensurability growth in algebraic groups. His work bridges abstract algebraic structures with analytic techniques, advancing the Langlands program's goals.

• Number Theory
• Representation Theory
• Algebraic Geometry
• +3 more

Fatma Kılınç-Karzan is an Associate Professor of Operations Research at Carnegie Mellon University's Tepper School of Business, with a courtesy appointment as Associate Professor of Computer Science. She is also affiliated with the Algorithms Combinatorics and Optimization (ACO) PhD Program and was a Visiting Scientist at Berkeley's Simons Institute for the Theory of Computing during Fall 2017. Her educational background includes a PhD from Georgia Institute of Technology's H. Milton Stewart School of Industrial & Systems Engineering with a minor in Mathematics, supervised by Prof. Arkadi Nemirovski. She earned her B.S. and M.S. degrees from the Industrial Engineering Department of Middle East Technical University with a minor in Information Systems. Dr. Kılınç-Karzan's research spans mathematical optimization with emphasis on convex and non-convex optimization theory, algorithms, and applications. Her work bridges theoretical foundations with practical implementations in optimization under uncertainty (robust optimization, chance constraints, distributionally robust optimization), machine learning (preference learning from limited data), and business analytics. She develops foundational theory for large-scale optimization problems with applications in decision making under uncertainty and high-dimensional statistical inference. Analysis of her recent publications reveals a strong focus on convex hull characterizations, semidefinite programming relaxations, distributionally robust optimization, and online convex optimization frameworks. Her work demonstrates increasing integration of optimization theory with machine learning applications, particularly in developing data-driven approaches for decision making under uncertainty. NSF CAREER Award (2015) INFORMS Optimization Society Young Researcher Prize (2015) INFORMS Junior Faculty Interest Group (JFIG) Best Paper Award (2014) BP Junior Faculty Chair (2014-2015) Faculty Giving Chair (2012-2013) Wimmer Fellowship (2012-2013) Dr. Kılınç-Karzan has successfully mentored numerous PhD students who have received prestigious awards, including the 2021 INFORMS Optimization Society Best Student Paper (1st prize) and multiple honorable mentions. Her research has been supported by significant grants including an NSF CAREER Award, an ONR grant (with S. Küçükyavuz), and an AFOSR grant. She serves on editorial boards for Mathematical Programming, Operations Research, Mathematics of Operations Research, and other leading journals, and has held leadership positions in professional societies including the Mathematical Optimization Society and INFORMS Computing Society. Through her affiliations with CMU's Tepper School, Computer Science Department, and ACO Program, she collaborates across disciplines to advance optimization theory and its applications. Her professional service includes committee chair roles for major INFORMS competitions and program committee leadership for international optimization conferences.

• Mathematical Optimization
• Convex Optimization
• Non-convex Optimization
• +7 more

John Evans is an Associate Professor and Jack Rominger Faculty Fellow in the Department of Aerospace Engineering Sciences at the University of Colorado Boulder, affiliated with the Applied Mathematics program. He serves as Associate Chair for Undergraduate Curriculum and is part of the Aerospace Mechanics Research Center (AMREC). His research focuses on computational mechanics, particularly fluid dynamics, fluid-structure interaction, and turbulence modeling using high-order and structure-preserving methods. Evans holds a PhD (2011) and MS (2008) in Computational and Applied Mathematics from the University of Texas at Austin, and dual BS/MS degrees in Mathematics and Applied Mathematics from Rensselaer Polytechnic Institute (2006). Before joining CU Boulder, he was a postdoctoral fellow at the Institute for Computational Engineering and Sciences (ICES). His research interests include isogeometric analysis, immersed methods, and data-driven turbulence modeling. Notable contributions include development of divergence-conforming discretizations for incompressible flows, stabilized collocation methods, and invariant subgrid stress models. He leads the AMREC lab and collaborates on plasma-fueled propulsion systems and geometrically sensitive simulations. Key Awards: 2021: Rocky Mountain AIAA Educator of the Year 2021: Gallagher Young Investigator Medal 2019-2021: Clarivate Highly Cited Researcher Professional Activities: Editor of Engineering Computations, Senior AIAA Member, Simons Visiting Professor (2019) Evans' work bridges advanced numerical methods with real-world engineering challenges. His lab develops open-source tools like XIGA for multi-material problems and focuses on immersive simulation environments. Current projects explore turbulence closure models, plasma propulsion, and topology optimization with B-spline-based approaches.

• Computational Mechanics
• Fluid Dynamics
• Fluid-Structure Interaction
• +3 more

Prof. Harry Hyungryul Baik is a Tenured Associate Professor at KAIST's Department of Mathematical Sciences since 2017. He holds a PhD from Cornell University (2014) and a B.S. from KAIST (2009), advised by William Thurston, John Hubbard, and Dylan Thurston. His research focuses on geometric topology, geometric group theory, and low-dimensional topology, with notable contributions to mapping class groups, Kleinian groups, and Teichmüller theory. Education: PhD in Mathematics (Cornell, 2014), B.S. in Mathematics (KAIST, 2009). Key research areas include asymptotic translation lengths, laminar groups, and circular orders of groups. He co-leads the KAIST-KIAS joint research group 2K-GATE as Director, emphasizing collaboration between topologists. Research highlights: Characterization of Fuchsian groups via laminations, unsmoothability of mapping class group actions on 1-manifolds, and exponential torsion growth in random 3-manifolds. His work bridges topology with dynamical systems and geometric group theory, often involving collaborations with institutions like KIAS and MPIM. Awards include the Sangsan Prize (2018), Young-KAST membership (2020–2023), and multiple grants from Samsung and POSCO. He advises 7 PhD students and has mentored 15+ alumni, many of whom hold postdoc positions globally. His lab actively hosts conferences like the KAIST Geometric Topology Fair. Labs/Teams: Director of 2K-GATE (KAIST-KIAS), core member of the KAIST Topology Research Group, collaborator with international networks including the Harvard-MIT-Princeton topology axis.

• Geometric Topology
• Geometric Group Theory
• Low-Dimensional Topology
• +6 more

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

• Geometry
• Topology
• Dynamical Systems
• +6 more

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.

• Number Theory
• Combinatorics
• Complexity Theory
• +3 more

Debmalya Panigrahi is a Professor and Associate Chair in the Department of Computer Science at Duke University. He holds a PhD in Theoretical Computer Science from MIT and has prior affiliations with Microsoft Research, Bell Labs, and the Simons Institute for Theory of Computing. His research focuses on algorithms, particularly graph algorithms, algorithms under uncertainty, and learning-augmented methods. He has received NSF CAREER and other awards, and his work spans peer-reviewed publications in top venues like STOC, FOCS, and SODA. He advises PhD students and mentors postdocs, emphasizing theoretical contributions with practical applications. His teaching includes courses on approximation algorithms, graph algorithms, and discrete mathematics. Education: PhD (MIT, advised by David Karger), MSc (Indian Institute of Science, advised by Ramesh Hariharan), BSc (Jadavpur University). Research highlights include fastest algorithms for graph connectivity, learning-augmented approximation methods, and online algorithms. Funded by NSF, ARO, Google, and others. Current projects explore network reliability, hypergraph algorithms, and algorithmic fairness. His lab collaborates across theory, AI/ML, and databases at Duke. Recent Grants: NSF CCF-2006512, CCF-1618286, CCF-1350537 Labs/Teams: Duke Algorithms Lab, Theory Group, Collaborations with CS-Econ and AI/ML groups Publications span 150+ papers, with 5+ journal articles in SIAM Journal of Computing and ACM Transactions. Recent focus on integrating machine learning into classical algorithms to improve worst-case performance bounds. Advised 10+ PhD students, many now in academia (e.g., UI Chicago, UT Dallas) and industry (Google, Microsoft).

• Theoretical Computer Science
• Algorithm Design and Analysis
• Graph Algorithms
• +5 more

Ben Fisch is an Assistant Professor of Computer Science at Yale University's School of Engineering & Applied Science. He is also the co-founder of Espresso Systems, a company focused on blockchain infrastructure. His research focuses on privacy and verifiability in decentralized systems like Bitcoin and Ethereum, with applications in digital finance and healthcare. Dr. Fisch received his B.A. from the University of Pennsylvania and completed his Ph.D. at Stanford University, where he worked with Dan Boneh in the applied cryptography research group. His educational background provided the foundation for his work at the intersection of cryptography, distributed systems, and economics. His research centers on leveraging cryptographic tools such as succinct non-interactive zero-knowledge proofs (zk-SNARKs), private information retrieval, and homomorphic encryption to address challenges in verifiable computation, verifiable storage, and verifiable fairness. He has made significant contributions to verifiable delay functions (VDFs) and proofs of replication, which have been adopted by major blockchain projects including Ethereum 2.0, Chia, and Filecoin. His work on Filecoin's Proofs of Replication has helped the network reach over 1.5 exabytes of storage capacity. His publication record shows a clear trend toward increasingly sophisticated cryptographic protocols for blockchain applications, with recent work focusing on data availability for Bitcoin rollups, efficient folding schemes for pairing-based arguments, and privacy pools with proof-carrying disclosures. His research bridges theoretical cryptography with practical implementations that have real-world impact in decentralized systems. His notable recognition includes: Best Paper Finalist at ACM CCS 2017 for 'Iron: Functional Encryption using Intel SGX' Dr. Fisch's research has led to significant technology transfer, most notably with his work on Verifiable Delay Functions (VDFs) sparking a multimillion dollar industry initiative through the VDF Alliance. His research on Proofs of Replication forms the basis of Filecoin's incentive layer and consensus protocol. His newer SNARK system Basefold is being used by several commercial products. He maintains active collaborations across academia and industry, with publications spanning top conferences in cryptography and security. As co-founder of Espresso Systems, Dr. Fisch leads a team developing next-generation blockchain infrastructure, particularly focusing on sequencing layers for rollups. His work bridges academic research with practical implementation, ensuring that theoretical advances in cryptography find real-world applications in decentralized systems.

• Cryptography
• Distributed Systems
• Blockchain Technology
• +5 more