جستجوی استاد راهنمای دانشگاهی

Amitabha Bagchiمشاهده پروفایل

استاد

• Data Algorithmics
• Probability and Networks
• Theoretical Computer Science
• +۷ مورد دیگر

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.

Ram Vasudevanمشاهده پروفایل

دانشیار

• Optimization and control of nonlinear systems
• Legged robot locomotion
• Autonomous systems safety
• +۴ مورد دیگر

Ram Vasudevan is an Associate Professor and Associate Chair of Graduate Studies in the Department of Robotics at the University of Michigan. His research focuses on developing tools for safe and robust deployment of robotic systems, emphasizing optimization, nonlinear control, and real-world applications. Key areas include legged robot locomotion, shared control systems, and safety-critical autonomous systems. Research Interests: Optimization and control of nonlinear systems, locomotion of legged robots, shared control active safety systems, and automation of diagnostic/rehabilitative tasks. His ROAHM Lab prioritizes mathematical guarantees for robotic performance, with applications in medical robotics, autonomous vehicles, and soft robotics. Recent work emphasizes trajectory optimization, sensor fusion, and safety-aware control strategies. He has contributed to benchmarks for autonomous vehicle perception and novel methods in thermal image restoration using neural radiance fields. Awards: None explicitly listed in provided text. Labs/Teams: Directs the ROAHM Lab, collaborating on projects like robotic tail mechanics, real-time motion planning, and sensor data analysis. Active in academic conferences including RSS and ICRA.

• Topological Data Analysis
• Data Visualization
• Computational Topology
• +۵ مورد دیگر

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

• Graph Algorithms
• Optimization
• High-Dimensional Geometry
• +۳ مورد دیگر

Yang P. Liu is an Assistant Professor at Carnegie Mellon University 's Department of Computer Science . He received his PhD from Stanford University under the supervision of Aaron Sidford and previously studied at MIT . Fields of Interest : Graph Algorithms, Optimization, High-Dimensional Geometry, Additive Combinatorics, Theoretical Computer Science. His research focuses on algorithmic design and analysis for graph problems, optimization, and combinatorics, with applications in machine learning and complexity theory. Recent work includes advancements in parallel repetition games , combinatorial lines , and dynamic graph algorithms . In 2024, his research spanned FOCS , STOC , and RANDOM conferences, addressing problems in k-CSPs , min-cost flow , and hypergraph sparsification . Earlier contributions (2023) included deterministic flow algorithms and spectral hypergraph techniques. Scientific Awards : NDSEG Fellowship (2018-2021), Google PhD Fellowship (2022-2023), FOCS Best Paper (2022), STOC Best Student Paper (2022), FOCS Best Student Paper (2021). He teaches CS 15-759 , a graduate course on convex optimization theory and applications, covering gradient descent, interior point methods, and algorithmic sparsification techniques.

Ruihong Huangمشاهده پروفایل

دانشیار

• Natural Language Processing (NLP)
• Information Extraction
• Machine Learning
• +۶ مورد دیگر

Ruihong Huang is an Associate Professor in the Department of Computer Science and Engineering at Texas A&M University, part of the College of Engineering. She holds a Ph.D. from the University of Utah (2014) and completed a postdoctoral fellowship at Stanford University. Her research focuses on Natural Language Processing (NLP) with emphasis on information extraction, event recognition, media bias analysis, and ethical AI applications. She teaches courses like Information Storage and Retrieval (CSCE 470), Natural Language Processing (CSCE 638), and has advised numerous PhD, Master’s, and undergraduate students. Key research contributions include work on event coreference resolution, discourse analysis, and detecting media bias through event relation graphs. Huang has developed benchmark datasets like UAL-Bench and EMONA, and her work spans applications in disaster management, fake news detection, and moral reasoning in LLMs. She is a recipient of the NSF CAREER Award and serves on program committees for top conferences like ACL and EMNLP. Her academic service includes roles as Area Chair for ACL 2024 and Senior Area Chair for EMNLP 2024. She maintains an active lab group focusing on NLP fundamentals and real-world applications, with projects involving propaganda identification, polarity calibration for opinion summarization, and multimodal dialog act classification. Huang has published over 80 papers in top-tier venues such as NAACL, EMNLP, ACL, and NeurIPS.

