Find Academic Supervisors

Andrew ChildsView profile

Professor

• Quantum Algorithms
• Quantum Information Processing
• Quantum Simulation
• +2 more

Andrew Childs is a Professor at the University of Maryland, affiliated with the Department of Computer Science and the Institute for Advanced Computer Studies (UMIACS). He serves as Director of the NSF Quantum Leap Challenge Institute for Robust Quantum Simulation (RQS) and is a Fellow at the Joint Center for Quantum Information and Computer Science (QuICS). His research focuses on quantum algorithms for simulating physical systems, algebraic problems, and quantum walk protocols, with applications in quantum computing and computational complexity. University of Maryland Institute for Advanced Computer Studies (UMIACS) Joint Center for Quantum Information and Computer Science (QuICS) NSF Quantum Leap Challenge Institute for Robust Quantum Simulation Childs' research spans quantum simulation, quantum Fourier transform, phase estimation, and Hamiltonian dynamics. He has developed techniques to reduce quantum computational resources for simulating quantum systems and explored limitations of quantum computers through hidden subgroup problems and non-unitary dynamics. His publications cover diverse areas including quantum walk optimization, Hamiltonian simulation methods, and applications to cryptography and condensed matter physics. Recent works address spatial search algorithms, product formulas for commutators, and quantum routing protocols. As an educator, Childs has taught courses on quantum algorithms and information processing at both the University of Maryland and University of Waterloo, with lecture notes and materials spanning multiple years. Contact: amchilds@umd.edu | Office: ATL 3359 | Affiliated with University of Maryland's quantum research institutes.

Supratik ChakrabortyView profile

Professor

• Formal Methods
• Formal Verification
• Automated Synthesis
• +7 more

