Find Academic Supervisors

Catherine GreenhillView profile

Professor

• Combinatorics
• Graph Theory
• Applied Probability
• +6 more

Professor Catherine Greenhill is a faculty member at the School of Mathematics and Statistics, UNSW Sydney , where she serves as Professor and head of the Combinatorics group. Her academic career spans institutions including the University of Queensland, University of Oxford, University of Leeds, University of Melbourne, and Australian National University. D.Phil., University of Oxford (1996) M.Sc. (Research) in Combinatorics (1992) B.Sc. (Hons) in Pure Mathematics (1991) Her research focuses on the intersection of discrete mathematics , theoretical computer science , and probability , particularly in asymptotic combinatorics , probabilistic methods , and analysis of algorithms . Her work includes asymptotic enumeration of combinatorial structures and design of randomized algorithms for graph sampling and counting. Her recent publications (2025–2021) center on random graphs and hypergraphs , with key contributions to switch Markov chains , degree sequence analysis , and chromatic number bounds . These works reflect her expertise in probabilistic combinatorics and algorithmic complexity . Scientific Awards: Fellow of the Australian Academy of Science (2022) Christopher Heyde Medal in Pure Mathematics (2015) June Griffith Fellowship (2013) Hall Medal (2010) Advising and Grants: She has supervised numerous PhD/Masters students and secured multiple ARC Discovery Grants (2019–2021, 2014–2016, 2012–2014). Her grants address topics like hypergraph modeling, random discrete structures, and network analysis in illicit drug trafficking.

• Human-Computer Interaction
• Learning Sciences
• Educational Technology
• +2 more

Jennifer Olsen, PhD, is an Assistant Professor of Computer Science at the University of San Diego since 2020. She holds a PhD, MS, and BS in Human-Computer Interaction and Cognitive Science from Carnegie Mellon University, followed by postdoctoral research at the Swiss Federal Institute of Technology (EPFL), Lausanne, Switzerland. Her research focuses on the intersection of human-computer interaction, cognition, and education, emphasizing collaborative learning and educational technology design from both learner and instructor perspectives. Education: PhD in Human-Computer Interaction, Carnegie Mellon University MS in Human-Computer Interaction, Carnegie Mellon University BS in Cognitive Science, Carnegie Mellon University Research Interests: Dr. Olsen explores how collaboration supports learning, designs technologies to enhance educational practices, and investigates gaze-based metrics for understanding collaborative problem-solving. Her work spans gamified robotics, AI-driven orchestration systems, and virtual reality applications in vocational training. She emphasizes learner-centered design and the integration of social robots and virtual agents in pedagogical settings. Grants/Advising: While no specific grants or advisees are listed, her prolific publication record indicates active involvement in educational technology research and development. Her work addresses challenges in classroom orchestration, multimodal data analysis, and accessibility in educational robotics. Labs/Teams: Collaborates with interdisciplinary teams focused on educational technology, human-robot interaction, and adaptive learning systems. Her research leverages tools like FROG orchestration graphs and eye-tracking technologies to develop practical classroom solutions.

Shoudong HuangView profile

Professor

• Mobile robot navigation
• Simultaneous localization and mapping (SLAM)
• Underwater robotics
• +4 more

Shoudong Huang is a Professor at the School of Mechanical and Mechatronic Engineering , University of Technology Sydney, and Deputy Director of the UTS Robotics Institute. His research focuses on mobile robot navigation , SLAM , nonlinear state estimation , and surgical robotics . He has published over 200 papers and is recognized as one of the 100 Most Influential Scholars in Robotics (Aminer, 2018). PhD in Automatic Control, Northeastern University (China) Postdoctoral Research Fellow, University of Hong Kong (1998-2000) Research Fellow, Australian National University (2001-2003) Full-time academic roles at UTS since 2004 His work addresses challenges in robot localization across extreme environments (underwater, underground mining, surgical settings) and develops globally optimal SLAM algorithms with guaranteed performance. He has secured over $4 million AUD in external funding, including ARC Discovery grants and industry partnerships. Recent publications emphasize cross-modal calibration (camera-LiDAR), interval analysis for bounded noise , and template-based deformable surface reconstruction . These span applications in autonomous driving, surgical navigation, and UAV guidance. Chancellor’s Medal for Research Excellence (2020) Supervisor of the Year (2023) Best Paper Award (2016 ICARCV) Huang serves as Associate Editor for IEEE Transactions on Robotics and International Journal of Robotics Research , and has held leadership roles in top robotics conferences like IROS and RSS. His collaborations span MIT, USC, Zhejiang University, and industry partners including PMSW Research Pty Ltd and Multiplex Constructions Pty Ltd.

