Find Academic Supervisors

Sean O'RourkeView profile

Associate Professor

• Probability
• Random Matrix Theory
• Random Polynomials

Sean O'Rourke is an Associate Professor in the Department of Mathematics at the University of Colorado Boulder. His research focuses on probability, random matrix theory, and random polynomials. He has organized multiple workshops and minisymposia, including events at the Canadian Discrete and Algorithmic Mathematics Conference (CanaDAM) and ICERM, demonstrating his active role in academic community engagement. His research spans spectral properties of random matrices (e.g., singular values, elliptic matrices, Laplacian matrices), probabilistic behavior of polynomial roots under operations like differentiation and summation, and applications of free probability theory. Recent work includes universal behavior in eigenvalue gaps, non-Hermitian matrix controllability, and asymptotic refinements of classical theorems for random polynomials. Publications highlight collaborations with researchers such as Andrew Campbell, Kyle Luh, David Renfrew, and Van Vu. His work appears in leading journals like Annals of Probability , Electronic Journal of Probability , and Transactions of the American Mathematical Society , covering topics from Gaussian fluctuations to low-rank perturbations and noncommutative harmonic analysis.

Pierre-Henri ParisView profile

Associate Professor

• Artificial Intelligence
• Knowledge Graphs
• Information Extraction
• +2 more

Pierre-Henri Paris is an Associate Professor (Maître de Conférences) at Paris-Saclay University since September 2024. Previously, he worked as a Postdoctoral Researcher at Telecom Paris (Institut Polytechnique de Paris) from September 2020 to August 2024. His academic journey includes a PhD in Artificial Intelligence from Sorbonne University and CNAM (Conservatoire National des Arts et Métiers) completed in 2020. Education: PhD in Artificial Intelligence, 2020, Sorbonne University and CNAM M.Sc. in Artificial Intelligence, 2016, CNAM M.Sc. in Mathematics, 2008, CY Cergy Paris University (incomplete) Pierre-Henri Paris's research focuses on the intersection of artificial intelligence, knowledge representation, and natural language processing. His work particularly emphasizes knowledge graphs, entity linking, and data quality. He has made significant contributions to projects like YAGO 4.5, which enhances knowledge bases with cleaner, logically consistent structures, and MAFALDA, a benchmark for fallacy classification. His research often bridges theoretical foundations with practical applications, particularly in how knowledge can be effectively represented, extracted, and utilized in complex systems. His recent publications reveal a strong focus on knowledge graph enhancement, semantic representation, and natural language understanding. The work on YAGO 4.5 demonstrates his commitment to creating more robust knowledge bases, while MAFALDA shows his interest in the intersection of language understanding and logical reasoning. His research trajectory indicates a consistent exploration of how structured knowledge can be integrated with linguistic analysis to create more intelligent systems. Advising: PhD students: Simon Coumes (2022-), Chadi Helwe (2022-2024), François Amat (2022-) Master's students: Syrine El Aoud (2021), Ayoub Mountassir (2013-2015) Bachelor's students: Khalil Halloul (2013-2014) Pierre-Henri Paris is actively involved in teaching at Paris-Saclay University, where he instructs courses including Introduction to Machine Learning, Introduction to Neural Networks, Algorithms for Data Science, Databases, and Data Warehousing. His teaching reflects his research expertise, providing students with both theoretical foundations and practical applications in artificial intelligence and data science.

Lane A. HemaspaandraView profile

Professor

• Computational Complexity Theory
• Structural Complexity Theory
• Computational Social Choice Theory
• +4 more

