Find Academic Supervisors

Jan Madsen is a Professor at DTU Compute, Technical University of Denmark, and Head of the Embedded Systems Engineering section. His research focuses on system-level modeling and design of embedded computing systems, particularly cyber-physical systems, microfluidic biochips, and synthetic biology applications. Develops design automation tools and methodologies for embedded systems Supervises numerous PhD students and leads major research projects Research Interests Key areas include: Embedded systems-on-a-chip Cyber-Physical Systems (Internet-of-Things) Microfluidic Lab-on-Chip devices Synthetic biology with molecular computing Design, modeling, and optimization of complex systems Scientific Awards DATE Fellow (2019) IEEE CEDA Outstanding Recognition (2019) DTU Scientific Advise Award (2013) Best Paper Awards at MECO (2013) and CASES (2009) Jorck’s Foundation Research Award (1995) Publications His 14+ journal papers and 115+ conference papers demonstrate expertise in: SystemC-based modeling frameworks Energy-aware sensor networks Self-healing eDNA architectures Microfluidic biochip synthesis RTOS modeling and MPSoC exploration

• Embedded Systems
• Cyber-Physical Systems
• Microfluidic Biochips
• +5 more

Seth Lewis Gilbert is a Professor and Head of the Department of Computer Science at the National University of Singapore (NUS), within the School of Computing . He holds the Dean's Chair Associate Professor title and focuses on algorithms for large-scale distributed systems , emphasizing scalability and fault-tolerance . His work spans wireless networks , contention resolution , dynamic networks , and blockchain protocols . Ph.D. in Computer Science, MIT (2007) M.S. in Computer Science, MIT (2003) B.S. in Electrical Engineering & Mathematics, Yale University (1999) His research explores trusted coordination in systems with untrusted and unreliable participants, addressing challenges like Byzantine agreement , load balancing , and contention resolution . He has pioneered formal frameworks for accountability in distributed protocols and developed novel algorithms for asynchronous task allocation . Recent publications include work on consensus protocols , leader election , and contention resolution , reflecting his focus on dynamic network environments . His research has earned recognition at venues like DISC, ICDCS, and CCS. Scientific Awards & Honors : Young Researcher Award (NUS, 2014) Faculty Teaching Excellence Award (2013/14, 2014/15, 2015/16) School of Computing Teaching Excellence Honour Roll (2016-2021) Best Paper Awards at DISC (2023, 2022), ICDCS (2022), IPDPS (2022) Best Student Paper Award at DISC (2022) He serves on the Steering Committee for DISC as Treasurer and has chaired program committees for DISC, OPODIS, and SPAA. His work bridges foundational algorithmic theory with practical applications in blockchains and dynamic networked systems .

• Distributed Systems
• Algorithms & Theory
• Systems & Networking
• +6 more

Suguman Bansal is an Assistant Professor in the School of Computer Science at Georgia Institute of Technology. Her research focuses on formal methods and their applications to artificial intelligence, programming languages, and machine learning. Previously, she held an NSF/CRA Computing Innovation Postdoctoral Fellowship at the University of Pennsylvania (2020-2022) and completed her PhD at Rice University (2016-2020). Education: PhD in Computer Science, Rice University (2016-2020) MS in Computer Science, Rice University (2014-2016) BSc (Honors) in Mathematics and Computer Science, Chennai Mathematical Institute (2011-2014) Research Interests: Formal methods, reinforcement learning, reactive synthesis, quantitative verification, and trustworthy AI systems. Her work bridges logic-based formal methods with modern AI challenges, emphasizing safety, reliability, and generalization in AI systems. Key Contributions: Pioneering work on specification-guided reinforcement learning, compositional synthesis algorithms, and formal verification of AI systems. Notable tools include Lisa (LTLf synthesis tool) and DiRL (compositional reinforcement learning framework). Awards: 2020 NSF CI Fellowship, 2021 MIT EECS Rising Star, 2023 ATVA Best Paper Award, and Keynote Speaker at SAS 2022. Advising & Grants: Advises PhD and Master’s students in reinforcement learning and formal methods. Lead PI on a collaboration grant with IIT Bombay (2024) and recipient of a ~$250K NSF/CRA postdoctoral grant. Labs/Teams: Leads the BansalLab at Georgia Tech, focusing on trustworthy AI through formal methods and algorithmic innovation.

• Formal Methods
• Artificial Intelligence
• Programming Languages
• +4 more

