Find Academic Supervisors

Clark OlsonView profile

Professor

• Computer Vision
• Clustering Algorithms
• Robot Navigation
• +3 more

Clark Olson is a Professor in the Division of Computing & Software Systems at the University of Washington Bothell, part of the School of Science, Technology, Engineering & Mathematics. He earned his Ph.D. in Computer Science from UC Berkeley (1994), M.S. in Electrical Engineering (1990), and B.S. in Computer Engineering (1989) from the University of Washington, Seattle. Education: Ph.D. in Computer Science (2017) from University of California, Berkeley M.S. in Electrical Engineering (1990) from University of Washington, Seattle B.S. in Computer Engineering (1989) from University of Washington, Seattle His research focuses on computer vision, robot navigation, and clustering algorithms. He has developed techniques for Mars rover terrain mapping, subspace clustering, and geometric feature matching. His work bridges theory and application in autonomous systems and image analysis. Analysis of his publications reveals expertise in computer vision (8 papers), clustering algorithms (4 papers), and robotics (5 papers). Key subtopics include Mars exploration (3 papers), Hough transforms (3 papers), and probabilistic methods (3 papers). Professor Olson teaches courses ranging from introductory programming (CSS 161-162) to advanced topics in computer vision (CSS 487-587) and algorithm design (CSS 549). He also advises on the CSSE Capstone (CSS 497) projects requiring rigorous prerequisites and structured evaluation criteria.

Gary FroylandView profile

Professor

• Dynamical Systems
• Machine Learning
• Optimisation
• +12 more

Scientia Professor Gary Froyland is a Professor at the University of New South Wales (UNSW), affiliated with the School of Mathematics & Statistics. He leads the ARC Laureate Centre for Dynamical Systems and Data and holds an Einstein Visiting Fellowship from the Einstein Foundation Berlin. His academic credentials include a BSc (Hons 1, Medal) in Pure and Applied Mathematics from the University of Queensland and a PhD in Mathematics from the University of Western Australia. Professor Froyland's research spans two primary domains: dynamical systems and optimization. In dynamical systems, he investigates the interplay of probability and geometry in nonlinear and chaotic systems, employing tools from ergodic theory, functional analysis, and differential geometry. His work extends to applications in oceanography, atmospheric science, and granular flows. In optimization, he focuses on decision-making in complex systems with uncertain information, developing novel approaches in mathematical programming that have been applied to mining, logistics, and medical treatment planning. His recent publications demonstrate a strong focus on coherent structures in dynamical systems, linear response theory, and applications to geophysical phenomena. The research shows increasing interdisciplinary collaboration, particularly with climate scientists and data analysts, reflecting a trend toward applying advanced mathematical techniques to real-world problems in environmental science and engineering. J.D. Crawford Prize (2025) Elected Member of the Academy of Europe / Academia Europaea (2024) ARC Laureate Fellow (2024-2029) Fellow of the Society for Industrial and Applied Mathematics (SIAM) (2021) Fellow of the Australian Academy of Science (2020) Vice-Chancellor's Award for Teaching Excellence - Postgraduate Research Supervision (2015) Professor Froyland actively supervises PhD and honors students, with current advisees including Kevin Felipe Kühl Oliveira, Nicholas Peters, and Kathrin Völkner. His research is supported by multiple grants, including an ARC Laureate Fellowship (2024-2029) for "Breakthrough mathematics for dynamical systems and data," an Einstein Visiting Fellowship (2022-2026), and several ARC Discovery Projects. His work has practical applications in climate science, mining optimization, and medical treatment planning, particularly in radiotherapy. He leads the ARC Laureate Centre for Dynamical Systems and Data, which brings together researchers to develop new mathematical approaches for analyzing complex dynamical systems. The center focuses on creating methods to identify coherent structures in spatiotemporal data, with applications spanning environmental science, social science, health science, and engineering.

David JerisonView profile

Professor

