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

Uzi VishkinView profile

Professor

• Parallel Algorithms
• Computer Architecture
• Parallel Computing
• +4 more

Uzi Vishkin is a Professor at the University of Maryland's Institute for Advanced Computer Studies (UMIACS) and Department of Electrical and Computer Engineering, with additional affiliation in the Department of Computer Science. His work focuses on parallel computing, including the PRAM-On-Chip vision to bridge parallel algorithms and hardware. He holds a D.Sc. from Technion (1981), M.Sc. and B.Sc. in Mathematics from Hebrew University (1975/1974). Research interests span parallel algorithms, PRAM (Parallel Random Access Machine) architecture, machine learning applications, and pattern matching. His PRAM-On-Chip project aims to create a coherent computing stack for many-core processors. Vishkin has contributed to theoretical foundations and practical implementations, including the XMT architecture and compiler. He has been recognized with ACM Fellow (1996), Highly Cited Researcher (2003), and National Academy of Inventors Fellow (2024). Awards highlight his pioneering work in parallel algorithms and computing systems. Teaching spans courses like Parallel Algorithms and Mathematical Foundations for Computer Engineering. He emphasizes parallel algorithmic thinking in education and has developed teaching materials for high school and university levels. Key projects include the XMT architecture, simulations, and tools for parallel programming. His work integrates algorithmic theory with hardware design to address programming challenges in many-core systems.

Albert AtseriasView profile

Professor

• Computational Complexity
• Logic in Computer Science
• Finite Model Theory
• +7 more

Albert Atserias is a Professor in the Department of Computer Science at the Universitat Politècnica de Catalunya (UPC), affiliated with the Faculty of Informatics of Barcelona (FIB) and the ALBCOM research group (Algorithms, Bioinformatics, Complexity, and Formal Methods). He is also associated with the Institut de Matemàtiques de la UPC-BarcelonaTech. His research is central to theoretical computer science, with a strong emphasis on logic and complexity. Atserias's research interests span Computational Complexity, Logic in Computer Science, Finite Model Theory, Proof Complexity, and Constraint Satisfaction Problems . His work explores the fundamental limits of computation, the expressive power of logical languages over finite structures, and the complexity of proving mathematical statements. He investigates the algebraic and combinatorial properties of proof systems, the limits of efficient algorithms for constraint solving, and the theoretical foundations of databases. His research often bridges logic, algebra, and combinatorics to provide deep insights into computational phenomena. The trends in his recent publications show a sustained focus on the logical and algebraic underpinnings of computational problems. Key themes include the consistency and complexity of database queries , the power and limitations of proof systems (like resolution and sum-of-squares), and the expressive power of homomorphism counts in graph theory. His work on the hardness of automating resolution and the development of circular proof systems are particularly significant contributions to proof complexity. The 2024 PODS Best Paper Award for work on relational consistency underscores the impact and timeliness of his research. Among his notable scientific awards are the prestigious ICREA Acadèmia , the PODS 2024 Best Paper Award , the Premi Extraordinari de Doctorat (Extraordinary Doctoral Prize), and the Kleene Award for Best Student Paper . These accolades reflect both the excellence of his early work and his continued leadership in the field. Atserias has been a principal investigator on numerous competitive research projects, including funding from the European Research Council (ERC) and the Spanish Ministry of Science. He has advised doctoral students, such as Toni Hakoniemi, whose thesis on proof complexity he supervised. His extensive collaborative network includes leading researchers like Phokion Kolaitis, Anuj Dawar, and Victor Dalmau. He has also served on the scientific committees of major conferences, contributing to the academic community. He is a core member of the ALBCOM research group , a leading team at UPC focused on theoretical aspects of computer science, which provides a vibrant environment for research in algorithms, complexity, and formal methods. His work is also connected to the broader Institut de Matemàtiques de la UPC, fostering interdisciplinary collaboration between computer science and mathematics.

Ming LiView profile

Professor

• Deep learning
• Natural language processing and automated conversation
• Kolmogorov complexity and its applications
• +8 more

