Find Academic Supervisors

• Program Verification
• Program Synthesis
• Concurrency
• +3 more

Roopsha Samanta serves as an Assistant Professor in the Department of Computer Science at Purdue University, where she leads the Purdue Formal Methods (PurForM) research group and participates in the Purdue Programming Languages (PurPL) initiative. Her academic foundation includes a PhD from the University of Texas, Austin (2013) and postdoctoral research at the Institute of Science and Technology Austria prior to joining Purdue in 2016. Education: PhD in Computer Science, University of Texas, Austin (2013) Postdoctoral Researcher, Institute of Science and Technology Austria Professor Samanta's research centers on bridging formal methods with programming languages to enhance software reliability, with core expertise in program verification, program synthesis, and concurrency. Her work uniquely targets both professional developers and non-programmers, developing techniques to ensure programs align with user intent through automated reasoning and synthesis. Recent efforts focus on distributed systems verification where traditional methods face scalability challenges. Analysis of her 2020-2024 publications reveals a dominant trajectory in distributed agreement systems, particularly advancing parameterized verification for unbounded process networks. Key innovations include bounded verification techniques for doubly-unbounded systems, explainable synthesis through specification localization, and secure multi-party computation frameworks like HACCLE. Her work consistently integrates theoretical formal methods with practical system implementation. Scientific Awards: NSF CAREER Award (2019) for “Robustness of Inductive Reasoning Engines” Amazon Research Award (2021) supporting secure computation research Her research is primarily funded through competitive grants including the NSF CAREER award and Amazon Research Award, enabling exploration of verification robustness and secure multi-party computation. While specific advising details aren't publicly documented, her leadership of the PurForM group indicates active mentorship of graduate researchers in formal methods. Current projects suggest expanding applications to privacy-preserving technologies and explainable AI-assisted programming. The PurForM research group, under her direction, develops foundational tools for program verification and synthesis with emphasis on distributed and concurrent systems. Collaborations within PurPL and industry partners like Amazon drive translational research from theoretical models to practical verification frameworks applicable to real-world distributed infrastructure.

Vivek SarkarView profile

Professor

• Parallel Computing
• Programming Languages
• Compilers
• +5 more

Vivek Sarkar is the John P. Imlay, Jr. Dean of the College of Computing at Georgia Institute of Technology and a professor in the School of Computer Science. He leads the Habanero Extreme Scale Software Research Laboratory, focusing on parallel computing, programming languages, compilers, and runtime systems. Previously, he was a Professor and Chair of Computer Science at Rice University and held senior roles at IBM Research, where he contributed to projects like the X10 programming language and the Jikes Research Virtual Machine. Research Interests: His work spans parallel computing software, including programming languages (e.g., X10, Habanero-Java), compiler optimizations, runtime systems, and debugging tools for high-performance systems. He emphasizes scalability and correctness in distributed and heterogeneous environments. Awards & Affiliations: ACM Fellow (2008), IEEE Fellow, Ken Kennedy Award (2011), member of the US Department of Energy’s ASCAC, and former IBM Academy of Technology member. He chairs the Center for Research into Novel Computing Hierarchies (CRNCH) at Georgia Tech. Grants & Students: His research is supported by NSF grants. He advises students in parallel computing, with openings for researchers interested in his lab’s work on asynchronous systems, graph processing, and quantum-classical programming. Labs & Projects: Habanero Lab, CRNCH, and collaborations on Chapel runtime systems, actor-based programming models, and exascale computing challenges.

• GPU Computing
• Parallel Computing
• Domain-Specific Languages
• +5 more

Prof. Dr.-Ing. Richard Membarth is a Research Professor for System-on-a-Chip and AI at the Edge Computing at Technische Hochschule Ingolstadt (THI). He is affiliated with the Hardware-Software Co-Design group and holds a secondary position at the German Research Center for Artificial Intelligence (DFKI) Saarbrücken. Co-creator of DSL frameworks like AnyDSL and Hipacc Key contributor to MetaDL (AI metaprogramming) and PRIME (predictive rendering) His research bridges GPU computing , domain-specific languages , and compiler technology , with recent work on Vulkan SPIR-V compilation and device-driven SpMV algorithms . Notable awards include the HiPEAC Paper Award (2018) and multiple Best Paper Awards for his compiler frameworks.

