جستجوی استاد راهنمای دانشگاهی

Giovanni De Micheliمشاهده پروفایل

استاد

• Integrated Circuit Design
• Hardware Synthesis
• Logic Optimization
• +۵ مورد دیگر

Giovanni De Micheli is a Full Professor at École Polytechnique Fédérale de Lausanne (EPFL), holding appointments in both the School of Computer and Communication Sciences (IC) and the School of Engineering (STI). He is affiliated with the Integrated Systems Laboratory (LSI) and serves as Scientific Director of EcoCloud. His primary office is located in INF 341 building at EPFL's Lausanne campus where he conducts research and teaching activities. Professor De Micheli's research spans multiple domains in electronic design automation and integrated circuit design. His primary interests include: Integrated Circuit Design and Hardware Synthesis Logic Optimization and Boolean Methods Nanoelectronics and 2D Electronics Quantum Computing and Emerging Technologies Low-Power Electronics and Energy-Efficient Systems Electronic Design Automation for Novel Computing Paradigms His recent publications demonstrate a strong focus on advancing logic synthesis techniques for both conventional and emerging technologies. Professor De Micheli's work bridges theoretical foundations with practical applications, particularly in adapting traditional EDA methods to novel computing paradigms like quantum computing and superconducting electronics. His research group has made significant contributions to the development of efficient algorithms for circuit optimization across multiple technology domains, with particular emphasis on area, power, and delay optimization while maintaining functional correctness. Professor De Micheli has supervised numerous doctoral students throughout his career at EPFL, mentoring over 40 PhD candidates whose research spans various aspects of electronic design automation, circuit design, and emerging technologies. His students have gone on to make significant contributions in both academia and industry. As Scientific Director of EcoCloud, Professor De Micheli leads research initiatives focused on energy-efficient computing systems and sustainable cloud infrastructure. His laboratory, the Integrated Systems Laboratory, serves as a hub for interdisciplinary research connecting computer science, electrical engineering, and materials science, with particular focus on next-generation computing technologies.

Florian Kerschbaumمشاهده پروفایل

استاد

• Data security and privacy
• Confidentiality and integrity in data science
• Applied cryptography
• +۴ مورد دیگر

Florian Kerschbaum is a Professor and NSERC/RBC Industrial Research Chair in Data Security at the Cheriton School of Computer Science, University of Waterloo. His research focuses on data security and privacy, applied cryptography, and confidentiality in data science. Research interests span data collection/preparation management, secure multi-party computation, homomorphic encryption, differential privacy, and machine learning robustness/privacy. His work develops cryptographic solutions for practical data management challenges in distributed systems.

Zhonghai Luمشاهده پروفایل

استاد

• Computer Architecture
• Embedded Systems
• Network-on-Chip (NoC)
• +۷ مورد دیگر

Zhonghai Lu is a Professor of Electronic Systems Design (specializing in Dependable and Autonomous Systems) at KTH Royal Institute of Technology, part of the Department of Electrical Engineering in the School of Electrical Engineering and Computer Science (EECS). He serves as Program Director for KTH's Embedded Systems master's program and Director of Studies at the Division of Electronics and Embedded Systems. His research focuses on Network-on-Chip (NoC), computer architecture, embedded systems, and Prognostics and Health Management (PHM) of power electronics. He leads a research group exploring in-network processing and embedded intelligence, transforming passive networks into active computational frameworks. Lu holds a BSc from Beijing Normal University (1989), MSc and PhD from KTH (2002, 2007), and an MBA in Innovation and Growth from the University of Turku (2012). He has authored over 240 scientific papers, including journal articles and peer-reviewed conferences, with notable recognitions such as Best Paper Awards at NOCS’2015 and EU HiPEAC, and a Featured Paper in IEEE Transactions on Computers (2020). He serves as Associate Editor for ACM Transactions on Architecture and Code Optimization (TACO) and has chaired major conferences like HiPEAC’2017 and NOCS’2018. His research group’s recent work includes integrating AI into hardware acceleration, fault-tolerant neural networks, and RUL estimation for power electronics using recurrent neural networks. Lu has secured grants from the Swedish Research Council and Intel Corporation and developed courses like IL2230 (Hardware Architectures for Deep Learning) and IL2233 (Embedded Intelligence), pioneering embedded AI education at KTH. Education: BSc (Beijing Normal University), MSc/PhD (KTH), MBA (University of Turku) Awards: Best Paper Awards (NOCS, EU HiPEAC), Swedish Research Council Grants, Intel Research Gifts Labs/Teams: Research Group on In-Network Processing and Embedded Intelligence

