Find Academic Supervisors

Suguman BansalView profile

Assistant Professor

• Formal Methods
• Artificial Intelligence
• Programming Languages
• +4 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.

Fred B. SchneiderView profile

Professor

• Trustworthy Systems
• Fault-Tolerant Distributed Systems
• System Security
• +6 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).

• Secure Decentralized Systems
• Blockchain Technology
• Systems Security
• +3 more

Prof. Bryan Ford leads the Decentralized/Distributed Systems (DEDIS) lab at EPFL. He focuses on secure decentralized systems, including blockchain technology, privacy, and systems security. He earned his Ph.D. from MIT and held faculty positions at Yale University and EPFL. His work spans distributed consensus protocols, peer-to-peer networking, and privacy-preserving systems. Key projects include QuePaxa (timeout-free consensus), UIA (global connectivity for mobile devices), and MedCo (secure healthcare data sharing). He advises numerous PhD students and contributes to open-source projects like Bitcoin collective signing and privacy networks like Riffle. Education: Ph.D., MIT; Postdoctoral work at Yale Research interests include blockchain scalability, consensus algorithms, and cryptographic privacy. His lab develops systems like TRIP for coercion-resistant voting and F3B to mitigate blockchain front-running. His work on NAT traversal and peer-to-peer protocols (e.g., STUN/ICE) remains foundational in network architecture. He emphasizes practical, auditable security solutions such as CertiKOS and atomic cross-chain transactions (Atom). Notable contributions: CoSi (collective signing), OmniLedger (sharded blockchain), and privacy-preserving protocols like PURBs (Protected Unsealable Recursive Boxes). His lab collaborates with Swiss Post to audit e-voting systems and designs democratic cryptocurrencies like PoPCoin.

Ying CaiView profile

Associate Professor

• AI
• Machine Learning
• Data Science
• +4 more

Ying Cai is an Associate Professor in the Department of Computer Science at Iowa State University, joining in 2003 after earning his Ph.D. in Computer Science from the University of Central Florida (2002). His research focuses on AI, machine learning, data science, cybersecurity, privacy protection, and database systems. He leads projects funded by the Air Force Research Laboratory, including work on authentication data structures for rank-aware queries, requiring U.S. citizenship and expertise in linear algebra/cryptography. Dr. Cai’s work spans cybersecurity (e.g., adversarial example defense, secure secret sharing), spatio-temporal systems (e.g., traffic risk prediction, check-in time modeling), and healthcare AI (e.g., cervical spine diagnosis with transformers). His publications emphasize practical applications of ML in privacy, security, and distributed systems. Professional roles include Associate Editor for Multimedia Tools and Applications (since 2009), Co-chair for COMPSAC TAIN/NCIW symposium (2014–2017), and TPC Chair for Mobilware 2010. His service includes contributions to INFOCOM, ICDCS, and MDM conferences. Current research opportunities exist for graduate students with strong programming/math skills, particularly in cryptography and linear algebra. He emphasizes interdisciplinary work, such as bridging AI with social sciences via large language models.

• Algorithms
• Game Theory
• Automata Theory
• +7 more

Marcin Jurdzinski is an Associate Professor (Reader) in the Department of Computer Science at the University of Warwick , UK. He has been a faculty member since 2004 and is a core member of the Foundations of Computer Science and Discrete Mathematics and its Applications research groups. University: University of Warwick School: Faculty of Science Department: Department of Computer Science Position: Associate Professor (Reader) Email: Marcin.Jurdzinski@warwick.ac.uk Office: CS2.19 His research lies at the intersection of algorithms, game theory, automata, and logic , with a strong emphasis on formal verification , model checking , and theoretical computer science . He is best known for his foundational work on parity games , including the development of small progress measures and discrete strategy improvement algorithms. The recent publications reveal a consistent focus on computational complexity in games and verification. Key themes include stochastic games, timed automata, bisimilarity, and quantitative analysis . His work often bridges theoretical insights with practical verification challenges, especially in real-time and probabilistic systems. He has supervised several PhD students and hosted postdoctoral researchers such as Laure Daviaud and Alexander Kozachinskiy. He has led EPSRC-funded projects including Solving Parity Games in Theory and Practice and Counter Automata: Verification and Synthesis . PhD Students: Aditya Prakash, Thejaswini K. S., Michail Fasoulakis, John Fearnley, Michal Rutkowski, Ashutosh Trivedi Postdocs: Laure Daviaud, Alexander Kozachinskiy He is actively involved in the academic community, serving on the steering committee of the Highlights of Logic, Games and Automata conference and on program committees for major venues such as CONCUR, ICALP, and LICS. He has also organized workshops including FORMATS and ICALP co-located events.

