Find Academic Supervisors

Dawn Song is a Professor in the Department of Electrical Engineering and Computer Science at the University of California, Berkeley, affiliated with multiple research centers including the Berkeley Artificial Intelligence Research Lab (BAIR) and the Berkeley Center for Responsible, Decentralized Intelligence (RDI). She holds leadership roles in AI safety, cybersecurity, and blockchain research. Her work bridges machine learning, security, and distributed systems, with notable contributions to formal verification, privacy-preserving technologies, and AI governance. Education: Ph.D. (2002) and M.S. (1999) in Computer Science from UC Berkeley and Carnegie Mellon University, respectively. She previously served as an Assistant Professor at Carnegie Mellon University before joining UC Berkeley in 2007. Research Interests: Dawn's work focuses on AI safety, cybersecurity, and the ethical implications of frontier AI. She explores topics such as large language model vulnerabilities, zero-knowledge proofs, blockchain security, and policy frameworks for AI governance. Her research combines theoretical rigor with practical applications, addressing challenges in secure systems, adversarial machine learning, and privacy-preserving computation. Publications: Her recent work includes groundbreaking studies on LLM memorization, smart contract decompilation, and AI agent cybersecurity evaluation. She also leads initiatives like the Singapore Consensus and California Report on AI safety priorities, emphasizing global collaboration in risk mitigation. Notable Awards: MacArthur Fellowship (2010), ACM Fellow (2019), IEEE Fellow (2019) Advising & Grants: She advises projects on AI policy and cybersecurity, securing grants from NSF, DARPA, and industry collaborations. Her lab develops tools like CyberGym for evaluating AI agents and zkPyTorch for secure machine learning. Labs & Teams: Her research groups at UC Berkeley focus on cutting-edge projects in AI safety, blockchain, and cybersecurity, collaborating with industry leaders and policymakers to advance both technical and ethical standards.

• Artificial Intelligence
• Cybersecurity
• Machine Learning
• +7 more

Abhishek Jain is an Associate Professor in the Department of Computer Science at Johns Hopkins University and a Senior Scientist at NTT Research. He is affiliated with the Data Science and AI Institute, the Information Security Institute, and the Algorithms and Complexity group. University: Johns Hopkins University Department: Computer Science Academic Rank: Associate Professor Institutional Roles: Co-director of the Advanced Research in Cryptography group, member of the Theory Group, and co-leader of the Cryptography Group Education: Ph.D. in Computer Science from the University of California Los Angeles (2012), advised by Amit Sahai and Rafail Ostrovsky. Recipient of the Symantec Outstanding Graduate Student Award during his Ph.D. Research Interests Cryptography Secure computation Proof systems Program obfuscation Privacy Blockchain Theoretical computer science Research Trends: His recent publications emphasize cryptographic protocols for homomorphic encryption, zero-knowledge proofs, and secure multi-party computation, alongside applications in blockchain and privacy-preserving systems. Key themes include scalability, verifiable evaluation, and adapting cryptographic techniques to dynamic and distributed environments. Scientific Awards 2020 NSF CAREER Award Best Paper Awards at Eurocrypt and the International Conference on the Theory and Applications of Cryptographic Techniques Advising & Grants: Mentors Ph.D. students and interns/postdocs at NTT Research. Research funded by NSF, DARPA, JP Morgan, Ethereum Foundation, Stellar, Cisco, Samsung, and JHU Catalyst awards. Labs & Teams: Co-leads the Cryptography Group at Johns Hopkins, participates in the DC Area Crypto Day, and organizes the weekly Theory Seminar. Collaborates with institutions including MIT CSAIL, BUSEC, and Microsoft Research New England.

• Cryptography
• Computer Security
• Privacy
• +5 more