David Perkinsonمشاهده پروفایل

استاد

• Combinatorics
• Graph Theory
• Algebraic Geometry
• +۵ مورد دیگر

David Perkinson is a Professor of Mathematics at Reed College, where he holds a position in the Department of Mathematics. His research focuses on combinatorics, algebraic geometry, and discrete mathematics, with a particular emphasis on sandpile models, graph theory, and matroid theory. He is the author of the textbook *Divisors and Sandpiles: An Introduction to Chip-Firing*, which explores the combinatorial theory of chip-firing on graphs. Perkinson has also developed software tools like the Sandpile Java App, which visualizes and analyzes the Abelian Sandpile Model. He organizes the Cascade Lectures in Combinatorics (CALICO), a series of conferences funded by the National Science Foundation, aimed at fostering collaboration among researchers in combinatorics. His work bridges discrete mathematics with algebraic geometry, emphasizing connections between graph theory and geometric structures. Perkinson teaches advanced courses in analysis and contributes to the academic community through his research on topics such as divisor theory on graphs, sandpile groups, and combinatorial game theory. His recent publications (2015–2024) address matroid theory, sandpile dynamics, and applications of algebraic methods to discrete systems.

Leslie Ann Goldbergمشاهده پروفایل

استاد

• Algorithms
• Complexity Theory
• Randomised Algorithms
• +۵ مورد دیگر

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.

• IoT Security
• AI Security
• Wireless Networks
• +۲ مورد دیگر

Xiaojiang Du is the Anson Wood Burchard Endowed Professor at Stevens Institute of Technology, directing research in IoT security, AI security, and wireless networks. An IEEE Fellow and ACM Distinguished Member, he leads NSF-funded projects on secure IoT systems and cross-platform security vulnerabilities. Education PhD in Electrical Engineering, University of Maryland MS in Electrical Engineering, Tsinghua University BE in Electrical Engineering, Tsinghua University Research Focus: Develops security frameworks for IoT ecosystems and adversarial machine learning, with recent breakthroughs in smart home security anomaly detection. Honors: IEEE Fellow, ACM Distinguished Member, multiple best paper awards at IEEE conferences. Graduated PhD students hold faculty positions at UNC Charlotte, UL Lafayette, and ShanXi University. Professional Service: IEEE ComSoc Distinguished Lecturer, Associate Editor for IEEE Transactions, and General Co-Chair for IEEE/ACM IWQoS 2023. Secured $9M+ in research funding from NSF, NSA, and DOD.

Elette Boyleمشاهده پروفایل

دانشیار

• Cryptography
• Computer Security
• Coding Theory
• +۷ مورد دیگر

Elette Boyle is an Associate Professor at Reichman University (IDC Herzliya) and a Senior Scientist at NTT Research . She holds a Ph.D. in Mathematics from MIT (advised by Shafi Goldwasser and Yael Tauman Kalai) and an undergraduate degree from Caltech . Education Ph.D. in Mathematics, MIT B.S. in Mathematics, Caltech Her research focuses on cryptographic solutions for secure data processing , particularly in secure multi-party computation , function/homomorphic secret sharing , and distributed point functions . Recent work explores topology-hiding communication , memory checking complexity , and sublinear-communication MPC . Key trends in her publications include: Advancements in Function Secret Sharing for branching programs and sparse vectors. Efficient Secure Multi-Party Computation protocols with preprocessing. Information-theoretic and computational Topology-Hiding Broadcast schemes. Optimized Oblivious Transfer with constant computational overhead. Scientific Awards European Research Council (ERC) Award Israeli Science Foundation (ISF) Grant United States Air Force Office of Scientific Research (AFOSR) Grant Google Research Scholar Award International Association for Cryptologic Research (IACR) Recognition As Director of the Foundations & Applications of Cryptography (FACT) Research Center , she leads collaborative work with institutions like Technion Israel , Cornell University , and NTT Research . Her students include Pierre Meyer (Ph.D.) , Matan Hamilis (Ph.D.) , and D'or Banon (MSc.) .

