Find Academic Supervisors

• Operations Research
• Machine Learning
• Optimization under Uncertainty
• +4 more

Minseok Ryu is an Assistant Professor at the School of Computing and Augmented Intelligence, Arizona State University (ASU). He holds a Ph.D. in Industrial & Operations Engineering from the University of Michigan (2020). Prior to ASU, he was a postdoctoral appointee at Argonne National Laboratory’s Mathematics and Computer Science Division. His research focuses on optimization methodologies for decentralized and stochastic decision-making distributed algorithms for machine learning and operations research applications in healthcare systems and energy grids Teaching responsibilities include courses on applied deterministic operations research (IEE 574), optimization (IEE 622), and research practicums (IEE 792). His work emphasizes computational challenges in decision-making under uncertainty, with recent projects addressing nurse staffing optimization, federated learning frameworks (e.g., APPFL/APPFLX), and resilient power grid systems. He has no recorded academic awards but actively contributes to open-source software and cross-disciplinary research collaborations. Research interests bridge theory and practice, targeting social goods through optimization techniques like distributionally robust optimization, federated learning, and heuristic algorithms for energy and healthcare systems.

Kaki RyanView profile

Assistant Professor

• Hardware Security
• Symbolic Execution
• Computer Science Education
• +3 more

Kaki Ryan is a Teaching Assistant Professor at the Department of Computer Science, University of North Carolina at Chapel Hill. She holds a Ph.D. (2025), M.S. (2021), and B.S. (2020) from UNC, with a minor in AAAD. Her research focuses on hardware security, symbolic execution, and computer science education. Education Ph.D., 2025, UNC-Chapel Hill M.S., 2021, UNC-Chapel Hill B.S., 2020, UNC-Chapel Hill (Computer Science and Mathematics) Ryan's research centers on hardware security, particularly using symbolic execution to identify bugs and vulnerabilities in hardware designs. She also emphasizes broadening participation in computing and improving pedagogical strategies in computer science education. Her recent publications (2023-2025) explore symbolic execution techniques for hardware security verification, including query caching, information flow analysis, and path explosion mitigation. These works span conferences like ASPLOS, VTS, FMCAD, and workshops such as HASP. Scientific Awards John M. Glotzer Graduate Teaching Assistant Award (2020-2021) Tanner Award for Excellence in Undergraduate Teaching (2022) As an educator, Ryan has served as Instructor of Record for COMP 435 (Computer Security Concepts) and COMP 311 (Computer Organization) in Fall 2025. She has extensive teaching experience as a Graduate Teaching Assistant, Head Teaching Assistant, and Undergraduate Teaching Assistant for courses like COMP 210, COMP 110, and COMP 435, with a focus on data structures, security concepts, and programming fundamentals.

Brian LawrenceView profile

Assistant Professor

• Arithmetic Geometry
• Number Theory
• Diophantine Geometry
• +2 more

Brian Lawrence is an Assistant Professor in the Department of Mathematics at the University of Wisconsin–Madison, currently on leave as of 2025. Previously, he held positions at UCLA, the University of Chicago, and Columbia University, following doctoral studies at Stanford University under Akshay Venkatesh. His educational background includes: PhD in Mathematics from Stanford University (advisor: Akshay Venkatesh) Lawrence's research centers on arithmetic geometry, specializing in Diophantine problems through p-adic methods. His work develops innovative approaches to Mordell's conjecture, Shafarevich-type results, and rational point distribution using p-adic Hodge theory, étale cohomology, and period mappings. He bridges theoretical number theory with computational frameworks, particularly in algorithmic solutions for Diophantine equations. His publication trends reveal sustained focus on foundational Diophantine geometry problems, with recent work emphasizing conditional algorithms for the Mordell problem and sparsity phenomena in integral points. Collaborations with leading mathematicians like Venkatesh and Sawin demonstrate interdisciplinary engagement across number theory and algebraic geometry. Lawrence actively mentors undergraduate researchers, supervising projects on resultants, Hodge theory, and symmetric polynomials by students including Pramana Saldin, Yuchen Chen, Anuj Sakarda, and Spencer Dembner. His organizational roles include founding the Crystalline Cohomology seminar at Columbia and co-organizing the University of Chicago Number Theory Seminar, fostering collaborative research environments. He contributes extensively through expository notes on schemes, polynomials on lattices, and Fibonacci numbers modulo p, reflecting commitment to mathematical education and knowledge dissemination across multiple institutions.