Kartik NayakView profile

Associate Professor

• Security
• Applied Cryptography
• Distributed Computing
• +4 more

Kartik Nayak is an Associate Professor in the Department of Computer Science at Duke University, affiliated with Trinity College of Arts & Sciences. His research focuses on blockchain protocols, applied cryptography, and distributed computing, with recent emphasis on improving consensus efficiency and privacy-preserving computation. University of Maryland, College Park (2018) – Ph.D. Nayak's work addresses critical challenges in blockchain systems, including decentralization, consensus latency, and transaction privacy. His research spans theoretical protocol design and practical implementations, with applications in secure distributed systems and privacy-preserving technologies. Recent publications highlight advancements in DAG-based BFT protocols, order policy enforcement, and fault-tolerant consensus. These works intersect with computer science, cryptography, and decentralized finance, reflecting his interdisciplinary approach. Best Paper Award at OPODIS 2021 Best Paper Runner Up at ACM CCS 2021 Grants from the National Science Foundation (2023–2028) and Ethereum Foundation (2022–2027) support his research on scalable consensus and transaction privacy. He actively mentors Ph.D. students and contributes to academic discourse through publications and collaborations.

Dongheui LeeView profile

Assistant Professor

• Human motion understanding
• Physical human-robot interaction
• Machine learning in robotics
• +5 more

Dongheui Lee is an Assistant Professor at the Institute of Automatic Control Engineering (LSR) within the Faculty of Electrical Engineering and Information Technology at Technische Universität München (TUM). She leads the Dynamic Human Robot Interaction for Automation System Lab. Her research focuses on human motion understanding, physical human-robot interaction, and machine learning in robotics. Education: B.S. and M.S. in Mechanical Engineering from Kyunghee University (2001-2003), PhD in Mechano-Informatics from the University of Tokyo (2007). Prior roles include research scientist at KIST Korea (2001-2004) and project assistant professor at the University of Tokyo (2007-2009). Research Interests: Human-robot collaboration, probabilistic robotics, motion recognition, and incremental lifelong learning mechanisms. She has contributed to advancements in motion primitives, compliant physical interaction, and real-time object tracking. Selected Awards: Finalist for KUKA Service Robotics Best Paper Award (2009), Hirose Scholarship (2006-2007), and multiple grants from KRF, KOSEF, and international robotics competitions. Key Publications: Focus on prioritized inverse kinematics, motion imitation, and adaptive control systems. Her work bridges robotics theory and practical applications in humanoid robots and human-robot interaction.

Giorgio C. ButtazzoView profile

Professor

• Real-Time Systems
• Heterogeneous Computing
• Robotics
• +4 more

Giorgio C. Buttazzo is a Full Professor of Computer Engineering at the Scuola Superiore Sant'Anna in Pisa, Italy, and founder/director of the RETIS Lab. His career includes roles at the University of Pavia and co-founding Evidence s.r.l. (a real-time embedded systems company). He holds an IEEE Fellowship (2012) and the IEEE TC RTS Outstanding Technical Contributions Award (2013). Education: Electronic Engineering (University of Pisa, 1985), Master in Computer Science (University of Pennsylvania, 1987), PhD in Computer Engineering (Scuola Superiore Sant'Anna, 1991). Affiliations: TeCIP Institute, RETIS Lab, and leadership roles in IEEE Technical Committees. Research focuses on real-time systems, robotics, and AI integration. He has authored 10 books, over 300 papers, and pioneered frameworks like the ERIKA/SHARK kernels. Current projects include RETICULATE, OPERAND, and NANCY (5G networks). Teaching includes Real-Time Systems, Neural Networks, and Jazz Guitar Improvisation. Advised over 150 master and PhD students. Active in conferences like ECRTS, RTSS, and RTAS.

Tim TwardzikView profile

Researcher

• Hardware Acceleration
• Embedded Systems Design
• Operating Systems Optimization
• +3 more