Stanislav Smirnov is a Professor of Mathematics at the University of Geneva, where he has been a faculty member since 2003. He also holds a part-time position at the Chebyshev Laboratory of St. Petersburg State University. As Director of the National Centre of Competence in Research SwissMAP since 2014, he leads a major research initiative funded by the Swiss National Science Foundation. His education includes a mathematics degree from St. Petersburg State University (1992) and a PhD from the California Institute of Technology (1996). Prior to joining Geneva, he held positions at Yale University, the Institute for Advanced Study in Princeton, the Max Planck Institute in Bonn, and the Royal Institute of Technology in Stockholm. Professor Smirnov's research focuses on the mathematical foundations of statistical physics, with particular emphasis on conformal invariance in two-dimensional lattice models. His work has revolutionized our understanding of critical phenomena through rigorous mathematical approaches, establishing deep connections between probability theory, complex analysis, and statistical mechanics. He develops novel discrete complex analysis techniques to prove continuum limits of lattice models at criticality. His publication record shows consistent advancement in understanding random planar geometry, percolation theory, and the Ising model, with increasing attention to Liouville quantum gravity in recent years. His work bridges deep mathematical analysis with physical insights, often providing rigorous proofs for phenomena previously understood only through physical intuition. Fields Medal (2010) for the proof of conformal invariance of percolation and the planar Ising model in statistical physics As an advisor, Professor Smirnov has mentored doctoral students including Ekin Arikök and Nikolai Bobenko. He leads the ANALYSE, PHYSIQUE MATHÉMATIQUE ET PROBABILITÉS research group at the University of Geneva. His research is supported by major grants including the NCCR SwissMAP, European Research Council's AG COMPASP, and Swiss National Science Foundation grants 200020_143434 and 200020_141329. Professor Smirnov has organized numerous influential conferences, including the "Conformal maps from probability to physics" workshop at Monte Verità (2010) and multiple "Random Planar Geometry" meetings in Les Diablerets, fostering collaboration between mathematicians and physicists working on critical phenomena and random geometry.

• Mathematical Physics
• Statistical Physics
• Probability Theory
• +4 more

Tal Malkin is a Professor of Computer Science at Columbia University, directing the Cryptography Lab and serving as inaugural chair of the Cybersecurity Center at Columbia's Data Science Institute. She holds a Ph.D. from MIT (2000), joined Columbia after AT&T Labs research experience, and focuses on cryptography, security, complexity theory with applications in secure computation, zero-knowledge proofs, and privacy-preserving systems . Education: B.S. in Math and Computer Science, Bar-Ilan University M.S. in Computer Science, Weizmann Institute of Science Ph.D. in Computer Science, MIT (2000) Research Interests: Malkin's work spans foundational and applied cryptography, including homomorphic encryption, lattice-based protocols, attribute-based encryption, and tamper-resilient systems . She explores intersections with machine learning and information theory , addressing challenges in multi-party computation , public-key encryption , and side-channel resistance . Scientific Contributions: Her publications include breakthroughs in non-malleable codes , secure computation , and privacy-preserving databases . Notable works involve continual leakage resilience , optimally-fair coin tossing , and garbled circuits for efficient cryptographic protocols. Awards & Grants: Recipient of the NSF CAREER award, IBM and Google faculty research awards, and the IACR Fellow designation. Her research is funded by NSF, NSA, DHS, NYSIA, IARPA, and industry partnerships with Google, IBM, Mitsubishi, and NEC. Professional Leadership: Former conference chairs at CRYPTO 2021 , CCS 2017 , and CT-RSA conferences. Active in program committees for over 20 leading cryptography and security events, including FOCS , Eurocrypt , and Real World Crypto . Advising: Supervised numerous Ph.D. students and postdoctoral researchers, including Marshall Ball , Chengyu Lin , and Negev Shekhel Nosatzki . Her lab has mentored graduates like Ghada Almashaqbeh (2019) and Fernando Krell (2016), focusing on decentralized networks , secure learning , and cryptographic primitives .

• Cryptography
• Computer Security
• Complexity Theory
• +8 more