Ron Peledمشاهده پروفایل

استاد

• Probability Theory
• Statistical Physics
• Mathematical Physics
• +۷ مورد دیگر

Ron Peled is a Full Professor in the School of Mathematical Sciences at Tel Aviv University , currently on leave to serve as the Brin Professor in the Department of Mathematics at the University of Maryland starting summer 2024. During 2022–2024 he was a Member at Princeton University and the Institute for Advanced Study . Education & Career: While explicit degrees are not listed, his trajectory shows appointments at NYU (2009–2010), UC Berkeley and Tel Aviv University as a teaching assistant, followed by faculty positions culminating in full professorship. Research Interests: His work lies at the intersection of probability theory, statistical physics, and combinatorics . Key themes include: Disordered systems and random environments (random-field Ising, spin glasses) First-passage percolation and random metrics Random surfaces and height functions Loop models and critical phenomena Random matrices and band matrices Geometric probability and allocation problems Publications & Impact: With over 70 papers in top journals such as Annals of Mathematics , Annals of Probability , Inventiones Mathematicae , and Communications in Mathematical Physics , his recent work explores minimal surfaces in random environments, localization in random band matrices, and quantitative disorder effects in low-dimensional spin systems. Grants & Awards: Research has been continuously funded by: Israel Science Foundation (grants 1048/11, 861/15, 1971/19, 2340/23) ERC Starting Grant LocalOrder ERC Consolidator Grant Transitions Marie Skłodowska-Curie International Reintegration Grant SPTRF Teaching & Mentoring: Prof. Peled has taught a broad spectrum of courses at Tel Aviv University (Brownian motion, probability, percolation, random matrices, stochastic calculus) and NYU (combinatorics, discrete mathematics). He has supervised 13 post-doctoral fellows and 8 graduate students (PhD & MSc) to date. Service & Outreach: He co-organizes the Joint Israeli Probability Seminar and has organized numerous international workshops and conferences including at Oberwolfach, Technion, and Tel Aviv University.

Albert Atseriasمشاهده پروفایل

استاد

• Computational Complexity
• Logic in Computer Science
• Finite Model Theory
• +۷ مورد دیگر

Albert Atserias is a Professor in the Department of Computer Science at the Universitat Politècnica de Catalunya (UPC), affiliated with the Faculty of Informatics of Barcelona (FIB) and the ALBCOM research group (Algorithms, Bioinformatics, Complexity, and Formal Methods). He is also associated with the Institut de Matemàtiques de la UPC-BarcelonaTech. His research is central to theoretical computer science, with a strong emphasis on logic and complexity. Atserias's research interests span Computational Complexity, Logic in Computer Science, Finite Model Theory, Proof Complexity, and Constraint Satisfaction Problems . His work explores the fundamental limits of computation, the expressive power of logical languages over finite structures, and the complexity of proving mathematical statements. He investigates the algebraic and combinatorial properties of proof systems, the limits of efficient algorithms for constraint solving, and the theoretical foundations of databases. His research often bridges logic, algebra, and combinatorics to provide deep insights into computational phenomena. The trends in his recent publications show a sustained focus on the logical and algebraic underpinnings of computational problems. Key themes include the consistency and complexity of database queries , the power and limitations of proof systems (like resolution and sum-of-squares), and the expressive power of homomorphism counts in graph theory. His work on the hardness of automating resolution and the development of circular proof systems are particularly significant contributions to proof complexity. The 2024 PODS Best Paper Award for work on relational consistency underscores the impact and timeliness of his research. Among his notable scientific awards are the prestigious ICREA Acadèmia , the PODS 2024 Best Paper Award , the Premi Extraordinari de Doctorat (Extraordinary Doctoral Prize), and the Kleene Award for Best Student Paper . These accolades reflect both the excellence of his early work and his continued leadership in the field. Atserias has been a principal investigator on numerous competitive research projects, including funding from the European Research Council (ERC) and the Spanish Ministry of Science. He has advised doctoral students, such as Toni Hakoniemi, whose thesis on proof complexity he supervised. His extensive collaborative network includes leading researchers like Phokion Kolaitis, Anuj Dawar, and Victor Dalmau. He has also served on the scientific committees of major conferences, contributing to the academic community. He is a core member of the ALBCOM research group , a leading team at UPC focused on theoretical aspects of computer science, which provides a vibrant environment for research in algorithms, complexity, and formal methods. His work is also connected to the broader Institut de Matemàtiques de la UPC, fostering interdisciplinary collaboration between computer science and mathematics.

