Find Academic Supervisors

• Uncertainty Reasoning and Decision Making in Artificial Intelligence
• Electronic Business
• Systems Analysis and Design
• +7 more

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.

Tasho KalethaView profile

Professor

• Number Theory
• Representation Theory
• Algebraic Geometry
• +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.

Lukas BrantnerView profile

Research Fellow

• Geometry
• Topology
• Algebraic Topology
• +4 more

Lukas Brantner is a Royal Society University Research Fellow at the Mathematical Institute of the University of Oxford. His research focuses on geometry, topology, and derived algebraic structures, with a particular emphasis on partition Lie algebras, deformation theory, and higher algebraic frameworks. His recent work spans topics such as derived foliations, Poincaré-Birkhoff-Witt theorems, and the complexity of geometric objects like Calabi-Yau varieties in characteristic p. This reflects a deep interplay between algebraic topology, homotopy theory, and modern algebraic geometry. Major Themes: Derived Algebraic Geometry, Homotopy Theory, Deformation Theory, Galois Theory Collaborators: Magidson, Nuiten, Antolín-Camarena, Heuts, Taelman, Campos, Waldron, Hahn, Knudsen, Mathew, Arone, Manners Scientific Awards & Honors: Royal Society University Research Fellow Brantner actively contributes to foundational research in algebraic topology and derived structures, often bridging pure algebra with topological phenomena. His publications highlight the evolution of partition Lie algebras, configuration spaces, and Goodwillie calculus in modern mathematics.

Jelani NelsonView profile

Professor

• Theoretical Computer Science
• Algorithms
• Data Streams
• +8 more

Jelani Nelson is a Professor and Department Chair in the UC Berkeley EECS Department (College of Engineering). His work focuses on theoretical computer science , particularly algorithms , data streams , dimensionality reduction , and privacy-preserving computation . Advising : Current students include Ishaq Aden-Ali, Xin Lyu, Mihir Singhal, and Hongxun Wu (co-advised with leading researchers). Education : PhD from MIT (George M. Sprowls Award), M.Eng from MIT. Research Highlights : Developed foundational results in Johnson-Lindenstrauss dimensionality reduction (optimality, sparse embeddings). Advancements in differential privacy (lower bounds, private mean estimation, threshold learning). Pioneering work on streaming algorithms for heavy hitters, norm estimation, and graph problems. Innovations in compressed sensing and oblivious subspace embeddings . Scientific Awards : PODS Best Paper Award (2011, 2022) IBM Pat Goldberg Memorial Best Paper Award (2011) George M. Sprowls Award for MIT doctoral thesis (2009) NeurIPS 2020 Spotlight Presentation

Mark D. HaimanView profile

Professor

• Algebra
• Combinatorics
• Algebraic Geometry
• +12 more

Mark D. Haiman is a Professor at the University of California, Berkeley, Department of Mathematics, with research interests spanning algebra, combinatorics, and algebraic geometry. His work connects symmetric function theory with geometric objects like Hilbert schemes and algebraic structures such as Cherednik algebras and Hecke algebras. Appointed: 2001 Contact: mhaiman@math.berkeley.edu Teaching: Math 256B—Algebraic Geometry (Spring 2025), Math 249—Algebraic Combinatorics (Spring 2024), and others in calculus and Lie groups. Research Interests : Haiman's research focuses on Macdonald polynomials, LLT polynomials, Hilbert schemes of points in the plane, and their combinatorial and geometric implications. His work includes resolving the Macdonald positivity conjecture and the n! conjecture through algebraic geometry. Publications : Haiman has contributed to foundational papers in combinatorial and algebraic structures, including generalizations of the shuffle theorem and positivity results for LLT polynomials. His articles often bridge representation theory, symmetric functions, and geometric methods. Students : He has supervised numerous PhD students, including Magda Hlavacek (2023), Foster Tom (2022), Jeremy Meza (2021), Maryam Farahmand-Asil (2018), Maria Monks Gillespie (2016), and others working on combinatorial algebraic geometry and related fields.

• Machine Learning
• Deep Learning
• Gaussian Processes
• +5 more

