Find Academic Supervisors

Afonso S. BandeiraView profile

Professor

• High Dimensional Probability
• Random Matrices
• Mathematical Statistics
• +3 more

Afonso S. Bandeira is a Professor in the Department of Mathematics (D-MATH) at ETH Zurich, where he conducts research at the intersection of mathematics, statistics, and computer science. He maintains strong affiliations with several interdisciplinary research centers including the Institute For Operations Research (IFOR), the Max Planck ETH Center for Learning Systems, the ETH Foundations of Data Science, and the ETH AI Center, with a courtesy appointment at D-ITET. Bandeira actively teaches courses including Mathematics of Signals, Networks, and Learning, and Mathematics of Data Science. His research focuses on High Dimensional Probability, Random Matrices, Mathematical Statistics, Theoretical Computer Science, Combinatorics, and Mathematical Optimization. Bandeira's work often explores the theoretical foundations of data science, examining phase transitions in statistical problems, computational barriers, and the geometry of high-dimensional spaces. He maintains a research group blog called Randomstrasse101 that emphasizes open problems in his field. Analysis of his recent publications reveals a strong focus on matrix and tensor concentration inequalities, synchronization problems, nonconvex optimization landscapes, and computational-statistical tradeoffs in high-dimensional inference. His work bridges theoretical mathematics with practical applications in machine learning and data analysis, particularly examining where computational limitations arise in statistical problems. Bandeira actively mentors students and researchers, currently supervising several doctoral candidates including Daniil Dmitriev, Konstantin Donhauser, Anastasia Kireeva, Kevin Lucca, Chiara Meroni, Gil Kur, Petar Nizic-Nikolac, and Almut Roedder. He emphasizes that students working with him should participate in the DACO seminar and group meetings, and encourages prospective students to have completed his Mathematics of Signals, Networks, and Learning or Mathematics of Data Science courses. He leads a research group focused on the mathematics of data science, with regular group meetings and seminars. Bandeira has developed comprehensive lecture notes including 'A Tour Through the Mathematics of Signals, Learning, and Networks' (2025) and 'Mathematics of Machine Learning' (2021), and previously authored 'Ten Lectures and Forty-Two Open Problems in the Mathematics of Data Science' (2015).

Stefano TessaroView profile

Professor

• Cryptography
• Computer Security
• Theoretical Computer Science
• +3 more

Stefano Tessaro is a Professor in the Paul G. Allen School of Computer Science & Engineering at the University of Washington. He holds the Paul G. Allen Career Development Professorship. His research focuses on cryptography, theoretical computer science, and computer security, emphasizing practical applications of cryptographic techniques. He co-leads the cryptography group at UW with Andrea Coladangelo and Huijia Lin, and is part of the theory group. Education: PhD in Computer Science from ETH Zurich (2010) Postdoctoral researcher at MIT CSAIL (2010-2014) and UC San Diego (2014-2019) Joined UW in 2019 as faculty Research Interests: His work spans theoretical cryptography, privacy-preserving systems, cryptographic protocols, and security foundations. He explores practical applications of cryptography, including secure protocols, post-quantum cryptography, and efficient cryptographic constructions. Articles Trends: Recent publications emphasize threshold signatures, memory-tight security proofs, lattice-based cryptography, and privacy-preserving systems. Key themes include adaptive security, formal verification, and efficiency improvements in cryptographic protocols. Awards: NSF CAREER Award Sloan Research Fellowship Hellman Fellowship Research awards from Cisco, JP Morgan, and Microsoft Grants & Advising: His research has been supported by NSF grants and industry partnerships. He advises students in cryptographic theory and applications, though no specific student names are listed in the provided text. Labs & Teams: Co-leads the UW cryptography group, collaborating on projects like LERNA (secure aggregation) and Twinkle (threshold signatures). Engages with interdisciplinary teams in theoretical computer science and security.

Peter SelingerView profile

Professor

• Quantum Computing
• Category Theory
• Mathematical Logic
• +4 more

