Find Academic Supervisors

Md ArifuzzamanView profile

Assistant Professor

• High-Performance Networking
• Quantum Networking
• Distributed Systems
• +3 more

Dr. Md Arifuzzaman is an Assistant Professor in the Department of Computer Science at Missouri University of Science and Technology (Missouri S&T). He specializes in High-Performance Systems, Quantum Networking, and Distributed Systems, focusing on optimizing large-scale system performance and scalability. His work addresses challenges in next-generation networks and storage systems, with publications in top venues like IEEE TPDS and ACM Supercomputing. Education: Ph.D. in Computer Science and Engineering, University of Nevada, Reno (2023) B.S. in Computer Science and Engineering, Bangladesh University of Engineering and Technology (2016) Research Interests: Dr. Arifuzzaman's work spans cutting-edge topics including quantum entanglement routing, reinforcement learning for network optimization, and high-speed file transfer protocols. His research emphasizes practical solutions for emerging technologies like terabit networks and quantum communication systems. Publications: Recent work focuses on quantum network protocols, machine learning-driven network probing, and storage reliability. His articles highlight advancements in both theoretical frameworks and real-world system implementations. Awards: No specific awards mentioned in the provided information. Advising/Grants: Details regarding student advising and grant activities are not explicitly stated in the text.

Sudhakar GantiView profile

Associate Professor

• Cloud Computing Resource Management
• Software Defined Networking (SDN)
• Traffic Management and Quality-of-Service
• +3 more

Sudhakar Ganti is an Associate Professor in the Department of Computer Science at the University of Victoria, part of the Faculty of Engineering and Computer Science. He holds a PhD from the University of Ottawa. His research focuses on cloud computing resource management, software-defined networking (SDN), traffic management, quality-of-service optimization, and performance evaluation through queueing theory. His work bridges theoretical frameworks with practical applications in network efficiency and distributed systems. Dr. Ganti’s expertise includes optimizing resource allocation in fog-cloud systems, enhancing telehealth IoT energy efficiency, and developing dynamic defense frameworks for SDN security. His contributions span network traffic prediction, large file transport protocols, and formal verification of networking systems. He has published extensively in top-tier conferences and journals, addressing challenges in distributed computing, cyber security, and edge computing. His research trends emphasize leveraging reinforcement learning for fog-cloud resource allocation, multi-objective optimization in IoT, and SDN-driven network security. Earlier work includes foundational studies on optical router bypass, cloud workload characterization, and conversational agents for smart environments. Despite his prolific output, no academic awards or grants are explicitly mentioned in his profile.

Charles LingView profile

Professor

• Machine Learning
• Deep Learning
• Artificial Intelligence
• +4 more

Charles Ling is a Professor of Computer Science at Western University, holding the title of Science Distinguished Research Professor. He also serves as Director of the Data Mining and Business Intelligence Lab and Associate Scientist at the Lawson Health Research Institute. His academic background includes a B.Eng. (CS and EE) from Shanghai Jiao Tong University and MSc/PhD from the University of Pennsylvania (UPenn). Research interests span machine learning, deep learning, AI, and healthcare informatics, with notable contributions to the GlucoGuide diabetes management system. He has authored over 220 peer-reviewed papers and a book titled Crafting Your Research Future , focusing on academic career development. Awarded Fellow of the Canadian Academy of Engineering (CAE) and recipient of the First Prize for Best Clinical Research Presentation (2011). Active in grants (NSERC, FedDev, Mitacs) and organizational roles in top conferences (KDD, ICDM). Supervises 5 PhD and 4 MSc students, with notable advisees including Harry Zhang and Victor Sheng. Leverages AI in education to enhance children's cognitive abilities through video-based programs like Power Thinking , approved by Curriculum Services Canada. His work integrates machine learning with healthcare, finance, and software engineering.

Liangping LiView profile

Associate Professor

• Hydrogeology
• Groundwater Modeling
• Data Assimilation
• +5 more

Dr. Liangping Li is an Associate Professor in the Department of Geology and Geological Engineering at South Dakota School of Mines & Technology. He holds a Ph.D. from Technical University of Valencia and an M.S. from China University of Geoscience, with expertise in hydrogeology, groundwater modeling, and geothermal energy systems. Education: M.S., China University of Geoscience; Ph.D., Technical University of Valencia His research focuses on integrating machine learning with groundwater modeling, data assimilation, geostatistics, and optimization of geothermal energy systems. He has pioneered methods combining generative adversarial networks (GANs) and ensemble smoother techniques for inverse modeling in complex aquifers. Recent publications highlight his work on extremal optimization for well placement, progressive growing GANs for facies modeling, and stochastic inversion of fracture networks. His research trends emphasize computational innovation in subsurface flow simulation and sustainable groundwater management. Scientific Awards: NSF RII Track-4 Grant, NSF REU Site Grant, BLM Environmental Monitoring Grant, and appointments as Associate Editor for Advances in Water Resources and Mathematical Geosciences . Dr. Li teaches courses in groundwater engineering, statistical methods, and environmental field camp, while mentoring graduate and undergraduate researchers in subsurface energy and water resource projects.