Tim Twardzik is a Researcher at the Chair of Integrated Systems within the School of Computation, Information and Technology at the Technical University of Munich . His work focuses on hardware acceleration techniques for Linux systems, particularly in optimizing inter-process communication (IPC), event notification mechanisms, and synchronization primitives through FPGA-based and MPSoC architectures. His research explores: Hardware-assisted scheduling for Linux Low-latency system-on-chip (SoC) design User-space event notification acceleration Thread synchronization mechanisms MPSoC-based embedded computing Performance analysis through simulation frameworks Publications highlight his contributions to hardware acceleration trends, with a focus on improving operating system primitives (e.g., futex, epoll) through custom silicon implementations.

Michael L. ScottView profile

Professor

• Parallel Computing
• Operating Systems
• Programming Languages
• +7 more

Michael L. Scott is the Arthur Gould Yates Professor of Engineering in the Department of Computer Science at the University of Rochester's Hajim School of Engineering and Applied Sciences. He received his Ph.D. from the University of Wisconsin-Madison in 1985 and has been a faculty member at Rochester since 1985, serving as Department Chair multiple times (1996-99, 2007, 2017, 2020-2024). He is a Fellow of the ACM, IEEE, and AAAS, and recipient of numerous awards including the Edsger W. Dijkstra Prize in Distributed Computing. Dr. Scott's research focuses on parallel and distributed systems, with particular expertise in synchronization mechanisms, transactional memory, and persistent memory systems. His work spans theoretical foundations to practical implementations, with numerous influential publications and open-source systems like RSTM and Ralloc. His research has addressed critical challenges in concurrent programming, memory management, and system reliability. His publications show a consistent focus on improving the reliability and performance of concurrent systems, with recent work centered on persistent memory technologies. The trajectory of his research demonstrates a progression from fundamental synchronization algorithms to sophisticated systems addressing modern hardware challenges. His publications span top venues in systems, architecture, and programming languages. His scientific honors include: ACM Fellow (2006) IEEE Fellow (2010) AAAS Fellow Edsger W. Dijkstra Prize in Distributed Computing (2006) University of Rochester's Goergen Award for Teaching (2001) Hajim School Lifetime Achievement Award (2018) IEEE TCCA/HPCA Test of Time Award (2022) Dr. Scott has advised over 25 Ph.D. students who have gone on to successful careers in academia and industry at institutions including Lehigh University, Google, Intel, Facebook, and NVIDIA. His textbook 'Programming Language Pragmatics' is a standard reference in the field, now in its 5th edition. He also co-authored 'Shared-Memory Synchronization,' a comprehensive treatment of the field. He spent the 2014-2015 academic year as a Visiting Scientist at Google. His research group, the Rochester Concurrent Systems Group, has developed numerous influential systems including RSTM (a software transactional memory system), Ralloc (a persistent memory allocator), and Montage (a system for persistent data structures). His work often bridges theoretical correctness with practical performance considerations.

Milos PrvulovicView profile

Professor

• Computer Architecture
• Hardware Security
• Side Channels
• +4 more

Milos Prvulovic is a Professor in the School of Computer Science at Georgia Institute of Technology's College of Computing. His research focuses on computer architecture, hardware security, and physical side channels, particularly leveraging electromagnetic emissions for program monitoring, malware detection, and secure execution. He has published extensively in top-tier conferences like HPCA, MICRO, and IEEE Transactions series. His work has been recognized with awards including ACM Senior Member (2009) and multiple best paper awards. Teaching includes courses such as High Performance Computer Architecture (OMS CS 6290/CS 4290), Processor Design (CS 3220), and advanced topics like Reliability & Security in Computer Architecture (CS 7292/8804). His research lab explores innovative solutions for embedded system security, IoT protection, and side-channel vulnerabilities. Key contributions include the EMSim tool for electromagnetic side-channel simulation, REMOTE malware detection framework, and the EDDIE anomaly detection system. Collaborations with Alenka Zajic and others highlight interdisciplinary work in hardware-software security interfaces.

Roberto PalmieriView profile

Associate Professor

• Concurrency
• Synchronization
• Distributed Computing
• +6 more