Peter Selinger is a Professor in the Department of Mathematics and Statistics at Dalhousie University , with a cross-appointment in Computer Science. He specializes in mathematical methods in computer science, particularly quantum computing and combinatorial game theory . His work on quantum programming languages like Quipper and foundational research in category theory has garnered international recognition. Education : Ph.D. in Mathematics (University of Pennsylvania, 1997), undergraduate studies in Mathematics (Technische Universität Darmstadt). Research Interests span quantum computing, category theory, and combinatorial game theory. He has pioneered formalisms for quantum programming languages, developed categorical models for quantum mechanics, and analyzed game-theoretic structures in games like Hex. His recent work includes linear dependent type theory , quantum circuit synthesis , and combinatorial game classification . Publications demonstrate expertise in quantum programming languages, categorical semantics, and game theory. Key trends include Hamiltonian simulation , Clifford+T circuits , and monotone game realization . Scientific Honors include the Killam Professorship (2017–2022), Faculty of Science Award for Excellence in Teaching (2023), and fellowships from the Alfred P. Sloan Foundation and German National Scholarship Foundation . Students he has supervised include PhD graduates Xiaoning Bian , Francisco Rios , and Neil J. Ross , along with MSc students like Fahimeh Bayeh and Seth Greylyn . He has advised 16 postdoctoral researchers.

David BindelView profile

Associate Professor

• Applied Numerical Linear Algebra
• Eigenvalue Problems
• Network Analysis
• +5 more

David Bindel is an Associate Professor in the Department of Mathematics at Cornell University, affiliated with the College of Arts and Sciences, College of Engineering, and Cornell Ann S. Bowers College of Computing and Information Science. He earned his Ph.D. in Mathematics from the University of California, Berkeley in 2006. His research focuses on applied numerical linear algebra, eigenvalue problems, and their applications in plasma physics, network analysis, and nonlinear systems. He develops methods for analyzing complex systems, including magnetic confinement in stellarators, stability of MHD systems, and community detection in networks. His work bridges theoretical foundations with practical computational tools, such as formal verification of linear algebra algorithms and scalable Gaussian process models. Bindel’s research explores the interplay between structure and computation, leveraging eigenvalue analysis to address challenges in computer vision, opinion dynamics, and engineering design. He has contributed to advancements in numerical methods for large-scale systems, including iterative solvers, spectral approximation techniques, and stochastic optimization. His interdisciplinary approach spans applied mathematics, computer science, and physics, with applications in fusion energy, machine learning, and network science. Recent work highlights include high-order expansions for magnetic confinement, adaptive filtering for dynamical systems, and Bayesian optimization strategies. His publications emphasize rigorous analysis alongside computational scalability, addressing both theoretical and practical aspects of modern scientific computing. Despite no explicitly listed awards, his contributions reflect significant impact in his fields.

Illya V. HicksView profile

Professor

• Combinatorial Optimization
• Integer Programming
• Graph Theory
• +5 more

Illya V. Hicks is a Professor in the Computational and Applied Mathematics Department at Rice University. He holds a PhD from Rice University (2000) and a BS from Texas State University (1995). His research focuses on combinatorial optimization, integer programming, graph theory, and matroid theory, with applications in social networks, cancer treatment, and network design. He has advised numerous doctoral, post-doctoral, and masters students. Education: PhD and MA in Computational and Applied Mathematics, Rice University, 2000 BS in Mathematics, Texas State University, 1995 Research Interests: Utilizing graph decomposition techniques to solve NP-complete problems, including branch decompositions and matroid circuit problems. Applications include sensor network design, healthcare logistics, and algorithmic graph theory. Awards: Recognized with the 2015 Presidential Mentoring Award (Rice University), 2010 Forum Moving Spirit Award (INFORMS), and the 2005 Optimization Prize for Young Researchers. Grants and Projects: Includes NSF-funded research on branch decomposition techniques, submodular optimization, and healthcare service distribution. Active in promoting minority participation in operations research through travel grants and mentoring initiatives. Labs/Teams: Engaged in collaborative research on graph algorithms, combinatorial optimization, and interdisciplinary applications in healthcare and engineering.

Amir Ali AhmadiView profile

Professor

• Optimization Theory
• Control Theory
• Dynamical Systems
• +7 more