James AspnesView profile

Professor

• Distributed Algorithms
• Computer Science
• Randomized Algorithms
• +5 more

James Aspnes is the Harold W. Cheel Professor of Computer Science at Yale University, specializing in distributed algorithms and randomized methods. He holds a PhD from Carnegie Mellon University and degrees from MIT. His research focuses on distributed systems, peer-to-peer networks, and sensor networks, emphasizing tools for efficient data management and fault-tolerance. Education: PhD (CMU, 1992), SM & SB (MIT, 1987) Affiliations: Yale since 1993, IBM Almaden Research Center (1992–1993) Research interests include distributed algorithms, randomization, and applications in biology and economics. Notable contributions include skip graphs, population protocols, and consensus algorithms. He has received the ACM-EATCS Dijkstra Prize (2020) and Dylan Hixon Prize (2000). Publications span distributed computing, algorithms, and cryptography. Recent work explores consensus protocols and privacy in population models. Grants include NSF awards totaling over $2M. Active in editorial roles (Algorithmica, Distributed Computing) and conference organization (PODC 2005, DCOSS 2007).

Ameer AbdelhadiView profile

Assistant Professor

• Hardware Acceleration
• Neurotechnology
• Reconfigurable Computing
• +4 more

Dr. Ameer Abdelhadi is an Assistant Professor in the Department of Electrical and Computer Engineering at McMaster University. His research focuses on application-specific custom-tailored computer architectures, hardware-efficient deep learning, neurotechnology, and reconfigurable computing. He holds a PhD from the University of British Columbia and has held academic positions at the University of Toronto, Imperial College London, and Simon Fraser University, alongside industry experience in semiconductor design. Education: PhD in Computer Engineering (University of British Columbia, 2016). Research Interests: Hardware acceleration for machine learning and neurotechnology Reconfigurable computing and FPGAs/ASICs Asynchronous circuits and synchronization protocols VLSI physical design and CAD algorithms Publications span high-impact venues such as IEEE Journal of Solid-State Circuits, IEEE Hot Chips, and IEEE Micro. Notable achievements include the 2017 Best Paper Award at ASYNC for work on synchronization FIFOs. Teaching includes COMPENG 4DV4 (VLSI System Design) and ELECENG 4OI6B (Engineering Design). His lab focuses on advancing hardware systems for next-generation applications in AI and biomedical engineering.

Bryan ParnoView profile

Professor

• Secure Systems
• Formal Software Verification
• Verifiable Computation
• +7 more

Bryan Parno is a Professor at Carnegie Mellon University in the Departments of Electrical & Computer Engineering and Computer Science . He is the recipient of the Kavčić-Moura Chair and leads the Secure Foundations Lab , focusing on end-to-end secure systems through formal verification. Research spans secure systems , applied cryptography , distributed systems , and zero-knowledge proofs Developed Verus (verified Rust systems) and Project Everest (verified HTTPS stack) Key contributions include Ironclad , Flicker , and Pinocchio , with impacts on Intel CPUs and Windows/iOS security models His work emphasizes open-source tools and reproducibility , often published in top venues like POPL, PLDI, and IEEE S&P. Recent projects address WebAssembly security and formal verification of complex distributed systems . Major Awards Jay Lepreau Best Paper Award (OSDI 2025) IEEE Cybersecurity Award for Practice (2024) Sloan Research Fellowship (2018) Test-of-Time Awards (IEEE S&P 2023, IEEE S&P 2020) Best Paper Awards at USENIX Security, OOPSLA, and PLDI

• Programming Language Theory
• Dependent and Refinement Types
• Computational Effects
• +6 more

Danel Ahman is an Associate Professor at the Institute of Computer Science , University of Tartu , Estonia, specializing in programming language theory . His research focuses on dependent/refinement types , computational effects , and verified software . Education PhD in Theoretical Computer Science (University of Edinburgh, 2017) MPhil in Advanced Computer Science (University of Cambridge, 2012) BSc in Informatics (Tallinn University of Technology, 2010) Research Interests : Danel investigates programming languages with algebraic effects and effect handlers for verified software, exploring denotational/operational semantics and fibrational approaches to effects. His work bridges theoretical computer science with practical formal verification. Scientific Awards : Estonian Research Council grant (2025) Marie Skłodowska-Curie Fellowship (2019) PhD dissertation prize (2018) Google/Citrix dissertation awards (2012) Teaching & Supervision : He teaches courses like Logic in Computer Science and Functional Programming at the University of Tartu, and supervised BSc/MSc theses on topics including asynchronous effects and formal verification. Danel also organizes research seminars and guest lectures on F*.