Amitabha BagchiView profile

Professor

• Data Algorithmics
• Probability and Networks
• Theoretical Computer Science
• +7 more

Amitabha Bagchi is a Professor in the Department of Computer Science and Engineering at IIT Delhi. His research spans data algorithmics, probability, networks, and theoretical computer science, with applications in distributed systems, social networks, and AI-driven platforms. He has published extensively in leading venues such as SIGMOD, VLDB, ICDE, AAAI, and KDD, often collaborating with students and researchers on problems involving graph algorithms, fairness, and large-scale data analysis. Research Interests: His primary research interests include Data Algorithmics, Probability and Networks, Theoretical Computer Science, Distributed Algorithms, Graph Algorithms, and Machine Learning Theory. He investigates algorithmic foundations for real-world problems such as food delivery optimization, social network analysis, and efficient data structures for streaming and large graphs. Publication Trends: Recent publications focus on fairness in gig economy platforms, efficient solvers for graph Laplacians, generalization in neural networks, and temporal graph querying. His work combines theoretical rigor with practical impact, often involving GPU acceleration, distributed computing, and data-aware algorithm design. Scientific Service: Editor, Algorithms (2020–present) Editor, Journal of Discrete Algorithms , Elsevier (2006–2018) Guest Editor, special issue on Algorithms for Shortest Paths in Dynamic and Evolving Networks , Algorithms (2021) Volume Editor for proceedings of ESA, ATMOS, COCOON, and others Conference Leadership: He has served on numerous program committees and as chair for conferences including ESA (Engineering Track, 2016), ATMOS (2020), and ICALP (2019). His involvement spans algorithmic engineering, transportation optimization, and theoretical computer science forums. Teaching: He currently teaches COL863: Special Topics in Theoretical Computer Science on concentration inequalities and their applications. He has previously taught advanced courses in algorithms and data structures.

• Complex Systems
• Financial Mathematics
• Statistical Physics
• +6 more

Tomaso Aste is a Professor of Complexity Science at the Department of Computer Science, University College London (UCL). He founded the Financial Computing and Analytics group and co-founded the UCL Centre for Blockchain Technologies. His work bridges complex systems, data science, and finance, with applications in blockchain, fintech, and market modeling. Education: PhD in Physics (Politecnico di Milano, 1994); Laurea in Physics (University of Genoa, 1990) Prior Appointments: Reader at University of Kent's School of Physics; Associate Professor at Australian National University's Applied Mathematics His research focuses on data-driven modeling of complex systems , particularly financial systems, complex networks, and statistical physics. He has pioneered information filtering networks and topological machine learning methods for financial applications, including portfolio optimization, risk assessment, and cryptocurrency analysis. Recent publications highlight his expertise in financial time-series analysis, blockchain technology, and AI-driven modeling. Articles explore topics like limit order books, cryptocurrency market fragility, and topological neural networks. His work has influenced regulatory technology (RegTech) frameworks and digital economy strategies. Scientific Awards : Marie Curie Individual Fellowship University of Genoa graduate study specialization Fellowship Bacheflor Boncompagni-Ludovisi Foundation Fellowship Awarded fellowships from European Commission and academic foundations support his interdisciplinary research. He has held editorial roles at journals like Philosophical Magazine and Granular Matter , and contributed to professional societies including American Physical Society and Australian Research Council panels. Teaching & Academic Leadership : Co-created four UCL Master's programs: Financial Risk Management, Computational Finance, Financial Technologies, Emerging Digital Technologies Coordinates executive training on AI, blockchain, fintech, and regtech for regulators and private firms Teaches graduate-level courses in Data-Driven Modeling, Data Science, and Advanced AI