Amir Ali Ahmadi is a Professor at Princeton University's Department of Operations Research and Financial Engineering (ORFE), with affiliations across multiple disciplines including PACM, Computer Science, Mechanical & Aerospace Engineering, Electrical Engineering, and the Center for Statistics and Machine Learning. He serves as Director of Princeton's Optimization and Quantitative Decision Science Certificate Program and has taken temporary roles at Citadel GQS (2021-2022) and Google Brain (2020-2021). His research bridges optimization theory , dynamical systems , and control theory , focusing on scalable algorithms for complex problems in robotics, autonomous systems, and machine learning. He has pioneered DSOS/SDSOS relaxations as alternatives to traditional sum-of-squares methods, enabling faster solutions through linear/second-order cone programming. Recent publications explore: Higher-order Newton methods for socially responsible investment Data-efficient learning of dynamical systems Computational complexity of local minima Robust-to-dynamics optimization frameworks Award highlights include: 2024 Egon Balas Prize in Optimization 2024 Princeton Engineering Council Teaching Award 2023 Distinguished Teaching Award (Princeton SEAS) 2019 NSF CAREER Award 2017 DARPA Young Faculty Award 2017 Sloan Fellowship in Computer Science He advises prominent researchers like Georgina Hall (Tucker Prize finalist) and Bachir El Khadir (Goldstine Fellow), and leads the Princeton Optimization Seminar and MURI project on Control-Oriented Learning on the Fly.

Rashmi VinayakView profile

Associate Professor

• Computer Systems
• Networked Systems
• Information Theory
• +5 more

Rashmi Vinayak is an Associate Professor in the Computer Science Department at Carnegie Mellon University, with a courtesy appointment in the Electrical and Computer Engineering Department. She is a member of both the Systems group and Theory group at CMU and leads TheSys research group. She is also affiliated with the Parallel Data Lab (PDL). Her educational background includes a Ph.D. from UC Berkeley in 2016, followed by postdoctoral studies at the same institution. Rashmi's research spans the intersection of computer/networked systems and information/coding theory. Her current focus is on robustness and resource efficiency in data systems across storage, communication, and computation. Key thrusts include storage systems, caching systems, and systems for machine learning. Her work on SIEVE, a cache eviction algorithm, has been widely adopted by industry including VMware, Google, Redpanda, and numerous open source libraries. Her recent publications demonstrate a strong trend toward practical systems research with theoretical foundations, particularly in caching algorithms, storage systems, and machine learning infrastructure. Many of her papers have received best paper awards and industry adoption. Notable awards include: Sloan Research Fellowship (2023) IEEE Information Theory Society Goldsmith Lecturer (2023) NSF CAREER Award (2020) Multiple USENIX NSDI Community (Best Paper) Awards VMware Systems Research Award (2021) Facebook and Google Research Awards Rashmi has supervised numerous PhD, Master's, and undergraduate students, many of whom have gone on to prestigious positions at Harvard, Google, Meta, and other leading institutions. Her research has been generously funded by NSF, Sloan Foundation, Open Compute Project, Google, Facebook/Meta, VMware, and Amazon Web Services. She actively collaborates with industry partners including Google, Microsoft, NetApp, Facebook, Cisco, Intel and Cloudera. She leads TheSys research group which focuses on designing next-generation data systems that are robust, efficient, and performant. The group takes a multi-disciplinary approach spanning computer systems, information theory, and machine learning.

Peter K. KitanidisView profile

Professor

• Groundwater Flow
• Hydrologic Modeling
• Inverse Problems
• +3 more

Peter K. Kitanidis is a Professor in the Department of Civil and Environmental Engineering and the Institute for Computational and Mathematical Engineering at Stanford University . His research focuses on groundwater flow , hydrologic forecasting , and stochastic inverse modeling , with applications to pollutant remediation and CO₂ storage monitoring . Education : Diploma, National Technical University of Athens (1974) M.S., MIT (1976) Ph.D., MIT (1978) Research Interests : Groundwater modeling and contaminant transport Hydraulic tomography and aquifer characterization Stochastic methods for uncertainty quantification Bioremediation and enhanced in-situ pollutant decay Dilution and mixing processes in heterogeneous media Real-time river flow forecasting Scientific Awards : L.G. Straub Award (1979) W.L. Huber Research Prize (1994) ISI Highly Cited Researcher (2001) AGU Hydrologic Sciences Award (2011) ASCE Pioneers in Groundwater Lecturer (2011) Advising and Grants : Advised 20+ PhD and MS students (1978–2018) Principal investigator on NSF, EPA, and DOE-funded projects Developed software for groundwater data analysis and CO₂ monitoring Contributed to bioremediation protocols and hydraulic tomography algorithms Labs and Teams : Kitanidis Laboratory for groundwater crisis solutions Collaborated with Oak Ridge National Laboratory and Stanford Hydrogeology Group Mentored postdocs (2000–2017) in reactive transport and inverse modeling