Sergey NorinView profile

Associate Professor

• Graph Theory
• Combinatorics
• Discrete Mathematics
• +4 more

Sergey Norin is an Associate Professor in the Department of Mathematics and Statistics at McGill University, specializing in Graph Theory and Combinatorics. His research focuses on structural graph theory, extremal problems, and combinatorial optimization, with a particular emphasis on graph minors, Ramsey numbers, and graph coloring. He contributes to theoretical advancements in discrete mathematics and their algorithmic applications. Recent work includes studies on sparse graphs, graph minors, and properties of hereditary families. His articles address topics like twin-width in random graphs, defective coloring, and asymptotic dimensions. Norin holds no listed awards but is active in publishing cutting-edge research in top-tier journals. No specific advising or grants are detailed in the provided information. His academic profile reflects a strong commitment to advancing combinatorial theory through rigorous mathematical analysis.

Noga AlonView profile

Professor

• Combinatorics
• Graph Theory
• Theoretical Computer Science
• +5 more

Noga Alon is a Professor of Mathematics at Princeton University, affiliated with the Mathematics Department. He is renowned for his contributions to Combinatorics, Graph Theory, and Theoretical Computer Science. His research emphasizes algebraic and probabilistic methods, with applications in circuit complexity and combinatorial geometry. Education & Affiliations Current position: Professor at Princeton University. Active in the Princeton Discrete Mathematics Seminar and has led conferences like the Noga60 Birthday Conference. Research Interests Focus areas include Combinatorics (e.g., Ramsey Theory, Graph Coloring), Theoretical Computer Science (e.g., Algorithms, Complexity), and probabilistic and algebraic methods in discrete mathematics. His work bridges combinatorial structures and algorithmic applications, with contributions to expander graphs, randomized algorithms, and extremal graph theory. Publications Over 300 papers, including foundational work on the probabilistic method, expander graphs, and combinatorial algorithms. Notable recent topics include graph coloring, path-finding algorithms (e.g., Color-coding), and spectral techniques for graph problems. Grants & Awards No specific grants or awards listed in available texts, though his academic stature implies prestigious recognition in combinatorics and computer science. Labs & Collaborations Involved in collaborative research through Princeton’s Mathematics Department and international conferences. Leads seminars and co-authors work with prominent researchers like M. Naor, J. Spencer, and others.

Ran RazView profile

Professor

• Complexity Theory
• Quantum Computation
• Circuit Complexity
• +2 more

Professor Ran Raz specializes in complexity theory at Princeton University's Department of Computer Science. His research targets lower bounds in computational models, quantum communication, and derandomization. Current investigations include quantum logspace verifiability and memory-sample tradeoffs in learning algorithms. Research pillars: Boolean/arithmetic circuit complexity Quantum computation and communication Probabilistically checkable proofs Publications reflect a focus on quantum-classical hybrid systems and foundational limits of computation. Lab affiliations: Quantum research group at Princeton CS.

Gabor KarsaiView profile

Professor

• Model-Driven Software Engineering
• Embedded Systems
• Cyber-Physical Systems
• +6 more

Dr. Gabor Karsai is a Distinguished Professor of Computer Science and Professor of Electrical and Computer Engineering at Vanderbilt University's School of Engineering. He also serves as Senior Research Scientist at the Institute for Software-Integrated Systems (ISIS), where he contributes to the Executive Council. With over 30 years in software engineering, his research focuses on embedded systems, model-driven development, resilient software platforms, and AI-driven autonomous systems assurance. He holds a PhD from Vanderbilt and degrees from the Technical University of Budapest. Education: Ph.D. in Electrical and Computer Engineering, Vanderbilt University Dr.Tech. in Computer Engineering, Technical University of Budapest M.S. and B.S. in Electrical Engineering, Technical University of Budapest Affiliations: Co-Associate Chair for Computer Engineering External Member of the Hungarian Academy of Sciences His research interests span model-integrated computing , autonomous systems assurance , and radiation-hardened systems . Recent work emphasizes AI integration into engineered systems and radiation effects mitigation for space applications. He has led major projects on distributed control for smart grids and resilient CPS architectures. Over 200 peer-reviewed publications and four patents reflect his contributions to software engineering and systems integration. Awards & Recognition: External Membership in Hungarian Academy of Sciences Leadership roles in ISIS and Vanderbilt's academic governance Advisees & Grants: While no student list is provided, his projects involve collaborative teams across academia and industry. Major sponsors include NSF, NASA, and DARPA. Current work includes the ALC (Assurance-based Learning-enabled CPS) and MIDAS (Model-based Intent-Driven Adaptive Software) initiatives. Labs & Platforms: Co-developer of the RIAPS distributed CPS platform and the SEAM assurance modeling framework. His labs focus on cyber-physical system design, radiation effects analysis, and autonomous system reliability.