Maya RamanathView profile

Associate Professor

• Database Systems
• Information Retrieval
• Semantic Web Data Management
• +3 more

Maya Ramanath is an Associate Professor in the Department of Computer Science and Engineering at Indian Institute of Technology (IIT) Delhi. She joined IIT Delhi in 2011 after a postdoctoral research stint at the Max-Planck Institute for Informatics in Germany. Her research interests focus on database systems, information retrieval, semantic web technologies, and knowledge graph construction and applications. Education: PhD in Computer Science, Indian Institute of Science, Bangalore M.Sc.(Engg.) in Computer Science, Indian Institute of Science, Bangalore B.E. in Computer Science and Engineering, Bangalore University, Bangalore Her recent work emphasizes efficient query processing over large-scale graphs, knowledge graph applications, and natural language interfaces for semantic data. Notable contributions include algorithms for reachability approximation in web-scale graphs, speculative query planning for knowledge graphs, and exploratory querying techniques. She has collaborated extensively on projects like NAGA, ESTHETE, and KlusTree, advancing the state of the art in graph-based data management and semantic search. Publications span conferences such as ICDE, ECIR, EDBT, and VLDB, reflecting a strong focus on database systems, graph algorithms, and semantic web applications. Her work bridges theoretical foundations with practical implementations, addressing scalability and efficiency challenges in modern data management systems. Research and advising activities include supervision of projects on distributed graph processing, query optimization, and knowledge representation. She has contributed to open-source tools like LegoDB and StatiX, and her lab focuses on interdisciplinary approaches to data-centric AI.

Christopher G. AtkesonView profile

Professor

• Humanoid robotics
• Human aware environments
• Machine learning
• +13 more

Christopher G. Atkeson is a Professor at the Robotics Institute at Carnegie Mellon University (CMU), where he has been since 2000 after previously holding positions at MIT and Georgia Institute of Technology. His research focuses on fulfilling the science fiction vision of machines achieving human levels of competence in perception, cognition, and action, with particular emphasis on understanding how to get machines to generate and perceive human behavior. Atkeson's work spans two complementary approaches: humanoid robotics and human aware environments. His research interests include nonparametric learning, memory-based learning, reinforcement learning, learning from demonstration, and modeling human behavior. He is particularly known for his work on robot learning of challenging dynamic tasks such as juggling, trajectory-based optimization, and soft robotics (including his contributions to the Baymax character in Disney's Big Hero 6). His recent publications demonstrate a strong focus on tactile sensing (FingerVision), human-in-the-loop optimization for exoskeletons, deep learning for locomotion control, and trajectory-based optimization methods. His work consistently bridges theoretical foundations in machine learning with practical implementations on physical robots. Among his scientific recognitions are an NSF Presidential Young Investigator Award, a Sloan Research Fellowship, and a Teaching Award from the MIT Graduate Student Council. Atkeson has advised numerous students who have gone on to successful careers in academia and industry, including notable researchers like Andrew Moore and Stefan Schaal. His teaching includes courses on dynamic optimization, humanoids, kinematics, dynamics, and control.

• Applied Topology
• Dynamical Systems
• Algebraic Topology
• +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.

Jiaxuan YouView profile

Assistant Professor

• Graph Neural Networks
• Relational Data
• Machine Learning Systems
• +9 more

Jiaxuan You is an Assistant Professor at the Siebel School of Computing and Data Science, University of Illinois at Urbana-Champaign, leading the U Lab focused on achieving Artificial General Intelligence (AGI) in digital environments. His research spans graph neural networks (GNNs), relational data, foundation models, and machine learning systems. PhD and MS in Computer Science from Stanford University (2021) Developed GraphGym and PyTorch Geometric (PyG) for graph learning Core member at Kumo AI (2021-2023) His research explores: Graph-enhanced LLMs: Integrating relational structures into foundation models AGI Development: Self-optimizing AI agents and tool utilization ML Systems: Scalable architectures and redundancy-free computation Interdisciplinary Applications: Financial networks, crop yield prediction, and metro systems Recent publications focus on temporal reasoning, multi-agent dynamics, and hybrid architectures for LLMs. He actively develops open-source tools like DBGYM and GraphRouter. Scientific recognition includes: JPMC PhD Fellowship Baidu Scholarship Best Student Paper at AAAI 2017 World Bank Big Data Innovation Challenge winner He mentors PhD and intern students, emphasizing machine learning systems expertise. His lab collaborates on AGI workshops (e.g., ICLR 2024) and industry projects.