Supratik Chakraborty serves as the Bajaj Group Chair Professor in the Department of Computer Science and Engineering at Indian Institute of Technology Bombay. He maintains dual affiliations with the Centre for Formal Design and Verification of Software and the Centre for Liberal Education at IIT Bombay, demonstrating his cross-disciplinary engagement. Professor Chakraborty's research spans formal methods with focus on formal verification, rigorous analysis of system models, and automated synthesis of systems from specifications. His work bridges theoretical foundations with practical applications, particularly in developing mathematically provable guarantees for increasingly complex hardware, software, and intelligent systems. Current research interests include constrained counting and sampling, scalable formal verification of software and hardware systems, automated synthesis of programs and circuits, and applications of automata, logic and finite model theory to practical verification challenges. His publication trajectory shows a significant evolution from traditional hardware and software verification toward addressing verification challenges in machine learning and AI systems. Recent work increasingly focuses on interpretability of black-box models, verification of neural networks, and synthesis techniques applicable to intelligent systems. The research demonstrates strong interdisciplinary connections between formal methods, programming languages, and artificial intelligence. IIT Bombay Excellence in Thesis (CSE) Award 2011 (for Bhargav Gulavani's thesis) IIT Bombay Excellence in Thesis (CSE) Award 2017 (for Abhisekh Sankaran's thesis) Best Paper in Algorithms and Architecture track at IEEE International Conference on Computer Design: VLSI in Computers and Processors, 1998 Professor Chakraborty has successfully supervised 11 doctoral students, with research spanning formal verification techniques, Boolean functional synthesis, constrained counting, and applications to hardware and software systems. His students have gone on to positions at major institutions including Microsoft Research, TCS Research, Georgia Tech, and BARC, reflecting the strong industry and academic impact of his mentorship. Current research directions show increasing emphasis on verification challenges posed by machine learning systems and AI. His research group at IIT Bombay, while not explicitly named in the materials, appears to focus on formal methods with strong connections to the Centre for Formal Design and Verification of Software. The group maintains active collaborations with international researchers including Moshe Y. Vardi at Rice University, and has made significant contributions to verification tools like VeriAbs that bridge theoretical advances with practical applications.

Henry YuenView profile

Associate Professor

• Quantum Computing
• Complexity Theory
• Cryptography
• +2 more

Henry Yuen is the Srivani Family Associate Professor of Computer Science at Columbia University, with affiliations in the CS Theory group, Data Science Institute, and Columbia Quantum Initiative. His work bridges theoretical computer science and quantum information, focusing on the computational foundations of quantum systems. Yuen received his BA in Mathematics from the University of Southern California (2010) and PhD in Computer Science from MIT (2016). His research explores quantum complexity theory, quantum cryptography, and quantum information through both theoretical frameworks and practical applications. His recent publications reveal a strong focus on quantum pseudorandomness, quantum circuit complexity, and quantum cryptographic primitives. The research trajectory demonstrates increasing sophistication in connecting quantum computational models with fundamental questions in complexity theory, particularly through the lens of quantum interactive proofs and quantum state complexity. His work frequently intersects with operator algebras and quantum information theory, reflecting the interdisciplinary nature of modern quantum computing research. NSF CAREER award Sloan Fellowship Yuen actively mentors graduate students, with several PhD students having graduated to postdoctoral positions or faculty roles. His service includes co-organizing the Columbia CS Theory Seminar and serving on program committees for major conferences including QIP, STOC, and ITCS. He has organized multiple workshops on quantum computing challenges and cryptography. As a member of the Columbia Quantum Initiative, Yuen contributes to Columbia's growing quantum ecosystem, collaborating across departments to advance both theoretical foundations and potential applications of quantum information processing.

• Quantum Computation
• Quantum Algorithms
• Computational Complexity
• +3 more

Ashley M R Montanaro is a Professor of Quantum Computation at the School of Mathematics, University of Bristol . Active in quantum computing research since at least 2014, they lead projects at the intersection of quantum algorithms , computational complexity , and quantum information theory , affiliated with the Bristol Quantum Information Institute. Research interests focus on quantum algorithm design , computational complexity analysis , and quantum simulation . Key work includes developing variational quantum algorithms for phase transition detection, Hamiltonian simulation techniques, and quantum-classical hybrid methods for solving complex problems in physics and optimization. Recent publications demonstrate expertise in: Quantum phase diagram simulation with low-depth circuits Quantum speedups for constraint satisfaction problems Quantum communication complexity of machine learning tasks Quantum-enhanced optimization heuristics Hamiltonian simulation with time-dependent product formulas Quantum algorithm complexity analysis Scientific awards include: EPSRC Fellowship (2014-2019) - "New insights in quantum algorithms and complexity" Active in quantum software development through projects like: "Quantum Algorithms from Foundations to Applications" (ERC-2018-COG) "Quantum Computing and Simulation Hub" (2019-2024) "Prosperity Partnership in Quantum Software" (2019-2023)

Leslie ValiantView profile

Professor

• Complexity Theory
• Machine Learning
• Parallel Computation
• +4 more

Leslie Valiant is the T. Jefferson Coolidge Professor of Computer Science and Applied Mathematics in Harvard University's School of Engineering and Applied Sciences, where he has held a faculty position since 1982. A foundational figure in theoretical computer science, his work bridges artificial and natural computational phenomena across multiple disciplines. His academic background includes education at: King's College, Cambridge Imperial College, London Ph.D. in Computer Science from Warwick University (1974) Valiant's research spans computational complexity , machine learning theory , parallel systems , and computational neuroscience . He pioneered the PAC (Probably Approximately Correct) learning framework that established computational learning theory as a rigorous field. His holographic algorithms work revealed deep connections between computational complexity and statistical physics, while his neuroidal model and evolvability theory provide computational explanations for cognitive processes and biological evolution. Current investigations focus on cortical computation primitives and knowledge infusion architectures. His publication trends show increasing integration of neuroscience with computational theory since 2010, with dominant themes in holographic computation (2006-2018), cortical modeling (2012-2018), and evolvability (2009-2017). The work consistently applies computational complexity analysis to biological and cognitive systems. Major recognitions include: Nevanlinna Prize (1986) for mathematical aspects of computer science Knuth Award (1997) for foundational algorithms contributions EATCS Award (2008) for theoretical computer science impact Turing Award (2010) for computational learning theory and complexity Fellowship in the Royal Society and National Academy of Sciences Valiant's research has been supported by NSF and international grants enabling cross-disciplinary work in computational neuroscience and evolutionary algorithms. While specific advisees aren't documented in source materials, his theoretical frameworks have shaped generations of researchers in machine learning and complexity theory. His current research group explores neuroidal architectures for cognitive computation, investigating how cortical circuits achieve robust information processing through in-circuit testing methodologies. Ongoing projects aim to identify fundamental computational primitives in neural systems and develop biologically inspired AI frameworks.

David DotyView profile

Professor

• Molecular computing
• Algorithmic self-assembly
• Chemical reaction networks
• +8 more

David Doty is a Professor in the Department of Computer Science at the University of California, Davis . His research focuses on the intersection of molecular systems and computation , exploring how natural processes like chemical reactions , DNA nanotechnology , and self-assembly can perform computation. He also investigates connections to theoretical computer science, including distributed computing and algorithmic information theory . Doty's work bridges physics , chemistry , and biology through rigorous computational models like the Tile Assembly Model and Population Protocols . His research program includes software development ( scadnano , ppsim ), theoretical analysis, and collaborations with experimentalists. He teaches courses on theory of computation and molecular computing , and has advised numerous students in his research group. His publications cover topics such as algorithmic self-assembly , chemical reaction networks , and thermodynamic binding networks , with a focus on understanding fundamental computational and physical limits. Key software tools developed by his group include scadnano for DNA design and ppsim for population protocol simulations. Doty's recent research trends explore rate-independent chemical computing , error correction , and stochastic modeling in molecular systems. Current academic activity includes teaching ECS 120 (Undergraduate Theory of Computation), ECS 220 (Graduate Theory of Computation), and ECS 232 (Theory of Molecular Computation). He maintains a research lab in 2306 Academic Surge and continues to publish in leading conferences like DNA Computing and CMSB .

Tamon StephenView profile

Professor

• Operations Research
• Combinatorial Optimization
• Algorithms
• +2 more

Tamon Stephen is a Professor in the Department of Mathematics at Simon Fraser University (SFU), part of the Faculty of Science. His research focuses on operations research, with an emphasis on combinatorial optimization, algorithms, discrete geometry, and computational biology. He holds a Ph.D. in Mathematics from the University of Michigan (2002). His work often bridges theoretical and computational aspects, addressing interdisciplinary applications. Stephen is affiliated with the Centre for Operations Research and Decision Sciences (CORDS) and has contributed to software tools for hypergraph transversals and colorful linear programming. He has taught courses such as Math 208W (Introduction to Operations Research) and has advised projects in metabolic network analysis and scheduling optimization. His office is located at the Surrey campus (SRYC 2886). Key research collaborations include studies on firefighter scheduling, nurse rostering, and metabolic pathway analysis. His methodologies often leverage algorithm design, polytope theory, and discrete mathematics. Stephen actively participates in academic service, organizing seminars and contributing to conferences such as the West Coast Optimization Meeting. His work emphasizes practical applications of theoretical results, with a focus on solving real-world optimization challenges.

Zhiming CaiView profile

Visiting Professor

• Synthetic Biology
• Genitourinary Oncology
• Genomics
• +4 more

Zhiming Cai is a Visiting Professor at the National Cancer Institute (NCI) and holds multiple leadership roles in China, including President of Shenzhen Medical Association, Deputy Director of Carlson International Oncology Center at Shenzhen University, and Director of the Guangdong Key Laboratory of Systemic Biology and Synthetic Biology in Genitourinary Oncology. As an Outstanding Principal Investigator at the Chinese Academy of Science's Institute of Synthetic Biology, he leads groundbreaking research in cancer genomics and synthetic biology. Doctor Philosophiae Honoris Causa, The National Academy of Science of Ukraine Fellow, American Institute for Medical and Biological Engineering (AIMBE) His research focuses on synthetic biology applications for cancer therapy , including engineered cell treatments and artificial gene circuits for tumor targeting. Notable work includes the "Remodeling Tumor Suppressor Theory" and CRISPR-based signal transduction systems that earned recognition from Nobel laureates and top-tier journals. With over 330 publications and an H-Index of 36, Cai's work has appeared in Nature , Cell , and European Urology . His research team has successfully treated over 200 advanced tumor patients using synthetic biology approaches, demonstrating clinical translation of cutting-edge technology. Guangdong Medical Natural Science Award (First Class) May 1st Labor Medal (China's highest worker award) State Council Special Allowance Expert National Model Worker International Genetically Engineering Machine Competition Gold Award Cai directs multiple high-profile research institutions including the National Tumor Genome Application Engineering Laboratory and the Academic Committee of the National and Local Joint Medical Synthetic Biology Engineering Laboratory. His work bridges basic research with clinical applications in genitourinary oncology through systematic biology approaches.

Giovanni De MicheliView profile

Professor

• Computer Architecture
• Electrical Engineering
• Integrated Systems
• +5 more

Giovanni De Micheli is a Professor of Electrical Engineering and Computer Science at EPF Lausanne, Switzerland. He also serves as Director of the Integrated Systems Centre and the Institute of Electrical Engineering at EPFL, and chairs the Scientific Committee of CSEM in Neuchatel. Previously, he held academic roles at Stanford University for 18 years, including Full Professor, Associate Professor, and Assistant Professor in the Department of Electrical Engineering. His research spans synthesis of digital circuits, hardware/software co-design, low-power design, and Networks on Chip (NoC) technology. 2003: IEEE Emanuel Piore Award 2000: Golden Jubilee Medal of the IEEE CAS Society 2000: ACM Fellow 1994: IEEE Fellow 1990: IEEE/CS Distinguished Service Award 1988: NSF Presidential Young Investigator Award His seminal contributions include pioneering C-based synthesis and Boolean matching algorithms for digital circuits, foundational work in dynamic power management using stochastic control, and the development of Network-on-Chip (NoC) technology. His publications, such as "Networks on Chips: A New SoC Paradigm" and "Dynamic Power Management for Portable Systems" , have shaped modern SoC design practices. With over 400 technical articles, 9 books, and an H-index of 56, his work remains highly influential.

Xi ChenView profile

Associate Professor

• Algorithmic Game Theory
• Economics
• Complexity Theory
• +3 more

Xi Chen is an Associate Professor in the Department of Computer Science at Columbia University. Prior to this, he was a postdoctoral researcher at the Institute for Advanced Study (Princeton University) and the University of Southern California. He holds a B.S. in Physics/Maths from Tsinghua University (2003) and a Ph.D. in Computer Science from Tsinghua University (2007), advised by Professor Bo Zhang under the guidance of the Institute for Theoretical Computer Science led by Andrew Chi-Chih Yao. His research focuses on Algorithmic Game Theory, Economics, and Complexity Theory. His work is supported by an NSF CAREER award, a Sloan Research Fellowship, and Columbia University startup funds. He has received the EATCS Presburger Award and multiple best paper awards, including at FOCS 2006, ISAAC 2009, and CCC 2017. Xi Chen has taught courses such as Analysis of Algorithms , Lower Bounds in Theoretical Computer Science , and Introduction to Computational Complexity . He co-advises current PhD students Tim Randolph and Erik Waingarten, and has graduated students like Timothy Sun (Emory University) and Xiaorui Sun (University of Illinois at Chicago). He has served on program committees for conferences like WINE, SODA, and STOC. His research spans theoretical computer science, including property testing, graph isomorphism, and fixed-point computation. He is affiliated with Columbia's Theory Group and actively participates in the Theory Seminar organized by Alex Andoni. Xi Chen's research also extends to algorithmic economics, exploring mechanisms, pricing strategies, and market equilibria. His work on complexity theory includes contributions to counting problems and circuit complexity. He maintains a lab and collaborates with researchers in theoretical computer science and algorithmic game theory.

Valentine KabanetsView profile

Professor

• Computational Complexity
• Pseudorandomness
• Circuit Lower Bounds
• +4 more

Valentine Kabanets is a Professor in the School of Computing Science at Simon Fraser University. He holds a Ph.D. in Computer Science from the University of Toronto (2000), M.Sc. from Simon Fraser University (1996), and B.Sc. from the National University of Kiev (1993). His research focuses on computational complexity theory, pseudorandomness, circuit lower bounds, and cryptography. He has received prestigious awards including the Nerode Prize (2013) and multiple best-paper awards at conferences like STOC and CCC. Teaching includes courses on computability and complexity (CMPT 308), data structures and algorithms (CMPT 307), and advanced complexity theory. His research explores foundational questions such as derandomization of algorithms, connections between upper/lower bounds in complexity, and cryptographic hardness assumptions. He leads the Algorithms and Complexity Theory Lab and has supervised numerous graduate students and postdocs. Kabanets' work bridges theoretical insights with practical algorithmic advancements, contributing to both foundational computer science and applied cryptography.

Justin ThalerView profile

Associate Professor

• Algorithms
• Computational Complexity
• Zero-Knowledge Proofs
• +3 more

Justin Thaler is an Associate Professor in the Department of Computer Science at Georgetown University, researching algorithms and computational complexity with focus on probabilistic proof systems, verifiable computation, and streaming algorithms. Education: PhD Computer Science, Harvard University BS Computer Science and Mathematics, Yale University Research Interests: Develops protocols for verifying computations (including zero-knowledge proofs), analyzes the power of low-degree polynomials, and designs efficient streaming/sketching algorithms for large datasets. Publications: Research advances theoretical foundations of proof systems, with recent work on SNARKs, lookup arguments, and Fiat-Shamir security. Authored the monograph 'Proofs, Arguments, and Zero-Knowledge'. Advising & Labs: Advises PhD students in theoretical computer science. Contributes to open-source projects including DataSketches library of streaming algorithms. Currently on leave at a16z crypto research.

Lilya BudaghyanView profile

Professor

• Boolean Functions
• Cryptography
• Information Security
• +3 more

Lilya Budaghyan is a Professor at the Department of Informatics, University of Bergen, Norway, leading the Boolean functions research team at the Selmer Center. She holds a PhD from the University of Magdeburg (2005) and a habilitation from Paris 8 University (2013). Her research focuses on Boolean functions, particularly APN (Almost Perfect Nonlinear) functions and their cryptographic applications, with contributions to hardware implementations, equivalence relations, and cryptographic protocol design. She has authored the book *Construction and Analysis of Cryptographic Functions* and received awards including the TMS Starting Grant (2016) and Emil Artin Junior Prize (2011). Her work includes projects like the EU-funded BoolTI (2021–2025) and collaborations across institutions in Armenia, Germany, Italy, and France. Key research themes include constructing APN functions, analyzing their properties, and optimizing their hardware implementations for secure systems. Her recent publications emphasize hardware architectures for APN permutations, equivalence between cryptographic functions, and theoretical advancements in algebraic coding and finite fields. She serves as an editor for journals in cryptography and has organized international workshops such as WCC 2013.

Li-Yang TanView profile

Assistant Professor

• Theoretical Computer Science
• Computational Complexity
• Machine Learning Theory
• +5 more

Li-Yang Tan is an Assistant Professor of Computer Science at Stanford University , focusing on theoretical computer science. His research emphasizes computational complexity, machine learning theory, and algorithm design. Education: Ph.D. in Computer Science from Columbia University , advised by Rocco Servedio His work explores: Boolean function complexity Decision tree learning algorithms Circuit lower bounds Computational-statistical tradeoffs Query complexity Massively parallel algorithms Recent publications analyze computational-statistical tradeoffs via NP-hardness, improve decision tree learning techniques, and establish direct sum theorems for query complexity. His research often bridges complexity theory, learning theory, and algorithm design, with applications in pseudorandomness and correlation clustering. Awards: Best Paper Award at FOCS Best Paper Award at CCC Best Paper Award at SAT Sloan Fellowship Li-Yang collaborates with students and researchers including Guy Blanc, Caleb Koch, and Carmen Strassle. He has delivered invited special issue papers at FOCS, CCC, and SAT conferences.

Mika GöösView profile

Assistant Professor

• Computational Complexity
• Communication Complexity
• Theoretical Computer Science
• +3 more

Mika Göös is a Tenure Track Assistant Professor at EPFL in the School of Computer and Communication Sciences, Department of Computer Science. Previously, he held postdoctoral positions at Stanford, Princeton IAS, and Harvard. He earned his PhD from the University of Toronto under Toniann Pitassi, an MSc from the University of Oxford, and a BSc from Aalto University. Education PhD: University of Toronto MSc: University of Oxford BSc: Aalto University His research focuses on computational and communication complexity, exploring fundamental limits of algorithms and their applications in cryptography, circuit design, and distributed computing. He co-developed lifting theorems connecting query complexity to communication complexity and investigates lower bounds in randomized algorithms, TFNP problems, and monotone circuits. Recent work emphasizes quantum communication advantages, direct sum theorems, and hardness condensation. His 15 most recent publications span topics like k-Hamming distance, parity decision trees, depth-3 circuits, and separations in TFNP classes. Scientific awards include the Machtey Award (2015), Best Paper at DISC (2012), EATCS Distinguished Dissertation Award (2017), and Best Paper at FOCS (2020). He has advised numerous PhD and MSc students, including Weiqiang Yuan, Ziyi Guan, and Alexandros Hollender. Currently, he leads a team comprising PhD students (Guan, Imbach, Riazanov, Sofronova, Yuan), postdocs (Nathaniel Harms), and scientists (Dmitry Sokolov). His work has appeared in top venues like STOC, FOCS, CCC, and ITCS, often with recorded talks and published in journals such as JACM and SICOMP.