Deian Stefan is an Associate Professor at the University of California San Diego (UCSD) in the Department of Computer Science and Engineering . His research spans security , programming languages , and systems , with a focus on building principled and practical secure systems. He has served as a co-founder and Chief Scientist at Intrinsic (acquired by VMWare) and contributed to standards bodies like the W3C WebAppSec and Node.js Security Working Groups . His research interests include: Secure Systems : Web frameworks, browser designs, sandboxing, runtime systems Language-Based Security : Constant-time programming, memory safety, information flow control Verification : Security verification, static/symbolic analysis tools WebAssembly and JavaScript JITs security Deian Stefan has received multiple scientific awards , including several Distinguished Paper Awards at venues like POPL, ICFP, and USENIX Security, as well as the IEEE Cybersecurity Award for Practice (2022) and CSAW 2020 First Place for Applied Research. He has taught courses on Computer Security (CSE 127, CSE 227) and advanced topics in Building Secure Systems (CSE 291) using Rust, WebAssembly, and blockchain security. His work has been supported by collaborations with industry and academia, including projects like RLBox and COWL .

• security
• programming languages
• systems
• +7 more

Oana Balmau is an Assistant Professor in the School of Computer Science at McGill University, where she leads the Data-Intensive Storage and Computer Systems Laboratory (DISCS Lab). She also holds a status-only appointment at the University of Toronto and serves as a working group chair for MLPerf Storage. Her research focuses on creating storage infrastructure that enables fast and energy-conscious insights from data, with particular emphasis on storage and persistent memory technologies for machine learning, data science, and edge computing workloads. Dr. Balmau's research interests span computer systems, with specific focus on: Design and implementation of efficient key-value stores Storage systems for machine learning workloads Edge computing infrastructure Persistent memory technologies Performance optimization of data-intensive systems Her recent work has led to significant contributions in storage benchmarking through the MLPerf Storage benchmark and in edge computing frameworks. The MLPerf Storage benchmark has become an industry standard for evaluating storage performance in machine learning environments, while her work on hierarchical edge computing addresses security and performance challenges in distributed edge environments. Her publications show consistent high-impact contributions to top systems venues, with recent work focusing on processing-in-memory virtualization, stream processing reconfiguration, and efficient data preprocessing pipelines. Dr. Balmau has received numerous awards for her research, including: SEC 2024 Best Paper Award for "Falcon: Live Reconfiguration for Stateful Stream Processing on the Edge" MLCommons Hero Award 2023 for leadership as MLPerf Storage working group chair ACM SIGOPS Dennis M. Ritchie Doctoral Dissertation Award 2021 Honorable Mention CORE John Makepeace Bennett Award 2021 for the best Computer Science doctoral dissertation in Australia and New Zealand USENIX ATC 2019 Best Paper Award for "SILK: Preventing Latency Spikes in Log-Structured Merge Key-Value Stores" As an educator, Dr. Balmau teaches courses on advanced computer systems, operating systems, and principles of computer systems design at McGill University. She has served on program committees for top systems conferences including SOSP, SIGMOD, FAST, and EuroSys, and has co-organized workshops on resource-efficient machine learning and edge computing. She leads the DISCS Lab, which focuses on two main research directions: Systems for ML (including the MLPerf Storage benchmark) and Edge computing (including frameworks for fast and secure edge computing in hierarchical edge environments).

• Storage Systems
• Persistent Memory
• Key-Value Stores
• +4 more