Lane A. Hemaspaandra (formerly Hemachandra) is a Professor at the Department of Computer Science, University of Rochester, New York. His academic career spans over three decades, with research focusing on computational complexity theory (especially structural complexity) and computational social choice theory . He holds a Ph.D. in Computer Science from Cornell University (1987) and has been recognized with prestigious awards such as the Friedrich Wilhelm Bessel Research Award from the Alexander von Humboldt Foundation and NSF Presidential Young Investigator (1989–1995). Education: B.S. in Computer Science and Mathematics & Physics, Yale University (1981) M.S. in Computer Science, Stanford University (1982) M.S. in Computer Science, Cornell University (1984) Ph.D. in Computer Science, Cornell University (1987) Hemaspaandra's research bridges theoretical computer science with political science and economics , particularly analyzing the computational complexity of election systems. His work includes foundational studies on Carroll/Dodgson voting , control complexity , and manipulative attacks in single-peaked societies. He has pioneered the use of complexity as a shield against election manipulation and control. The 15 most recent articles (2021–2024) span topics like backbone opacity , electoral control dichotomies , iterative constant-setting for complexity , and online bribery in sequential elections . These works often intersect with parameterized complexity , multi-agent systems , and game-theoretic models . Scientific Awards: AAAI Senior Member (2020–...) ACM Distinguished Scientist (2007–...) Alexander von Humboldt Foundation Renewed Research Stay (2018–2019) SIGACT Distinguished Service Prize (2013) Edward Peck Curtis Award for Undergraduate Teaching (2012) Hertz Foundation Fellowship (1982–1987) He has advised 15 Ph.D. students and postdocs, including prominent researchers like Prof. Piotr Faliszewski (AGH University) and Dr. Curtis Menton (Google). His NSF-funded projects explore complexity-theoretic approaches to election systems, and he has collaborated with institutions in Germany, Japan, and Poland.

Nicola NicoliciView profile

Professor

• Digital Integrated Circuit Design
• Hardware Testing
• Post-Silicon Validation
• +7 more

Nicola Nicolici is a Professor in the Department of Electrical and Computer Engineering at McMaster University. His research focuses on methods and algorithms for the design of digital integrated circuits and systems, with significant contributions in manufacturing test, post-silicon validation and debug. His work has expanded to include embedded systems, low-energy computing, and custom hardware-accelerated computing systems. Professor Nicolici's research interests span multiple areas of digital system design and validation. His early work focused on manufacturing test methodologies and power-aware testing strategies for integrated circuits. More recently, he has made significant contributions to post-silicon validation techniques, including constrained-random stimuli generation, trace signal selection, and bit-flip detection. His research has evolved to address emerging challenges in embedded computing systems, low-energy design, and specialized hardware acceleration for various applications including deep neural networks and signal processing. His recent publications reveal a strong trend toward hardware acceleration for specialized computing tasks. The research spans matrix multiplication algorithms (Strassen and Karatsuba), memory system optimization (DDR5 calibration), FPGA-based radar processing, and neural network acceleration. His work consistently bridges theoretical algorithm development with practical hardware implementation considerations, particularly focusing on precision analysis, fault tolerance, and energy efficiency. The research demonstrates a clear progression from traditional digital circuit testing to more complex system-level validation and acceleration techniques. Professor Nicolici has been actively involved in teaching courses related to system-on-chip design and test, digital systems, and embedded systems. His teaching portfolio includes advanced courses such as System-on-Chip (SOC) Design and Test and Digital Systems Design , reflecting his expertise in the field. While specific grant information isn't detailed in the provided text, his extensive publication record suggests ongoing research funding support. His research has contributed significantly to the fields of digital circuit testing, post-silicon validation, and hardware acceleration. The work has practical applications in semiconductor manufacturing, embedded systems design, and specialized computing architectures. His recent focus on neural network acceleration and memory system optimization reflects the evolving landscape of computer architecture research.

Hassan Z. AshtianiView profile

Associate Professor

• Machine Learning Theory
• Privacy-Preserving Algorithms
• Gaussian Mixture Models
• +5 more

Hassan Z. Ashtiani is an Associate Professor in the Department of Computing and Software within the Faculty of Engineering at McMaster University. His academic profile shows consistent engagement in both teaching and research activities, with evidence of active participation in major machine learning conferences and journals through 2025. Dr. Ashtiani's research focuses on the theoretical foundations of machine learning, with particular expertise in privacy-preserving algorithms, Gaussian mixture models, and adversarial robustness. His work bridges statistical learning theory with practical algorithm design, often addressing fundamental questions about sample complexity and computational efficiency in learning systems. A significant portion of his recent work explores the intersection of differential privacy with statistical learning, developing methods for private density estimation and distribution learning. Analysis of his publication record reveals a strong trend toward increasingly sophisticated theoretical frameworks for private and robust learning. His work consistently appears in top-tier venues including NeurIPS, ICML, COLT, and ALT, with recent contributions extending into agnostic private density estimation and robust learning with tolerance. The research demonstrates progression from foundational work on nearest neighbor search and clustering algorithms toward more complex problems in private learning of high-dimensional distributions. Dr. Ashtiani teaches across multiple levels of computer science education, including undergraduate courses in Automata and Computability (COMPSCI 2AC3) and Principles of Programming (COMPSCI 2S03), as well as graduate-level courses such as Fundamentals of Machine Learning (COMPSCI 4ML3) and Theoretical Foundations of Unsupervised Learning (CAS 775). His teaching portfolio shows consistent involvement in machine learning education since at least 2019, with evidence of teaching multiple sections each academic year. His scholarly impact is reflected in mentions across 3 news outlets, reference in 1 policy source, engagement from 7 X users, and 90 readers on Mendeley, suggesting growing recognition of his contributions to theoretical machine learning.