Roberto Palmieri is an Associate Professor in the Department of Computer Science & Engineering at Lehigh University, where he co-leads the Scalable Systems Software (SSS) Research Group. He holds a Ph.D., M.S., and B.S. in Computer Engineering from Sapienza University of Rome (2012, 2008, 2006). His research focuses on concurrency, synchronization, distributed computing, and heterogeneous systems, emphasizing protocols optimized for multicore, cluster-scale, and geo-distributed infrastructures. His work spans theoretical and practical advancements in distributed systems, including atomic registers, consensus algorithms, and blockchain concurrency control. He has received an NSF CAREER Award for research on RDMA-optimized distributed protocols. Palmieri advises students in the Rossin College of Engineering and collaborates on high-performance computing projects, contributing to frameworks like HyFlow and Shield. Education: Ph.D., Computer Engineering, Sapienza University of Rome (2012) M.S., Computer Engineering, Sapienza University of Rome (2008) B.S., Computer Engineering, Sapienza University of Rome (2006) His research emphasizes scalability, fault tolerance, and performance in distributed systems. Recent work includes protocols for RDMA systems (e.g., ALock, Rome), blockchain transaction management (OCToPus), and hardware-accelerated synchronization (HATS). He has published extensively at top venues like OPODIS, DISC, and IEEE conferences. Awards: NSF CAREER Award (2021) Grants: CAREER: Distributed Protocols and Primitives Optimized for RDMA (2021) Palmieri leads the SSS Group, which develops open-source tools for distributed systems and collaborates on industry-relevant projects. His lab investigates cutting-edge topics like NUMA-aware concurrency, transactional memory, and cloud-optimized data grids.

• Cryptographic Protocols
• Cloud Security and Privacy
• Homomorphic Encryption
• +3 more

Travis Mayberry is an Assistant Professor in the Cyber Security department at the United States Naval Academy. His research focuses on cryptographic protocols, cloud security, privacy-preserving technologies, homomorphic encryption, and secure voting systems. He holds a PhD in Computer Science from Northeastern University, with a dissertation on practical Oblivious RAM (ORAM) protocols for private data outsourcing. He also contributed to the Scantegrity project at the University of Maryland, Baltimore County, developing end-to-end verifiable voting systems. Key areas of research include privacy in mobile devices, secure communication protocols, and cryptographic mechanisms for data protection. His work has been published in top venues like Privacy Enhancing Technologies Symposium (PETS), Network and Distributed Systems Security Symposium (NDSS), and ACM Computer and Communications Security (CCS). He received a Distinguished Paper Award in 2014 for his research on combining ORAM and PIR for efficient private file retrieval. Mayberry’s publications analyze vulnerabilities in Bluetooth Low Energy protocols, TLS client authentication tracking, and MAC address randomization in mobile devices. He has collaborated extensively on secure voting systems (e.g., Scantegrity) and practical ORAM implementations like ObliviSync and rORAM. His contributions bridge theoretical cryptography with real-world applications in privacy and security.

Luisa SiniscalchiView profile

Assistant Professor

• Cryptography
• Secure Multiparty Computation
• Post-quantum Cryptography
• +7 more

Luisa Siniscalchi is an Assistant Professor (tenure track) in the Department of Applied Mathematics and Computer Science at the Technical University of Denmark (DTU), affiliated with the Cybersecurity Engineering Center and the Center for Quantum Technologies. Her research lies at the intersection of cryptography, cybersecurity, and theoretical computer science. Her research interests focus on secure multiparty computation (MPC) , zero-knowledge proofs , non-malleable and deniable protocols , post-quantum cryptography , and cryptographic primitives . She investigates foundational aspects of secure computation under minimal assumptions, aiming to achieve optimal round complexity and strong security guarantees in both synchronous and asynchronous settings. The recent publications highlight a consistent trend in designing efficient, secure, and practical cryptographic protocols, particularly in MPC and deniable authentication. Her work often appears in top-tier venues such as EUROCRYPT, CRYPTO, and TCC, demonstrating strong theoretical rigor and innovation. Key themes include black-box constructions, post-quantum security, and privacy-preserving mechanisms. Scientific Awards: No awards listed in the provided text. Luisa Siniscalchi is actively supervising PhD students in cutting-edge projects related to proactive post-quantum cryptography, long-term security of protocols, and dynamic graph algorithms. She collaborates with principal investigators such as Claudio Orlandi, Ivan Damgård, and Carsten Baum, indicating integration into major research initiatives at DTU. While specific grants are not detailed, her involvement in multi-year PhD projects suggests active grant funding. Labs and Research Groups: Cybersecurity Engineering Center, DTU Center for Quantum Technologies, DTU Active research in cryptographic protocols and algorithms

