Find Academic Supervisors

• 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.

Ian GoldbergView profile

Professor

• Security
• Privacy
• Privacy-Enhancing Technologies (PETs)
• +5 more

Ian Goldberg is a Professor at the Cheriton School of Computer Science , University of Waterloo, Canada. He holds the Canada Research Chair in Privacy Enhancing Technologies and leads the Cryptography, Security, and Privacy (CrySP) group . He is affiliated with the Cybersecurity and Privacy Institute and the Institute for Quantum Computing . Research Focus: Security, privacy, and privacy-enhancing technologies (PETs) for the Internet, including Off-the-Record (OTR) Messaging , censorship resistance , private information retrieval , and zero-knowledge proofs . Recent Publications: His work addresses metadata protection , deniable authentication , and secure multi-party computation , with applications to anonymous communication and censorship resistance. Scientific Awards: Canada Research Chair in Privacy Enhancing Technologies Students: He advises current and former PhD/Master’s students in projects like Lox , PRSONA , Walkie-Talkie , and SkypeMorph . Notable advisees include Sajin Sasy (Privacy-Preserving Communications), Justin Tracey (PETs Development), and Tao Wang (Website Fingerprinting Defenses). Labs & Teams: Goldberg is a core member of the CrySP group and contributes to the Tor Project and Off-the-Record Messaging open-source initiatives. His research bridges theoretical and applied cryptography, with deployments in real-world systems like Tor and PIR protocols.

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.

Charalampos PapamanthouView profile

Associate Professor

• Computer Security
• Applied Cryptography
• Verifiable Computations
• +5 more

Charalampos Papamanthou is an Associate Professor of Computer Science at Yale University, where he also serves as Co-director of the Yale Applied Cryptography Laboratory and a member of the Yale Institute for Foundations of Data Science. He holds affiliations with the Yale Center for Algorithms, Data, and Market Design. Additionally, he is Chief Scientist at Lagrange Labs. His research focuses on computer security and applied cryptography, particularly verifiable and privacy-preserving computations, leakage-abuse attacks on searchable encryption, and scalable blockchains/cryptocurrencies. He has advised numerous students and postdocs, and his work is supported by NSF, Protocol Labs, and JP Morgan. Research Interests: His primary areas include cryptographic protocols, privacy-preserving systems, blockchain infrastructure, secure cloud computing, and distributed consensus mechanisms. He has pioneered advancements in zero-knowledge proofs, private information retrieval, and dynamic searchable encryption. Awards: He has received prestigious awards such as the CCS Test-of-Time Award (2022), JP Morgan Faculty Research Award (2022), and NSF CAREER Award (2017). His contributions span over 140 publications in top venues like CRYPTO, CCS, and SODA. Teaching: He has taught advanced courses in cryptography, algorithms, and computer systems security at Yale and previously at the University of Maryland and Brown University. Recently, he chairs Yale’s PhD admissions in Computer Science. Labs & Teams: Leads the Yale Applied Cryptography Lab, focusing on real-world applications of cryptographic research. Collaborates with industry partners like Lagrange Labs to develop privacy-preserving technologies.

Michael PotterView profile

Professor

• History of Analytic Philosophy
• Philosophy of Mathematics
• Philosophical Logic
• +5 more

Michael Potter is Professor of Logic at the Faculty of Philosophy , University of Cambridge, and a Life Fellow at Fitzwilliam College. Previously at Balliol College, Oxford (D.Phil. in pure mathematics), he has held research fellowships at St Andrews, Harvard, and Stirling University (AHRC-funded). His work bridges historical and systematic philosophy, focusing on History of analytic philosophy (Frege, Russell, Wittgenstein, Ramsey) Philosophy of mathematics and logic Philosophy of religion Potter's research has produced major works like Set Theory and its Philosophy (OUP 2004) and The Rise of Analytic Philosophy (Routledge 2019), with significant contributions to understanding the Metaphysical underpinn't> of the Tractatus Neo-Fregean logicism Paradoxes in mathematical foundations He has supervised research on topics spanning dialetheism, predicative mathematics, and modal ontological arguments. Scientific awards include the AHRC Senior Research Fellowship (2004-2005). His recent publications analyze Transcendental arguments in Wittgenstein Sortition-based democratic theory Philosophical implications of Ramsey's infinite proofs via peer-reviewed chapters and journal articles.