• Mathematical Optimization
• Algorithmic Intelligence
• Energy Systems Modeling
• +5 more

Thorsten Koch serves as Head of the Department of Applied Algorithmic Intelligence Methods within the Division of Mathematical Algorithmic Intelligence at Zuse Institute Berlin (ZIB). His research spans mathematical optimization, energy systems modeling, quantum computing applications, and scientometrics. Koch leads significant research projects including FAN (focusing on AI in scholarly communication), UNSEEN (energy scenarios), HPO-NAVI (research software visibility), and Multi-Energy Models for European Energy System Planning. Koch's research interests center on developing advanced optimization algorithms for complex systems, particularly in energy networks and scientific data analysis. His work bridges theoretical mathematics with practical applications in gas network optimization, wind farm design, portfolio management, and quantum computing. He has pioneered methods for large-scale mixed-integer programming, scenario generation, and the integration of machine learning with traditional optimization techniques. His recent publications demonstrate growing emphasis on quantum optimization, scientometrics, and the application of AI to scientific communication infrastructure. His publication trends reveal a strategic expansion from traditional mathematical optimization into quantum computing applications and scientific data infrastructure. Recent work shows increasing collaboration across disciplines - connecting energy systems analysis with financial modeling, integrating machine learning with optimization solvers, and applying computational methods to scientometrics. The 15 most recent articles highlight three major thrusts: quantum optimization (33%), energy systems modeling (27%), and scientific data infrastructure (40%), reflecting his leadership in both theoretical algorithm development and practical implementation for societal challenges. Koch actively contributes to research infrastructure through leadership roles in projects like KOBV (Berlin-Brandenburg Cooperative Library Network), HDC (Humanities Data Centre), and CIB (future library networks). His work on the DeepGreen initiative focuses on establishing legally secure workflows for implementing open-access components in scientific publication licensing agreements, demonstrating his commitment to open science principles and research data management.

• Emergent Software Systems
• Runtime Adaptation
• Component-Based Software
• +7 more

Professor Barry Porter is a faculty member at Lancaster University in the School of Computing and Communications . His research focuses on emergent software platforms that address software complexity through component models , meta-software platforms , and machine learning . Key areas include distributed systems, cloud integration with sensor nodes, green computing, and real-time visualization. Research Interests : Runtime adaptation in complex systems Self-assembling software architectures Machine learning for code optimization Distributed emergent systems at scale Green computing for multi-core environments Edge-cloud continuum integration Recent Publication Trends : His 2025 work explores genetic improvement for software using speciation algorithms , program geometry projection , and multi-agent decision frameworks . Earlier studies (2022-2024) investigate edge-cloud systems , neural transfer learning , and ecosystem curation in emergent software. Supervision & Projects : He supervises PhD student Ben Craine and leads projects like B-EGI (Bio-Enhanced Genetic Improvement) and BBC Prosperity Partnership for media delivery. Collaborations span environmental IoT, multi-agent learning, and fog computing. Labs & Groups : Affiliated with the Lancaster Intelligent, Robotic and Autonomous Systems Centre , Centre of Excellence in Environmental Data Science , and the Distributed Systems group.

Sean AnderssonView profile

Professor

• Systems and Control Theory
• Robotics
• Nanotechnology
• +12 more