Peter WinklerView profile

Professor

• Discrete Mathematics
• Probability Theory
• Combinatorics
• +2 more

Peter Winkler is William Morrill Professor of Mathematics and Computer Science at Dartmouth College, conducting research in discrete mathematics, probability, and theoretical computer science. His work connects combinatorial problems with statistical physics and algorithmic complexity. Key research areas include: Probabilistic methods in combinatorics and game theory Phase transitions in discrete structures Geometric probability and optimization Mathematical puzzles and paradoxes Winkler's publications resolve fundamental questions in pursuit-evasion theory, geometric set optimization, and combinatorial phase transitions. His work on mathematical puzzles has influenced both academic research and popular mathematics. Current projects explore limit permutations, abelian networks, and new puzzle collections. Honored with the Mathematical Association of America's Lester R. Ford Award and David P. Robbins Prize, Winkler has held visiting positions at the Institute for Advanced Study and Mathematical Sciences Research Institute.

Holden LeeView profile

Assistant Professor

• Machine Learning
• Probability
• Theoretical Computer Science
• +3 more

Holden Lee is an Assistant Professor in the Department of Applied Mathematics and Statistics at Johns Hopkins University, where he joined in 2022. His research focuses on the theoretical foundations of machine learning, probability, and their intersections with theoretical computer science. He explores probabilistic methods in modern machine learning, including deep learning-based generative models and convergence guarantees for sampling algorithms like Markov Chain Monte Carlo. Prior to JHU, he was a postdoc at Duke University and a Simons Fellow at UC Berkeley. He holds a PhD in Mathematics from Princeton University and degrees from MIT and the University of Cambridge. Education: PhD in Mathematics, Princeton University, 2019 MASt in Pure Mathematics, University of Cambridge, 2014 BSc in Mathematics, MIT, 2013 Research Interests: Machine Learning Theory Probabilistic Sampling Methods Generative Models Statistical Learning Theory His work emphasizes theoretical rigor, particularly in understanding the success and limitations of deep learning algorithms and designing efficient sampling techniques beyond classical log-concave settings. Articles Trends: Lee’s recent publications (2022–2024) focus on advancing sampling algorithms for complex distributions, analyzing generative models, and improving convergence guarantees for methods like MCMC and score-based diffusion. His work bridges theory and practice, with applications in multimodal data, text generation, and dynamical systems. Awards: Simons Fellow at UC Berkeley (2021) Advising & Grants: Lee has contributed to projects at NeurIPS and collaborates on research in AI efficiency and theoretical guarantees. He teaches courses on probability and applied mathematics at JHU and Duke. Labs/Teams: His research group focuses on theoretical machine learning and probabilistic methods, with ongoing projects on scalable sampling algorithms and generative model analysis.

Jianqiang ChengView profile

Associate Professor

• Stochastic Programming
• Robust Optimization
• Distributionally Robust Optimization
• +7 more

Dr. Jianqiang Cheng is an Associate Professor in the Department of Systems and Industrial Engineering at the University of Arizona, College of Engineering. He is also a member of the Graduate Faculty and affiliated with the Applied Mathematics and Statistics Graduate Interdisciplinary Programs. His research is centered on optimization under uncertainty with applications in energy systems and logistics. Research Interests: His primary research areas include stochastic programming, robust optimization, distributionally robust optimization, semidefinite programming, and chance-constrained optimization. He applies these methodologies to challenges in power systems, renewable energy integration, microgrid design, and resilient supply chains. The recent publications (2020–2022) reflect a strong trend toward data-driven and computationally efficient methods in optimization. Key themes include distributionally robust optimization under moment and Wasserstein ambiguity, chance-constrained AC optimal power flow, and resilient supply chain modeling under disruptions such as the COVID-19 pandemic. His work frequently appears in top journals like INFORMS Journal on Computing , IEEE Transactions on Power Systems , and European Journal of Operational Research . Scientific Awards: Best Short Paper Award, INFORMS Workshop on Data Science (Fall 2022) NSF CAREER Award, National Science Foundation (Spring 2022) Science Foundation Arizona's 2017 Bisgrove Scholar (Spring 2017) Dr. Cheng has secured significant research funding, including the NSF CAREER Award, supporting his work in data-driven optimization. He collaborates extensively with researchers in energy systems and operations research, including K. Pan, M. Cheramin, A. M. Fathabad, and A. Lisser. While specific advisees are not listed, his role as a member of the Graduate Faculty indicates active supervision of graduate students in systems engineering, applied mathematics, and statistics. His research contributes to the development of advanced optimization models for real-world systems affected by uncertainty, particularly in energy and logistics. Though no specific lab is mentioned, his work implies involvement in computational optimization and energy systems modeling research groups within the College of Engineering.