Osman YağanView profile

Research Professor

• Machine Learning
• Data Science
• Network Science
• +7 more

Osman Yağan is a Research Professor in the Department of Electrical and Computer Engineering at Carnegie Mellon University (CMU), with affiliate faculty status in the School of Computer Science. He is also a core member of CyLab Security and Privacy Institute. Prior to joining CMU in 2013, he was a Postdoctoral Research Fellow at CyLab. He holds a Ph.D. in Electrical and Computer Engineering from the University of Maryland (2011) and a B.S. from Middle East Technical University (2007). His research focuses on modeling, analysis, and optimization of computing systems, leveraging applied probability, network science, data science, and machine learning. Key areas include multi-armed bandits, resilient machine learning, contagion processes in networks, and cybersecurity. Research Interests include Machine Learning, Data Science, Network Science, Cybersecurity, and Robustness in Cyber-Physical Systems. He has advised numerous students, including current PhD candidates Yurun Tian, Orkun İrsoy, and Ishank Juneja, as well as notable alumni such as Mansi Sood (now at MIT) and Jun Zhao (Assistant Professor at Nanyang Technological University). Key Awards include the CIT Dean's Early Career Fellowship, IBM Academic Award, and Best Paper Awards at ICC 2021, IPSN 2022, and ASONAM 2023. His work spans theoretical contributions (e.g., contagion models in multi-layer networks) and applied research (e.g., mitigating cascading failures in power systems). He leads or co-leads grants from ONR, NSF, and ARO, focusing on resilient machine learning, network robustness, and pandemic modeling.

Clifford SteinView profile

Professor

• Algorithms
• Combinatorial Optimization
• Operations Research
• +4 more

Clifford Stein is a Professor of Industrial Engineering and Operations Research (IEOR) and Computer Science at Columbia University, and Associate Director for Research at the Data Science Institute. He holds a Ph.D. (1992), M.S. (1989), and B.S.E. (1987) from MIT and Princeton University, respectively. His research focuses on algorithms, combinatorial optimization, operations research, scheduling, and computational biology. A co-author of the best-selling textbook Introduction to Algorithms , Stein has published widely in top venues and holds prestigious awards like ACM Fellow and NSF Career Award. His work includes foundational contributions to minimum cut algorithms, scheduling theory, and network optimization, supported by NSF and Sloan Foundation grants. Stein has advised over 40 graduate and undergraduate students, many now in academia and industry.

• Topological Data Analysis
• Data Visualization
• Computational Topology
• +5 more

Bei Wang Phillips is an Associate Professor in the School of Computing and a faculty member at the Scientific Computing and Imaging (SCI) Institute at the University of Utah. She holds a Ph.D. in Computer Science from Duke University and an undergraduate degree from the University of Bridgeport. Her research focuses on Topological Data Analysis (TDA), data visualization, computational topology, and machine learning, with applications in scientific data exploration and analysis. She has received prestigious awards including the NSF CAREER Award (2022) and the PECASE Award (2025). Her work spans projects funded by NSF, NIH, and DOE, including multiparameter TDA and topology-aware data compression. She advises numerous students and collaborates on interdisciplinary initiatives in astrophysics, climate science, and AI fairness. Education: Ph.D. in Computer Science, Duke University (2010) B.S. in Computer Science and Mathematics, University of Bridgeport (2003) Research Interests: Topological techniques for large-scale data analysis Integration of topological, geometric, and machine learning methods Applications in visualization, bioinformatics, and network analysis Key Projects: NSF-funded TDA research (DMS-2301361, OAC-2313124) DOE project on topology-preserving data compression Collaborations with NASA, Argonne National Lab, and Carnegie Institution of Washington Awards: Presidential Early Career Award for Scientists and Engineers (2025) NSF CAREER Award (2022) DOE Early Career Research Program (2020) Advising and Grants: Mentored over 30 students and postdocs Recipient of multiple NSF and DOE grants totaling millions