• Homomorphic Encryption
• Big Data Analysis
• Database Systems
• +۶ مورد دیگر

Hayato Yamana serves as Professor at Waseda University's Faculty of Science and Engineering and concurrently holds the position of Vice President for IT Promotion and Chief Information Officer since October 2020. His academic journey began with a Dr. Eng. degree from Waseda University in 1993, followed by positions at the Electrotechnical Laboratory of MITI, before joining Waseda University as Associate Professor in 2000 and becoming full Professor in 2005. He has held significant leadership roles including Director of the Database Society of Japan and the Information Processing Society of Japan, as well as Vice Chair of IEICE's Information and Communication Society. Waseda University, Faculty of Science and Engineering (2005-Present) National Institute of Informatics, Visiting Professor (2005-Present) Waseda University, Vice President for IT Promotion (2020-Present) Deputy Chief Information Officer (2015-2020) His research spans homomorphic encryption, big data analysis, and computer architecture, with notable contributions in privacy-preserving computation, recommender systems, and secure data processing. His work bridges theoretical cryptography with practical applications in smart cities, healthcare, and e-commerce security. Recent publications demonstrate strong focus on accelerating homomorphic encryption operations, improving recommendation system diversity, and developing novel authentication mechanisms. Analysis of his 15 most recent publications reveals consistent emphasis on privacy-preserving technologies (particularly homomorphic encryption applications), innovative recommender system architectures, and biometric security solutions. His research group produces highly cited work at the intersection of cryptography, machine learning, and systems security, with practical implementations in real-world scenarios including smart grids, e-commerce, and healthcare. Fellow, Information Processing Society of Japan (IPSJ), 2020 Golden Core Award, IEEE Computer Society, 2018 Fellow, Institute of Electronics, Information and Communication Engineers (IEICE), 2018 IBM Faculty Award, 2009 Multiple Best Paper Awards from IEICE, IPSJ, and ITE Yamana has secured substantial research funding for projects in homomorphic encryption, smart city infrastructure, and privacy-preserving systems. His leadership extends to advising numerous doctoral students and directing major research initiatives including the Smart Systems and Services Innovative Professional Education Program. He maintains active collaborations with industry partners through projects involving secure computation and data analytics. His research group operates at the forefront of secure computing, with specialized laboratories focused on homomorphic encryption acceleration, privacy-preserving machine learning, and secure mobile authentication. The team actively develops practical implementations of cryptographic protocols for real-world applications in healthcare, finance, and smart city infrastructure, bridging theoretical cryptography with deployable security solutions.

• Geometric Group Theory
• Discrete Groups
• Metric Geometry
• +۶ مورد دیگر