Han Liu is a Professor in the Department of Computer Science at Northwestern University's McCormick School of Engineering. He directs the MAGICS (Modern Artificial General Intelligible and Computer Systems) Lab and the Center for Foundation Models and Generative AI at Northwestern, with prior roles as director of the Deep Reinforcement Learning Center at Tencent AI Lab and professor at Princeton and Johns Hopkins Universities. PhD in Machine Learning and Statistics from Carnegie Mellon University (2012), advised by John Lafferty and Larry Wasserman Han Liu's research focuses on integrating artificial intelligence with computer systems, particularly through foundation models and probabilistic graphical models. His work aims to revolutionize science, engineering, and business by deploying statistical machine learning methods in edge and cloud computing environments. Recent research trends include transformer-based models, modern Hopfield networks, genomic foundation models, and theoretical analysis of attention mechanisms. His 2025 publications explore topics like species differentiation with DNA embeddings, universal approximation capabilities of transformers, and metaverse spatial reasoning. Alfred P Sloan Fellowship in Mathematics IMS Tweedie New Researcher Award ASA Noether Young Scholar Award NSF CAREER Award Presidential Early Career Awards for Scientists and Engineers Han Liu serves as associate editor for the Journal of American Statistical Association, Electronic Journal of Statistics, Technometrics, and the Journal of Portfolio Management. He has directed research centers at Northwestern and contributed to major conferences as area chair (NeurIPS, ICML, ICLR).

• Artificial Intelligence
• Computer Systems
• Statistical Machine Learning
• +4 more

Prof. Srdjan Capkun is a Full Professor in the Department of Computer Science at ETH Zurich and Director of the Zurich Information Security and Privacy Center (ZISC). He holds a Dipl.Ing. from the University of Split (1998) and a Ph.D. from EPFL (2004). His research focuses on system and network security, including wireless security (e.g., secure positioning), trusted computing, blockchain technologies, and privacy-preserving systems. He co-founded 3db Access (acquired by Infineon) and Sound-Proof, addressing secure distance measurement and authentication. Notable achievements include an ERC Consolidator Grant (2016), ACM Fellowship, and IEEE Fellowship. Education: Dipl.Ing., Electrical Engineering / Computer Science, University of Split, 1998 Ph.D., Communication Systems, EPFL, 2004 Research Interests: Wireless security (e.g., UWB, GNSS, cellular) Trusted execution environments (TEEs) Blockchain and cryptocurrency systems Privacy-preserving technologies Awards & Grants: ERC Consolidator Grant (2016) ACM Fellow and IEEE Fellow Leadership of ZISC Advising & Labs: Leads the System Security Group at ETH Zurich Guided postdoctoral researchers and graduate students in security and privacy Companies: 3db Access (secure distance measurement) Futurae (online authentication)

• Computer Security
• Network Security
• Wireless Security
• +4 more

Kenneth P. Birman is the N. Rama Rao Professor of Computer Science at Cornell University, where he has had a long and impactful career in distributed systems, cloud computing, and AI/ML infrastructure. He is known for foundational contributions to reliable and scalable distributed systems, and for leading high-impact projects such as Cascade, Vortex, and Derecho. He is also the author of a widely used textbook on reliable distributed systems and has founded multiple companies based on his research. Education: Ph.D. in Computer Science, University of California, Berkeley M.S. in Computer Science, University of California, Berkeley B.A. in Computer Science, Columbia University Research Interests: Professor Birman's research focuses on building reliable, secure, and scalable distributed systems . His current emphasis is on AI and ML infrastructure , particularly in reducing latency and improving performance through hardware acceleration, RDMA-based communication, and edge computing. He explores how to eliminate data movement bottlenecks in AI pipelines and how to support real-time, mission-critical applications in domains like healthcare, smart grids, and industrial IoT. His work spans systems programming, cloud computing, fault tolerance, and formal verification . He has designed systems that have been deployed in high-stakes environments such as the New York Stock Exchange, the Swiss Exchange, and the French Air Traffic Control system. Scientific Awards: ACM Fellow (1999) IEEE Fellow (2014) IEEE Tsutomu Kanai Award for innovations in distributed computing Teaching and Mentorship: Professor Birman teaches two courses in the fall semester: CS4414: Systems Programming and CS5416: Cloud and ML Systems Programming . He has advised numerous Ph.D. and M.S. students, including Alicia Yang, Tiancheng Yuan, Yifan Wang, Weijia Song, Edward Tremel, Sagar Jha, Jonathan Behrens, and Mae Milano. He has announced that Fall 2025 will be his last semester teaching, and he is no longer recruiting new students, though he will continue supervising current ones. Labs and Projects: He leads the Derecho Project and the Cascade/Vortex Project , both focused on high-performance distributed systems. These projects are collaborative efforts with students and industry partners, and the software is released under open-source licenses. He also maintains strong ties with Cornell's systems group and collaborates with faculty across CS, ECE, IS, and the Cornell Tech NYC campus.