Lionel LevineView profile

Professor

• Applied Mathematics
• Combinatorics and Discrete Geometry
• Probability and Statistics
• +4 more

Lionel Levine is a Professor in the Department of Mathematics at Cornell University, affiliated with the College of Arts and Sciences. His academic research focuses on abelian networks, interacting particle systems, and the emergence of complex patterns from simple rules. He has held prestigious fellowships, including the Simons Fellowship and Sloan Research Fellowship, and has been honored with an endowed professorship. Levine's work bridges probability theory, combinatorics, and statistical physics, with notable contributions to the study of sandpile models and internal diffusion-limited aggregation (IDLA). Education: Ph.D. in Mathematics (2007), University of California, Berkeley. Research Interests: Applied Mathematics, Combinatorics, Probability, Abelian Networks, Sandpile Models, and their intersections with computer science and statistical physics. His research explores how local rules generate large-scale structures, such as in abelian networks and sandpile models. Awards and Honors: Simons Fellowship, Sloan Research Fellowship, Endowed Professorship in the College of Arts and Sciences. Teaching: Courses include Probability Theory (MATH 6710/6720), Topics in Probability: Math for AI Safety (MATH 7710), and undergraduate mathematics courses like Strategy, Cooperation, and Conflict (MATH 1340). Grants and Funding: Supported by the National Science Foundation (NSF), Simons Foundation, Sloan Foundation, and Institute for Advanced Study. Collaborations: Collaborates with prominent researchers such as Yuval Peres, Cris Moore, and Jim Propp. His work has been published in leading journals like the Annals of Probability and Duke Mathematical Journal. Future Work: Continues investigating AI safety, causal models, and multi-agent learning, including research on mathematical frameworks for transformer circuits and hidden incentives in AI systems.

• Programming Language Design
• Program Verification
• Type Theory
• +3 more

Neelakantan R. Krishnaswami is a Professor of Computer Science at the University of Cambridge's Computer Laboratory , and a Fellow of Trinity College . His research focuses on the intersection of program verification, programming language design, and foundational topics like type theory and semantics. His work spans areas such as refinement types, parser design, separation logic for systems software, and the semantics of reactive programming. Notable contributions include the Datafun language for higher-order Datalog and the λert type theory for explicit refinement types. He has also developed foundational frameworks for verifying imperative programs using advanced type systems and logical relations. Key publications include 'Explicit Refinement Types' (ICFP 2023), 'flap: A Deterministic Parser with Fused Lexing' (PLDI 2023), and 'CN: Verifying Systems C Code' (POPL 2023). His work frequently addresses challenges in efficiency, correctness, and modularity for both functional and imperative systems. His awards include Distinguished Paper Awards at PLDI 2019 and POPL 2020. His research integrates theoretical rigor with practical tooling, exemplified by contributions to languages like Coq, Lean, and Haskell.

Joseph FriedmanView profile

Associate Professor

• Artificial Intelligence Hardware
• Beyond-CMOS Computing
• Neuromorphic Computing
• +6 more

Joseph S. Friedman is an Associate Professor of Electrical & Computer Engineering at the University of Texas at Dallas, leading the NeuroSpinCompute Laboratory within the Erik Jonsson School of Engineering and Computer Science. His research focuses on unconventional computing paradigms leveraging nanotechnology, including neuromorphic systems, spintronics, and memristive devices. He specializes in nanomagnet-based logic architectures, neuromorphic computing with domain walls and skyrmions, and hardware security for emerging technologies. His research explores energy-efficient computing through novel paradigms such as reversible skyrmion logic, neuromorphic networks using magnetic tunnel junctions, and stochastic Bayesian inference circuits. He has pioneered spintronic neurons demonstrating 94% accuracy in handwritten digit recognition and developed secure logic locking mechanisms using nanomagnet logic. His work integrates experimental fabrication with SPICE modeling, emphasizing scalable beyond-CMOS systems. Recent advancements include toggle SOT-MRAM architectures, quantum circuit design for neutral atom systems, and neuromorphic networks leveraging superconducting flux quanta. He advises over 20 graduate and undergraduate students, fostering innovation in AI hardware and unconventional computing. Notable projects include the NeuroSpinCompute Lab's domain wall neuromorphic networks, secure logic locking schemes, and collaborations with institutions like Sandia National Labs on neuromorphic reservoir computing. Current research trends emphasize low-energy spintronic architectures, hybrid quantum-classical systems, and neuromorphic applications in edge computing. His research is supported by NSF grants CCF-1910800 and CCF-2146439, focusing on neuromorphic and spintronic systems. He regularly contributes to conferences like IEEE Rebooting Computing and SPIE Spintronics, showcasing breakthroughs in nanomagnetic logic and neuromorphic inference.