• Fourier analysis
• partial differential equations
• free boundary problems
• +2 more

David Jerison is a Professor of Mathematics at the Massachusetts Institute of Technology (MIT), where he conducts research in Fourier analysis and partial differential equations. His work focuses primarily on free boundary problems and, more recently, on internal Diffusion Limited Aggregation (internal DLA), a stochastic growth model. He maintains an active research program with numerous publications in leading mathematical journals. Professor Jerison's research spans several interconnected areas of mathematical analysis. His primary interests include Fourier analysis and partial differential equations, with particular emphasis on free boundary problems. In recent years, he has expanded his research to include internal Diffusion Limited Aggregation, a stochastic growth model that has connections to probability theory and mathematical physics. His work often bridges geometric analysis, spectral theory, and probabilistic methods, demonstrating the deep connections between different branches of mathematics. Analysis of Professor Jerison's recent publications reveals a consistent focus on geometric aspects of partial differential equations, particularly free boundary problems. His research shows progression from classical PDE theory toward more stochastic and probabilistic approaches, as evidenced by his work on internal DLA. The publications demonstrate interdisciplinary connections between mathematical analysis, probability theory, and mathematical physics, with applications ranging from geometric measure theory to quantum mechanics. Professor Jerison is actively involved in teaching and mentoring at MIT. He has taught courses including Differential Equations (18.03), Fourier Analysis and Applications (18.103), and Differential Analysis (18.155). He also directs the Summer Program for Undergraduate Research (SPUR), which is exclusively for MIT undergraduates, and organizes the mathematics section of the Research Science Institute (RSI) for high school students. His teaching materials are available through MIT's Open Courseware platform, indicating his commitment to educational outreach and accessibility.

Sanjay JainView profile

Professor

• Inductive Inference
• Recursion Theory
• Complexity Theory
• +3 more

Sanjay Jain is a Provost's Chair Professor in the Department of Computer Science at the School of Computing, National University of Singapore (NUS). His research focuses on theoretical computer science with particular emphasis on inductive inference, recursion theory, complexity theory, and computational learning theory. Education: B.Tech. in Computer Science from Indian Institute of Technology Kharagpur, India (1986) M.S. in Computer Science from University of Rochester, USA (1988) Ph.D. in Computer Science from University of Rochester, USA (1990) Professor Jain's research spans multiple areas of theoretical computer science. His primary contributions are in computational learning theory, where he has made significant advances in understanding the intrinsic complexity of language identification and the limits of inductive inference. His work on recursion theory explores fundamental questions about computability and complexity, while his research in complexity theory addresses structural aspects of computational problems. A notable achievement was his work on "Deciding Parity Games in Quasipolynomial Time," which won the prestigious STOC 2017 best paper award and later the EATCS-IPEC Nerode Prize. Professor Jain's publication record shows a consistent focus on theoretical foundations of computer science, particularly in learning theory and computational complexity. His recent work has expanded into automatic structures, semiautomatic models, and connections between computational learning and algebraic structures. There is a clear progression from foundational work on language identification to more complex models involving automatic functions, transducers, and connections to mathematical logic. Scientific Awards: STOC 2017 Best Paper Award for "Deciding Parity Games in Quasipolynomial Time" EATCS-IPEC Nerode Prize (2021) Professor Jain has served on the editorial board of Information and Computation and has been actively involved in the academic community through program committee memberships for major conferences including COLT, ALT, LATA, TAMC, and PRICAI. He has held leadership roles as program co-chair for ALT 2000 and ALT 2013, and conference chair for ALT 2005. His work has been supported by various research grants, though specific details are not provided in the available materials. Professor Jain leads research in theoretical computer science at NUS, where he has built a strong research group focused on computational learning theory and related areas. His work often involves collaborations with researchers from around the world, particularly with Frank Stephan, with whom he has co-authored numerous papers. His research group has made significant contributions to understanding the fundamental limits and possibilities of computational learning models.