Florian KerschbaumView profile

Professor

• Data security and privacy
• Confidentiality and integrity in data science
• Applied cryptography
• +4 more

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.

Anush TserunyanView profile

Professor

• Mathematics
• Ergodic Theory
• Combinatorics
• +3 more

Anush Tserunyan is a Professor of Mathematics at McGill University, Canada, and a Visiting Professor at the Unit of Pure and Applied Mathematics (UMPA) at École normale supérieure de Lyon from December 1, 2024, to January 31, 2025. She holds a bachelor's and master's in computer science and applied mathematics from Yerevan State University (2005–2007) and a Ph.D. in Mathematics from UCLA (2013), focusing on finite generators for group actions, equivalence relations, and recursive program complexity. Research Interests: Anush Tserunyan specializes in Ergodic Theory , Combinatorics , and Group Actions , with notable contributions to graph theory, hypergraphs, and Ramsey theory. Her work bridges combinatorial structures with analytic methods, particularly in dynamical systems and descriptive set theory. Collaborations: During her visit to UMPA, she collaborates with teams in Geometry, Groups and Dynamics , and Number Theory , alongside researchers like Benjamin Schraen and Sophie Morel. Her stay includes seminars on GGD, Number Theory, and the 'Actions!' working group. Publications: Her research spans topics like ergodic theorems, disjoint matchings in graphs, and algebraic hypergraphs, reflecting a focus on foundational mathematical structures and their applications.

Nadia PolikarpovaView profile

Associate Professor

• Program Synthesis
• Program Verification
• Type Systems
• +5 more

Nadia Polikarpova is an Associate Professor in the Department of Computer Science and Engineering at the University of California, San Diego . She earned her PhD from ETH Zurich in 2014 under Bertrand Meyer , followed by postdoctoral research at MIT CSAIL with Armando Solar-Lezama . Her academic contributions have been recognized with prestigious awards including the 2020 Sloan Fellowship , 2020 Intel Rising Stars Award , and 2020 NSF CAREER Award . Polikarpova's research focuses on program synthesis , program verification , and type systems . She leads the Programming Systems group at UCSD and contributes to the IFIP Working Group 2.8 on Functional Programming since 2022. Her work spans foundational research and practical tools, including projects like Synquid , SuSLik , and Laurel that combine formal methods with machine learning for code generation. Her recent publications in venues like OOPSLA , NeurIPS , and ICFP reveal trends in AI-assisted programming , live programming environments , and formal verification . She has advised numerous PhD and Master’s students including Shraddha Barke , Zheng Guo , and Tristan Knoth , many of whom have moved to prominent academic and industry positions. Notable artifacts from her lab include tools like ColDeco for spreadsheet inspection and Superfusion for eliminating intermediate data structures. 2020 : Sloan Fellow 2020 : Intel Rising Stars Award 2020 : NSF CAREER Award 2021 : Distinguished Paper at POPL 2023 : Distinguished Artifact at PLDI 2023 : Distinguished Paper at OOPSLA Polikarpova actively contributes to academic service, serving on program committees for PLDI , POPL , and OOPSLA , and co-chairing the OOPSLA Review Committee in 2023. She has delivered keynotes at APLAS'20 and PLDI'24 , emphasizing the integration of large language models with formal methods.

Brian ConradView profile

Professor

• Number Theory
• Arithmetic Geometry
• Algebraic Geometry
• +3 more