• Distributed Systems
• Cloud Computing
• Machine Learning Systems
• +5 more

Andrea Coladangelo is an Assistant Professor at the Allen School of Computer Science & Engineering , University of Washington , co-leading the Quantum group and contributing to the Theory and Crypto groups. He coordinates the NSF-funded Quantum@UW REU program , fostering undergraduate research in quantum information. Previously, he was a postdoctoral researcher at UC Berkeley and the Simons Institute , advised by Umesh Vazirani , following a PhD in Computer Science at Caltech under Thomas Vidick . His academic journey began with a B.A. in Mathematics from Oxford and a Master in Mathematics from Cambridge . He co-founded qBraid , a platform for quantum computing education. Research Interests : Andrea explores the intersection of quantum computation and cryptography , focusing on foundational questions in entanglement , quantum correlations , and quantum learning theory . His work investigates quantum pseudorandomness , device-independent security , quantum algorithms , and quantum copy-protection , often leveraging computational assumptions to bridge quantum information theory with cryptographic applications. Scientific Awards : 2025 Google Research Scholar Program Award in Quantum Computing 2023 CSE Undergraduate Teaching Award for his course on quantum computation 2019 Best Student Paper Award at QIP Teaching & Outreach : Andrea designed and taught CSE 434: Intro to Quantum Computation (Spring 2023, 2024, 2025), CSE 534: Quantum Information and Computation (Autumn 2023), and CSE 599C: Quantum Learning Theory (Winter 2025). He also delivered lectures at the 22nd Bellairs Crypto Workshop (2024) and led a quantum programming tutorial using qBraid . Labs & Teams : As co-leader of the Quantum group at the Allen School, he collaborates with researchers in Theory and Crypto , advancing quantum computing through interdisciplinary projects and educational initiatives.

• Quantum Computation
• Quantum Cryptography
• Quantum Learning Theory
• +3 more

Kamalika Chaudhuri is a Professor in the Department of Computer Science and Engineering at the University of California, San Diego (UCSD), and also serves as a Director and Research Scientist with the FAIR team at Meta AI. Her research focuses on the foundations of trustworthy machine learning, including robust machine learning, learning with privacy, and out-of-distribution generalization. Dr. Chaudhuri has earned her PhD from UC Berkeley in 2007 with a dissertation on "Learning Mixtures of Distributions." Her academic journey has led her to become a leading researcher in machine learning theory with a particular emphasis on privacy and robustness. Her research interests span machine learning foundations with a strong focus on trustworthy AI . She investigates problems at the intersection of differential privacy , adversarial robustness , and out-of-distribution generalization . Her work addresses critical challenges in developing machine learning systems that maintain privacy while preserving utility, resist adversarial attacks, and generalize effectively beyond training data distributions. She has pioneered approaches in privacy-preserving machine learning, robust learning theory, and methods for detecting and mitigating data memorization in models. An analysis of her recent publications (2024-2025) reveals a strong focus on the intersection of privacy, security, and machine learning. Her work spans differential privacy mechanisms, membership inference attacks, memorization detection, and fairness certification. She has been particularly active in developing methods for privacy-preserving foundation models, with several papers on differentially private computer vision and language models. Her research demonstrates a consistent thread of addressing fundamental challenges in trustworthy AI while developing practical solutions that balance privacy, accuracy, and utility. Best Award at the ICLR 2024 Workshop on Privacy Regulation and Protection in Machine Learning Distinguished Paper Award at IEEE Conference on Secure and Trustworthy Machine Learning (SaTML), 2024 Dr. Chaudhuri has advised numerous PhD students who have gone on to prominent positions at Google, DeepMind, Microsoft Research, and other leading AI institutions. Her group maintains an active research blog with guest posts from UCSD researchers. She has served in significant leadership roles including General Chair for ICML 2022 and Program Co-Chair for both ICML 2019 and AISTATS 2019, where she pioneered initiatives to improve reproducibility in machine learning research. Her research group at UCSD focuses on trustworthy machine learning, with current projects spanning privacy-preserving AI, robustness against adversarial attacks, and methods for ensuring reliable out-of-distribution generalization. The group collaborates closely with the FAIR team at Meta AI, where Dr. Chaudhuri serves as a Research Scientist.