• Financial Analysis
• Equity Valuation
• Life Insurance
• +3 more

Demetris Christodoulou is an Associate Professor in Accounting, Governance and Regulation at the University of Sydney. He holds a BEcon from Piraeus University, an MSc(Fin) from the University of York (UK), and a PhD from Athens University of Economics and Business (AUEB). His research focuses on applying data analytics, econometrics, and visualization techniques to financial analysis, equity valuation, life insurance, and financial advice. He co-directs the PEMA research group, specializing in productivity and performance measurement analytics, and previously led the MEAFA research group (2007–2022). He has collaborated extensively with industry partners including Deloitte and Australian insurers, and developed training programs for over 1,000 executives. His work includes open-source contributions to Stata software and the Graph Workflow platform, alongside $662k in workshop-generated funds supporting academic programs. He has advised multiple PhD students and taught at leading universities globally. Education: BEcon in Economics (Econometrics), Piraeus University MSc in Finance, University of York (UK) PhD in Accounting and Financial Analysis, Athens University of Economics and Business His research interests span financial reporting models, life insurance underwriting strategies, and behavioral finance. Recent projects address dishonesty mitigation in insurance disclosures and the adviser effect on customer disclosures. He has published widely in top journals like the Review of Accounting Studies and Stata Journal , and his work was featured in The Australian for insights on insurance fraud reduction. He maintains international collaborations, including visiting roles at Columbia Business School and the University of Cyprus, and serves on advisory boards for organizations like Behaviour.ai. Publications highlight methodological innovations in econometrics and visualization, with 2025's upcoming Stata Journal paper advancing time-series analysis techniques. His grants include partnerships with industry on longitudinal studies of insured lives, aiming to improve risk modeling and public policy insights.

• Combinatorial Game Theory
• Graph Theory
• Computer Science Education
• +6 more

Dr. Angela Siegel is an Assistant Professor and Assistant Dean, Academic Outreach in the Faculty of Computer Science at Dalhousie University, Halifax, Canada. She is actively involved in both academic leadership and research. Education: Ph.D. in Mathematics (Combinatorial Game Theory), Dalhousie University, 2011 M.Sc. in Mathematics, Dalhousie University, 2005 B.Sc. in Mathematics & Marine Geophysics, 1997 Her research focuses on combinatorial game theory, graph theory, discrete mathematics, and number theory, with a strong emphasis on computer science education and inclusive teaching . She investigates the challenges students face when transitioning into computer science programs, aiming to improve pedagogical approaches and support systems. Her work bridges theoretical mathematics and practical educational innovation. The recent publications highlight a dual focus: theoretical contributions to combinatorial games (e.g., partizan games, placement games, geography variants) and applied research in computing education, particularly student transition and inclusive practices. Her interdisciplinary work spans mathematics, computer science, and educational theory. Scientific Awards: Dr. Siegel has supervised and collaborated with students and researchers on topics including student transition into higher education computing, LEGO-based pedagogy, and workplace readiness. While no specific grants are listed, her repeated presentations and publications suggest active research funding and scholarly engagement. She has contributed to major conference proceedings and book volumes such as Games of No Chance . She is associated with research teams focused on combinatorial games and computer science education innovation, often collaborating with scholars like Richard Nowakowski, Neil McKay, and Mark Zarb. Her work in inclusive teaching and student support reflects a commitment to building accessible and equitable learning environments in computing.

Ali VakilianView profile

Academic

• Algorithmic Foundations of Machine Learning
• Data Science
• Streaming Algorithms
• +18 more