Goulnara Arzhantseva is a full Professor at the Department of Mathematics within the Faculty of Mathematics at the University of Vienna. With an active research career spanning over a decade, she has established herself as a prominent figure in geometric group theory and related fields. Her work demonstrates continuous scholarly output with publications appearing consistently from 2011 through 2024. Professor Arzhantseva's research focuses primarily on geometric group theory, with particular emphasis on discrete groups, metric geometry, approximation properties of groups, small cancellation theory, expanders, and sofic groups. Her work bridges pure mathematics with applications in metric geometry and functional analysis. The breadth of her research is evident in her collaborations with numerous mathematicians across different institutions and countries. Her publication record shows a clear trajectory of increasingly sophisticated work in geometric group theory. The most recent publications (2022-2024) focus on metric approximations of discrete groups, spectral gap properties, origami expanders, and acylindrical hyperbolicity in cubical small cancellation groups. These works represent cutting-edge research at the intersection of group theory, geometry, and combinatorics. Scientific Awards: Prize mentioned in search results (4 total, specific names not provided) Prize mentioned in search results (4 total, specific names not provided) Prize mentioned in search results (4 total, specific names not provided) Prize mentioned in search results (4 total, specific names not provided) Professor Arzhantseva has been actively involved in numerous research projects, with records showing 7 projects between 2011-2024. Her collaborative approach is evident in her extensive publication record, which includes significant contributions to prestigious mathematics journals. While specific details about her advising activities are not provided in the available information, her substantial research output suggests active mentorship of graduate students in geometric group theory.

Lisa Willsمشاهده پروفایل

استادیار

• Computer Architecture
• Hardware Acceleration
• Hardware-Software Co-Design
• +۵ مورد دیگر

Lisa Wills serves as Assistant Professor of Computer Science at Duke University's Trinity College of Arts & Sciences and holds a joint appointment in Electrical and Computer Engineering at the Pratt School of Engineering since 2019. Her research bridges computer architecture and domain-specific applications, with a focus on hardware acceleration for computationally intensive fields. Dr. Wills earned her Ph.D. from Columbia University in 2014. Her academic journey reflects a deep commitment to advancing hardware-software co-design methodologies for real-world computational challenges. Her research centers on developing efficient hardware accelerators for big data analytics, particularly in genomics, graph processing, and database systems. She pioneers frameworks that simplify accelerator deployment while tackling critical bottlenecks in genomic data analysis, protein structure prediction, and privacy-preserving computing. Current work focuses on hardware-aware machine learning systems and energy-efficient architectures for emerging AI applications. Analysis of her publication record reveals a clear trajectory: from foundational work in database processing units (2014-2016) to specialized genomic accelerators (2019-2021), then evolving toward ML-enhanced design automation (2022-2023) and cutting-edge architectural abstractions (2024-2025). Her research consistently targets the intersection of hardware efficiency and domain-specific computational demands, with increasing emphasis on AI/ML workloads. Google ML and Systems Junior Faculty Award (2025) Dr. Wills actively mentors doctoral students including Chris Kjellqvist (lead architect of Beethoven accelerator framework), Mason Ma (PyTFHE FHE framework), and Mansi Choudhary (COCOSSim accelerator simulator). Her research is supported by significant grants including the NSF AI Institute: Athena ($20M, 2021-2027), Meta-funded ProSE accelerator project (2023-2026), and NSF CAREER award (2021-2026), totaling over $25M in active funding. She directs the APEX Lab (Application-driven Programmable Efficient Accelerated Systems), which develops open-source frameworks like Beethoven for FPGA/ASIC accelerator deployment and focuses on lowering barriers for non-hardware researchers to leverage custom acceleration in genomics, AI, and big data applications.

Lisa Wu Willsمشاهده پروفایل

استادیار

• Computer Architecture
• Hardware-Software Co-design
• Hardware Accelerators
• +۶ مورد دیگر

Lisa Wu Wills is an Assistant Professor in the Department of Computer Science and Electrical and Computer Engineering at Duke University, leading the APEX Lab (Application-driven Programmable Efficient Accelerated Systems Lab). Her research focuses on hardware acceleration for big data analytics in genomics, graphs, and databases to advance healthcare and natural sciences. Education: Ph.D. in Computer Science, Columbia University, 2014 Research Interests: Dr. Wills pioneers computer architecture and hardware-software co-design to create efficient accelerators for emerging applications. Her work targets genomics , graph analytics , and database systems , emphasizing simplified hardware deployment and energy efficiency for scientific breakthroughs in healthcare and AI. Publication Trends: Her 2022-2025 publications reveal a strong focus on open-source frameworks (Beethoven, PyTFHE) for accelerator development, hardware acceleration in privacy-preserving computing, and optimization for large language models. Key themes include transfer learning for EDA, domain-specific architectures for genomics, and energy-efficient image processing. Scientific Awards: Google ML and Systems Junior Faculty Award (2025) Advising and Grants: Dr. Wills mentors three PhD students: Chris Kjellqvist (Beethoven framework architect), Mason Ma (PyTFHE lead for FHE applications), and Mansi Choudhary (COCOSSim simulator creator). Her 2025 Google award funds research on accelerating vector databases and retrieval-augmented generation for LLMs. Labs and Teams: She directs the APEX Lab at Duke, developing tools like Beethoven (open-source accelerator composer) and PyTFHE for hardware-software integration, enabling domain scientists to leverage custom acceleration with minimal hardware expertise.