• Theoretical Computer Science
• Algorithm Design and Analysis
• Graph Algorithms
• +۵ مورد دیگر

Debmalya Panigrahi is a Professor and Associate Chair in the Department of Computer Science at Duke University. He holds a PhD in Theoretical Computer Science from MIT and has prior affiliations with Microsoft Research, Bell Labs, and the Simons Institute for Theory of Computing. His research focuses on algorithms, particularly graph algorithms, algorithms under uncertainty, and learning-augmented methods. He has received NSF CAREER and other awards, and his work spans peer-reviewed publications in top venues like STOC, FOCS, and SODA. He advises PhD students and mentors postdocs, emphasizing theoretical contributions with practical applications. His teaching includes courses on approximation algorithms, graph algorithms, and discrete mathematics. Education: PhD (MIT, advised by David Karger), MSc (Indian Institute of Science, advised by Ramesh Hariharan), BSc (Jadavpur University). Research highlights include fastest algorithms for graph connectivity, learning-augmented approximation methods, and online algorithms. Funded by NSF, ARO, Google, and others. Current projects explore network reliability, hypergraph algorithms, and algorithmic fairness. His lab collaborates across theory, AI/ML, and databases at Duke. Recent Grants: NSF CCF-2006512, CCF-1618286, CCF-1350537 Labs/Teams: Duke Algorithms Lab, Theory Group, Collaborations with CS-Econ and AI/ML groups Publications span 150+ papers, with 5+ journal articles in SIAM Journal of Computing and ACM Transactions. Recent focus on integrating machine learning into classical algorithms to improve worst-case performance bounds. Advised 10+ PhD students, many now in academia (e.g., UI Chicago, UT Dallas) and industry (Google, Microsoft).

Asaf Ferberمشاهده پروفایل

استادیار

• Combinatorics
• Random Graphs
• Probabilistic Methods
• +۱ مورد دیگر

Asaf Ferber is Associate Professor in Mathematics at University of California, Irvine, School of Physical Sciences. His research spans discrete mathematics including combinatorial games, random graphs, extremal hypergraph theory, and quantum computation. Research explores Hamiltonian cycles in random graphs, structural properties of pseudorandom graphs, and quantum algorithms for combinatorial problems. Recent work develops quantum approaches to graph learning and sparse recovery in random matrices. Awards: NSF CAREER Award Sloan Fellowship Distinguished Early Career Faculty Award for Research Air Force Research Grant NSF-BSF Grant Organizes conferences including SoCalDM Symposium and Desert Discrete Math Workshop, mentoring graduate students through UCI's Probability and Combinatorics Seminar.

Jundong Liمشاهده پروفایل

استادیار

• Data Mining
• Machine Learning
• Graph Machine Learning
• +۱۲ مورد دیگر