• Self-organized criticality
• Neuronal network dynamics
• Excitation/Inhibition balance
• +5 more

Anna Levina is an Assistant Professor for Computational Neuroscience at the University of Tübingen , affiliated with the Department of Computer Science under the Faculty of Science. Her research focuses on the self-organization of neuronal activity, critical dynamics in neural networks, and the excitation/inhibition balance in cortical circuits. Current positions: Assistant Professor (since 2018), Group Leader (2017-2018), Equality Officer (Computer Science) Previous roles: IST Fellow (2015-2017), Associated Researcher (2011-2015), Postdoc/PI (2011-2015), Postdoc (2008-2011) Her research integrates mathematical modeling , statistical physics , and computational neuroscience to study criticality phenomena, neural avalanches, and adaptive network dynamics. Key interests include: Self-organized criticality in neural systems Excitation/Inhibition balance mechanisms Network topology and dynamics Timescale analysis in neural processing Stochastic modeling of neural activity Recent publications reveal trends in understanding critical dynamics across biological and artificial networks, with applications to memory systems, sensorimotor integration, and disease modeling. She has received recognition as an IST Fellow .

Aaron SmithView profile

Associate Professor

• Applied Probability
• Computational Statistics
• Monte Carlo Methods
• +3 more

Aaron Smith is an Associate Professor in the Department of Mathematics and Statistics at the University of Ottawa, affiliated with the Faculty of Science. He holds a PhD from Stanford University. His research focuses on applied probability, computational statistics, Monte Carlo methods, and Markov chains, with an emphasis on advancing theoretical understanding and practical applications of these methodologies. Dr. Smith's work includes contributions to community detection algorithms, Markov chain mixing times, and synthetic health data generation. His recent publications explore topics such as nonstandard Dirichlet form representations, perturbation analysis of MCMC algorithms, and sparse Bayesian multidimensional scaling. He advises students in applied probability and has supervised postdoctoral researchers in related fields. His research interests span a wide range of topics, including stochastic processes, statistical inference, and algorithm design. He is particularly known for his analysis of convergence rates in Markov chains and the development of efficient sampling techniques for complex models. His interdisciplinary work bridges theoretical mathematics and practical computational challenges in data science and healthcare. Dr. Smith collaborates on projects involving synthetic data frameworks for privacy-preserving applications and has contributed to foundational work on mixing times and perturbation effects in stochastic systems.

Alexander ScottView profile

Professor

• Combinatorics
• Probability
• Algorithms
• +3 more

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.

• Urban morphology
• Urban design
• Street layout and network structure
• +5 more

Stephen Marshall is Professor of Urban Morphology and Urban Design at The Bartlett School of Planning, University College London. He also served as Visiting Professor at the Department of Architecture and Urban Studies, Politecnico di Milano, Italy from 2019 to 2021. With over twenty-five years of experience in the built environment fields, initially in consultancy and subsequently in academia, Professor Marshall has established himself as a leading expert in urban morphology and design. His educational background includes a Doctor of Philosophy from University College London (2001), a Postgraduate Diploma from Edinburgh College of Art (1995), a Master of Science from the University of Leeds (1989), and a Bachelor of Engineering from the University of Glasgow (1988). Professor Marshall's principal research focuses on urban morphology and street layout, examining their relationships with urban formative processes including urban design, coding and planning. His work bridges urban design theory with practical applications, exploring how cities evolve through complex interactions of physical form, social processes, and planning interventions. He has written or edited several influential books including 'Streets and Patterns' (2005), 'Cities, Design and Evolution' (2009), and 'Urban Coding and Planning' (2011). His recent publications reveal a growing interest in applying complexity science to urban morphology, with particular attention to biological analogies for understanding self-organizing cities. He has pioneered research on digital participation methods in urban planning, exploring how online platforms can enhance public engagement in urban space design. His work consistently bridges theoretical urban morphology with practical applications for contemporary urban challenges like pandemic adaptation and sustainable transport. Professor Marshall has served as Chair of the Editorial Board of Urban Design and Planning from its launch to 2012, and is now co-editor of Built Environment journal. His editorial work has significantly shaped scholarly discourse in urban planning and design. He leads several significant research initiatives including the Incubators of Public Spaces project, which explores digital platforms for co-creating urban spaces, and the Self-Organising Built Environment project, which investigates biological analogies in urbanism. These projects reflect his interdisciplinary approach to understanding and shaping urban environments, connecting with Sustainable Development Goal 11 (Sustainable Cities and Communities).