• Theoretical Computer Science
• Algorithms and Data Structures
• Computational Geometry
• +5 more

Raimund Seidel is a Professor in the Department of Computer Science at Universität des Saarlandes, leading the Chair of Theoretical Computer Science. He is actively involved in research and teaching, focusing on foundational aspects of algorithms and data structures, particularly in computational geometry. His primary research interests include theoretical computer science , design and analysis of efficient algorithms , geometric data structures , randomized algorithms , and combinatorial geometry . His work addresses fundamental problems such as planar point location, convex hull computation, and efficient encoding of triangulations. He also investigates geometric algorithms under the transdichotomous model, leveraging word-level parallelism. The selected publications reflect a long-standing contribution to computational geometry and data structure theory , with a focus on randomized methods and exact complexity analysis. His research combines theoretical rigor with practical implications for algorithm design. Award or honor not found in the provided text. Prof. Seidel has advised several students, including Alexander Malkis , Ralf Osbild , Udo Adamy , Christian Sohler , and others, many of whom have gone on to academic and research careers. No explicit information about grants or funding is available in the text. He leads a research group within the Department of Computer Science at Universität des Saarlandes, mentoring current staff such as László Kozma , Giorgi Nadiradze , and Lavinia Dinu . The group maintains active research in theoretical computer science and computational geometry.

• Data Mining
• Machine Learning
• Clustering Algorithms
• +3 more

Anna Beer is a researcher in the Faculty of Computer Science, specializing in data mining and machine learning with a focus on density-based clustering, spectral clustering, and interactive clustering frameworks. She holds a BSc and MSc in computer science and maintains an ORCID profile (https://orcid.org/0000-0002-6890-997X) for her research contributions. Research Themes: Development of clustering algorithms (e.g., DISCO, Scar, LUCKe), fairness in density-based clustering (FairDen), and applications to molecular dynamics and climate research (DROPP). Collaborations: Works with colleagues like Ira Assent, Christian Plant, and Lars Krieger, with recent contributions to conferences like ICLR 2025. Activities: Presented research on density-connectivity distance at a 2023 oral contribution. Publications: 9 publications since 2019, including 3 in 2025 and 6 in 2024, covering topics from cluster evaluation to deep active learning strategies.

Chao HuView profile

Associate Professor

• Engineering Design under Uncertainty
• Battery Health Diagnostics and Prognostics
• Machine and Structural Health Monitoring
• +3 more

Dr. Chao Hu is the Collins Aerospace Professor in Engineering Innovation and Associate Professor at the University of Connecticut's Department of Mechanical Engineering within the College of Engineering. His research focuses on engineering design under uncertainty, battery health diagnostics, and structural health monitoring. He holds a B.E. from Tsinghua University (2007) and a Ph.D. from the University of Maryland (2011), with prior roles at Medtronic and Iowa State University. Research interests emphasize physics-informed machine learning for prognostics, battery degradation modeling, and reliability-based design optimization. Key publications include work on digital twin models for lithium-ion batteries, federated learning for fleet-wide fault diagnosis, and probabilistic machine learning pipelines for real-time state estimation. He has received awards like the ASME Design Automation Young Investigator Award and highly cited paper recognitions. Dr. Hu serves as Senior Editor for Engineering Optimization and Review Editor for Structural and Multidisciplinary Optimization . His work spans academic leadership in journals and industrial collaborations. Current projects include battery aging datasets (UConn-ILCC and UConn-ISU-ILCC), design for remanufacturing frameworks, and high-rate structural health monitoring techniques.

Frank KellyView profile

Professor

• Random processes
• Networks
• Optimization
• +3 more

Professor Frank Kelly holds the Professor of the Mathematics of Systems at the University of Cambridge , affiliated with the Department of Pure Mathematics and Mathematical Statistics (DPMMS). His work bridges theoretical insights with practical applications in random processes , networks , and optimization . Academic Rank: Professor Department: DPMMS Research Themes: Stochastic systems, network resource allocation, mathematical modeling Kelly’s research focuses on stochastic networks , including congestion control in communication systems, fair bandwidth sharing , and electricity grid optimization . His work often incorporates proportional fairness principles and Markov models to analyze complex systems. Recent publications reveal a trajectory in network dynamics and resource allocation , with applications to electric vehicles, satellite routing, and virtualized networks. His work shows interdisciplinary impact across computer science , telecommunications , and energy systems . Kelly has contributed foundational works like Stochastic Networks (2014) and pioneered models for loss networks and congestion control . He maintains active collaborations and has advised on policy matters, including spectrum auctions and network regulation.