Brian Conrad is a Professor of Mathematics at Stanford University, specializing in number theory and arithmetic geometry. He holds a position in the Department of Mathematics and has contributed extensively to algebraic geometry, algebraic number theory, and representation theory. His research encompasses foundational work on reductive groups, pseudo-reductive groups, and their applications in arithmetic contexts. Dr. Conrad is an editor for the Journal of the AMS, Algebra and Number Theory, and IMRN. He has organized numerous learning seminars, including those on étale cohomology and the BSD conjecture, and has taught advanced courses on algebraic geometry, class field theory, and modular forms. His work bridges classical algebraic geometry with modern arithmetic applications, emphasizing foundational proofs and geometric intuition. His editorial roles and seminar leadership reflect his commitment to advancing mathematical exposition and education. Education details are not explicitly provided in the texts, but his academic trajectory includes significant contributions to the field through publications and mentorship. Dr. Conrad's research has led to advancements in areas such as the classification of algebraic groups, étale cohomology, and the arithmetic of elliptic curves. His collaborative work with mathematicians like Chai, Oort, and Prasad has produced influential monographs, including Pseudo-reductive Groups and Complex Multiplication and Lifting Problems .

Metin UyanikView profile

Senior Lecturer

• Economic Theory
• Game Theory
• Microeconomic Theory
• +3 more

Dr. Metin Uyanik is a Senior Lecturer at the School of Economics, The University of Queensland. He holds a PhD from Johns Hopkins University (2016) and previously worked as a Postdoctoral Research Fellow at the University of Rochester's Wallis Institute of Political Economy. His research focuses on Economic Theory, Game Theory, Political Economy, Computational Economics, and Mathematical Economics. His work has been published in top-tier journals such as Economic Theory , Games and Economic Behavior , and Journal of Mathematical Economics . Education: Bachelor of Economics, Bogazici University Masters (Research) of Economics, Koc University Doctor of Philosophy, The Johns Hopkins University Research Interests: Dr. Uyanik's research bridges theoretical and applied economics, emphasizing foundational mathematical approaches. His work explores general equilibrium theory, discontinuous games, topological methods in economics, and welfare economics. Key themes include the analysis of non-convex economies, fixed-point theorems, and the integration of axiomatic frameworks with behavioral assumptions. Teaching: He teaches Advanced Microeconomics, Economics for Commerce, and Introduction to Strategic Thinking at UQ. His pedagogical focus includes mathematical rigor and practical applications of economic theory. Collaborations & Future Work: Collaborations with scholars like M. Ali Khan and Richard P. McLean highlight his engagement with complex theoretical frameworks. Ongoing projects include studies on large production economies, myersonian common knowledge, and computational methods in equilibrium analysis.

Maria ChudnovskyView profile

Professor

• Graph Theory
• Combinatorics
• Discrete Mathematics
• +3 more

Maria Chudnovsky is a Professor of Mathematics at Princeton University and a former Professor of IEOR and Mathematics at Columbia University (2006-2014). Her research focuses on graph theory and combinatorics, with significant contributions to structural graph theory, perfect graphs, and algorithmic applications. Education: B.A. Summa Cum Laude (1996) and M.Sc. (1999) from Technion, Ph.D. (2003) from Princeton University Her work addresses fundamental problems in graph coloring, forbidden induced subgraphs, and combinatorial optimization, including the proof of the Strong Perfect Graph Theorem and development of algorithms for detecting graph structures. Notable awards include the MacArthur Foundation Fellowship (2013-2017), D.R. Fulkerson Prize (2009), and Henry Burchard Fine Professor of Mathematics (2022). She has held prestigious fellowships such as the Clay Mathematics Institute Research Fellowship (2003-2008). Grants: NSF DMS-EPSRC Grant DMS-2120644 (2021-2024), US Army Research Office Grant W911NF-16-1-0404 (2016-2020), and multiple NSF grants She has advised numerous PhD/MSc students and postdocs, including Sophie Spirkl, Mingxian Zhong, and Tara Abrishami. Her outreach includes popular science communication on YouTube's Numberphile and participation in initiatives promoting women in STEM.

Paul LarsonView profile

Professor

• Set Theory
• Topology
• Model Theory
• +3 more