Ali Vakilian is a Research Assistant Professor at the Toyota Technological Institute at Chicago (TTIC), with a strong academic background in theoretical computer science and algorithms. He will join the Department of Computer Science at Virginia Tech as an Assistant Professor in Fall 2025. His research bridges algorithmic theory and machine learning, focusing on scalable, fair, and efficient algorithms for massive data. Education: Ph.D. in EECS, Massachusetts Institute of Technology (MIT), advisors: Erik Demaine and Piotr Indyk M.S. in Computer Science, University of Illinois at Urbana-Champaign (UIUC), advisor: Chandra Chekuri B.S. in Computer Engineering, Sharif University of Technology Research Interests: Ali Vakilian's work centers on the algorithmic foundations of machine learning and data science. He develops streaming, sketching, and sublinear-time algorithms for massive datasets, and pioneers learning-augmented algorithms that use machine learning predictions to improve performance while maintaining worst-case guarantees. His research in trustworthy ML includes algorithmic fairness, fair clustering, and learning with strategic agents. He also contributes to combinatorial optimization and approximation algorithms for network design, set cover, and low-rank approximation. His recent publications (2023–2025) show a consistent focus on fair clustering (individual and group fairness), streaming graph algorithms , learning-augmented methods , and frequency estimation . These works appear in top venues such as NeurIPS, ICML, SODA, and ICALP, often with recognitions like oral or spotlight presentations. Scientific Awards: Outstanding Student Paper Highlight Award, AISTATS 2024 Notable-top-25% paper, ICLR 2023 Oral presentation, AISTATS 2024 Spotlight presentation, NeurIPS 2023 Advising and Grants: Ali Vakilian mentors several students and interns, including summer interns at TTIC and Fatima Fellows. His research is supported by the National Science Foundation (TRIPODS program), as noted in the press coverage of his work on LearnedSketch. He actively contributes to the academic community through advising, organizing workshops (e.g., Algorithms with Predictions, Learning-Augmented Algorithms), and serving on program committees (e.g., NeurIPS, ICML, AISTATS). Labs and Teams: He is affiliated with the theory and algorithms group at TTIC and collaborates with researchers at MIT, UIUC, and other institutions. His work on learning-augmented algorithms has led to influential workshops and collaborations with leading figures such as Piotr Indyk and Erik Demaine.

Daniel M. KaneView profile

Professor

• Number Theory
• Combinatorics
• Complexity Theory
• +3 more

Daniel M. Kane is a Professor at the University of California, San Diego (UCSD), holding a joint appointment in the Department of Mathematics and the Department of Computer Science and Engineering (CSE). His research spans mathematics and theoretical computer science, with a focus on number theory, combinatorics, complexity theory, and computational statistics. He earned a Ph.D. in Mathematics from Harvard University (2011) and dual BS degrees in Mathematics with Computer Science and Physics from MIT (2007). Prior to UCSD, he was a postdoctoral researcher at Stanford University (2011–2014) on an NSF fellowship. His research interests include robust statistics, machine learning, polynomial threshold functions, and algorithmic methods for high-dimensional data. Notable achievements include co-authoring the book Algorithmic High-Dimensional Robust Statistics (Cambridge University Press, 2023) and receiving the Best Paper Award at the Conference on Computational Complexity (2013), as well as gold medals at the International Mathematical Olympiad (2002 and 2003). Current teaching includes courses such as Math 96 (Putnam Seminar), Math 154 (Graph Theory), CSE 101 (Algorithms), and CSE 203A (Randomized Algorithms). He has consulted for companies like CASPER Labs and AIble, and his work extends to cryptographic protocols, including quantum money schemes based on quaternion algebras. Key contributions include breakthroughs in robust mean estimation, list-decodable learning, and the development of efficient algorithms for statistical problems. His research often bridges foundational theory with practical applications in machine learning and data analysis.

Brett KolesnikView profile

Research Fellow

• Probability Theory
• Random Structures
• Bootstrap Percolation
• +4 more

Brett Kolesnik is a Research Fellow in the Department of Statistics at the University of Warwick. His research focuses on probability theory, random structures, bootstrap percolation, and interactions with combinatorics. He has held postdoctoral fellowships at UC Berkeley, San Diego, and the University of Oxford, and was a Senior Demy at Magdalen College. His work includes organizing workshops on bootstrap percolation and collaborating with leading researchers in probability and combinatorics. Education: PhD in Mathematics from the University of British Columbia (advised by Omer Angel). Notable awards include the NSERC Postdoctoral Fellowship and the Florence Nightingale Bicentennial Fellowship in Statistics. Research interests span bootstrap percolation models, random graph dynamics, and stochastic processes. Recent work includes studies on Brownian map geometry, tournament score sequences, and Coxeter group structures. Selected articles explore topics such as critical beta-splitting processes, Catalan percolation, and random walks on algebraic structures. His publications appear in top journals like Electronic Journal of Probability and Annals of Applied Probability . Awards include the Florence Nightingale Fellowship and NSERC Postdoctoral Fellowship. Professional involvement includes organizing the 2024 BIRS workshop on Bootstrap Percolation and contributing to interdisciplinary collaborations in probability and combinatorics.