• Finite Model Theory
• Graph Structure Theory
• Computational Complexity
• +3 more

Kord Eickmeyer is a Lecturer at Technische Universität Darmstadt in the Department of Mathematics, specializing in the mathematical logic group. He holds a PhD in mathematics from Humboldt University Berlin and has held postdoctoral positions at TU Darmstadt (2011–2017) and the National Institute of Informatics in Tokyo (2011–2013). His research focuses on finite model theory, graph structure theory, and computational complexity, particularly in descriptive and parameterized complexity, as well as randomization and derandomization techniques. Research interests include exploring the boundaries of computational complexity through logical frameworks, analyzing graph structures for efficient algorithm design, and investigating the role of randomness in computation. His work bridges theoretical computer science and mathematical logic, with applications in algorithm design and formal methods. Publications span topics from model-checking on ordered structures to gap-planar graphs and randomized logics. Collaborations include prominent institutions like the National Institute of Informatics and Humboldt University Berlin. No scientific awards are explicitly listed, but his extensive academic contributions reflect a strong research trajectory. Advising and grants are not detailed in the provided text, though his academic career includes supervision roles during his PhD and postdoctoral phases. His involvement with the mathematical logic group at TU Darmstadt highlights collaborative research efforts in foundational areas of computer science and mathematics.

Melanie WeberView profile

Assistant Professor

• Geometric Machine Learning
• Optimization on Manifolds
• Non-Euclidean Machine Learning
• +3 more

Melanie Weber is an Assistant Professor of Applied Mathematics and Computer Science at Harvard University's John A. Paulson School of Engineering and Applied Sciences (SEAS), leading the Geometric Machine Learning Group. Her research focuses on leveraging geometric structures in data for designing efficient machine learning and optimization algorithms with theoretical guarantees. She holds a PhD from Princeton University (2021) and has held fellowships at the Mathematical Institute of Oxford, Brasenose College, and the Simons Institute. Her work bridges geometry, optimization, and machine learning, with funding from NSF, Sloan Foundation, and Harvard initiatives. Education : PhD in Applied Mathematics, Princeton University (2021) BSc/MSc in Mathematics and Physics, University of Leipzig (2016) Research Interests : Dr. Weber's research integrates geometric principles into machine learning and optimization, focusing on non-Euclidean spaces, graph structures, and manifold-based methods. Key areas include optimization on Riemannian manifolds, curvature-based analysis (e.g., Ricci curvature), and developing algorithms resilient to data geometry challenges like over-smoothing in graph neural networks. Her work emphasizes theoretical foundations while addressing practical scalability in high-dimensional data. Awards & Recognition : 2024 Sloan Research Fellowship 2023 Leslie Fox Prize in Numerical Analysis 2023 NSF Grant for Geometric Optimization Grants & Funding : Supported by National Science Foundation (NSF), Alfred P. Sloan Foundation, Aramont Foundation, Harvard Dean’s Fund, and Harvard Data Science Initiative. Labs & Collaborations : Leads the Geometric Machine Learning Group at SEAS, collaborating with institutions like MIT, Max Planck Institute, and industry labs (Facebook, Google, Microsoft). Active in organizing workshops on geometric methods and curvature analysis.

Andrew McCallumView profile

Professor