William F. Schneider is the Keating-Crawford Professor of Chemical Engineering and Chair of the Department of Chemical and Biomolecular Engineering at the University of Notre Dame's College of Engineering. He also holds a concurrent professorship in the Department of Chemistry and Biochemistry. Dr. Schneider leads the Computational Environmental Catalysis research group focused on applying density functional theory (DFT) simulations to solve problems in energy and the environment. Dr. Schneider's educational background includes a Ph.D. in Chemistry from Ohio State University (1991) and a B.S. in Chemistry from the University of Michigan-Dearborn (1986). Before joining Notre Dame in 2004 as an Associate Professor, he worked at the Ford Motor Company Research Laboratory where he developed expertise in catalytic chemistry related to automobile emissions control. Dr. Schneider's research focuses on molecular-scale understanding of heterogeneous catalysis, with particular emphasis on energy-related applications. His group uses computationally intensive molecular simulations to understand and predict chemical properties and reactivity from first principles. Key research areas include: Zeolites for NOx reduction Catalysis at metal surfaces Catalysis for shale gas conversion Energy-directed catalysis Carbon capture and conversion Sustainable bio/fossil fuels His recent publications demonstrate a strong focus on computational approaches to understanding catalytic mechanisms, particularly in zeolite systems for environmental applications and energy conversion processes. The research often combines density functional theory with microkinetic modeling to provide molecular-level insights into catalytic processes. Dr. Schneider has received numerous honors including: Dorini Family Chair of Energy Studies Keating-Crawford Professor of Chemical Engineering Fellow of the American Association for the Advancement of Science James A. Burns, C.S.C., Award for outstanding mentorship of doctoral students Executive Editor of the Journal of Physical Chemistry C As an advisor, Dr. Schneider mentors numerous graduate students and postdocs in the Computational Molecular Sciences and Engineering Laboratory (CoMSEL). His research group collaborates closely with experimentalists to validate computational findings and accelerate their application. Current projects include investigations into plasma-catalytic processes, copper-zeolite systems for methane oxidation, and computational screening of catalysts for various energy applications. Dr. Schneider's research is supported by various grants focusing on energy conversion, environmental catalysis, and computational materials design. He leads the Computational Environmental Catalysis group which is part of the broader CoMSEL research community at Notre Dame.

• Carbon Capture and Conversion
• Catalysis
• Energy Conversion and Efficiency
• +7 more

Yannis Chronis is an incoming Assistant Professor at the Department of Computer Science , ETH Zurich (starting August 2025), where he will join the ETH Systems Group . Prior to this, he spent 3 years as a Systems Researcher at Google's Systems Research Group in Sunnyvale, USA. He holds a Ph.D. in Computer Science from the University of Wisconsin-Madison (advised by Prof. Jignesh Patel) and a Bachelor's/Master's from the University of Athens, Greece (advised by Prof. Yannis Ioannidis). His research focuses on optimizing databases and data processing for modern hardware through software-hardware co-design. Key areas include database efficiency in memory-centric architectures, learned query optimizers, and cloud resource management. His work is supported by a Facebook Fellowship and has been recognized with the EDBT 2016 Medal for best paper. Teaching: Taught CS 564 - Database Management Systems at UW-Madison (Spring 2022). Service: Served on program committees for SIGMOD, VLDB, CIDR, and others, and chairs the CIDR Proceedings Committee. Key Publications: His recent work includes studies on memory-centric computing for databases, cardinality estimation benchmarks, and adaptive query processing techniques.

• Database Systems
• Hardware-Software Co-design
• Data Processing Efficiency
• +3 more

Fred B. Schneider is the Samuel B. Eckert Professor of Computer Science at Cornell University , where he has been a faculty member since 1978. His career spans foundational work in trustworthy systems , fault-tolerant distributed systems , and system security . He served as department chair from 2014–2018 and previously earned a B.S. in Engineering from Cornell (1975) and a Ph.D. in Computer Science from Stony Brook University (1978).

• Trustworthy Systems
• Fault-Tolerant Distributed Systems
• System Security
• +6 more

Prof. Martin Haenggi is the Frank M. Freimann Professor of Electrical Engineering and Concurrent Professor in the Department of Applied and Computational Mathematics and Statistics at the University of Notre Dame. He holds a Dr.sc.techn. (Ph.D.) from ETH Zurich and has been at Notre Dame since 2000. His research focuses on stochastic geometry and wireless networks, including cellular, heterogeneous, vehicular, and millimeter-wave systems. He has held sabbaticals at UCSD (2007–2008), EPFL (2014–2015), and ETH Zurich (2021–2022). Education: Dipl.-Ing. (M.Sc.), ETH Zurich, 1995 Dr.sc.techn. (Ph.D.), ETH Zurich, 1999 Research interests emphasize stochastic geometry for analyzing network performance, including coverage, interference, and reliability in wireless systems. Key areas include meta distributions, spatial-temporal analysis, and network optimization. His work has been recognized with IEEE Fellow status, Clarivate Highly Cited Researcher distinction, and NSF CAREER Award (2005). Grants and Awards: NSF Award (Deep Stochastic Geometry: 2020–2023) NSF Award (Toward a Stochastic Geometry for Cellular Systems: 2015–2019) Rice Prize (2017), Best Survey Paper Award (2017), and Best Tutorial Paper Award (2010) from IEEE Communications Society Teaching includes advanced courses on stochastic geometry, wireless networks, and signal processing. His lab focuses on theoretical and applied aspects of network modeling, with collaborations in industry and academia.

