Find Academic Supervisors

Andrew ChildsView profile

Professor

• Quantum Algorithms
• Quantum Information Processing
• Quantum Simulation
• +2 more

Andrew Childs is a Professor at the University of Maryland, affiliated with the Department of Computer Science and the Institute for Advanced Computer Studies (UMIACS). He serves as Director of the NSF Quantum Leap Challenge Institute for Robust Quantum Simulation (RQS) and is a Fellow at the Joint Center for Quantum Information and Computer Science (QuICS). His research focuses on quantum algorithms for simulating physical systems, algebraic problems, and quantum walk protocols, with applications in quantum computing and computational complexity. University of Maryland Institute for Advanced Computer Studies (UMIACS) Joint Center for Quantum Information and Computer Science (QuICS) NSF Quantum Leap Challenge Institute for Robust Quantum Simulation Childs' research spans quantum simulation, quantum Fourier transform, phase estimation, and Hamiltonian dynamics. He has developed techniques to reduce quantum computational resources for simulating quantum systems and explored limitations of quantum computers through hidden subgroup problems and non-unitary dynamics. His publications cover diverse areas including quantum walk optimization, Hamiltonian simulation methods, and applications to cryptography and condensed matter physics. Recent works address spatial search algorithms, product formulas for commutators, and quantum routing protocols. As an educator, Childs has taught courses on quantum algorithms and information processing at both the University of Maryland and University of Waterloo, with lecture notes and materials spanning multiple years. Contact: amchilds@umd.edu | Office: ATL 3359 | Affiliated with University of Maryland's quantum research institutes.

Yang ZhouView profile

Associate Professor

• Big Data Algorithms
• Data Mining
• Machine Learning
• +5 more

Yang Zhou is an Associate Professor in the Department of Computer Science and Software Engineering at Auburn University, part of the Samuel Ginn College of Engineering. His research focuses on big data algorithms, machine learning, data mining, and distributed computing. He has contributed to advancements in federated learning frameworks, graph mining tools, and spatial machine learning for environmental applications like flood mapping. Education includes a Ph.D. in Computer Science from Georgia Tech (2021), M.E. in Computer Application Technology from Chongqing University (2016), and B.E. in Engineering from Jiangnan University (2014). His work emphasizes scalable algorithms for large-scale systems, with tools like DirDense for dense subgraph mining and FedASMU for federated learning optimization. Recent publications explore adversarial robustness, blockchain strategies in IoT, and curriculum-based learning for large language models. He advises on interdisciplinary projects at the intersection of AI and environmental science.

Karsten BorgwardtView profile

Professor

• Machine Learning
• Systems Biology
• Bioinformatics
• +3 more

Karsten Borgwardt is a Professor and Director of the Department of Machine Learning and Systems Biology at the Max Planck Institute of Biochemistry. He holds a PhD in Computer Science (2007) from LMU Munich and has held academic positions at ETH Zürich, Universität Tübingen, and the Max Planck Institutes in Tübingen. His research focuses on machine learning applications in biology and medicine, including biomarker discovery, personalized medicine, and systems biology. Education: PhD in Computer Science (2007), LMU Munich M.Sc. in Biology (2003), University of Oxford Diplom (M.Sc. equivalent) in Computer Science (2004), LMU Munich Research Interests: Development of machine learning algorithms for large biomedical datasets Pattern recognition in genomic and clinical data Applications in sepsis biomarkers, antimicrobial resistance prediction, and personalized medicine Grants & Projects: Scientific Coordinator of Marie Curie Networks (2013-2022) Swiss National Science Foundation Starting Grant (2014) Personalized Swiss Sepsis Study (CHF 5.3M, 2018) Awards: Krupp Award (2013), Golden Owl Teaching Award (2017), multiple 'Top 40 under 40' recognitions (2014-2016). Labs: Leads the Machine Learning and Systems Biology Department at MPI, collaborating with 22+ labs in sepsis research and international networks.

Brandon SewardView profile

Associate Professor

• Ergodic theory
• Topological dynamics
• Descriptive set theory
• +1 more