Paul Larson is a Professor of Mathematics at Miami University. His research focuses on set theory, topology, and model theory, with particular expertise in forcing axioms, descriptive set theory, and infinitary logic. He holds a Ph.D. in Mathematics from the University of California, Berkeley. His work bridges foundational mathematical logic with applications in topology and combinatorics. Key contributions include studies on canonical models under fragments of the Axiom of Choice, polar forcings, and cardinal characteristics. Larson has collaborated extensively with leading researchers such as Saharon Shelah and Jindřich Zapletal. His publications span prestigious journals like the Annals of Pure and Applied Logic and Transactions of the American Mathematical Society. Beyond research, he contributes to the academic community through editorial work and expository writings on historical developments in determinacy theory. Education: Ph.D., Mathematics, University of California, Berkeley Research interests emphasize foundational questions in set theory with applications to topology and model theory. His recent work explores advanced forcing techniques, square principles in Pmax extensions, and combinatorial properties of cardinal invariants. Publications reflect interdisciplinary engagement, including crystal structure prediction in high-pressure chemistry and operator theory in functional analysis. Despite an extensive publication record, no specific scientific awards are documented here. His advising and grant activities remain unspecified in the provided texts. Collaborations span international institutions, reflecting his role as a central figure in contemporary set theory research.

Eduardo AzevedoView profile

Professor

• Microeconomic theory
• Market design
• Selection markets
• +4 more

Eduardo Azevedo is the John M. Bendheim and Thomas L. Bendheim Professor of Business Economics and Public Policy at the Wharton School , University of Pennsylvania. He holds a courtesy appointment as Professor of Economics and was awarded the 2016 Sloan Foundation Fellowship. His research integrates economic theory with practical applications across science and business domains. His research interests include: Market design Selection markets Social science genetics Experimental economics Game theory Recent publication trends focus on: Economic theory applications to healthcare and digital markets Empirical Bayes methods in A/B testing Adverse selection in insurance markets Strategic behavior in two-sided matching Evolutionary behavioral economics He serves as an instructor for BEPP2500 - Managerial Economics , emphasizing real-world application of microeconomic theory to business problems. His work also involves software development for economic research, including MATLAB-based empirical Bayes tools for analyzing treatment effects in large-scale experiments. Scientific awards : Sloan Foundation Fellow (2016)

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.

Imogen Forbes-MacphailView profile

Assistant Professor

• Nineteenth-Century Poetry
• Mathematics and Literature
• Victorian Studies
• +3 more

Imogen Forbes-Macphail is an Assistant Professor at the University of California, Davis, specializing in the interdisciplinary intersections of nineteenth-century British poetry and mathematical thought. Her current book project, Line and Number: Formal Problems in Nineteenth-Century Poetry and Mathematics , examines how Victorian poets and mathematicians engaged with analogous formal challenges. Victorian Poetry Caucus Representative, North American Victorian Studies Association Co-Editor (with Anna Henchman), Special Issue of Nineteenth-Century Gender Studies on women’s writing and scientific knowledge production (“Longing to Know”) Research Focus: Forbes-Macphail’s work bridges literary formalism and historical scientific methodologies, particularly exploring topics like computational proof, topological poetics, and the mysticism inherent in Victorian-era mathematical and poetic discourse. Her interdisciplinary approach highlights how mathematical concepts influenced poetic structures and vice versa. Scientific Contributions: Her publications span analyses of the Four-Color Theorem, Ada Lovelace’s literary-scientific legacy, and the gendered dynamics of 19th-century knowledge production. Key trends include the aestheticization of mathematical rigor, the role of formalism in shaping Victorian intellectual paradigms, and crossdisciplinary epistemological inquiries. Honorable Mention, “Expanding the Field” Essay Prize, Northeast Victorian Studies Association (2022) Susan Morgan Graduate Student Essay Prize, Interdisciplinary Nineteenth-Century Studies (2019) Sally Mitchell Prize, North American Victorian Studies Association (2018) Honorable Mention, Susan Morgan Graduate Student Essay Prize (2018) Sussex-Samuel Prize, Australasian Universities Language and Literature Association (2013) Forbes-Macphail’s teaching includes courses such as ENL 164: Writing Science Publications , emphasizing the synthesis of scientific and literary communication. She previously held a Junior Fellowship at the Harvard Society of Fellows (2022–25), underscoring her prominence in Victorian studies.