• Computer Security
• Cryptography
• Distributed Systems
• +3 more

Nickolai Zeldovich is the Joan and Irwin M. Jacobs Professor of Electrical Engineering and Computer Science at MIT, and a member of the Computer Science and Artificial Intelligence Laboratory (CSAIL). He received his PhD from Stanford University in 2008 and focuses on building practical secure systems, including encrypted databases, undefined behavior detection tools, formally verified file systems, and cryptocurrency protocols. His work spans both theoretical and applied aspects of computer security and distributed systems. Research interests include: Secure system design Distributed consensus mechanisms Formal verification of software/hardware Cryptographic protocols Privacy-preserving web technologies Publications & Verification Tools Recent work focuses on modular verification of complex systems, including: Shipwright (2025): Byzantine-fault-tolerant distributed system verification PoWER (2025): Crash consistency verification framework K2 Architecture (2023): Trustworthy hardware security modules Grove (2023): Separation-logic-based verification library Tiptoe (2023): Private web search protocols Major Awards Best paper award, ACM SOSP (2011, 2015, 2017) Sloan Research Fellowship (2010) NSF CAREER award (2011) MIT Jamieson Award for Teaching (2024) Active in multiple startup ventures including Algorand (cryptocurrency), MokaFive (virtualization), and PreVeil (end-to-end encryption).

• Superconducting Logic
• Bio-based Architectures
• Novel Computing Mediums
• +6 more

Dr. Jennifer Volk is an Assistant Professor at the College of Engineering, University of Wisconsin-Madison, specializing in Electrical & Computer Engineering. Her research focuses on leveraging novel technologies like superconductor electronics and photonics to create efficient systems for datacenters, neuromorphic computing, quantum computing, and space/sensing applications. She employs a holistic approach spanning circuit design, materials science, and computer microarchitecture. PhD (2024), University of California, Santa Barbara BS (2016), University of California, Santa Cruz Her research interests include superconducting logic , bio-based architectures , and novel computing mediums , emphasizing co-optimization of logic and circuit blocks. Her work develops design abstractions to simplify adoption of unconventional technologies. Dr. Volk's publications demonstrate expertise in superconducting circuit design, radiation-hardened CMOS for particle physics, and photonic materials. She has received numerous awards including the 2025 John D. Wiley Assistant Professorship and IEEE fellowships in applied superconductivity. 2025 John D. Wiley Assistant Professorship 2024 UC Santa Barbara President's Dissertation Year Fellowship 2023 IEEE CSC Graduate Study Fellowship in Applied Superconductivity 2022 IEEE Micro Top Picks Honorable Mention 2021 IEEE Micro Top Picks She teaches E C E 340 - Electronic Circuits I (Spring 2025). Her work bridges materials science, circuit design, and system architecture to enable next-generation computing platforms.

Ramana VinjamuriView profile

Associate Professor

• Brain-Machine Interfaces
• Neuroprosthetics and Exoskeletons
• Machine Learning
• +4 more

Ramana Vinjamuri is an Associate Professor in the Department of Computer Science and Electrical Engineering at the University of Maryland, Baltimore County (UMBC). He holds a secondary appointment as Visiting Professor at the Indian Institute of Technology, Hyderabad, India. His academic journey includes a Ph.D. in Electrical Engineering from the University of Pittsburgh (2008), M.S. in Bioinstrumentation from Villanova University (2004), and B.Tech. in Electrical and Electronics Engineering from Kakatiya University (2002). Dr. Vinjamuri's research focuses on Brain-Machine Interfaces (BMIs) for upper-limb prostheses control , neuroprosthetics and exoskeletons , machine learning in motor control , and neurophysiological signal processing . His work extends synergy-based models to control 37-dimensional hand movements, addresses human-robot interaction through emotionally intelligent systems, and develops neurotechnologies for substance use disorder using wearable sensors and AI. NSF CAREER Award (2019) NSF IUCRC BRAIN Center Planning Grant (2020) Harvey N Davis Distinguished Teaching Assistant Professor Award (2018) His publications demonstrate expertise in EEG and EMG signal analysis , deep learning for motor decoding , synergy modeling , and humanoid robot control . The Vinjamuri Lab at UMBC involves graduate, undergraduate, and high school researchers, with international collaborations in India and the US.