Andrea ColadangeloView profile

Assistant Professor

• Quantum Computation
• Quantum Cryptography
• Quantum Learning Theory
• +3 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.

• Educational Technology
• Informatics Education
• Programming Pedagogy
• +3 more

Snježana Babić serves as Associate Professor and Head of the Graduate Study Program Informatics - Teaching Major at the Faculty of Informatics in Pula , University of Pula. With a PhD obtained in 2016 and university affiliation since 2017, she teaches across undergraduate and graduate programs focusing on ICT fundamentals, web design, digital competencies, and informatics education methodology. Her educational background includes graduation in 1993 followed by doctoral studies culminating in 2016. Though specific institutions aren't detailed in the text, her career trajectory shows progression from foundational ICT teaching to specialized informatics education leadership. Babić's research centers on educational technology adoption with particular emphasis on programming pedagogy for young learners through the MEMA method. Her work investigates digital competencies across multiple educational contexts, from primary schools to higher education. Recent publications demonstrate rapid adaptation to emerging technologies, with 2025 studies examining ChatGPT integration in Croatian educational settings and cross-cultural applications of programming methods. Analysis of her 15 most recent publications reveals consistent focus on technology acceptance models applied to Croatian educators and students. The research trajectory shows evolution from foundational e-learning systems (2016-2020) to cutting-edge AI and robotics applications (2022-2025), maintaining strong methodological focus on teacher motivation , implementation barriers , and culturally-specific adoption factors . Her teaching portfolio demonstrates deep integration with research interests: Undergraduate: ICT Fundamentals, Web Design and Application Graduate: Digital Competencies in Education, Informatics Education Methodology, Practicum for IT Educators Cross-disciplinary: ICT in Nursing, Healthcare Informatics Babić actively contributes to institutional leadership as program head while maintaining robust research productivity. Her work bridges theoretical technology adoption frameworks with practical implementation challenges in Croatian educational contexts, particularly examining how emerging technologies like humanoid robots and AI assistants can be effectively integrated into teaching practices.

Angjoo KanazawaView profile

Assistant Professor

• Computer Vision
• Computer Graphics
• Artificial Intelligence
• +6 more

Angjoo Kanazawa is an Assistant Professor in the Department of Electrical Engineering and Computer Sciences (EECS) at the University of California, Berkeley. She leads the Kanazawa AI Research (KAIR) lab under the Berkeley Artificial Intelligence Research (BAIR) umbrella and serves on the advisory board of Wonder Dynamics. Her research focuses on the intersection of computer vision, computer graphics, and machine learning, with a particular emphasis on 4D reconstruction of dynamic scenes, neural radiance fields (NeRF), and systems that model human-environment interactions from 2D visual data. Education : Ph.D., Computer Science (2017), University of Maryland, College Park BA, Mathematics and Computer Science (2012), New York University (NYU) Her work aims to build systems that can capture, perceive, and understand complex 3D/4D worlds from photographs and videos, enabling applications in scene reconstruction, motion analysis, and generative modeling. She has pioneered techniques for scaling NeRFs across GPUs (NeRF-XL), developing open-source tools like nerfstudio and gsplat. Her recent publications focus on topics like self-occluded avatar recovery (SOAR), decentralized diffusion models, and 4D reconstruction of articulated objects for robotics. Kanazawa's research has been recognized with prestigious awards including the IEEE CS TCPAMI Young Researcher Award (2024) , Sloan Research Fellowship (2023) , and Google Faculty Research Award (2021) . Her lab has trained numerous students who now hold positions at leading institutions and companies like Anthropic, Meta Reality Labs, and Luma AI. Key Scientific Awards : IEEE CS TCPAMI Young Researcher Award (2024) Sloan Research Fellow (2023) Hellman Fellow (2022) Bakar Fellows Spark Award (2022) Google Faculty Research Award (2021) Her KAIR lab collaborates extensively with industry partners and academic institutions, including the Max Planck Institute and Google Research. She has served as an advisor for PhD students and postdocs who now lead teams at UC Berkeley, MIT, Stanford, and Luma AI, while her teaching includes graduate courses like CS 280A (Computer Vision) and CS 294-173 (Learning for 3D Vision).