• Machine Learning
• Artificial Intelligence
• Natural Language Processing
• +3 more

Andrew McCallum is a Distinguished Professor and Director of the Center for Data Science at the University of Massachusetts Amherst. He holds a PhD in Computer Science from the University of Rochester (1995) and a BS from Dartmouth College (1989). His research focuses on machine learning, natural language processing, and information extraction, with applications to scientific literature and knowledge base construction. He has pioneered work on conditional random fields and probabilistic databases, and led the development of systems like Rexa, an advanced research paper search engine. Affiliations: Center for Data Science, Center for Intelligent Information Retrieval, Computational Social Science Institute Key Projects: OpenReview.net, Unified Information Extraction, Automated Knowledge Base Construction His work emphasizes extracting actionable knowledge from unstructured text, with contributions to social network analysis, entity resolution, and semi-supervised learning. McCallum has over 300 publications and has received awards including the NSF ITR Grant, IBM Faculty Partnership Awards, and ACM/AAAI Fellowships. He has advised numerous students and served as ICML General Chair (2012). Recent Research Trends: Probabilistic box embeddings, case-based reasoning for knowledge bases, scalable clustering algorithms, and applications in biomedical informatics.

Nathan LinialView profile

Professor

• Combinatorics
• Theoretical Computer Science
• Bioinformatics
• +6 more

Nathan (Nati) Linial is a Professor at the School of Computer Science and Engineering at the Hebrew University of Jerusalem, where he has been a faculty member since completing his postdoctoral period at UCLA. He earned his undergraduate degree in mathematics from the Technion and his PhD in graph theory from the Hebrew University. His research spans multiple areas of theoretical computer science and mathematics, with primary focus on combinatorics, theoretical computer science, and bioinformatics. Linial's work has made significant contributions to high-dimensional combinatorics, expander graphs, metric embeddings, and computational molecular biology. His research often bridges geometry, analysis, and combinatorial structures, demonstrating deep connections between seemingly disparate mathematical fields. Linial's recent publications reveal a strong trend toward high-dimensional combinatorial structures, including simplicial complexes, hypertrees, and high-dimensional permutations. His work frequently employs probabilistic methods, linear programming techniques, and geometric approaches to solve fundamental combinatorial problems. The breadth of his research is evident in both pure mathematical contributions and applications to computational biology. Fellow of the American Mathematical Society ISI Highly Cited Researcher Conant Prize (2008) for the influential survey paper "Expander graphs and their applications" Linial has served on the editorial boards of several prestigious journals including the Israel Journal of Mathematics (as Chief Editor 2013-2017), Random Structures and Algorithms, and Combinatorica. His academic leadership extends to organizing conferences and workshops in combinatorics and theoretical computer science. He has mentored numerous students whose work spans theoretical computer science, combinatorics, and computational biology. Linial is associated with research projects including ProtoNet (for protein sequence classification) and EVEREST (for evolutionary conserved protein domains), demonstrating his commitment to interdisciplinary research that bridges computer science with molecular biology.

Maxim KontsevichView profile

Professor

• Mathematical Physics
• Algebraic Geometry
• Deformation Quantization
• +5 more

Maxim Kontsevich is a permanent professor at the Institut des Hautes Études Scientifiques (IHÉS), holding the AXA Chair for Mathematics since 1995 and a visiting chair at Rutgers University (one month annually since 1997). Born in 1964 in Khimki, USSR, he earned his PhD from Bonn University in 1992. His career includes visiting positions at Harvard, the Institute for Advanced Study, and Berkeley, where he was a professor from 1993 to 1995. His research spans mathematical physics, algebraic geometry, and non-commutative geometry. Notable contributions include deformation quantization, mirror symmetry, and motivic integration. His work bridges algebraic structures with geometric and physical concepts, influencing areas like topological field theories, string theory, and integrable systems. Awardees of Fields Medal (1998), Crafoord Prize (2008), and Breakthrough Prize (2014), he also holds editorial roles at Compositio Mathematica and Publications Mathématiques IHÉS. His over 50 publications explore advanced topics such as quantum cohomology, Hodge theory, and categorical structures in geometry.

