Find Academic Supervisors

Dr. Zhan Gao is an Assistant Professor of Economics at Southern Methodist University, where he has been a faculty member since 2025. His core expertise lies in econometric theory and its intersection with machine learning, particularly in high-dimensional time-series and panel-data settings. Education: Ph.D. in Economics, University of Southern California Research Interests: Dr. Gao’s research spans econometrics , machine learning , biostatistics , and health economics . Methodologically, he focuses on robust estimation under endogeneity, high-dimensional inference, and convex optimization techniques that scale to large datasets. His recent publications advance robust regression methods that withstand outlier contamination, develop new identification strategies for categorical random-coefficient models, and create survival-analysis tools for dependent censoring in oncology trials. Collectively, this body of work reflects a commitment to rigorous theory paired with reproducible computational tools. Software & Reproducibility: All major papers are accompanied by open-source R and Python packages hosted on GitHub, ensuring full reproducibility. Notable repositories include implementations of penalized least squares, copula-graphic estimators, and high-dimensional GMM routines. Teaching: In Fall 2025 Dr. Gao will teach ECO 4370 / 6370 Computing for Economics , introducing graduate and advanced undergraduate students to modern computational methods and convex optimization in econometrics.

• Econometrics
• Machine Learning
• High-Dimensional Time Series
• +4 more

Douglas Wikström is a Lecturer in Theoretical Computer Science at the Royal Institute of Technology (KTH), specifically within the School of Electrical Engineering and Computer Science. He is based at Lindstedtsvägen 5, Floor 5, Stockholm, with contact information including phone +46 8 790 81 38 and email dog@kth.se. Dr. Wikström specializes in cryptography and theoretical computer science, with a strong focus on electronic voting systems, security protocols, and mix-net technologies. His research spans zero-knowledge proofs, verifiable computation, and cryptographic protocol design. His work demonstrates significant contributions to the theoretical foundations of secure voting systems and privacy-preserving technologies. His recent publications reveal a continued emphasis on cryptographic verification techniques, security analysis of voting protocols, and efficient implementations of cryptographic primitives. The research trajectory shows consistent contributions to both theoretical aspects of cryptography and practical implementations of secure systems. As an educator, Dr. Wikström teaches several advanced courses including Algorithms, Data Structures and Complexity (DD2350), Advanced Algorithms (DD2440), Fundamentals of Cryptography (DD2448), and Applied Cryptography (DD2520), where he serves as course coordinator, teacher, and examiner. His teaching portfolio demonstrates a strong commitment to both theoretical foundations and practical applications of computer science.

• Cryptography
• Theoretical Computer Science
• Algorithms
• +4 more

Kristóf Bérczi is a researcher at the Department of Operations Research, Eötvös Loránd University, Hungary. His work intersects computer science, mathematics, and operations research, focusing on theoretical and applied optimization problems. MSc and PhD in Operations Research, ELTE Postdoc at Hungarian Academy of Sciences Research Interests: Approximation algorithms Combinatorial optimization Matroid theory Submodular functions Algorithmic game theory Graph theory Recent Publication Trends: His 2024-2025 work explores matroid-constrained partitioning, inverse optimization algorithms, rainbow subgraph problems, and envy-free pricing models, often combining matroid theory with practical algorithm design. Scientific Contributions: Active in program committees (APPROX 2019, IPCO 2024, WALCOM 2025) Organized workshops on matroid optimization and matching theory Editorial board member of SIAM Journal on Discrete Mathematics Mentorship: Supervises PhD students Áron Jánosik, András Imolay, and others, with graduates now in postdoc/lecturer positions at institutions like CMM Chile and LSE UK.

• Approximation Algorithms
• Combinatorial Optimization
• Matroid Theory
• +3 more

Scott J Aaronson is the David J. Bruton Jr. Centennial Professor of Computer Science at the University of Texas at Austin , where he explores the theoretical foundations of quantum computing and computational complexity theory . A pioneer in the field, he has bridged quantum physics, computer science, and mathematics to clarify the capabilities and limitations of quantum computers. A summa cum laude graduate of Cornell University and holder of a PhD from UC Berkeley , Aaronson has shaped public understanding through his popular blog Shtetl-Optimized , his book Quantum Computing Since Democritus , and TED Talks. His research has established critical insights into: Quantum Supremacy : Theoretical frameworks for experimental validation without full fault tolerance Cryptographic Security : Demonstrating quantum lower bounds for collision problems Classical Complexity : The invention of algebrization as a tool for complexity class analysis Awarded the ACM Prize in Computing (2020) , ACM Fellow (2019) , and the Simons Investigator Award , his work has been recognized as foundational to the digital age. He has also mentored graduate students in quantum complexity theory, with projects advancing topics like Boson Sampling , Forrelation , and Quantum Zero-Knowledge Protocols . Scientific Awards: ACM Prize in Computing (2020) ACM Fellow (2019) Tomassoni-Chisesi Prize in Physics (2018) Simons Investigator Award (2017) Alan T. Waterman Award (2012) Aaronson’s advocacy for Deep Zionism and reflections on AI’s existential implications reflect his broader engagement with ethics and societal impact in technology.

• Quantum Computing
• Computational Complexity Theory
• Theoretical Computer Science
• +4 more

Daniel Wichs is a tenured Professor at the Khoury College of Computer Sciences at Northeastern University in Boston. He is a prominent researcher in the field of cryptography and serves as a Senior Scientist at NTT Research. His academic journey includes a PhD from New York University under Yevgeniy Dodis, a postdoctoral fellowship at IBM Research T.J. Watson, and degrees from Stanford University. Current Position: Professor at Northeastern University Prior Positions: IBM Josef Raviv Memorial Postdoctoral Fellow (2011-2013) Education: PhD NYU (2011), BS/MS Stanford (2005) Professor Wichs specializes in cryptography with research interests spanning computing on encrypted data, program obfuscation, lattice-based cryptography, information-theoretic cryptography, and foundational aspects of cryptography. He also maintains broad interests in computer security, algorithms, complexity theory, coding theory, and information theory. His research group includes current PhD students Manu Kondapaneni, LaKyah Tyner, and Ethan Mook, along with numerous successful alumni who have become professors at institutions worldwide. His recent publications demonstrate a strong focus on advanced cryptographic primitives including homomorphic encryption, zero-knowledge proofs, private information retrieval, and functional encryption. These works frequently appear at top-tier conferences like STOC, FOCS, CRYPTO, and EUROCRYPT, with several receiving best paper awards. His research often bridges theoretical foundations with practical applications in privacy-preserving computation. Best Paper at STOC 2023 Alfred P. Sloan Research Fellowship (2018) NSF CAREER Award (2018) J.P. Morgan Faculty Research Award (2022) IBM Postdoctoral Fellowship (2011-2013) Professor Wichs actively contributes to the academic community through service as Area Chair for CRYPTO 2025 and EUROCRYPT 2024, Program Chair for ITC 2020, General Chair for STOC 2016, and membership on numerous program committees. He teaches advanced courses including Foundations of Cryptography (CS 7810) and Theory of Computation (CS 3800), and has organized events like the Charles River Crypto Day and the Simons Summer Program in Cryptography 2025. His research group operates at the forefront of cryptographic theory, addressing fundamental questions about secure computation on encrypted data while developing practical cryptographic tools for real-world applications.

• Cryptography
• Computer Security
• Algorithms
• +7 more