Sean Andersson is a Professor in Mechanical Engineering and Systems Engineering at the College of Engineering, Boston University, and serves as Director of the BU Robotics Lab. His research bridges systems and control theory with applications in nanotechnology , atomic force microscopy , and robotics . His work in nanobioscience focuses on single molecule tracking and high-speed imaging in atomic force and fluorescence microscopy, leveraging control theory to enhance imaging capabilities. In robotics, he develops stochastic control methods for autonomous systems operating in complex environments, emphasizing multi-agent systems , sparsely sampled data , and symbolic control frameworks . Recent publications highlight trends in receding horizon control , persistent monitoring , neural style transfer for imaging , and stochastic policy optimization . The Andersson Lab also explores compressive sensing and optimal control for sensor networks and nanoscale fluid dynamics.

Lev LevitinView profile

Professor

• Information Theory
• Computer Networks
• Quantum Information
• +3 more

Lev Levitin is a Distinguished Professor in the Department of Electrical & Computer Engineering and Division of Systems Engineering at Boston University, with office PHO 332 and contact email levitin@bu.edu. His primary academic focus spans information theory, quantum communication, and computer network architecture. Education: PhD, USSR Academy of Sciences, Gorky University, 1969 Levitin's research integrates fundamental physics with information systems, emphasizing quantum measurement theory, bioinformatics, and the physical limits of computation. His work explores critical phenomena in network dynamics, virtual cut-through routing algorithms, and thermodynamic constraints in information processing. This interdisciplinary approach bridges theoretical physics, computer engineering, and complex systems analysis to address foundational questions in reliable computing. Analysis of his 15 most recent publications reveals two dominant research threads: (1) rigorous modeling of interconnection networks with emphasis on latency, saturation, and phase transitions in multidimensional topologies, and (2) quantum information theory investigations into physical limits of communication, energy requirements, and measurement constraints. The network studies consistently employ virtual cut-through routing as a core methodology, while quantum works establish fundamental bounds on information retrieval and computational speed. Scientific Awards: Life Fellow, IEEE Member, International Academy of Informatization Levitin leads the Reliable Computing Laboratory at Boston University, teaching foundational and advanced courses including Introduction to Engineering, Logic Design, Probability Theory, and specialized graduate courses in Information Theory and Discrete Mathematics. His educational contributions span undergraduate instruction through doctoral supervision, though specific student names and current grant funding details are not documented in the provided materials.

Sainyam GalhotraView profile

Assistant Professor

• Databases
• Data Management
• Responsible Data Science
• +7 more

Sainyam Galhotra is an Assistant Professor in the Department of Computer Science at Cornell University. His research focuses on developing data science tools for effective and responsible analytics, leveraging techniques from causal inference, data management, theoretical computer science, machine learning, and human-computer interaction to address challenges in trustworthy system design including robustness, explainability, and fairness. Education: Postdoc: University of Chicago PhD: University of Massachusetts Amherst (supervised by Barna Saha) BTech: Indian Institute of Technology Delhi (IIT Delhi) (supervised by Prof. Amitabha Bagchi) Research Interests: Dr. Galhotra's research spans several interconnected areas in data science and artificial intelligence. His work primarily focuses on Responsible Data Science , where he develops methods to ensure that data-driven systems operate fairly and transparently. Within this broad area, his specific interests include: Causal Inference techniques for understanding cause-effect relationships in complex data Algorithmic Fairness approaches to mitigate bias in machine learning systems Explainable AI methods that make black-box models more interpretable Data Management systems for efficient and reliable data processing Entity Resolution techniques for integrating data from multiple sources Trustworthy System Design that addresses robustness, explainability, and fairness His recent publications demonstrate a clear trend toward developing frameworks that combine causal reasoning with practical data management systems, particularly focusing on how to make data-driven decisions more transparent and equitable. The intersection of database systems with fairness considerations appears to be a particularly active area of his research. Scientific Awards: Rising Star in Data Science at the Data Science Institute, UChicago (Oct 2021) Computing Innovation Fellowship Award Recipient (by CRA, CCC and NSF) (Apr 2021) DAAD AInet Fellow (Feb 2021) ACM SIGMOD Entity Resolution Programming Contest – Top 5 finalist (May 2020) Most reproducible paper award in SIGMOD 2018 and 2019 (Jun 2019) First recipient of Krithi Ramamritham Computer Science Scholarship (Jun 2019) Best paper award in SIGSOFT FSE 2017 (May 2017) Dr. Galhotra is actively seeking students to collaborate with on his research projects. His work has been supported by various fellowships and awards, including the prestigious Computing Innovation Fellowship. He has mentored several students through his research projects, with a focus on developing the next generation of data scientists who can build responsible and trustworthy systems. His research group appears to focus on the intersection of database systems and responsible AI, developing tools like HypeR for causal reasoning, Ver for view discovery, and Nexus for correlation discovery in spatio-temporal data. This work suggests a cohesive research agenda centered around making data systems more transparent, fair, and user-friendly.