Geoffrey Pleiss is an Assistant Professor in the Department of Statistics at the University of British Columbia's Faculty of Science. He is also a CIFAR AI Chair at the Vector Institute and an inaugural member of CAIDA's AIM-SI (AI Methods for Scientific Impact) cluster. His work bridges statistical theory, machine learning, and computational methods with applications across various scientific domains. Pleiss received his PhD from the Computer Science department at Cornell University in 2020, where he was advised by Kilian Weinberger and worked closely with Andrew Gordon Wilson. Prior to his faculty position at UBC, he was a postdoctoral researcher at Columbia University with John P. Cunningham. His research focuses on the intersection of deep learning and probabilistic modeling, particularly on developing heuristic and approximate notions of uncertainty from machine learning models. His work has significant implications for reliable and optimal decision-making in experimental design and scientific discovery. Major research thrusts include neural network uncertainty quantification, Bayesian optimization, Gaussian processes, and ensemble methods. Pleiss develops theoretical frameworks while maintaining strong connections to practical applications across scientific domains. An analysis of his recent publications reveals a strong focus on uncertainty quantification in deep learning models, with particular attention to the limitations and capabilities of ensemble methods in the era of overparameterized models. His work increasingly addresses practical challenges in Bayesian optimization for scientific discovery, especially in materials science. There's also a growing emphasis on computational efficiency in Gaussian process methods, reflecting his commitment to making advanced statistical techniques accessible for real-world applications. CIFAR AI Chair Pleiss currently advises several graduate students including Donney Fan (PhD, Computer Science), Tim G. Zhou (MSc, Computer Science), Zachary Lau (MSc, Statistics), Nathan Cantafio (BSc, Statistics), and Tristan Cinquin (Research Intern at Vector Institute). His research is supported by multiple funding sources including his CIFAR AI Chair position, which provides significant research resources for advancing machine learning methodologies with scientific impact. Pleiss co-created and maintains GPyTorch, a highly efficient and modular implementation of Gaussian processes in PyTorch designed for speed, modularity, and prototyping. He is also involved with CoLA (Compositional Linear Algebra), a library for structured linear algebra operations in JAX and PyTorch that enables fast linear algebra computations by automatically exploiting matrix structure.

Anoosheh HeidarzadehView profile

Assistant Professor

• Information and coding theory
• Private and secure computing
• Fault-tolerant distributed computing
• +3 more

Anoosheh Heidarzadeh is an Assistant Professor in the Department of Electrical and Computer Engineering at Santa Clara University's School of Engineering. He holds a Ph.D. in Electrical and Computer Engineering from Carleton University (2012) and previously served as a Visiting Assistant Professor at Texas A&M University (2018-2022) and Associate Research Scientist at the same institution (2015-2017). His postdoctoral research was conducted at the California Institute of Technology (2013-2014). His research focuses on: Information and coding theory : Fundamental limits of data transmission and storage systems Private and secure computing : Protocols for confidential data processing in networked environments Fault-tolerant distributed systems : Resilient computation frameworks for large-scale applications Distributed machine learning : Scalable algorithms for collaborative learning architectures Recent publications (2021-2022) demonstrate strong emphasis on privacy-preserving computation (covering 73% of articles) and distributed coding techniques (67% of articles), with innovations in private information retrieval, matrix operations, and group testing methodologies. Theoretical contributions dominate (87%), while 13% address applied challenges like COVID-19 screening.

James MaynardView profile

Professor

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

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

Brent PymView profile

Associate Professor

• Mathematical Physics
• Algebraic Geometry
• Noncommutative Geometry
• +3 more

Brent Pym is an Associate Professor in the Department of Mathematics and Statistics at McGill University. His research focuses on the intersection of differential, algebraic, and noncommutative geometry, with a particular emphasis on Poisson varieties and deformation quantization. He has held academic positions at the University of Edinburgh, University of Oxford, and was a Postdoctoral Fellow at McGill and the University of Toronto. Education: BScE in Engineering Physics, Queen's University (2007) MSc in Mathematics, University of Toronto (2008) PhD in Mathematics, University of Toronto (2013) Research Interests: Pym studies Poisson structures, their quantizations, and connections to mathematical physics. His work involves classical/derived algebraic geometry, D-modules, moduli spaces, the Stokes phenomenon, and multiple zeta values. Recent projects include holonomic Poisson manifolds, log symplectic structures, and software for symbolic calculations in deformation quantization. Awards: Lichnerowicz Prize (2018) Advising & Grants: Pym has openings for graduate students (admission 2026) and undergraduate projects (2026–27). He develops the Star Products software package for symbolic calculations in Poisson brackets and quantization. His work is supported by research collaborations and institutional grants. Labs & Teams: Pym collaborates with researchers in geometry and mathematical physics, contributing to projects in noncommutative algebra and geometric quantization. His software tools enhance symbolic computation in these fields.

Fatma Kılınç-KarzanView profile

Associate Professor

• Mathematical Optimization
• Convex Optimization
• Non-convex Optimization
• +7 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.

Andrew ChildsView profile

Professor

• Quantum Algorithms
• Quantum Information Processing
• Quantum Simulation
• +2 more