• Functional Analysis
• Artificial Intelligence
• Foundations of Computational Mathematics
• +15 more

Professor Anders C. Hansen is a mathematician at the University of Cambridge and University of Oslo, leading the Applied Functional and Harmonic Analysis group. His work bridges functional analysis, artificial intelligence, and computational mathematics, focusing on the Solvability Complexity Index (SCI) hierarchy and stability issues in deep learning. He has held prestigious fellowships, including a Royal Society University Research Fellowship and Peterhouse Bye-Fellowship. Educated at the University of Cambridge, UC Berkeley, and the Norwegian University of Science and Technology Developed groundbreaking theories in compressed sensing and deep learning, revealing algorithmic instability paradoxes Organized workshops on computational mathematics and AI interpretability His research explores the SCI hierarchy , exposing computational barriers in AI, quantum mechanics, and inverse problems. Key projects include Smale’s 18th problem and analyzing neural network stability. His work has transformed understanding of compressed sensing, particularly in medical imaging. Recent scientific awards include the Whitehead Prize (2019), IMA Prize (2018), and Leverhulme Prize (2017). Collaborations span institutions like Caltech, MIT, and the University of Vienna. As an educator, he teaches NST Part IA Mathematical Methods , Part II Numerical Analysis , and a Part III course on Compressed Sensing . His group has mentored 17 PhD and postdoctoral researchers since 2012.

• Graph Algorithms
• Optimization
• High-Dimensional Geometry
• +3 more

Yang P. Liu is an Assistant Professor at Carnegie Mellon University 's Department of Computer Science . He received his PhD from Stanford University under the supervision of Aaron Sidford and previously studied at MIT . Fields of Interest : Graph Algorithms, Optimization, High-Dimensional Geometry, Additive Combinatorics, Theoretical Computer Science. His research focuses on algorithmic design and analysis for graph problems, optimization, and combinatorics, with applications in machine learning and complexity theory. Recent work includes advancements in parallel repetition games , combinatorial lines , and dynamic graph algorithms . In 2024, his research spanned FOCS , STOC , and RANDOM conferences, addressing problems in k-CSPs , min-cost flow , and hypergraph sparsification . Earlier contributions (2023) included deterministic flow algorithms and spectral hypergraph techniques. Scientific Awards : NDSEG Fellowship (2018-2021), Google PhD Fellowship (2022-2023), FOCS Best Paper (2022), STOC Best Student Paper (2022), FOCS Best Student Paper (2021). He teaches CS 15-759 , a graduate course on convex optimization theory and applications, covering gradient descent, interior point methods, and algorithmic sparsification techniques.

Lijie ChenView profile

Assistant Professor

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

Lijie Chen is an Assistant Professor in the Department of Electrical Engineering and Computer Sciences at UC Berkeley, where he is part of the Berkeley Theory Group. Previously, he was a Miller Research Fellow at UC Berkeley, hosted by Avishay Tal and Umesh Vazirani, and earned his Ph.D. from MIT under Ryan Williams. His research focuses on theoretical computer science, particularly computational complexity theory, with applications to quantum physics and AI safety. Education: Ph.D. in Computer Science from MIT (2022), B.Sc. from Yao Class at Tsinghua University. Research Interests: Complexity theory, quantum complexity, derandomization, circuit lower bounds, and foundational aspects of AI safety. Chen has made significant contributions to understanding fundamental questions in complexity theory, including circuit lower bounds and the connections between randomness and computation efficiency. His work often bridges theoretical insights with practical implications in quantum computing and algorithm design. Awards and Honors: Machtey Award for Best Student Paper (2019). Danny Lewin Best Student Paper Award (2019). Invited to SICOMP Special Issues for FOCS and STOC papers. He has organized workshops on complexity theory and derandomization, and his research has been recognized in venues like STOC, FOCS, and the Journal of the ACM.