Daniel Dominic Kaplan SleatorView profile

Professor

• Algorithms
• Data Structures
• Theoretical Computer Science
• +5 more

Daniel Dominic Kaplan Sleator is a Professor of Computer Science at Carnegie Mellon University's School of Computer Science. He maintains an office in the Gates-Hillman Center (7205 Gates-Hillman) and teaches various courses in algorithms and theoretical computer science. Professor Sleator's research spans several areas of theoretical computer science and algorithms. His primary interests include: Algorithms and Data Structures Amortized Analysis and Competitive Analysis Persistent and Self-Adjusting Data Structures Computational Geometry and Combinatorial Optimization Combinatorial Game Theory and Mathematical Games Music Analysis using Computational Methods His extensive publication record shows a consistent focus on efficient data structures and algorithms. Over the years, his work has evolved from foundational data structures like splay trees and skew heaps to applications in diverse areas such as music analysis and combinatorial games. A notable trend in his work is the development of self-adjusting data structures that achieve excellent amortized performance without maintaining explicit structural constraints. His papers on splay trees, skew heaps, and persistent data structures have become classics in the field. Professor Sleator has made significant contributions across multiple domains of computer science. His work on competitive algorithms for paging and list update problems has been particularly influential, establishing fundamental results in online algorithms. His research extends beyond traditional computer science into interdisciplinary areas like computational music theory, demonstrating the broad applicability of algorithmic thinking. He teaches a variety of courses including Algorithms 15-451/651, Competition Programming 15-295, and specialized topics like mathematical games.

Florentina BuneaView profile

Professor

• Statistical machine learning theory
• High-dimensional statistical inference
• Optimal transport
• +6 more

Florentina Bunea is a Professor in the Department of Statistics and Data Science at Cornell University’s Bowers College of Computing and Information Science, and an active member of the Graduate Fields of Statistics, Applied Mathematics, and Computer Science. She also serves on the Diversity and Inclusion Council of her college, championing workforce diversity in data-science disciplines. Education & Institutional Roles Professor, Department of Statistics and Data Science, Cornell University Member, Graduate Fields of Statistics, Applied Mathematics, Computer Science Member, Diversity and Inclusion Council, Bowers College of Computing and Information Science Research Interests Professor Bunea’s research lies at the intersection of statistical machine-learning theory and high-dimensional inference. She develops rigorous methodology supported by sharp theoretical guarantees to tackle core problems in modern data science. Recent themes include: Soft-max mixtures for understanding large-language-model/AI algorithms Optimal transport for high-dimensional mixture distributions Wasserstein-distance inference for sparse mixing measures in topic models Latent-space clustering and cluster-based inference in high dimensions Network modeling and hidden-structure inference Applications spanning genetics, systems immunology, neuroscience, sociology, and economics Research Funding & Awards Her work is supported by grants from the National Science Foundation (NSF-DMS). She is a Fellow of the Institute of Mathematical Statistics and a recipient of the IMS Medallion Award. Editorial & Service Contributions Associate Editor: Annals of Statistics, Bernoulli, JASA, JRSS-B, EJS, Annals of Applied Statistics Co-Editor: Chapman & Hall/CRC Statistics and Applied Probability Monograph Series Advising & Collaboration Professor Bunea has mentored numerous doctoral and post-doctoral researchers, including Xin Bing, Shuyu Liu, Seth Strimas-Mackey, and Yang Ning, among others. Collaborative projects extend across Cornell and external institutions, producing widely-used software packages and high-impact publications. Contact Office: 1184 Comstock Hall, Cornell University Email: fb238@cornell.edu Phone: (607) 255-8449

Nina BalcanView profile

Professor

• Machine Learning
• Artificial Intelligence
• Theoretical Computer Science
• +12 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.