Andrew Childs is a Professor at the University of Maryland, affiliated with the Department of Computer Science and the Institute for Advanced Computer Studies (UMIACS). He serves as Director of the NSF Quantum Leap Challenge Institute for Robust Quantum Simulation (RQS) and is a Fellow at the Joint Center for Quantum Information and Computer Science (QuICS). His research focuses on quantum algorithms for simulating physical systems, algebraic problems, and quantum walk protocols, with applications in quantum computing and computational complexity. University of Maryland Institute for Advanced Computer Studies (UMIACS) Joint Center for Quantum Information and Computer Science (QuICS) NSF Quantum Leap Challenge Institute for Robust Quantum Simulation Childs' research spans quantum simulation, quantum Fourier transform, phase estimation, and Hamiltonian dynamics. He has developed techniques to reduce quantum computational resources for simulating quantum systems and explored limitations of quantum computers through hidden subgroup problems and non-unitary dynamics. His publications cover diverse areas including quantum walk optimization, Hamiltonian simulation methods, and applications to cryptography and condensed matter physics. Recent works address spatial search algorithms, product formulas for commutators, and quantum routing protocols. As an educator, Childs has taught courses on quantum algorithms and information processing at both the University of Maryland and University of Waterloo, with lecture notes and materials spanning multiple years. Contact: amchilds@umd.edu | Office: ATL 3359 | Affiliated with University of Maryland's quantum research institutes.

Mark CrowleyView profile

Associate Professor

• Reinforcement Learning
• Deep Learning
• Manifold Learning
• +12 more

Mark Crowley is an Associate Professor in the Department of Electrical and Computer Engineering at the University of Waterloo, with a cross-appointment in the Cheriton School of Computer Science. He is a member of the Waterloo Artificial Intelligence Institute (WAII) and the Waterloo Institute for Complexity and Innovation (WICI), and serves as National Secretary of the Canadian Artificial Intelligence Association (CAIAC). His educational background includes a Ph.D. and M.Sc. in Computer Science from the University of British Columbia, where he worked in the Laboratory for Computational Intelligence, and a B.A. in Computer Science from York University. He completed a postdoctoral fellowship at Oregon State University working with Tom Dietterich's machine learning group. Crowley's research focuses on developing dependable and transparent algorithms to augment human decision-making in complex domains with multiple agents, spatial structure, or uncertainty. His work spans Reinforcement Learning , Deep Learning , Ensemble Methods , and Manifold Learning . He frequently collaborates with researchers in applied fields including Computational Sustainability, Sustainable Forest Management, Autonomous Driving, Medical Imaging, and Material Design. His research is motivated by both theoretical opportunities and real-world challenges such as forest fire management, automotive applications, and medical imaging. His recent publications demonstrate a strong focus on addressing challenges in reinforcement learning, particularly around observation costs, multi-agent systems, and causal representation learning. His work on ChemGymRL provides a significant contribution to digital chemistry and material design through reinforcement learning frameworks. The textbook Elements of Dimensionality Reduction and Manifold Learning represents a major contribution to the theoretical foundations of machine learning. Crowley actively supervises graduate students, with recent thesis completions including Shayan Shirahmadi Gale Bagi (PhD, Feb 2025) and Oleksandra Nahorna (MASc, Dec 2024). His lab, UWECEML (Waterloo ECE Machine Learning Lab), focuses on developing new algorithms at the intersection of Machine Learning, Optimization, and Probabilistic Modeling. He teaches courses including ECE 457C (Reinforcement Learning), ECE 657A (Data & Knowledge Modelling & Analysis), and ECE 457B (Fundamentals of Computational Intelligence). His blog Computationally Thinking explores AI, machine learning, and the societal impact of these technologies.

Aise Johan de JongView profile

Professor

• Algebraic Geometry
• Arithmetic Geometry
• Stacks Theory
• +4 more

Aise Johan de Jong is a Professor in the Department of Mathematics at Columbia University, where he teaches courses including representations of finite groups and organizes the algebraic geometry seminar. He is a leading figure in algebraic geometry with a particular focus on stacks theory and arithmetic aspects of algebraic varieties. Institution: Columbia University, Department of Mathematics Research Focus: Algebraic stacks, arithmetic geometry, moduli spaces Major Project: The Stacks Project (open-source collaborative textbook) De Jong's research primarily centers on algebraic stacks, arithmetic geometry, and the foundations of algebraic geometry. His work bridges abstract theoretical frameworks with concrete computational aspects, particularly in positive characteristic. He has made significant contributions to understanding Brauer groups, period-index problems, and the geometry of moduli spaces. His research often connects number theory with geometric structures, exploring how arithmetic properties manifest in geometric settings. His publication record shows a consistent focus on fundamental structures in algebraic geometry, with particular emphasis on stacks theory (evident in The Stacks Project), Brauer groups, rational connectivity, and arithmetic properties of algebraic varieties. The trajectory of his work demonstrates increasing sophistication in handling complex geometric structures while maintaining connections to arithmetic questions. His most recent work continues to explore the interplay between algebraic geometry and number theory, particularly through the lens of stacks and moduli spaces. De Jong actively mentors graduate students, with numerous descendants listed in the Mathematics Genealogy Project. His academic lineage includes researchers working across various subfields of algebraic geometry. He has organized multiple conferences including "Moduli spaces and moduli stacks" (2012) and "Spaces of curves and their interaction with diophantine problems" (2009), demonstrating his leadership in the field. He leads The Stacks Project, a major collaborative open-source initiative that has become an essential reference for algebraic geometers worldwide. This project provides comprehensive foundations for algebraic stacks and related concepts, with regular updates and community contributions. De Jong also maintains the Stacks Project Blog where he discusses mathematical topics related to the project and shares updates.