Aram HarrowView profile

Professor

• Quantum Information Science
• Quantum Algorithms
• Quantum Computing
• +3 more

Aram Harrow is a Professor of Physics at the Massachusetts Institute of Technology (MIT) , affiliated with the MIT Center for Theoretical Physics and MIT Center for Quantum Engineering . He focuses on quantum information science and quantum algorithms , with additional interests in representation theory and optimization . His recent work explores quantum computing applications in chemical physics and statistical mechanics . Undergraduate and graduate degrees in Physics at MIT Faculty positions: MIT (2013-present), University of Washington (2010-12), University of Bristol (2005-10) Research Interests: His work bridges quantum information theory and many-body physics , including: Quantum algorithm design for chemistry and optimization Quantum circuit complexity and t-designs Entanglement dynamics in quantum systems Quantum-classical hybrid computing models Key Publications: Recent articles demonstrate quantum speedups for biomolecular free energy calculations , Hamiltonian simulation , and jet clustering algorithms . His research combines quantum complexity theory with practical implementations on near-term quantum devices. Scientific Awards: 2023 Simons Investigator 2018 APS Bennett Award 2017 IEEE Best Paper Award 2016 Kavli Frontiers Fellow Mentorship: He advises current PhD students Shankar Balasubramanian , Angus Lowe , and Norah Tan , with 12 former advisees including Anand Natarajan and Saeed Mehraban . His 2026 recruitment seeks one new graduate student.

Ben FischView profile

Assistant Professor

• Cryptography
• Distributed Systems
• Blockchain Technology
• +5 more

Ben Fisch is an Assistant Professor of Computer Science at Yale University's School of Engineering & Applied Science. He is also the co-founder of Espresso Systems, a company focused on blockchain infrastructure. His research focuses on privacy and verifiability in decentralized systems like Bitcoin and Ethereum, with applications in digital finance and healthcare. Dr. Fisch received his B.A. from the University of Pennsylvania and completed his Ph.D. at Stanford University, where he worked with Dan Boneh in the applied cryptography research group. His educational background provided the foundation for his work at the intersection of cryptography, distributed systems, and economics. His research centers on leveraging cryptographic tools such as succinct non-interactive zero-knowledge proofs (zk-SNARKs), private information retrieval, and homomorphic encryption to address challenges in verifiable computation, verifiable storage, and verifiable fairness. He has made significant contributions to verifiable delay functions (VDFs) and proofs of replication, which have been adopted by major blockchain projects including Ethereum 2.0, Chia, and Filecoin. His work on Filecoin's Proofs of Replication has helped the network reach over 1.5 exabytes of storage capacity. His publication record shows a clear trend toward increasingly sophisticated cryptographic protocols for blockchain applications, with recent work focusing on data availability for Bitcoin rollups, efficient folding schemes for pairing-based arguments, and privacy pools with proof-carrying disclosures. His research bridges theoretical cryptography with practical implementations that have real-world impact in decentralized systems. His notable recognition includes: Best Paper Finalist at ACM CCS 2017 for 'Iron: Functional Encryption using Intel SGX' Dr. Fisch's research has led to significant technology transfer, most notably with his work on Verifiable Delay Functions (VDFs) sparking a multimillion dollar industry initiative through the VDF Alliance. His research on Proofs of Replication forms the basis of Filecoin's incentive layer and consensus protocol. His newer SNARK system Basefold is being used by several commercial products. He maintains active collaborations across academia and industry, with publications spanning top conferences in cryptography and security. As co-founder of Espresso Systems, Dr. Fisch leads a team developing next-generation blockchain infrastructure, particularly focusing on sequencing layers for rollups. His work bridges academic research with practical implementation, ensuring that theoretical advances in cryptography find real-world applications in decentralized systems.