• Wireless Networks
• Stochastic Geometry
• Communications Theory
• +7 more

Gordon Plotkin is a Professor at the School of Informatics, University of Edinburgh, where he is affiliated with the Laboratory for Foundations of Computer Science (LFCS). His research lies at the intersection of theoretical computer science and programming language semantics, with a profound influence on the formal understanding of computation. His research interests include Programming Language Theory, Semantics of Programming Languages, Domain Theory, Operational Semantics, Lambda Calculus, Type Theory, Concurrency Theory, and Algebraic Effects. His seminal work on structural operational semantics and domain theory has laid the foundation for modern semantics of programming languages. His publications span over five decades, showing a sustained and evolving research trajectory from foundational work in lambda calculus and domain theory to recent contributions in algebraic effects, probabilistic computation, and biochemical systems modeling. The articles demonstrate a consistent focus on formal methods, mathematical rigor, and the algebraic structure of computational effects. He has collaborated with leading researchers including Martín Abadi, John Power, Glynn Winskel, and John Reynolds. His work continues to influence both theoretical and practical developments in programming languages and systems. Gordon Plotkin has made foundational contributions to computer science, particularly through his development of structural operational semantics and domain-theoretic models of computation. He has advised numerous researchers and supervised many influential PhD theses, though specific student names are not listed in the provided text. His work has been supported by long-standing affiliations with the Laboratory for Foundations of Computer Science and the University of Edinburgh, and he has contributed to major collaborative projects in programming language design and verification. He is associated with several research groups and labs, most notably the Laboratory for Foundations of Computer Science (LFCS), which serves as a hub for theoretical research in programming languages, semantics, and logic at the University of Edinburgh.

• Programming Language Theory
• Semantics of Programming Languages
• Domain Theory
• +7 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.

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

Jonathan A. Kelner is a Professor of Applied Mathematics in the Department of Mathematics at the Massachusetts Institute of Technology (MIT) and a member of the MIT Computer Science and Artificial Intelligence Laboratory (CSAIL). His research focuses on applying techniques from pure mathematics to solve fundamental problems in algorithms and complexity theory, with the goal of developing practical algorithms for real-world questions. Dr. Kelner received his undergraduate degree from Harvard University and his Ph.D. in Computer Science from MIT in 2006. Before joining the MIT faculty, he spent a year as a member of the Institute for Advanced Study. His educational background has provided a strong foundation for his interdisciplinary research spanning mathematics and computer science. His research interests include combinatorial optimization, mathematical programming, spectral graph theory, distributed computing, machine learning, computational geometry and topology, computational biology, signal processing, and random matrix theory. Kelner's work demonstrates how deep theoretical insights can lead to practical algorithmic improvements, particularly in graph algorithms and optimization problems. His approach often involves connecting seemingly disparate areas of mathematics to create novel algorithmic techniques. Analysis of his recent publications reveals a strong focus on spectral graph theory, optimization algorithms, and the Sum-of-Squares method. His work frequently addresses fundamental questions in theoretical computer science with practical implications for algorithm design. A notable trend in his research is the development of nearly-linear-time algorithms for various graph problems, which represents significant improvements over previous approaches. NSF CAREER Award Alfred P. Sloan Research Fellowship NEC Award for Research in Computers and Communication Sprowls Doctoral Dissertation Award Best Student Paper Award at STOC 2004 Best Paper Award at STOC 2011 Kokusai Denshin Denwa Junior Faculty Chair 2008 Harold E. Edgerton Faculty Achievement Award 2011 School of Science Award for Excellence in Undergraduate Education 2012 Professor Kelner has been actively involved in mentoring students and has received recognition for his teaching excellence, including the School of Science Award for Excellence in Undergraduate Education in 2012. His research has been supported by prestigious grants including the NSF CAREER Award. He has collaborated extensively with researchers across multiple institutions, often working with other leading figures in theoretical computer science to produce groundbreaking results in algorithm design. At MIT, Kelner is part of both the Mathematics Department and CSAIL, positioning him at the intersection of theoretical mathematics and practical computer science. This dual affiliation reflects the interdisciplinary nature of his work, which bridges pure mathematical theory with concrete algorithmic applications.

• Algorithms
• Spectral Graph Theory
• Combinatorial Optimization
• +7 more