• Trustworthy Machine Learning
• Algorithmic Fairness
• Data Privacy
• +۷ مورد دیگر

Hui Wang is a Professor and Associate Chair for PhD Studies and Research in the Department of Computer Science at the Charles V. Schaefer, Jr. School of Engineering and Science, Stevens Institute of Technology. She also serves as the Director of the Data Science PhD Program and holds leadership roles in multiple institutional committees, including the Doctoral Committee, Faculty Mentoring Program, and Strategic Planning initiatives at both departmental and university levels. Research Interests: Dr. Wang's research focuses on building trustworthy machine learning systems by integrating privacy, fairness, and accountability . Her work aims to fortify ML models against privacy attacks, eliminate algorithmic biases, and ensure auditable decision-making. She explores intersections between machine learning, data mining, and cybersecurity, with applications across domains requiring ethical and secure AI deployment. Recent Research Trends: Her recent publications and funded projects reflect a strong emphasis on privacy-preserving machine learning , fairness-aware systems , and verifiable computing . Themes include securing graph embeddings, federated learning with fairness guarantees, and audit mechanisms for black-box models. Supported by NSF, Cisco, and Google, her work bridges theoretical rigor with practical system design. Scientific Awards: NSF CAREER Award, 2014 Advising and Grants: Dr. Wang actively mentors PhD students and hosts visiting scholars. She leads multiple NSF-funded projects, including Securing Network Embedding against Privacy Attacks and Privacy for All: Ensuring Fair Privacy Protection in Machine Learning . Her research is supported by substantial grants from the National Science Foundation, Cisco, and Google, reflecting her leadership in trustworthy AI. Labs and Teams: While not explicitly named, Dr. Wang leads a research group focused on trustworthy machine learning, advising students and collaborating with industry partners. She is deeply integrated into the Data Science PhD program and CS faculty leadership, shaping research and academic strategy at Stevens.

• Theoretical Computer Science
• Distributed Algorithms
• Parallel Algorithms
• +۳ مورد دیگر

Yi-Jun Chang is an Assistant Professor in the Department of Computer Science at the National University of Singapore (NUS). He previously held a Junior Fellow position at the Institute for Theoretical Studies, ETH Zurich (2019–2021), and earned his Ph.D. in Computer Science and Engineering from the University of Michigan (2019). His research focuses on theoretical computer science, particularly distributed, parallel, and sublinear graph algorithms. Ph.D., University of Michigan (2019) M.S., National Taiwan University (2015) B.S., National Taiwan University (2013) Chang’s research explores the complexity and optimization of algorithms in distributed systems, including leader election, graph shattering, expander decomposition, and subgraph detection. His work addresses fundamental challenges in time-energy trade-offs, communication efficiency, and deterministic vs. randomized approaches in models like LOCAL and CONGEST. Recent publications highlight advancements in distributed triangle enumeration, optimal coloring, shortest path computation, and certification in bounded pathwidth graphs. Awards include the PODC 2019 Best Paper and Best Student Paper Awards, followed by the 2020 PODC Doctoral Dissertation Award. PODC 2019 Best Paper Award PODC 2019 Best Student Paper Award 2020 PODC Doctoral Dissertation Award Chang teaches courses such as CS3230 (Design and Analysis of Algorithms) and CS5275 (The Algorithm Designer's Toolkit). He advises Ph.D. students Hung Thuan Nguyen and Haoran Zhou, and has collaborated with postdoctoral researchers including Gopinath Mishra and Dean Leitersdorf.