Brandon Seward is an Associate Professor of Mathematics at the University of California San Diego (UC San Diego), where they conduct research and teach in the Department of Mathematics. They use the pronouns they/them or he/him . Education Ph.D. in Mathematics, University of Michigan , 2015 Research Interests Their work lies at the intersection of ergodic theory, topological dynamics, descriptive set theory, and group theory . They investigate geometric, combinatorial, and entropic properties of actions of countable groups, with special emphasis on the divide between amenable and non-amenable groups. Publications & Research Impact Across 27 refereed papers (2014-2024), Seward has advanced entropy theory for non-amenable groups, Borel combinatorics of group actions, and structure theorems for measure-preserving actions. Their work has appeared in top journals such as Inventiones Mathematicae , Journal of the American Mathematical Society , and Duke Mathematical Journal . Scientific Awards Michael Brin Dynamical Systems Prize for Young Mathematicians (2018) – awarded for outstanding contributions to dynamical systems. Teaching & Mentorship Seward regularly teaches core undergraduate courses (e.g., Math 142A Introduction to Analysis) and organizes the UC San Diego Group Actions Seminar , a weekly research forum featuring international speakers. They serve as a faculty mentor and are actively involved in graduate student supervision and seminar coordination. Contact & Office Email: bseward@ucsd.edu Office: AP&M 5739, 9500 Gilman Drive, La Jolla, CA 92093-0112

Leslie Ann GoldbergView profile

Professor

• Algorithms
• Complexity Theory
• Randomised Algorithms
• +5 more

Leslie Ann Goldberg is a Senior Research Fellow at St Edmund Hall and Professor of Computer Science at the University of Oxford. She currently serves as Head of the Department of Computer Science (on sabbatical 2025-26) and focuses on foundational problems in Algorithms and Complexity Theory , particularly randomised algorithms for network communication, machine learning, and statistical physics models. Her research includes solving Aldous' 1987 conjecture on backoff protocol instability (with John Lapinskas), developing rigorous mathematical analysis frameworks for algorithmic efficiency, and advancing approximate counting techniques via Markov Chain Monte Carlo methods (with Andreas Galanis and collaborators). Key projects involve graph homomorphisms , Moran process dynamics , and #BIS complexity class analysis. Recent publications (2023-2024) span topics like Sybil defense mechanisms, low-temperature sampling on random graphs, and parameterised subgraph counting modulo 2. Her work demonstrates cross-disciplinary impact in computational biology, statistical physics, and database theory. Scientific Awards include Best Paper Prizes at ICALP 2016, ICALP 2010, and IPEC 2017. She supervises PhD student Paulina Smolarova and collaborates extensively with researchers in Oxford and beyond.

David EppsteinView profile

Professor

• Graph Algorithms
• Computational Geometry
• Graph Theory
• +3 more

David Eppstein is a Distinguished Professor of Computer Science at the University of California, Irvine (UCI), affiliated with the Donald Bren School of Information & Computer Sciences. He holds academic leadership roles as director of the Center for Algorithms and Theory of Computation and associate director of the Center for Algorithms, Combinatorics, and Optimization. His research focuses on graph algorithms, computational geometry, discrete mathematics, and geometric graph theory. Eppstein earned a B.S. in Mathematics from Stanford University (1984) and a Ph.D. in Computer Science from Columbia University (1989). Research Interests: Graph drawing, information visualization, dynamic graph algorithms, mesh generation, optimal triangulation, K-shortest paths, subgraph isomorphism, data depth, exponential-time algorithms for NP-hard problems. Awards: ACM Fellow (2012), AAAS Fellow (2017), Distinguished Professor (2020), Best Paper Awards (2023, 2022), and SIAM recognition. Grants: Co-PI on a $1.2M NSF grant (2022) for geometric graph research, and previous NSF grants for algorithm studies (2016). His work bridges theoretical computer science and practical applications, including contributions to graph visualization, geometric algorithms, and combinatorial optimization. Notable recent achievements include resolving open questions in graph biplanarity and authoring the book Forbidden Configurations in Discrete Geometry (2018).