Peter Lucas HulenView profile

Professor

• Electronic Music
• Music Composition
• Music Theory
• +3 more

Peter Lucas Hulen is a Professor in the Music Department at Wabash College , where he has taught for nearly 25 years. His work bridges classical acoustic composition with experimental computer-generated electronic music, informed by his classical training and later shift toward digital techniques. Research interests include: Electronic music history Music technology pedagogy Digital synthesis methods (FM, subtractive, granular) Integration of acoustic and electronic sound Algorithmic composition Interdisciplinary applications His compositions explore: Microtonal scales using superparticular ratios Wireless performance interfaces Choral liturgy adaptation Cultural sound symbolism Speaker array design Temporal structure manipulation Recent works combine academic rigor with technical innovation: 2017: Homage and Refuge , Wobbly 2015: Organum IV 2014: Magnificat , Sitting 328b 2013: Les substances botaniques , Primitive 2012: Lamentationes Jeremiae I He developed a systematic electronic music curriculum including: History and Literature Computer Programming (Max/MSP) Performance Ensembles Theory and Composition

• Nonblocking Algorithms
• Concurrent Data Structures
• Memory Reclamation
• +3 more

Ruslan Nikolaev is an Assistant Professor in the Department of Computer Science and Engineering, specializing in nonblocking algorithms, memory reclamation, and concurrent data structures. His research spans operating systems, virtualization, and lock-free programming paradigms. Academic Rank: Assistant Professor Department: Computer Science and Engineering Research Interests focus on: Nonblocking and wait-free algorithms Memory-efficient reclamation techniques Lock-free data structures Operating system virtualization Device driver security Recent work includes 2025 advancements in SCOT and RRR-SMR frameworks for nonblocking structures, 2024 contributions to wait-free reclamation, and 2022 innovations in address space randomization (Adelie), critical service domains (Kite), and wait-free queues (Wcq). Earlier projects (2013-2020) explored OS virtualization (VirtuOS) and reclamation mechanisms (LibrettOS). Trends in his publications highlight: Optimization of concurrent algorithms Security enhancements in Linux drivers Virtualization techniques for critical services Efficient memory management strategies Robust fault tolerance in distributed systems

Eric RuppertView profile

Associate Professor

• Distributed Computing
• Shared-Memory Algorithms
• Data Structures
• +3 more

Eric Ruppert is an Associate Professor in the Department of Electrical Engineering & Computer Science at York University, where he has taught computer science since 2000. He is a member of the Theory of Computing Group and teaches foundational computer science courses including algorithms and theory of computation. He has served on program committees for major conferences including PODC 2025 and WADS 2025. Ruppert received his education at the University of Toronto. He has held postdoctoral positions at Brown University and served as a visiting professor at the École Polytechnique Fédérale de Lausanne. His research focuses on the theory of distributed computing, with particular emphasis on algorithm design and lower bound proofs. His recent work has centered on shared-memory data structures for multi-core architectures. His research interests span distributed algorithms, computational complexity, and the theoretical foundations of concurrent systems. He has made significant contributions to understanding the computational power of population protocols, consensus problems, and non-blocking data structures. His publication record shows a consistent focus on distributed computing theory, with recent work emphasizing non-blocking and wait-free data structures. Over the past decade, his research has increasingly addressed challenges in concurrent programming for multi-core systems, developing efficient algorithms for queues, deques, and binary search trees that provide strong progress guarantees. Ruppert has been actively involved in the distributed computing research community, serving on program committees for major conferences including PODC and WADS. His work has been published in top-tier venues such as Distributed Computing, Journal of the ACM, and proceedings of ACM SIGACT/SIGOPS conferences. At York University, Ruppert teaches courses on algorithms, theory of computation, and computational complexity. He has supervised numerous graduate students through project courses and thesis work. He is known for his dedication to teaching, including coaching students for the annual ACM programming contest. Ruppert is a member of the Theory of Computing Group at York University, which focuses on foundational aspects of computer science including algorithms, complexity theory, and distributed systems. His work bridges theoretical computer science with practical applications in concurrent and parallel computing.