• Software Verification
• Formal Methods
• Programming Languages
• +5 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.

Takuya OouraView profile

Assistant Professor

• Numerical Analysis
• Numerical Integration
• Algorithms
• +3 more

Takuya Ooura is an Assistant Professor at the Research Institute for Mathematical Sciences (RIMS) at Kyoto University, specializing in numerical analysis and mathematical software development. His work bridges theoretical mathematics with practical applications in scientific computing and software development. Dr. Ooura earned his educational credentials through a rigorous academic path: he graduated from Hokuriku High School in 1987; completed his undergraduate studies at Nagoya University's School of Science in 1992; earned his Master of Engineering from the Department of Applied Physics at the University of Tokyo in 1994; and completed his PhD (Engineering) from the same department in 1997. His academic journey continued with a Research Fellowship from the Japan Society for the Promotion of Science (1997) followed by a position as Research Associate at RIMS, Kyoto University (2000). Dr. Ooura's research focuses on numerical integration algorithms, particularly his groundbreaking double exponential formula for Fourier-type integrals, which has been incorporated into Mathematica's NIntegrate function. He has also developed a high-speed FFT library that's utilized in Google Chrome browser (visible in chrome://credits). His work on continuous Euler transformation for accelerating convergence of slowly decaying integrals represents significant innovation in numerical analysis. His research spans both theoretical development and practical implementation of mathematical algorithms with real-world applications. His publication record demonstrates consistent contributions to numerical analysis, with particular emphasis on quadrature methods, integral transforms, and high-precision computation. His work shows a clear progression from theoretical foundations to practical implementations, with several algorithms achieving widespread adoption in commercial and open-source software. Paper prize awarded by JSIAM (2000) for 'A continuous Euler transformation and its application to Fourier transforms of slowly decaying functions' Paper prize awarded by JSIAM (2001) for 'Improvement of the PI Calculation Algorithm and Implementation of Fast Multiple-Precision Computation' Paper prize awarded by JSIAM (2005) for 'An Improved Convergence Test for the Double Exponential Formula' Japan Society for Industrial and Applied Mathematics 4th Achievement Award (2014) for 'Pioneering and practical development of the double exponential numerical integration method' Dr. Ooura has developed several widely used mathematical software packages including the double exponential integral formula, Clenshaw-Curtis numerical integration rule, and a general-purpose FFT library. His FFT package is particularly notable for its speed and accuracy, with benchmark tests showing superior performance compared to other implementations. His software has been incorporated into major projects including Google Chrome and SETI@home, demonstrating the practical impact of his theoretical work. His future research directions include further development of numerical computation libraries and applying his methods to various computational problems.

Zhun DengView profile

Assistant Professor

• Machine Learning
• Statistics
• Theoretical Computer Science
• +4 more

Zhun Deng is a tenure-track Assistant Professor at the Department of Computer Science, University of North Carolina at Chapel Hill. His research bridges machine learning, statistics, and theoretical computer science, focusing on rigorous frameworks for responsible AI systems. He previously held postdoctoral positions at Columbia University and completed his Ph.D. at Harvard's Theory of Computation group under Cynthia Dwork. Ph.D. in Computer Science, Harvard University (2022) B.Sc. in Mathematics, Chu Kochen Honors College, Zhejiang University His research spans theoretical foundations of machine learning, including: Quantile-based risk control and conformal prediction Fairness guarantees in algorithmic decision-making Uncertainty quantification for LLMs Copyright frameworks for generative AI Physics-informed hybrid models Multi-agent reinforcement learning with constraints Recent work analyzes LLM alignment through distribution-free methods (ICML 2025), explores performativity challenges (ICML 2025), and develops calibration techniques (ICLR 2024). Collaborations include research interns from Stanford, MIT, and NYU. Students in his group include: Ruomeng Ding (Ph.D., UNC) Xiaowei Yin (Ph.D., UNC) Kaicheng Zhang (Ph.D., UNC)

Daniel CooneyView profile

Assistant Professor

• Mathematical Biology
• Applied Dynamical Systems
• Differential Equations
• +4 more

Daniel Cooney is an Assistant Professor in the Department of Mathematics at the University of Illinois Urbana-Champaign. He holds additional affiliations as an Affiliate at the Carl R. Woese Institute for Genomic Biology. His research focuses on applying partial differential equations (PDEs), dynamical systems, and stochastic processes to study evolutionary dynamics, particularly in biological and social systems. Key themes include multilevel selection, evolutionary game theory, and the emergence of cooperative behavior. Cooney earned his PhD in Applied and Computational Mathematics from Princeton University, advised by Simon Levin, and completed a postdoc as a Simons Fellow in Mathematical Biology at the University of Pennsylvania. His work bridges theoretical mathematics with applications in ecology, epidemiology, and social sciences. Recent publications explore topics like altruistic punishment in cultural systems, classroom-turnover dynamics, and protocell evolution. He actively participates in academic outreach, co-organizing conferences such as the AMS Special Session on Mathematics of Infectious Disease and the SIAM Minisymposium on Social-Ecological Systems. His research has been published in high-impact journals including *Proceedings of the National Academy of Sciences* and *Bulletin of Mathematical Biology*.

Eric WongView profile

Assistant Professor

• Machine Learning
• Artificial Intelligence
• Explainable AI
• +5 more

Eric Wong is an Assistant Professor in the Department of Computer and Information Science at the University of Pennsylvania, affiliated with the ASSET Center and leading the Brachio Lab. His research focuses on robust and reliable machine learning, including model debugging, adversarial robustness, and explainable AI. He holds a PhD from Carnegie Mellon University (CMU), advised by J. Zico Kolter, and completed a postdoc with Aleksander Madry. His work bridges theory and practice, addressing challenges in model interpretability, safety, and scalability. Teaching includes CIS 5200 (Machine Learning), CIS 3333 (Mathematics for Machine Learning), and a specialized course on debugging ML pipelines. Notable contributions include the FIX Benchmark for interpretable features and defenses against LLM jailbreaking attacks. He received an Amazon Research Award in 2024 and has published extensively in top conferences like ICML, NeurIPS, and ICLR. Affiliations: University of Pennsylvania (CIS), ASSET Center, Brachio Lab Education: PhD in Machine Learning (CMU), Postdoc at MIT Key Projects: FIX Benchmark, DOLPHIN framework, SmoothLLM defense Awards: Amazon Research Award (2024) Lab Focus: Safe AI, model debugging, neurosymbolic learning

Sarah DeanView profile

Assistant Professor

• Machine Learning
• Data-Driven Control
• Decision-Making Systems
• +6 more

Sarah Dean is an Assistant Professor in the Computer Science Department at Cornell University, affiliated with the College of Engineering. Her research focuses on the interplay of machine learning, optimization, and dynamics in real-world systems, particularly in control theory, recommendation systems, and ethical AI. Education: PhD in EECS, University of California, Berkeley (2021) Postdoctoral Research, University of Washington (2021-2022) Research Interests: Data-driven control systems, reinforcement learning, recommendation systems, user dynamics, algorithmic fairness, and the societal impacts of AI. She emphasizes foundational understanding of how learning systems interact with human and social processes. Recent Work Trends: Her articles explore topics like bilinear system identification, user participation dynamics in recommendation platforms, and ethical considerations in AI development. Recent work includes harm mitigation strategies and mathematical modeling of AI-human feedback loops. Awards: AI2050 Early Career Fellow (2024) Best Paper at ICML 2018 (Delayed Impact of Fair Machine Learning) Best Student Paper in Imaging Systems (OSA Congress 2018) Advising & Labs: Advises over 15 graduate and undergraduate students. Leads research on interactive ML systems, with contributions to projects like the 'MSGD' repository for streaming data learning. Active in the GEESE group, promoting socially responsible computing.