Mehmet KoyutürkView profile

Professor

• Systems Biology
• Computational Genomics
• Network Biology
• +4 more

Mehmet Koyutürk serves as the Andrew R. Jennings Professor in the Department of Computer and Data Sciences at Case Western Reserve University's Case School of Engineering, with additional affiliation as a Member of the Cancer Genomics and Epigenomics Program at the Case Comprehensive Cancer Center. His computational research bridges algorithm development with biological applications, focusing on network-structured data analysis to address complex biomedical challenges. Dr. Koyutürk earned his Ph.D. in Computer Science from Purdue University following B.S. and M.S. degrees in Electrical Engineering and Computer Engineering from Bilkent University. His primary research domains include high-throughput biological data analysis, systems/network biology methodologies, data mining algorithms, and scientific computing optimization, with particular emphasis on phosphorylation networks, genomic interactions, and multi-omics integration. Recent publication trends reveal expanding applications of his network science expertise into Alzheimer's disease phosphoproteomics, bipolar disorder biomarker discovery, and intimate partner violence analysis, while maintaining core contributions to graph neural networks and biological link prediction. His group actively develops open-source analytical tools like RokaiXplorer for phospho-proteomic data accessibility. Scientific Recognition Andrew R. Jennings Professorship Dr. Koyutürk leads multiple NIH-funded initiatives including R01-LM012980 for phosphoproteomics analysis, U01-CA198941 (BD2K program) for big network integration, and R01-LM011247 for GWAS enhancement, complemented by NSF CAREER Award CCF-0953195. He serves on the steering committee for CWRU's Systems Biology and Bioinformatics graduate programs and as Associate Editor for IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB), with extensive collaboration through Mark Chance's Center for Proteomics and Bioinformatics. His laboratory specializes in developing scalable algorithms for biological network analysis, currently advancing projects on kinase-substrate association prediction, co-phosphorylation network characterization in cancer, and network-based approaches to intimate partner violence data mining, with strong emphasis on translating computational methods into biomedical insights through open-source software dissemination.

• Algorithms
• Computational Complexity
• Theoretical Computer Science

Yassine Ghannane is a Research Fellow at the Department of Computer Science , University of Copenhagen , specializing in Algorithms and Complexity . University: University of Copenhagen Department: Department of Computer Science Research Focus: Theoretical computer science, permutation-based evolutionary algorithms, computational complexity His recent work includes runtime analysis and theory development for permutation-based evolutionary algorithms, as well as module-based neural network mapping heuristics. Publications span 2022–2024 with interdisciplinary applications in machine learning and optimization. Contact: yagh@di.ku.dk | Office: Universitetsparken 1, 2100 København Ø, Denmark

Ilaria PerugiaView profile

Professor

• Numerical methods for PDEs
• Finite element methods
• Discontinuous Galerkin methods
• +6 more

Ilaria Perugia is a University Professor (Univ.-Prof.) and Chair of Numerics of PDEs at the Department of Mathematics, Faculty of Mathematics, University of Vienna. She also serves as Deputy Head of the Research Platform Erwin Schrödinger International Institute for Mathematics and Physics. Her research focuses on numerical methods for partial differential equations with applications in computational physics and engineering. Professor Perugia's primary research interests include: Numerical methods for PDEs Finite element methods Discontinuous Galerkin methods Trefftz methods Virtual element methods Space-time methods Computational electromagnetics Wave propagation problems Nonlinear reaction-diffusion problems Her work spans theoretical analysis, algorithm development, and practical implementation of numerical methods for solving complex physical phenomena. Her recent publications demonstrate a strong focus on space-time methods, virtual element methods, and structure-preserving discretizations for wave equations, heat equations, and other PDEs. She has made significant contributions to the development of stable and efficient numerical schemes that preserve important physical properties of the underlying continuous problems, particularly in the context of wave propagation and computational electromagnetics. Professor Perugia leads a research group comprising several researchers and students including Mattia Corti, Matteo Ferrari, Monica Nonino, Andrea Scaglioni, Paul Stocker, Enrico Zampa, and Marco Zank. Her group actively collaborates on projects related to numerical analysis and scientific computing, with particular emphasis on developing novel discretization techniques for challenging PDE problems.