Keval VoraView profile

Associate Professor

• Parallel & Distributed Computing
• Irregular Big Data Processing
• High Performance Computing

Keval Vora is an Associate Professor at the School of Computing Science, Simon Fraser University. His research focuses on scalable solutions for modern data analytics systems, particularly in graph processing and distributed computing. He leads the Parallel Data and Computing Lab (PDCL), developing systems like Peregrine , GraphBolt , and GraphBolt . Contact: TASC1 9419, keval@sfu.ca. Education: PhD in Computer Science from the University of California, Riverside (2017). Previously worked at Morgan Stanley on low-latency trading software. Teaching: Courses include Distributed Systems (CMPT 431) and Special Topics in Networks and Systems (CMPT 982). Advises graduate and undergraduate students on projects involving distributed systems and graph analytics. Research Interests: Parallel/Distributed Computing, Irregular Big Data Processing, High-Performance Computing. His work emphasizes efficient techniques with provable guarantees for large-scale systems. Software Contributions: Peregrine (pattern-based analytics), GraphBolt (dynamic graph processing), and Lumos (disk-based graph processing). These systems address challenges in scalability, efficiency, and real-time data handling.

Sanjay JainView profile

Professor

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

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

• Algebra
• Combinatorics
• Number Theory
• +3 more