• Algebraic Geometry
• Mathematical Physics
• Mirror Symmetry
• +7 more

Maxim Kontsevich has been a permanent professor at the Institut des Hautes Études Scientifiques (IHÉS) since 1995, holding the AXA-IHES Chair for Mathematics . He is also Professor at Rutgers University (one month per year since 1997) and was Professor at University of California, Berkeley (1993–1995). Born 25 August 1964 in Khimki, former USSR, he became a French citizen in 1999. Education: Ph.D. in Mathematics, University of Bonn, March 1992. Research Interests: Prof. Kontsevich’s work lies at the intersection of algebraic geometry , mathematical physics , and quantum theory . He introduced revolutionary ideas in mirror symmetry , non-commutative geometry , and deformation quantization , creating new algebraic structures that have found applications far beyond their original contexts. His current ERC Synergy Grant “ReNew Quantum” (2019-2025) explores recursive and exact new quantum theory . Publications & Trends: Across more than 50 influential papers, Kontsevich has consistently pushed the boundaries of enumerative geometry , motivic integration , and topological field theory . His recent work delves into symplectic aspects of homological algebra , motivic Donaldson-Thomas invariants , non-archimedean geometry , and integrable systems , revealing deep connections between geometry, algebra, and physics. Scientific Awards & Honors: Fields Medal (1998) Crafoord Prize (2008) Shaw Prize in Mathematical Sciences (2012) Breakthrough Prize in Fundamental Physics (2012) Breakthrough Prize in Mathematics (2014) ERC Synergy Grant “ReNew Quantum” (2019) AMS Moore Prize (2025) Doctor Honoris Causa: Aarhus University (2014), Universität Wien (2015), Syddansk Universitet (2023) Member of Académie des Sciences, Institut de France, Academia Europaea, National Academy of Sciences (foreign), London Mathematical Society (honorary) Grants & Leadership: As Principal Investigator of the ERC Synergy Grant “ReNew Quantum” (€10 million, 2019-2025), Kontsevich coordinates an international team advancing exact methods and resurgence in quantum field and string theories. Editorial Service & Community Roles: He serves on the editorial boards of Compositio Mathematica , Publications Mathématiques IHÉS , Journal of Noncommutative Geometry , and several other leading journals, shaping the direction of contemporary mathematical research.

Caterina ConsaniView profile

Professor

• Arithmetic Geometry
• Number Theory
• Non-Commutative Geometry
• +3 more

Caterina Consani is a Professor of Mathematics at Johns Hopkins University's Krieger School of Arts & Sciences. She holds a PhD from the University of Chicago (1996) and a Dottore di Ricerca in Matematica from the Universities of Genoa and Turin (1993). Her research focuses on arithmetic geometry, non-commutative geometry, and the development of absolute geometry over the 'absolute point.' She has contributed to foundational work on the BC-system, the Arithmetic Site, and the Scaling Site, linking number theory with geometric frameworks. Education: PhD in Mathematics, University of Chicago (1996); Dottore di Ricerca in Matematica, Universities of Genoa & Turin (1993). Prior to Johns Hopkins, she taught at MIT (1996–1999) and the University of Toronto (1999–2005). Research Interests: Arithmetic geometry, non-commutative geometry, absolute geometry in characteristic one, connections to number theory and the Riemann Hypothesis. Collaborations include work with Alain Connes on adele class spaces and non-commutative algebraic geometry. Awards: Fellow of the American Mathematical Society (2024); 2025 Best Paper AOFA Award (Annals of Functional Analysis). Editorial roles include the Journal of Number Theory and Journal of Noncommutative Geometry. Teaching: Offers advanced courses in algebraic geometry and number theory, including topics like étale cohomology and the yoga of weights in 'Weil II.' Grants: Supported by the Simons Foundation. Organized major conferences such as the JAMI Conference on Riemann-Roch in Characteristic One (2019).