• Machine Learning
• Trustworthy Machine Learning
• Differential Privacy
• +4 more

Jenna Wise DiVincenzo is an Assistant Professor at the Elmore Family School of Electrical and Computer Engineering at Purdue University. She specializes in research areas such as software verification, formal methods, and programming languages, with a focus on gradual verification techniques that combine static and dynamic analysis. Her work emphasizes usability and scalability in verification tools, and she has contributed to projects like Gradual C0 and gradual null-pointer analysis. Dr. DiVincenzo earned her PhD in Software Engineering from Carnegie Mellon University (2023) and a BS in Mathematics and Computer Science from Youngstown State University (2017). She has interned at IBM Research, MIT Lincoln Laboratory, and the Software Engineering Research and Empirical Studies Lab at YSU. Her awards include the Google PhD Fellowship, NSF GRFP Fellowship, and 2022 Rising Star in EECS. Her research projects span theoretical advancements in gradual verification, empirical studies on usability, and practical tool development. She advises PhD students (e.g., Craig Liu, Conrad Zimmerman) and collaborates on initiatives like gradual verification for Rust and educational tools to teach verification concepts. Her work also explores leveraging large language models for specification generation and enhancing verification tool soundness through formal proofs.

• Software Verification
• Formal Methods
• Programming Languages
• +5 more

Ian Goldberg is a Professor at the Cheriton School of Computer Science , University of Waterloo, Canada. He holds the Canada Research Chair in Privacy Enhancing Technologies and leads the Cryptography, Security, and Privacy (CrySP) group . He is affiliated with the Cybersecurity and Privacy Institute and the Institute for Quantum Computing . Research Focus: Security, privacy, and privacy-enhancing technologies (PETs) for the Internet, including Off-the-Record (OTR) Messaging , censorship resistance , private information retrieval , and zero-knowledge proofs . Recent Publications: His work addresses metadata protection , deniable authentication , and secure multi-party computation , with applications to anonymous communication and censorship resistance. Scientific Awards: Canada Research Chair in Privacy Enhancing Technologies Students: He advises current and former PhD/Master’s students in projects like Lox , PRSONA , Walkie-Talkie , and SkypeMorph . Notable advisees include Sajin Sasy (Privacy-Preserving Communications), Justin Tracey (PETs Development), and Tao Wang (Website Fingerprinting Defenses). Labs & Teams: Goldberg is a core member of the CrySP group and contributes to the Tor Project and Off-the-Record Messaging open-source initiatives. His research bridges theoretical and applied cryptography, with deployments in real-world systems like Tor and PIR protocols.

• Security
• Privacy
• Privacy-Enhancing Technologies (PETs)
• +5 more