Gábor Somlai is a mathematics researcher at Eötvös Loránd University's Faculty of Science, affiliated with the Department of Algebra and Number Theory since 2006. He is a core member of the HUN-REN-ELTE Geometric and Algebraic Combinatorics Research Group (previously MTA-ELTE until 2023) and participates in the Asymptotic Group Theory ERC project. His institutional roles include contributions to the Mathematics Doctoral School and the Institute of Mathematics. His research spans Algebra , Combinatorics , and Number Theory , with emphasis on spectral sets, tiling problems, group theory, and finite geometry. Recent work explores cyclotomic polynomials, the generalized trifference problem, and connections between tiling and spectral properties in finite abelian groups. His publications reveal a strong focus on combinatorial number theory and algebraic methods in discrete geometry. Somlai's publication trends show sustained contributions to theoretical foundations of tiling and spectral sets (testing Fuglede's conjecture in cyclic groups) Cayley graph properties and CI-group classifications polynomial methods in finite geometry and direction problems His work bridges pure algebra with combinatorial applications, often resolving long-standing conjectures in specialized domains. As part of the HUN-REN-ELTE research group, he collaborates on geometric and algebraic combinatorics projects, leveraging ERC funding for asymptotic group theory investigations. His research infrastructure includes access to the Alfréd Rényi Institute of Mathematics (http://www.renyi.hu) resources.

Muhammad RashedView profile

Assistant Professor

• Electronic Design Automation (EDA)
• In-Memory Computing
• Artificial Intelligence Acceleration
• +5 more

Dr. Muhammad Rashed is an Assistant Professor in the Department of Computer Science and Engineering at the University of Texas at Arlington, within the College of Engineering. He holds a Ph.D. in Computer Engineering from the University of Central Florida (2024) and a B.S. in Electrical and Electronics Engineering from Bangladesh University of Engineering and Technology (2015). Ph.D. : Computer Engineering, University of Central Florida, 2024 B.S. : Electrical and Electronics Engineering, Bangladesh University of Engineering and Technology, 2015 His research focuses on electronic design automation (EDA), in-memory computing, AI acceleration, and sustainable computing. He explores novel computing paradigms to overcome the limitations of traditional architectures, particularly in data-intensive applications such as AI and scientific computing. His work emphasizes hardware-software co-design and leveraging emerging non-volatile memories for energy-efficient processing. The 15 most recent publications highlight a consistent focus on in-memory computing, particularly in path-based and flow-based architectures, logic synthesis, and AI acceleration. Key themes include optimization, fault tolerance, verification, and the use of advanced data structures like sentential decision diagrams. His work is published in top-tier venues such as DAC, ICCAD, ASP-DAC, and IEEE/ACM journals. Scientific Awards: UTA CARES Grant for OER Creation Research Experiences for Undergraduates (REU) Grant Alireza Seyedi Doctoral Research Innovation Endowed Scholarship David T. & Jane M. Donaldson Memorial Scholarship IEEE/ACM William J. McCalla ICCAD Best Paper Award Nomination Best Research Video Award, Design Automation Conference (DAC) Dr. Rashed advises several graduate and undergraduate students in the NextGen Computing Lab and is involved in research grants including the UTA CARES Grant and REU funding. He actively contributes to academic service through roles such as conference TPC member, journal reviewer (e.g., IEEE TCAD, ACM TODAES), and committee participation in the department and college. His lab, the NextGen Computing Lab, is dedicated to building scalable, energy-efficient computing systems for next-generation AI and scientific workloads, aligning with national initiatives in advanced computing.

• Artificial Intelligence
• Computational Social Choice
• Computational Complexity
• +5 more

Edith Hemaspaandra is a Professor in the Department of Computer Science at the Rochester Institute of Technology (RIT), located in the Golisano College of Computing and Information Sciences. She holds a BS, MS, and Ph.D. in Computer Science from the University of Amsterdam (the Netherlands). Her research focuses on computational social choice, computational complexity theory, logic complexity, and formal methods. She teaches courses such as CSCI-262/263 (Introduction to Computer Science Theory) and CSCI-664 (Computational Complexity). Her work explores the algorithmic aspects of voting systems, including election manipulation, control, and bribery, with a focus on their computational complexity. She has also contributed to formal methods for automata theory, educational tools like JFLAP extensions, and the study of complexity classes such as LWPP and WPP. Her research bridges theoretical computer science with practical applications in social choice theory and algorithm design. Her grants include an NSF-funded project on computationally protecting elections from manipulation (2011). She actively publishes in top venues like STACS and ISAAC, addressing topics ranging from graph reconstruction to hybrid election models. Though no awards are explicitly listed, her extensive publication record highlights her contributions to theoretical computer science. Her advising and grant activities include collaborative research projects and educational tool development. She is affiliated with RIT’s Department of Computer Science and maintains a personal website and ORCID profile.

• Machine Learning
• Deep Learning
• Graph Analysis
• +6 more

Michalis Vazirgiannis is a Professor at LIX, École Polytechnique (France) leading the Data Science and Mining (DaSciM) group. With academic backgrounds in Physics (Athens University), AI (Heriot-Watt University), and Informatics (Athens University), he has conducted research at Fraunhofer, Max Planck MPI, and INRIA/FUTURS while teaching at institutions across Greece, France, China, and Spain. His research spans Machine/Deep Learning for Graphs (GNNs, graph kernels, embeddings) Text Mining & NLP (Graph-of-Words, biomedical text analysis) Combinatorial Optimization for pandemic forecasting and energy systems Event/Anomaly Detection in time series and sensory data Industrial collaborations with Airbus, Google, Tencent, and BNP . He has supervised 29 completed PhD theses, published over 250 papers, and received prestigious awards including Marie Curie and Tencent Rhino-Bird Fellowships. His team leads the ANR-HELAS Chair (2020-2025) focusing on heterogeneous data deep learning.

Katrin TentView profile

Professor

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

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

M. Tamer ÖzsuView profile

Professor

• Data Science
• Database Systems
• Distributed Data Management
• +3 more

M. Tamer Özsu is a University Professor of Computer Science at the David R. Cheriton School of Computer Science, University of Waterloo, where he holds a Cheriton Faculty Fellowship. He also serves as a Distinguished Visiting Professor at Tsinghua University and is the Founding Director of Waterloo-Huawei Joint Innovation Laboratory since 2018. His extensive contributions to computing have earned him numerous prestigious awards including the 2024 ACM Presidential Award for long-standing and significant contributions to the computing field. Professor Özsu's research focuses on data engineering aspects of data science, particularly addressing data management issues with two main foci: management of non-traditional data and large-scale distributed data management. He is renowned for his seminal book "Principles of Distributed Database Systems" (co-authored with Patrick Valduriez), now in its fourth edition, and the "Encyclopedia of Database Systems" (co-edited with Ling Liu), in its second edition. His work bridges theoretical foundations with practical system implementations, targeting grand societal challenges through computational approaches. His recent publications reveal a strong trend toward graph analytics, streaming data processing, and the integration of large language models with vector data management. The research shows increasing focus on GPU-accelerated graph processing, RDF query optimization, and multimodal data analysis, reflecting the evolution of data management challenges in the era of big data and AI. His work continues to address fundamental challenges in distributed data systems while adapting to emerging technologies and application domains. Scientific Awards and Fellowships ACM Presidential Award (2024) IEEE TCDE Education Award (2024) IEEE Innovation in Societal Infrastructure Award (2022) CS Can | Info Can Lifetime Achievement Award (2018/2019) ACM SIGMOD Test-of-Time Award (2015) ACM SIGMOD Contributions Award (2006) The Ohio State University College of Engineering Distinguished Alumnus Award (2008) Fellow of the Royal Society of Canada Fellow of the American Association for the Advancement of Science (AAAS) Life Fellow of the Association for Computing Machinery (ACM) Life Fellow of the Institute of Electrical and Electronics Engineers (IEEE) Fellow of the Asia-Pacific Artificial Intelligence Association (AAIA) Elected member of the Science Academy, Türkiye Professor Özsu has been deeply involved in academic leadership and community building. As Founding Editor-in-Chief of ACM Books (2013-2019), he launched a series that by 2019 had published 28 major books with another 30 under contract. His service to ACM, particularly through SIGMOD, has been exemplary and widely recognized. He directs the Waterloo-Huawei Joint Innovation Laboratory, which focuses on cutting-edge research in data management and distributed systems, fostering strong industry-academia collaboration.

Carey E. PriebeView profile

Professor

• computational statistics
• statistical pattern recognition
• statistical image analysis
• +5 more

Carey E. Priebe is a Professor in the Department of Applied Mathematics and Statistics at the Whiting School of Engineering, Johns Hopkins University. He maintains strong affiliations with multiple research centers including the Johns Hopkins University Center for Imaging Science, the Mathematical Institute for Data Science, and the Human Language Technology Center of Excellence. His academic career spans several decades with significant contributions to statistical methodology and theory. Dr. Priebe's research focuses on computational statistics, statistical pattern recognition, and statistical inference for high-dimensional and graph data. His work bridges theoretical statistics with practical applications in areas such as brain connectome mapping, network analysis, and image processing. He has made significant contributions to spectral graph theory, graph matching, and vertex nomination, with applications ranging from neuroscience to national security. His publication record demonstrates consistent contributions to statistical methodology, with a notable emphasis on graph-based statistical methods. His research trajectory shows increasing focus on network data analysis, particularly in the last decade, with applications to brain mapping and connectome analysis as evidenced by his NSF BRAIN Initiative grant and Nature publication. 2013 Erskine Fellow (University of Canterbury) 2011 McDonald Award for Excellence in Mentoring and Advising 2010 ASA SDNS Distinguished Achievement Award 2009 Erskine Fellow (University of Canterbury) 2008 National Security Science and Engineering Faculty Fellow 2008 Pond Award for Excellence in Teaching NSF BRAIN EAGER grant recipient (2014) Professor Priebe has supervised an extensive number of doctoral students whose work spans statistical methodology, network analysis, and machine learning. His students have secured positions at prestigious institutions including academia (University of Wisconsin, Boston University), government research labs, and major technology companies (Microsoft, Facebook, Amazon). His research has been supported by significant grants from NSF, DARPA, and other agencies focused on national security applications and fundamental statistical methodology development. He maintains active collaborations across multiple disciplines and institutions, as evidenced by his numerous conference presentations and visiting appointments including at The Alan Turing Institute and The Isaac Newton Institute. His work bridges theoretical statistics with practical applications in neuroscience, security, and data science.