Jundong Li is an Assistant Professor at the University of Virginia with primary appointment in the Department of Electrical and Computer Engineering and secondary appointments in Computer Science and the School of Data Science. He is affiliated with the School of Engineering and Applied Science and conducts research at the intersection of machine learning, data mining, and artificial intelligence. Education: Ph.D. in Computer Science, Arizona State University, 2019 M.Sc. in Computer Science, University of Alberta, 2014 B.Eng. in Software Engineering, Zhejiang University, 2012 His research focuses on graph machine learning , trustworthy and fair AI , and large language models . He investigates how to make deep learning models more interpretable, robust, and equitable, especially in graph-structured data and NLP applications. His work combines causal inference, feature selection, and model explanation techniques to build reliable AI systems. His recent publications (2024–2022) reveal a strong trend toward large language models , with topics including in-context learning, knowledge editing, and collaborative reasoning. Simultaneously, he continues pioneering research on fairness and interpretability in graph neural networks , addressing structural bias, adversarial attacks, and node attribution. His work is highly interdisciplinary, spanning computer science, data science, and social impact. Scientific Awards: SIGKDD Rising Star Award (2024) PAKDD Best Paper Award (2024) NSF CAREER Award (2022) SIGKDD Best Research Paper Award (2022) JP Morgan Faculty Research Award (2021, 2022) Cisco Faculty Research Award (2021) Stanford/Elsevier Top 2% Scientist (2024) Jundong Li actively advises graduate students, as seen in his co-authored papers with researchers like Song Wang, Yushun Dong, and Binchi Zhang. His research is generously funded by the National Science Foundation (NSF) through multiple programs including CAREER, III, SaTC, SAI, and S&CC, as well as by the Department of Energy (DOE) , Office of Naval Research (ONR) , Jefferson Lab , and industry partners including JP Morgan, Cisco, Netflix, and Snap . He leads a dynamic research group focused on advancing the frontiers of graph learning and trustworthy AI, with projects on causal inference, model unlearning, and explainable systems. His lab contributes to both theoretical foundations and real-world applications in public health, transportation, and network security.

• Machine Learning
• Artificial Intelligence
• Data Science
• +۷ مورد دیگر

Pan Xu is a tenure-track assistant professor with joint appointments in the Department of Biostatistics & Bioinformatics, Department of Computer Science, and Department of Electrical & Computer Engineering at Duke University. Previously, Xu was a Postdoctoral Scholar Research Associate at Caltech's Department of Computing and Mathematical Science and earned a Ph.D. in Computer Science from UCLA. Xu's research focuses on developing computationally- and data-efficient machine learning algorithms with strong empirical performance and theoretical guarantees. Xu's research interests center around Machine Learning with broad applications in Artificial Intelligence, Data Science, Optimization, Reinforcement Learning, and High Dimensional Statistics. The research specifically targets real-world problems in Bioinformatics and Healthcare, with recent work emphasizing distributionally robust decision making, efficient exploration strategies, and multi-agent systems. Xu has developed novel algorithms that address the challenges of exploration in sequential decision making and robustness to distributional shifts between training and deployment environments. Xu's recent publications demonstrate a strong trend toward developing theoretically grounded yet practical algorithms for reinforcement learning and bandit problems, with particular emphasis on distributionally robust methods, efficient exploration techniques, and applications to healthcare. The work spans both theoretical analysis (providing minimax optimal regret bounds) and practical implementations (validated on benchmarks like Atari games and real healthcare datasets). Whitehead Scholar award from Duke University School of Medicine (2023) Best Paper Award at ACM FAccT 2023 for Queer In AI paper PIMCO Postdoctoral Fellowship in Data Science (2022) TMLR Featured Certification (2023) NSF award on approximate sampling based exploration (2023) Xu actively mentors multiple Ph.D. students across Duke's Biostatistics & Bioinformatics, Computer Science, and Electrical & Computer Engineering programs, with several alumni now pursuing doctoral studies at top institutions. The research group has secured competitive funding including an NSF award for approximate sampling based exploration for sequential decision making. Xu serves as an action editor for TMLR and as an area chair for major conferences including ICML, NeurIPS, AAAI, ICLR, and AISTATS. Xu leads a dynamic research group focused on sequential decision making, with projects spanning theoretical algorithm development, implementation of practical systems, and applications to healthcare and bioinformatics. The group maintains active collaborations across Duke's medical and engineering schools, with recent work applying machine learning to epidemic forecasting during the pandemic.

Anil Madhavapeddyمشاهده پروفایل

استاد

• Environmental Computing
• Climate Change Informatics
• Distributed Systems
• +۵ مورد دیگر