Jamie MorgensternView profile

Associate Professor

• Machine Learning
• Ethics & Fairness
• Human-Centered AI
• +3 more

Jamie Morgenstern is an Associate Professor at the Paul G. Allen School of Computer Science & Engineering , University of Washington . She was previously an assistant professor at Georgia Tech and a Warren Center Fellow at University of Pennsylvania . Expertise: Ethics & Fairness, Human-Centered AI, Machine Learning Education: PhD in Computer Science from Carnegie Mellon University (2015) Her research examines the social impact of machine learning and ensuring ML models do not exacerbate societal inequalities. She investigates robustness to human-generated training data, fairness in clustering and active learning, and algorithmic equity in recommendation systems. Recent publications focus on interactive ML systems , fairness constraints , and privacy-preserving methods across conferences like NeurIPS, ICML, and AIES. Key subfields include multimodal learning , membership inference attacks , and data equity . Scientific Awards: NSF Career award for "Strategic and Equity Considerations in ML" Simons collaboration project Simons Award for Graduate Students in Theoretical Computer Science (2014-2016) NSF GFRP fellowship Microsoft Research Graduate Women's Scholarship Spotlight presentation at NeurIPS 2015 Mentoring: She advises current PhD students Rachel Hong , Jie (Claire) Zhang , and Yuanyuan (Chloe) Yang . Former advisees include Daniel Jiang (MS), Bhuvesh Kumar (PhD), and Angel (Alex) Cabrera (BS). Grants: Funded by NSF Career award and Simons collaboration projects. Previously supported by Simons, NSF, and Microsoft Research fellowships. Labs & Collaborations: Collaborates with researchers like Michael Kearns , Aaron Roth , and Avrim Blum . Affiliated with the Allen School's Artificial Intelligence research group.

• graph algorithms
• optimization
• high-dimensional geometry
• +3 more

Yang P. Liu is an Assistant Professor in the Computer Science Department at Carnegie Mellon University's School of Computer Science. Previously, he was a Postdoctoral Member at the Institute for Advanced Study and earned his PhD from Stanford University under the supervision of Aaron Sidford. He completed his undergraduate studies at MIT, graduating in May 2018. His educational background includes: PhD in Computer Science, Stanford University (Advisor: Aaron Sidford) Bachelor's degree, Massachusetts Institute of Technology (graduated May 2018) Dr. Liu's research spans the intersection of mathematics and computer science, with particular focus on graph algorithms , optimization , high-dimensional geometry , and additive combinatorics . His work often develops novel algorithmic techniques that bridge theoretical insights with practical applications. He has made significant contributions to areas such as convex optimization, linear programming, and combinatorial problems. His teaching includes courses like "A Principled Approach to Optimization" (CS 15-759), which covers rigorous treatments of convex optimization topics including gradient descent, interior point methods, linear regression, linear programming, and sparsification. His extensive publication record in top-tier conferences (FOCS, STOC, SODA) demonstrates a consistent focus on developing almost-linear time algorithms for fundamental graph problems, optimization techniques, and combinatorial theorems. Recent work shows increasing emphasis on combinatorial lines, corners theorem, and k-CSP approximability, while maintaining strong connections to optimization theory and graph algorithms. Dr. Liu has received notable recognition for his work: National Defense Science and Engineering Graduate (NDSEG) Fellowship (2018-2021) Google PhD Fellowship (2022-2023) Best Paper award at FOCS 2022 for "Maximum Flow and Minimum-Cost Flow in Almost Linear Time" Best Student Paper at STOC 2021 for "Discrepancy Minimization via a Self-Balancing Walk" His research has been supported by prestigious fellowships including the NDSEG Fellowship and Google PhD Fellowship. His work on graph algorithms, optimization, and combinatorics involves collaborations with researchers across theoretical computer science and mathematics. His publications often involve co-authors from multiple institutions, suggesting active research collaborations across the field. Dr. Liu maintains an active research program with a focus on developing efficient algorithms for fundamental computational problems. His recent work continues to push the boundaries of what's computationally feasible in graph algorithms, optimization, and combinatorial mathematics, with particular emphasis on achieving almost-linear time complexity for challenging problems.