Dmitri KrioukovView profile

Associate Professor

• Network Science
• Complex Networks
• Mathematical Physics
• +7 more

Prof. Dmitri Krioukov is an Associate Professor in the Department of Physics at Northeastern University and holds an affiliated faculty position in Electrical and Computer Engineering. He directs the DK-Lab at the Network Science Institute, focusing on theoretical aspects of complex networks, including latent network geometry, random geometric graphs, and navigation in networks. His work bridges mathematical physics and applied network science, with applications to real-world data such as the Internet's structure. Research interests revolve around the interplay between network topology and geometry, including studies of causal sets, graph curvature, and dynamics in complex systems. He has pioneered frameworks linking network growth to hyperbolic geometry, enabling efficient routing algorithms. Notable contributions include the discovery of latent geometric structures underlying real-world networks and their implications for navigation and scalability. He has been recognized for high-impact publications, including multiple Stanford University Annual Assessments placing him among the top 2% most-cited scientists in his field (2024, 2023, 2022). His lab's interdisciplinary approach integrates principles from physics, mathematics, and computer science to address fundamental questions in network science.

Katrin TentView profile

Professor

• Model theory
• Group theory
• Geometry
• +4 more

Professor Katrin Tent is a distinguished mathematician specializing in mathematical logic at the University of Münster, where she holds a professorship in the Faculty of Mathematics and Computer Science within the Institute for Mathematical Logic and Foundations Research. She is an active researcher in Mathematics Münster, an investigator in CRC 1442 Geometry: Deformations and Rigidity, and contributes to multiple research projects including Topics in Mathematics Münster T3: Models and universes, T4: Groups and actions, and T8: Random discrete structures and their limits. PhD in Linguistics, Christian-Albrechts-Universität zu Kiel (1988) Diplom in Mathematics, Christian-Albrechts-Universität zu Kiel (1989) PhD in Mathematics, University of Notre Dame (1994) Habilitation, "Model theory of groups and BN-pairs" (2000) Professor Tent's research bridges model theory, group theory, and geometry, with particular focus on finite Morley rank structures, BN-pairs, and sharply multiply transitive groups. Her work often combines methods from these areas to prove unexpected results, either constructing groups or incidence geometries with surprising model theoretic properties or using model theory to construct new and interesting geometries or groups. Her recent publications reveal a consistent trajectory connecting model theory with group-theoretic structures. She has made significant contributions to understanding sharply 2- and 3-transitive groups, finite Morley rank geometries, and the model theory of generalized polygons. Her work demonstrates how model-theoretic techniques can solve deep problems in group theory and geometry, particularly through the study of BN-pairs and incidence structures. DFG Research Fellowship (1996-1998) Bayerischer Habilitationsförderpreis (1998-2001) Heisenberg-Stipendium (2001-2004) ERC Consolidator Grants expert panel (2016, 2018) Elected to DFG Senate (2019) Professor Tent leads an active research group with current members including Marco Amelio, Dr. Benjamin Brück, Anna Cascioli, Lukas Jonuska, Silke Meissner, Zahra Mohammadi Khangheshlaghi, and Dr. Sam Shepherd. Her former research group members include Dr. Simon Andre, Dr. Isabel Müller, and Dr. Tim Clausen, among others. Her supervisory work spans both theoretical foundations and specific applications in geometric group theory and model theory. Her research group operates within the Institute for Mathematical Logic and Foundations Research at the University of Münster, collaborating closely with other researchers in the Mathematics Münster cluster. The group participates in various projects including CRC 1442 - C04: Group theoretic aspects of negative curvature, contributing to the vibrant mathematical research environment at one of Germany's leading mathematics institutions.