Nils Fleischhacker is an Assistant Professor for Cryptography at Ruhr University Bochum, where he leads the Theoretical Cryptography group within the Faculty of Computer Science. His research focuses on foundational aspects of cryptography with particular emphasis on zero-knowledge proofs, digital signatures, and secure computation. Prior to joining Ruhr University, he held postdoctoral positions at Johns Hopkins University and Carnegie Mellon University. Dr. Fleischhacker received his PhD in Computer Science from Saarland University in February 2017, advised by Dominique Schröder. During his doctoral studies, he was a research intern at Microsoft Research with Chris Brzuska and a research visitor at the University of Maryland, College Park with Jonathan Katz and Dana Dachman-Soled. His research spans theoretical cryptography with significant contributions to zero-knowledge proofs, multi-signature schemes, property-preserving hash functions, and security proofs for cryptographic primitives. Fleischhacker's work often addresses fundamental questions about the limits and possibilities of cryptographic constructions, with particular attention to black-box separations and lower bounds. His recent publications demonstrate a strong focus on lattice-based cryptography and post-quantum secure protocols. Fleischhacker's publications over the past five years reveal a consistent research trajectory focused on improving the efficiency and security of cryptographic primitives, with particular emphasis on signature schemes, zero-knowledge protocols, and secure computation frameworks. His work frequently appears in top-tier cryptography venues including CRYPTO, EUROCRYPT, and CCS. Dr. Fleischhacker actively mentors PhD students, with numerous successful graduations spanning from 2010 to 2024. His former PhD students include Önder Askin (2024), Floyd Zweydinger (2023), and Lars Schlieper (2022), among others. His research is supported through various academic channels and collaborations. He is affiliated with several prominent research organizations including the Horst Görtz Institute (HGI) for Information Security, the DFG Excellence Cluster CASA, the EU Marie Curie Network QSI, and the International Association for Cryptologic Research (IACR). These affiliations provide a strong institutional framework for his theoretical cryptography research.

• Cryptography
• Theoretical Computer Science
• Zero-Knowledge Proofs
• +5 more

Giuseppe Ateniese is a Professor and Eminent Scholar in Cybersecurity at George Mason University, affiliated with the Department of Computer Science and Cyber Security Engineering. Formerly, he held the Farber Endowed Chair and chaired the Department of Computer Science at Stevens Institute of Technology. His research focuses on cloud security, applied cryptography, blockchain technology, and AI-driven cybersecurity solutions. He has received prestigious awards including the NSF CAREER Award and Google/IBM Faculty Awards. AIFurther, he teaches courses on blockchains, cryptography fundamentals, and cryptofinance. His work includes pioneering contributions to rewritable blockchains, password cracking via AI (e.g., PassGAN), and secure decentralized systems. Education: PhD in Computer Science, University of Genoa (2000) Laurea (M.Sc.), University of Salerno (1995) Master of Engineering (Honoris Causa), Stevens Institute of Technology (2020) Research Interests: Ateniese’s work bridges theoretical and applied cryptography, with emphasis on blockchain scalability, privacy-preserving machine learning, and secure data storage. He has developed foundational techniques like proxy re-cryptography and accountable storage systems. His recent efforts address AI’s dual role as both a cybersecurity tool and threat vector, including AI-based password cracking and defense strategies against LLM-driven attacks. Awards: NSF CAREER Award (for privacy/security research) Google Faculty Research Award (cloud security) IBM Faculty Award IEEE CISTC Technical Recognition Award Teaching & Labs: He teaches advanced courses on blockchains (CS695), cryptography fundamentals (CYSE/ECE476), and introductory cryptography (CS487/587). His research team focuses on cryptographic protocols, decentralized systems, and AI-security intersections. Collaborations include projects with Accenture on editable blockchain prototypes and NSF-funded work on password security.

• Cybersecurity
• Blockchain Technology
• Applied Cryptography
• +4 more