Anil Madhavapeddy serves as Professor of Planetary Computing at the University of Cambridge's Department of Computer Science and Technology and directs the Cambridge Centre for Carbon Credits (4C). A Fellow of Pembroke College, he integrates systems research with environmental conservation through the Computer Laboratory's Environment and Energy Group. His career spans industry leadership (NetApp, Citrix, Intel), academic appointments (Cambridge, Imperial, UCLA), and entrepreneurial ventures (XenSource, Unikernel Systems, Docker). Madhavapeddy earned his PhD at Cambridge's Computer Laboratory in 2006. His research bridges computational systems and planetary-scale environmental challenges, with deep expertise in open-source development (OCaml, Xen, Docker, OpenBSD) and technology strategy advising for organizations including Zededa, Tezos Foundation, and Tarides. His work centers on environmental computing and climate informatics, leveraging distributed systems and functional programming to develop sensing infrastructure for conservation. Recent projects focus on carbon credit systems, AI-driven biodiversity monitoring, and sustainable computing architectures that minimize ecological footprints while maximizing analytical capability. Analysis of his 2025 publications reveals a concentrated effort on AI-integrated conservation tools, privacy-preserving carbon accounting, and energy-efficient computing. Key themes include spatial networking for ecological data, LLM-enhanced evidence retrieval in conservation science, and novel metrics for extinction risk assessment—demonstrating computational innovation applied to urgent planetary boundaries. No scientific awards were documented in the source material. Madhavapeddy advises multiple technology firms on strategic development while leading the Cambridge Centre for Carbon Credits, though specific grant funding details remain unreported. He actively contributes to the Environment and Energy Group at Cambridge's Computer Laboratory and directs the interdisciplinary Cambridge Centre for Carbon Credits (4C). His open-source leadership spans critical infrastructure projects including OCaml, Xen, and Docker, fostering collaborative development communities that underpin modern cloud and container technologies.

B. Aditya Prakashمشاهده پروفایل

دانشیار

• Data Science
• Machine Learning
• Artificial Intelligence
• +۶ مورد دیگر

Aditya Prakash is an Associate Professor and Associate Chair for Academic Affairs in the School of Computational Science and Engineering at Georgia Tech. He holds a PhD from Carnegie Mellon University (2012) and a B.Tech from IIT Bombay (2007). His research focuses on data science, machine learning, and AI applied to epidemiology, healthcare, security, and urban computing. His work has led to impactful tools used by organizations like CDC, ORNL, and Walmart. Notable awards include the NSF CAREER Award (2018) and IEEE's 'AI Ten to Watch' (2017). Education: PhD (Computer Science, CMU, 2012), B.Tech (IIT Bombay, 2007) Research Interests: Epidemic forecasting, network analysis, healthcare informatics, and large-scale data-driven solutions for societal challenges. He has authored over 80 papers and holds two patents. His lab develops methods for disease modeling, urban infrastructure analysis, and cybersecurity. Key projects include the NSF-funded BEHIVE initiative for pandemic prediction and collaborations with MIDAS network for infectious disease modeling. Awards: NSF CAREER, Facebook Faculty Award, IEEE AI Recognition, and multiple best-paper awards. His group advises students across PhD, MS, and undergraduate levels, with notable alumni in academia and industry. Labs & Affiliations: Core faculty at ML@GT (Machine Learning Center) and IDEaS (Institute for Data Engineering and Science). Active in organizing conferences like AAAI, KDD, and SIGMOD.

Ola Svenssonمشاهده پروفایل

دانشیار

• Approximation Algorithms
• Combinatorial Optimization
• Computational Complexity
• +۳ مورد دیگر