Ming Li is a Professor at the University of Waterloo , holding the Canada Research Chair in Bioinformatics . Affiliated with the David R. Cheriton School of Computer Science , his research spans Bioinformatics , Kolmogorov Complexity , Deep Learning , Natural Language Processing , and Computational Biology . His contact details include office Davis Center 3355 and email mli@uwaterloo.ca . Research Interests include Bioinformatics (protein/antibody sequencing, structure analysis), Deep Learning , Natural Language Processing , Kolmogorov Complexity and Applications , and Algorithms & Complexity (average-case analysis, information distance). Editorial Roles : Co-Managing Editor of the Journal of Bioinformatics and Computational Biology , Associate Editor-in-Chief for Journal of Computer Science and Technology , Editorial board member of multiple journals including SIAM Journal on Computing and Information and Computation . Professional Activities : Served on scientific advisory committees for Genome Prairie and Tsinghua University, and numerous international conference program committees (e.g., KDD 2007, CPM 2007, FOCS'99). Awards & Honors : Killam Prize (2010) IEEE Granular Computing Outstanding Contribution Award (2010) Premier's Discovery Award (2009) Fellow of Royal Society of Canada, ACM, and IEEE (2006) Killam Fellowship (2001) E.W.R. Steacie Memorial Fellowship (1996) Multiple Best Paper Awards Students & Postdocs : Mentored over 30 graduate students and postdocs, including current advisees Guangyu Feng, Anqi Cui, and alumni like Babak Alipanahi, Xin Chen, and Brona Brejova.

Will PerkinsView profile

Associate Professor

• Theory of Algorithms
• Probability
• Combinatorics
• +2 more

Will Perkins is an Associate Professor in the School of Computer Science at Georgia Institute of Technology. Previously, he held faculty positions at the University of Illinois at Chicago, the University of Birmingham (UK), and was an NSF Postdoc at Georgia Tech. He earned his PhD in 2011 from New York University's Courant Institute under Joel Spencer. His research focuses on algorithms, statistical physics, and discrete mathematics, particularly exploring algorithmic tractability of random computational problems, statistical physics spin models, and combinatorial methods derived from algorithmic intuition. Research Interests : Algorithms, statistical physics, combinatorics, phase transitions, random graphs, and Gibbs measures. His work bridges theoretical computer science and statistical mechanics, addressing questions about sampling, phase coexistence, and algorithmic barriers. Recent Activities : Director of the Algorithms and Randomness Center at Georgia Tech, Managing Editor of Combinatorial Theory , and Associate Editor of Random Structures and Algorithms and SIAM Journal on Discrete Mathematics . Upcoming engagements include the Rocky Mountain Summer Workshop (2024), Park City Mathematics Institute (2024), and conferences on Random Structures and Algorithms (2025). Teaching : Courses include Design and Analysis of Algorithms (CS 3510), Advanced Algorithms (CS 4540), and specialized topics like Statistical Physics in Algorithms and Combinatorics (CS 8803). He has taught across institutions, including at the University of Birmingham and University of Illinois at Chicago. Key Contributions : His work on phase transitions in combinatorial structures, algorithmic sampling in statistical physics models, and rigorous analysis of Gibbs measures has been published in top venues like FOCS, STOC, and Communications in Mathematical Physics. Notable results include hardness of sampling for anti-ferromagnetic Ising models and novel contour methods for Pirogov-Sinai theory.

Santosh S. VempalaView profile

Professor

• Algorithms
• Convex Geometry
• High-Dimensional Sampling
• +4 more

Santosh S. Vempala is the Frederick P. Storey II Chair and Professor of Computer Science at Georgia Institute of Technology's College of Computing with joint appointments in the H. Milton Stewart School of Industrial and Systems Engineering (ISyE) and the School of Mathematics. He teaches courses including CS6150: Computing for Good (C4G) and CS6550/CS8803DAA: Continuous Algorithms: Optimization and Sampling. His research spans multiple interconnected domains: Algorithmic convex geometry and high-dimensional sampling Continuous optimization methods Computational models of brain function Randomized algorithms with applications to machine learning Vempala's recent publications reveal a strong focus on developing efficient algorithms for high-dimensional problems, particularly logconcave sampling and convex body integration. His work bridges theoretical computer science with practical applications in optimization and neuroscience, with increasing attention to the intersection of theoretical frameworks and brain computation models through his collaboration with Christos Papadimitriou. He leads the Computing for Good (C4G) initiative which applies computational approaches to social challenges, including projects like Safe and Easy Passwords!, LifeNet, C4G BLIS, and Shelter-to-Home that address problems in resource-constrained settings. Vempala currently advises PhD students Xinyuan Cao, Mirabel Reid, Max Dabagia, and Yunbum Kook, and has authored influential books including 'Spectral Algorithms' and 'The Random Projection Method' that have shaped research in algorithmic convex geometry. His tutorials at major conferences, including STOC 2015 on 'Sampling and Volume Computation in High Dimension' and FOCS 2020 on 'Computation in the Brain,' demonstrate his leadership in connecting theoretical computer science with broader scientific challenges.

Geoffroy CouteauView profile

Researcher

• Cryptography
• Secure Multiparty Computation
• Zero-Knowledge Proofs
• +5 more

Geoffroy Couteau is a CNRS research scientist at IRIF (Institut de Recherche en Informatique Fondamentale), Université Paris Cité, where he conducts research in theoretical and applied cryptography. He obtained his PhD from École Normale Supérieure de Paris in 2017 under the supervision of David Pointcheval and Hoeteck Wee, followed by a postdoctoral position at Karlsruhe Institute of Technology (KIT) from 2017 to 2019. His primary research interests include secure multiparty computation, zero-knowledge proofs, and the theoretical foundations of cryptography, with a particular emphasis on pseudorandom correlation generators and efficiency improvements in cryptographic protocols. He has made significant contributions to fine-grained cryptography, non-interactive zero-knowledge proofs, and post-quantum secure computation. The recent publications reflect a strong trend toward foundational advances in secure computation, with increasing focus on efficiency, practicality, and connections to complexity theory and learning theory. His work often bridges theoretical hardness assumptions with practical protocol design. ERC Starting Grant (2023) for project OBELiSC (Overcoming Barriers and Efficiency Limitations in Secure Computation) Geoffroy Couteau has advised numerous PhD and master’s students, including Dung Bui, Clément Ducros, Eliana Carozza, and Ulysse Léchine. He has also hosted many visiting students and postdocs, fostering a vibrant research group. He has served on the program committees of major conferences such as EUROCRYPT, CRYPTO, TCC, and PKC. He is currently leading research in cryptography at IRIF and is involved in postdoctoral hiring for projects in advanced cryptographic primitives. He maintains a research blog and resource collection for students, including LaTeX templates, a probability cheat sheet, and curated answers to common cryptography questions.

David SteurerView profile

Associate Professor

• Theoretical Computer Science
• Algorithms
• Sum-of-Squares Method
• +5 more

David Steurer is an Associate Professor in the Department of Computer Science at ETH Zurich, where he leads the Institute for Theoretical Computer Science. His research bridges theoretical computer science, mathematics, and practical applications in machine learning and statistics. Steurer has made significant contributions to the understanding of sum-of-squares methods, semidefinite programming, and high-dimensional estimation problems. Steurer earned his B.Sc. & M.Sc. in Computer Science from Saarland University in 2006, followed by a Ph.D. in Computer Science from Princeton University in 2010 under the supervision of Sanjeev Arora. His doctoral dissertation, "On the Complexity of Unique Games and Graph Expansion," received an Honorable Mention for the ACM Doctoral Dissertation Award in 2011. Steurer's research focuses on algorithm design through mathematical programming relaxations, particularly semidefinite programming and the sum-of-squares method. His work addresses computational complexity of high-dimensional estimation problems including tensor decomposition, clustering, Gaussian mixture models, and stochastic block models. He also investigates algorithmic aspects of robustness and differential privacy, especially for estimation tasks. His theoretical contributions have practical implications for machine learning and data analysis in the presence of noise and adversarial conditions. Analysis of Steurer's recent publications reveals a consistent trajectory in advancing the sum-of-squares framework for high-dimensional estimation and robust statistics. His work demonstrates how sophisticated mathematical programming techniques can provide certifiable guarantees for challenging problems in machine learning. The research spans theoretical foundations while maintaining relevance to practical applications, particularly in scenarios involving corrupted or noisy data. A notable trend is the extension of sum-of-squares methods to handle increasingly complex statistical models while providing rigorous performance guarantees. ERC Consolidator Grant (2019) Michael and Sheila Held prize (2018, with Raghavendra) Invited speaker at International Congress of Mathematicians (2018) STOC Best Paper Award (2015) Alfred P. Sloan Research Fellowship (2014) NSF CAREER Award (2014) Microsoft Research Faculty Fellowship (2014) FOCS Best Paper Award (2010) Steurer has advised numerous PhD students and postdocs who have gone on to prominent positions, including Sam Hopkins (now faculty at MIT), Jonathan Shi, and Aaron Potechin. His research is supported by multiple prestigious grants, including an ERC Consolidator Grant, an NSF CAREER Award, and a Microsoft Research Faculty Fellowship. He has served on numerous program committees for top theoretical computer science conferences and has been recognized for his service to the community through roles such as internal member of the Scientific Advisory Committee of the Institute for Theoretical Studies at ETH Zurich. As head of the Institute for Theoretical Computer Science at ETH Zurich, Steurer leads a research group focused on advancing the theoretical foundations of computer science with particular emphasis on mathematical optimization methods. His team explores the boundaries of what can be efficiently computed in high-dimensional settings, with applications spanning machine learning, statistics, and data science. The group maintains strong connections with both theoretical and applied researchers across ETH and the broader academic community.

Chris PeikertView profile

Professor

• Cryptography
• Lattice-based Cryptography
• Coding Theory
• +2 more

Chris Peikert is a Professor in the Department of Computer Science and Engineering at the University of Michigan's College of Engineering. He received his Ph.D. from MIT's Computer Science and Artificial Intelligence Laboratory in 2006 under the supervision of Silvio Micali. Peikert is a leading researcher in cryptography, particularly known for his foundational work in lattice-based cryptography. His research interests span cryptography, lattices, coding theory, algorithms, and computational complexity, with a particular focus on cryptographic schemes whose security can be based on the apparent intractability of lattice problems. Peikert has made significant contributions to the development and analysis of lattice-based cryptographic primitives, including ring-LWE, fully homomorphic encryption, and zero-knowledge proofs. Peikert's recent work demonstrates continued leadership in post-quantum cryptography, with publications in top venues like CRYPTO, EUROCRYPT, and STOC. His research spans theoretical foundations of lattice problems to practical implementations of lattice-based cryptographic systems, including hardware acceleration for fully homomorphic encryption. IACR Fellow (2024) Test-of-Time Award from Crypto 2008 (2023) TCC Test-of-Time Award (2017) Patrick C. Fischer Development Professor of Theoretical Computer Science (2017) Best Paper Award at Eurocrypt 2010 Best Paper Award at STOC 2009 Alfred P. Sloan Foundation Fellowship Google Research Award Peikert has been actively involved in the cryptographic research community, serving on program committees for major conferences including CRYPTO, EUROCRYPT, FOCS, and TCC (where he was program co-chair in 2021). He has also developed educational resources, including extensive lecture materials on lattice-based cryptography and teaching courses on cryptography and theoretical computer science at both the undergraduate and graduate levels.

Eren C KızıldağView profile

Assistant Professor

• Statistics
• Data Science
• Probability Theory
• +5 more

Eren C. Kızıldağ is an Assistant Professor in the Department of Statistics at the University of Illinois Urbana-Champaign, with additional affiliations in the Department of Electrical and Computer Engineering. He holds a PhD in Electrical Engineering and Computer Science from MIT, where he was part of the Laboratory for Information and Decision Systems (LIDS) and the Institute for Data, Systems, and Society (IDSS). Previously, he was a Distinguished Postdoctoral Fellow at Columbia University. His research bridges probability, statistics, and computer science, focusing on statistical-computational trade-offs in random models such as optimization problems and statistical inference. Key interests include understanding algorithmic barriers in high-dimensional problems, discrepancy theory, and neural network theory. His work often explores connections to statistical physics and combinatorial structures. Recent publications highlight contributions to topics like low-rank tensor recovery, algorithmic obstructions in partitioning problems, and geometric barriers in discrepancy minimization. His research also addresses theoretical foundations of overparameterized neural networks and hardness results for partition functions in spin glass models. Kızıldağ’s academic journey includes a Master’s from MIT and a B.S. (summa cum laude) from Bogaziçi University, with early work in MRI technology at ISMRM. His research is supported by collaborations with institutions like LIDS and IDSS, and his work frequently appears in top venues such as Annals of Applied Probability, Mathematics of Operations Research, and IEEE ISIT.

Diptarka ChakrabortyView profile

Assistant Professor

• Theoretical Computer Science
• Algorithms on large data sets
• Sublinear algorithms
• +5 more

Diptarka Chakraborty is an Assistant Professor in the Department of Computer Science at the School of Computing, National University of Singapore (NUS). He obtained his PhD from the Indian Institute of Technology Kanpur in 2016 and held postdoctoral positions at Charles University, Prague, and the Weizmann Institute of Science, Israel. His educational background includes: PhD in Computer Science and Engineering, Indian Institute of Technology Kanpur, 2016 Dr. Chakraborty's research lies at the intersection of Theoretical Computer Science and Algorithms , specializing in sublinear algorithms , approximation algorithms , graph algorithms , and data structures for massive datasets. His work addresses computational hardness in edit distance, rank aggregation, and fault-tolerant graph structures, with recent emphasis on algorithmic fairness and streaming applications. Analysis of his 2020-2025 publications reveals dominant trends in fairness-constrained algorithms (e.g., fair rank aggregation) and scalable techniques for massive data (e.g., clustering permutations in streaming models), alongside foundational contributions to equivalence testing, model counting, and reachability under failures. His scientific contributions have been recognized with: Faculty Teaching Excellence Award 2024 Google South & Southeast Asia Research Award 2022 Best Paper Award at FOCS 2018 IBM Research India Outstanding Ph.D. Student Award 2015-16 Dr. Chakraborty actively mentors two PhD students and multiple research fellows while leading three major research projects: massive data handling under edit metrics, fair rank aggregation, and fault-tolerant graph structures. His Google Research Award supports investigations into computational challenges of fairness. He maintains an active research group with international collaborations and regular seminar participation across institutions including IITs, TIFR, and UC campuses.

Sharmistha GuhaView profile

Assistant Professor

• Bayesian Methods
• High-Dimensional Regression
• Causal Inference
• +4 more

Sharmistha Guha is an Assistant Professor in the Department of Statistics at Texas A&M University, part of the College of Arts & Sciences. Her research focuses on Bayesian methods for analyzing complex, high-dimensional data, with applications in neuroscience, network security, and social sciences. She develops techniques for supervised network data analysis, causal inference, and data privacy preservation. Education: Ph.D. in Statistical Science (Duke University, implied by dissertation recognition). Research Interests: Bayesian high-dimensional regression, object-oriented regression, causal inference in randomized trials, probabilistic record linkage, Bayesian nonparametric mixture models, and integration of heterogeneous data types like networks and functional data. Her work addresses challenges in neuroimaging (dMRI/fMRI) and big data analytics. Recent Contributions: Her articles span Bayesian methodologies for network analysis, differential privacy in treatment effect estimation, and applications in environmental health (e.g., PM2.5 exposure studies). Notable trends include leveraging Bayesian hierarchical models for complex data structures and advancing causal inference frameworks. Awards: 2022 Blackwell-Rosenbluth Award (ISBA) 2021 Savage Award Honorable Mention 2024 NSF-DMS Grant 2413721 Grants & Advising: Secured NSF funding for heterogeneous data integration research. Mentored students like Jose Rodriguez-Acosta (NSF GRFP Fellow) and Jacob Pagel (NIH-funded CoSIBS participant). Lab/Team: Leads a research group integrating statistical method development with domain collaborations in neuroscience and network security. Active in organizing workshops and serving on panels to foster academic engagement.

• Quantum Computation
• Computational Complexity Theory
• Quantum Physics
• +2 more

Adam Bouland is an Assistant Professor of Computer Science at Stanford University, where he leads the CS Theory Group. His research focuses on quantum computation, computational complexity theory, and their connections to physics. He completed his Ph.D. at MIT under Scott Aaronson, followed by postdoctoral research at UC Berkeley and the Simons Institute under Umesh Vazirani. His research explores fundamental questions in quantum computing including quantum complexity classes, quantum supremacy demonstrations, pseudorandom quantum states, quantum algorithm design, and connections to high-energy physics through AdS/CFT correspondence. Recent work investigates computational aspects of quantum systems, quantum learning theory, and noise resilience in quantum devices. Professor Bouland leads an active research group including 6 PhD students and 1 postdoctoral researcher, with joint appointments across Computer Science, Physics, and ICME departments. He regularly teaches graduate courses on Quantum Computation (CS259Q) and Quantum Complexity Theory (CS359D). His service includes program committee membership for major theoretical computer science conferences including FOCS, STOC, ITCS, and QIP.

Jason R. GreenView profile

Professor

• Theoretical chemical physics
• Nonequilibrium statistical mechanics
• Data science
• +4 more

Jason R. Green is a Professor in the Department of Chemistry at the University of Massachusetts Boston. With a PhD from Purdue University (2007) and postdoctoral experience at the Universities of Chicago, Cambridge, and Northwestern University, his research bridges theoretical chemistry, physics, and data science to explore nonequilibrium systems. His work focuses on transforming chemical energy into dynamically functional materials through interdisciplinary approaches. Education: B.S., Case Western Reserve University (cum laude, 2002) Ph.D., Purdue University (2007) with NASA Graduate Fellowship NSF Postdoctoral Fellow at University of Chicago and University of Cambridge Research Interests: Theoretical chemical physics Nonequilibrium statistical mechanics Data science applications in chemical systems His recent publications analyze electrochemical material dynamics (ACS Nano 2024), chemically driven self-assembly (Chemical Science 2024), and thermodynamic speed limits across disciplines (Nature Physics 2020, Physical Review X 2022). He has received prestigious fellowships including NASA's Graduate Student Researchers Program and NSF Postdoctoral Fellowship. The Green Research Group at UMB applies theory, computation, and data science to understand energy transformation in synthetic and biological materials.

• Mathematical Physics
• Partial Differential Equations
• Probability
• +3 more

Felipe Hernández is an Assistant Professor in the Department of Mathematics at Pennsylvania State University. He is affiliated with the Department of Mathematics, located in McAllister Building, and can be contacted at felipeh@psu.edu. His research interests span Mathematical Physics, Partial Differential Equations, and Probability, with a focus on quantum systems, stochastic processes, and theoretical analysis of complex systems. His work explores topics such as quantum diffusion in disordered systems, decoherence dynamics, and the interplay between classical and quantum mechanics. He also investigates computational methods like neural networks to enhance accuracy in quantum chemistry calculations and explores foundational questions in quantum computing, such as BosonSampling complexity. Recent contributions include studies on Hodge systems, divergence-free vector fields, and endpoint estimates in functional analysis. While no specific awards or grants are listed, his research demonstrates a commitment to advancing mathematical physics and computational methods through rigorous theoretical analysis and interdisciplinary approaches.