Stefania Dumbrava is an Associate Professor of Computer Science at ENSIIE (École Nationale Supérieure d'Informatique pour l'Industrie et l'Entreprise) and a permanent member of the ACMES team in the SAMOVAR laboratory at Télécom SudParis, Institut Polytechnique de Paris. She is also actively involved in the Property Graph Schema Working Group and the European Research Network on Formal Proofs (EuroProofNet). Education PhD in Computer Science, Université Paris-Sud (2016) MSc in Computer Science, Jacobs University Bremen (2012) BSc in Mathematics, Jacobs University Bremen (2010) Research Interests Dumbrava's research lies at the intersection of formal methods and data management . She designs and verifies algorithms and systems for graph databases , with emphasis on property graphs , schema discovery , query optimization , and distributed graph processing . Recently, her work focuses on certifying large-scale distributed graph systems under the ANR JCJC VERDI project (2025–2029). Awards & Honors SIGMOD Best Paper Award 2023 – “PG-Schema: Schemas for Property Graphs” SIGMOD Research Highlight Award 2023 – “Threshold Queries” VLDB 2022 Best Regular Research Paper Runner-Up – “Threshold Queries in Theory and in the Wild” SIGMOD 2025 Distinguished Reviewer Award ICDE 2025 Best Program Committee Member Award EASST Best Software Science Paper Award, ICGT 2025 Students & Grants Dumbrava has supervised numerous research interns and is actively recruiting PhD students for her ANR VERDI project on verified foundations of large-scale distributed graph systems. She has also served on six PhD thesis committees as examiner since 2021. Labs & Teams She leads the ACMES research group within the SAMOVAR laboratory (Télécom SudParis, Institut Polytechnique de Paris), where her team develops formally verified graph-database engines and tools such as GRASP, VerDILog, and DatalogCert.

• Formal methods for databases
• Graph databases
• Property graphs
• +7 more

Jelle Hellings is an Assistant Professor in the Department of Computing and Software at McMaster University , Canada. His research focuses on high-performance large-scale data management systems with a strong theoretical and algorithmic component, including resilient systems (blockchains) , graph databases , and external-memory algorithms . He previously worked as a Postdoc Scholar at the University of California, Davis and earned his PhD from Hasselt University in Belgium. Education: Doctor of Sciences in Computer Science (2018), Hasselt University Master of Science in Computer Science and Engineering (2011), Eindhoven University of Technology His research interests include scalable resilient systems with Byzantine fault tolerance, database theory, graph query languages, constraints on graph data, and external-memory algorithms for large graph datasets. He has authored numerous high-impact publications on blockchain-based resilient systems, query optimization in graph databases, and theoretical advancements in relation algebra expressiveness. Hellings actively contributes to academic service through program committee memberships and tutorial organization, and he currently teaches courses on future resilient databases and foundational computer science topics.

• Resilient Systems
• High-Performance Data Management
• Database Theory
• +10 more

Vijay Laxmi is a Professor in the Department of Computer Science and Engineering at Malaviya National Institute of Technology (MNIT) Jaipur, India. With over a decade of active research publication from 2014-2024, Dr. Laxmi has established themselves as a prominent researcher in network security, Android security systems, and Network-on-Chip architectures. Their work demonstrates consistent collaboration with Manoj Singh Gaur and numerous doctoral students at MNIT Jaipur. Dr. Laxmi's research interests span Network Security, Android Security, Malware Analysis, Network-on-Chip Architectures, Routing Protocols, Side-Channel Attacks, Wireless Networks, and Mobile Security. Their work bridges theoretical security frameworks with practical implementations, particularly in mobile and embedded systems. Recent publications indicate a growing focus on AI-based security approaches including GAN applications for fuzzing and deep learning for image dehazing. The research trajectory shows increasing sophistication in security analysis techniques, evolving from basic malware detection to advanced side-channel attack analysis and sophisticated network security protocols. Recent publications demonstrate expertise in both theoretical frameworks and practical implementations with applications in real-world security challenges. Dr. Laxmi has mentored numerous graduate students including Vineeta Jain, Anugrah Jain, Sonal Yadav, Mohit Singh, and Gaurav Singal, who appear as co-authors across multiple publications. Their collaborative network extends to researchers at international institutions, indicating strong academic connections beyond their home institution.

• Network Security
• Android Security
• Malware Analysis
• +6 more