Ola Svensson is an Associate Professor at the School of Computer and Communication Sciences , EPFL. His research spans approximation algorithms, combinatorial optimization, computational complexity, and scheduling. He holds an ERC Consolidator Grant (2023–) and previously received an ERC Starting Grant (2014–2019) and SNF grant (2019–2023). Education: PhD in Computer Science from IDSIA, Università della Svizzera italiana (2009) M.Sc. from Uppsala University (2005) Research Focus: Svensson develops novel techniques for NP-hard problems, with emphasis on primal-dual methods, LP/SDP hierarchies, and hardness proofs. His work applies to clustering, scheduling, network design, and submodular optimization. Publications: His 15 most recent works (2018–2021) focus on learning-augmented algorithms, robust optimization, and improved approximations for clustering/TSP. Key trends include integration of ML with classical algorithms and quasi-polynomial methods for combinatorial problems. Awards: Best Paper Awards at FOCS (2011, 2017) and STOC (2018) I&C Teaching Award at EPFL Advising & Grants: He advises 6 current PhD students and graduated 8 others. Major grants include ERC Starting Grant 'OptApprox' (€1.4M) and ERC Consolidator Grant 'POTCO' (€2M). Teaching: Leads courses in Advanced Algorithms, Computational Complexity, and Approximation Algorithms. He developed pedagogical frameworks for scribe notes and project-based learning in theoretical computer science.

Aaron Smithمشاهده پروفایل

دانشیار

• Applied Probability
• Computational Statistics
• Monte Carlo Methods
• +۳ مورد دیگر

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.

Yang Songمشاهده پروفایل

دانشیار

• Computer Vision
• Deep Learning
• Multimodal AI
• +۷ مورد دیگر

Yang Song is an ARC Future Fellow and Scientia Associate Professor at the School of Computer Science and Engineering , University of New South Wales (UNSW) . She serves as Associate Head of School (Research) and Co-Director of iCinema , focusing on AI and Computer Vision applications for social good. Education: BEng in Computer Engineering (Nanyang Technological University, Singapore), PhD in Computer Science (UNSW, 2013) Research Areas: Biomedical image analysis, human-centred AI, graph data modeling, neuro-symbolic learning, and AI trustworthiness. Her work develops domain-specific deep learning models for radiological segmentation, histopathology cancer analysis, and 3D reconstruction. Recent projects address explainability in LLMs, fairness in AI, and human-robot interaction frameworks. With over 200 peer-reviewed publications in top venues like CVPR , MICCAI , and NeurIPS , her research spans biomedical imaging, robotics, and general multimodal AI. Scientific Awards include: 2024: ARC Industrial Transformation Research Hub for Human-Robot Teaming 2023: Google Inclusion Research Award 2022: NHMRC Ideas Grant for computational brain imaging 2021: UNSW Engineering Research Excellence Award 2020: Scientia Fellowship (UNSW) 2019: ARC Future Fellowship She supervises 24 current PhD/MPhil students and has graduated 15 advisees, including placements at Harvard University and Siemens Healthineers. Her grants include collaborations with Surf Life Saving Australia and industry partnerships for AI-driven solutions.

• Artificial Intelligence
• Marketing Analytics
• Digital Marketing
• +۴ مورد دیگر

Natasha Zhang Foutz is a Research Associate Professor of Commerce at the McIntire School of Commerce, University of Virginia . Her work bridges Artificial Intelligence , Marketing Analytics , and Consumer Behavior , with a focus on Digital Content and Location-Based Services . She teaches Marketing Analytics , Entertainment Marketing , and Marketing Models across undergraduate to PhD programs. Ph.D. in Marketing, Cornell University M.S. in Statistics & Marketing, Cornell University B.S. in Economics, Fudan University Her research investigates: AI-Powered Entertainment Marketing : Using machine learning to analyze consumer behavior in digital content. Privacy and Ethical Data Use : Studying consumer trade-offs between privacy and public good, especially during crises like the COVID-19 pandemic . Location Analytics : Leveraging mobile data for urban economics, real estate, and emergency response modeling (e.g., MobiRescue for disaster logistics). Prosocial Consumer Behavior : Exploring how social capital and diversity drive innovation and policy compliance. Recent publications highlight trends in Reinforcement Learning for crisis management, Privacy-Preserving AI , and Freemium Pricing Models in digital markets. Her awards include the 2025 UVA Outstanding Researcher Award and the 2018 Mallen Award for motion picture studies. Natasha serves as an Area Editor for multiple journals, emphasizing Data Science in marketing. She has advised numerous PhD students and collaborated on projects analyzing Big Data in consumer mobility and platform economics.