Nate Foster is a Professor of Computer Science at Cornell University and currently serves as the Associate Dean for Research in the Ann S. Bowers College of Computing and Information Science. He is also a Visiting Researcher at Jane Street and served as a Visiting Professor at École Polytechnique Fédérale de Lausanne during the 2023-24 academic year. His research uses ideas from programming languages to solve problems in networking, databases, and security. BA in Computer Science, Williams College (2001) MPhil in History and Philosophy of Science, University of Cambridge (2008, all work completed in 2003) PhD in Computer and Information Science, University of Pennsylvania (2009) Foster's research focuses on developing languages and tools that make it easy for programmers to build secure and reliable systems. His current work centers on the design and implementation of languages and tools for programmable networks, particularly using the P4 language. His past work includes bidirectional languages (also known as 'lenses'), database query languages, data provenance, type systems, mechanized proof, and formal semantics. His research group at Cornell has made significant contributions to network verification, software-defined networking, and formal foundations for programmable data planes. Analysis of Foster's recent publications reveals a strong focus on network verification and programming language foundations for networking. His work consistently applies formal methods to practical networking problems, with a particular emphasis on the NetKAT and P4 languages. Over the past five years, his research has evolved toward more complex network verification techniques, including infinite state verification, active learning of network models, and dependently-typed approaches to network programming. His work bridges theoretical computer science with practical networking systems, making formal methods accessible to network engineers. ACM Fellow (2025) ACM SIGPLAN Robin Milner Award (2023) ACM SIGCOMM Rising Star Award (2018) NSF CAREER Award (2013) Alfred P. Sloan Fellowship (2012) Multiple distinguished paper awards across top conferences including POPL, PLDI, and SIGCOMM Foster has advised numerous PhD and Master's students who have gone on to prominent positions in both industry and academia, with many continuing work in programming languages and networking. He has led multiple significant research grants including an NSF CAREER Award and has been involved in the P4 Language Consortium, serving as Chair of the P4 Language Governing Board. His work has been supported by various organizations including NSF, DARPA, and industry partners like Intel and Jane Street. Foster is also active in the programming languages research community, serving on numerous program committees and as Vice Chair of DARPA's Information Science and Technology (ISAT) study group. Foster leads a vibrant research group at Cornell focused on programming languages for networks, with collaborators from academia and industry. His group has developed several influential tools and frameworks including NetKAT, Petr4, and KATch. They maintain strong connections with the P4 community and work closely with industry partners to ensure their research has practical impact on real-world networking systems.

• Programming Languages
• Networking
• Databases
• +5 more

Andrew Head is an Assistant Professor at the University of Pennsylvania in the Computer and Information Science department. His research focuses on human-computer interaction, programming, and reading, particularly in developing technology for interactive reading and reasoning. He advises PhD students Alyssa Hwang, Hita Kambhamettu, Litao Yan, Jeffrey Tao, and Jessica Shi, and co-leads the Penn Human-Computer Interaction (Penn HCI) group with Danaé Metaxa. His work is published in top venues like ACM CHI, UIST, and ICSE. Research Interests: Andrew's work bridges interactive systems with programming environments, aiming to enhance how scientists and programmers interact with their tools. Key areas include AI-assisted code understanding, math notation accessibility, and medical note interpretation through interactivity. He employs user studies to identify needs and builds interactive systems to address them. Recent Article Trends: His publications emphasize systems-centric HCI approaches, integrating AI into code and document interfaces. Topics span code explanation (e.g., Ivie), property-based testing (e.g., Tyche), math notation augmentation (e.g., FreeForm), and medical informatics (e.g., Explainable Notes). Recent work also explores notebook environments (e.g., Bolt-on, Tyche) and literate programming (e.g., Colaroid). Scientific Awards: Distinguished Paper Award, ICSE 2024 Best Paper Awards at CHI (2024, 2023, 2022, 2019), UIST (2023, 2018), and others. Nominated for Best Paper at CHI 2023 and VL/HCC 2015. Advising & Grants: Andrew advises multiple PhD students and has secured significant grants, including a $1M NSF award for 'Property-based Testing for the People' (2024). His group collaborates with Penn’s MindCORE center and teams like PLClub and PennNLP. Labs & Teams: He co-leads the Penn HCI group, which works closely with other Penn research teams and labs. The group focuses on creating interactive tools that enhance scientific and programming workflows, supported by grants and cross-institutional partnerships.

• Human-Computer Interaction
• Programming
• Reading
• +13 more