Eric Larson is an Associate Professor at Brown University's Department of Mathematics, specializing in algebraic geometry. His research focuses on moduli spaces, Brill-Noether theory, and algebraic curves. He collaborates with notable mathematicians such as Isabel Vogt and Izzet Coskun on topics like normal bundles, Chow rings, and stability conditions. Larson actively engages in academic outreach, organizing Putnam competition practices and undergraduate colloquia. He has developed computational tools for studying elliptic curves' Galois representations and contributed to expository works on interpolation problems and LaTeX accessibility.
Angela Capel Cuevas is an Assistant Professor of Quantum Information Theory/Theoretical Quantum Computation at the University of Cambridge's Department of Applied Mathematics and Theoretical Physics (DAMTP). Previously, she held a Junior Professorship at Eberhard Karls Universität Tübingen (2021-2024) and was an MCQST Distinguished PostDoc at TU München (2020-2021). Her research focuses on the intersection of quantum information theory and quantum many-body systems, particularly studying thermalization dynamics via quantum functional inequalities. She is a recipient of the Simons Emmy Noether Fellowship and Forbes 30 Under 30 (Spain 2023). Education: PhD in Mathematics, Universidad Autónoma de Madrid/ICMAT (2015-2019) Master in Computational Engineering and Mathematics, URV/UOC (2016-2018) Bachelor in Mathematics, Universidad de Granada (2009-2014) Research: Angela's work applies analytic and geometric tools to quantum systems, emphasizing decay of correlations in Gibbs states and quantum dissipative evolutions. Key topics include entropy inequalities, modified logarithmic Sobolev inequalities, and thermalization rates in spin chains. Her recent work bridges quantum functional analysis with practical implications for quantum computing and thermalization phenomena. Grants & Roles: PI of CRC TRR 352 'Mathematics of Many-Body Quantum Systems' (7M€) Co-PI of QuantERA project TouQan (1.25M€) Organized workshops at BIRS and Tübingen (2023-2024) Awards: Simons Emmy Noether Fellowship (2023) Forbes 30 Under 30 (2023) Vicent Caselles RSME-FBBVA Award (2022) Labs/Teams: Leads a group studying quantum dissipative systems and thermalization at DAMTP. Collaborates with institutions globally on quantum functional inequalities and Gibbs state properties.
Ştefan Tohăneanu is a Professor in the Department of Mathematics and Statistical Science at the University of Idaho , affiliated with the College of Science. His academic journey includes a Ph.D. in Mathematics from Texas A&M University (2007), and M.S. degrees in Algebra (2001) and Analysis (2001) from the University of Bucharest, where he also earned a B.S. in Mathematics (1997). Research Focus: Commutative Algebra, Hyperplane Arrangements, Matroid Theory, and applications to Coding Theory, including generalized Hamming weights, Orlik-Terao algebras, and homological properties of ideals. Publications: Recent work explores Betti numbers, Jacobian ideals, logarithmic derivations, and connections between algebraic invariants and coding theory problems like minimum distance computation and error correction. Collaborations: Engages with global research networks through affiliations with institutions such as Texas A&M University, University of Bucharest, and University of Idaho.
Hrvoje Jasak is a Professor of Continuum Physics at the Department of Physics (Cavendish Laboratory), University of Cambridge. He holds a fellowship at Christ’s College. His academic journey includes a BSc in Mechanical Engineering from the University of Zagreb (1992) and a PhD in CFD from Imperial College London (1996). Prior to academia, he held engineering roles at CD-adapco (now Siemens PLM), Nabla Ltd, and Ansys-Fluent Inc., contributing to CFD software development. His research focuses on numerical simulation methods, continuum physics, multiphase flows, naval hydrodynamics, and software development. He co-created OpenFOAM, chairs its Numerics Technical Committee, and leads the Computational Continuum Mechanics (CCM) research group within the Laboratory for Scientific Computing. His work integrates advanced numerical techniques like the partially rotating grid method, finite volume algorithms, and multiphysics coupling frameworks. Jasak is a seasoned developer with 25+ years of C++ expertise, having authored ~1 million lines of code. His group’s projects include the Naval Hydro Pack , fluid-structure interaction solvers, and the Eulerian multi-fluid model for dense sprays. He actively collaborates on international initiatives like the NUMAP-FOAM Summer School and the OpenFOAM community. His teaching spans MPhil programs, PhD supervision, and specialized CFD courses. Current research explores wave-ice interaction, lubricated contact modeling, and open-source software innovation. The CCM group’s work bridges academia and industry, addressing challenges in marine engineering, energy systems, and computational mechanics.
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.
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.
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.
John MacLaren Walsh is a Professor in the Department of Electrical and Computer Engineering at Drexel University, where he leads the Adaptive Signal Processing and Information Theory Research Group. He holds BS, MS, and PhD degrees from Cornell University, all completed under Dr. C. Richard Johnson, Jr. His research spans information theory, network coding, distributed computing, and machine learning applications in patent analysis. His work focuses on: Bounding entropic vectors and their impact on communication networks Rate region computation for network coding and distributed storage Information theory for distributed function computation Machine learning-enhanced patent processing systems Publications emphasize entropy geometry, network coding complexity, distributed algorithms, and patent analysis, with consistent themes of optimization and combinatorial methods. Recent work (2016-2019) shows increased focus on probabilistic supports and computational efficiency in network coding. Awards: 2011 NSF CAREER Award for 'Entropy Geometry in Variational Inference Signal Processing' He has advised PhD students on topics like entropy region mapping, network coding, and distributed control. Key grants include NSF CAREER and AFOSR funding for wireless network overhead control. He directs the Adaptive Signal Processing and Information Theory Research Group, which develops algorithms for network coding, distributed storage, and patent analysis systems.
Jonathan A. Kelner is a Professor of Applied Mathematics in the Department of Mathematics at the Massachusetts Institute of Technology (MIT) and a member of the MIT Computer Science and Artificial Intelligence Laboratory (CSAIL). His research focuses on applying techniques from pure mathematics to solve fundamental problems in algorithms and complexity theory, with the goal of developing practical algorithms for real-world questions. Dr. Kelner received his undergraduate degree from Harvard University and his Ph.D. in Computer Science from MIT in 2006. Before joining the MIT faculty, he spent a year as a member of the Institute for Advanced Study. His educational background has provided a strong foundation for his interdisciplinary research spanning mathematics and computer science. His research interests include combinatorial optimization, mathematical programming, spectral graph theory, distributed computing, machine learning, computational geometry and topology, computational biology, signal processing, and random matrix theory. Kelner's work demonstrates how deep theoretical insights can lead to practical algorithmic improvements, particularly in graph algorithms and optimization problems. His approach often involves connecting seemingly disparate areas of mathematics to create novel algorithmic techniques. Analysis of his recent publications reveals a strong focus on spectral graph theory, optimization algorithms, and the Sum-of-Squares method. His work frequently addresses fundamental questions in theoretical computer science with practical implications for algorithm design. A notable trend in his research is the development of nearly-linear-time algorithms for various graph problems, which represents significant improvements over previous approaches. NSF CAREER Award Alfred P. Sloan Research Fellowship NEC Award for Research in Computers and Communication Sprowls Doctoral Dissertation Award Best Student Paper Award at STOC 2004 Best Paper Award at STOC 2011 Kokusai Denshin Denwa Junior Faculty Chair 2008 Harold E. Edgerton Faculty Achievement Award 2011 School of Science Award for Excellence in Undergraduate Education 2012 Professor Kelner has been actively involved in mentoring students and has received recognition for his teaching excellence, including the School of Science Award for Excellence in Undergraduate Education in 2012. His research has been supported by prestigious grants including the NSF CAREER Award. He has collaborated extensively with researchers across multiple institutions, often working with other leading figures in theoretical computer science to produce groundbreaking results in algorithm design. At MIT, Kelner is part of both the Mathematics Department and CSAIL, positioning him at the intersection of theoretical mathematics and practical computer science. This dual affiliation reflects the interdisciplinary nature of his work, which bridges pure mathematical theory with concrete algorithmic applications.
Cong Ling is a Professor of Information Theory and Cryptography at Imperial College London's Department of Electrical and Electronic Engineering, within the Faculty of Engineering. His research focuses on lattice theory and its applications in coding, cryptography, quantum information, and number theory. Key affiliations include the Academic Centre of Excellence in Cyber Security Research and the Engineering Secure Software Systems group. Education details are not explicitly provided in the text, but his professional experience indicates advanced qualifications in electrical engineering and mathematics. Research interests span lattice-based cryptography, post-quantum security, algebraic coding theory, and quantum-resistant algorithms. His work bridges information theory and number theory, with contributions to MIMO systems, secure communication protocols, and cryptographic protocol design. Recent publications emphasize lattice reduction techniques, quantum algorithms for the shortest vector problem, and advancements in polar codes. Notable trends include exploration of non-commutative algebras for cryptography, Gaussian sampling optimizations, and hybrid quantum-classical approaches to hard integer problems. Over 50+ articles published since 2018 reflect his leadership in lattice-based research and quantum-safe technologies. Awards: None explicitly listed in the text. Grants/Advising: No specific grants or student advisees mentioned; focus remains on collaborative research outputs. Labs/Teams: Associated with Imperial's Cyber Security Research groups and quantum engineering initiatives.
Ivan Dokmanic is an Assistant Professor at the Coordinated Science Laboratory (CSL) within the University of Illinois . His research bridges signal processing , machine learning , and applied inverse problems , with a focus on acoustics, biomedical imaging, and distance geometry. Current Role : Assistant Professor, CSL Email : dokmanic@illinois.edu Research Interests : Dokmanic explores machine learning applications in inverse problems , particularly distance geometry for molecular imaging and acoustics . His work includes unlabeled sensing , where distances between points are known but their arrangement is not. This has implications for powder diffraction , indoor localization , and echo modeling . Article Trends : His recent publications emphasize distance geometry in machine learning , acoustic signal processing , and inverse problem theory . Key areas include molecular imaging , audio encryption , and sensor positioning . Collaborative work spans medical imaging , cyberphysical systems , and geometric invariants . 2016 Google Faculty Award NSF Grant (1 year, $157,079) Students and Grants : Dokmanic mentors PhD students like Puoya, Shuai, and Anadi. His research is funded by the National Science Foundation , Google , VISA , and nVidia .
Alexandros G. Dimakis is a Professor at the University of California, Berkeley's Department of Electrical Engineering and Computer Sciences (EECS), College of Engineering. He is also Co-Director of the National AI Institute for Foundations of Machine Learning and Co-Founder of BespokeLabs.ai. PhD (2008) and Diploma (2003) in Electrical Engineering His research focuses on Generative AI , Information Theory , and Machine Learning . Recent work includes advancements in diffusion models, compressed sensing, and causal inference. His publications (150+) emphasize inverse problems, neural network verification, and generative model optimization. Recent publications highlight trends in Diffusion Models for inverse problems, Language Model Scaling , and 3D-Aware Generative Systems . Collaborative projects span biomedical applications, large-scale dataset curation (Datacomp-LM), and parameter-efficient model fine-tuning. Scientific Awards : IEEE Fellow (2022) James Massey Award (2018) NSF CAREER Award (2011) Google Research Faculty Award Best Paper awards at UAI workshops Eli Jury Dissertation Award (UC Berkeley) He advises PhD students in generative modeling, compressed sensing, and information theory. His research group collaborates with institutions like MIT, NYU, and IBM Research. Former students hold positions at Google, Amazon, and academic institutions like Purdue University.
Prof. Dr. Kai Cieliebak is a Professor of Mathematics at the University of Augsburg, where he holds the Chair of Analysis and Geometry within the Institute of Mathematics under the Faculty of Mathematics, Natural Sciences, and Materials Engineering. He has been at Augsburg University since 2012, following a professorship at Ludwig-Maximilians-Universität München from 2001-2012. His research group includes several researchers and postdocs working on symplectic geometry and related fields. Dr. Cieliebak earned his Diplom in mathematics summa cum laude from Ruhruniversität Bochum in 1992, with thesis on "Pseudo-holomorphe Kurven und periodische Orbits auf Cotangential Bündeln" under advisor H. Hofer. He completed his PhD in mathematics at ETH Zürich in 1996, with thesis "Symplectic boundaries: closed characteristics and action spectra," also advised by H. Hofer. His academic journey included positions at Harvard University, Stanford University, and research at IBM Zürich before his professorships in Munich and Augsburg. Prof. Cieliebak's research focuses on symplectic and contact geometry , with significant contributions to understanding symplectic manifolds, Lagrangian and Legendrian knots, Stein manifolds, and string topology. His work in Hamiltonian dynamics explores variational methods, periodic orbits, and celestial mechanics problems, particularly the restricted three-body problem. In global analysis , he investigates solution spaces of elliptic PDEs and symplectic field theory. His approach often bridges differential geometry, topology, and dynamical systems, with applications to mathematical physics. Over the past decade, Prof. Cieliebak's publications reveal a consistent focus on symplectic homology, Floer theory, and their applications to geometric problems. His work shows increasing integration of algebraic structures with geometric methods, particularly in cyclic homology and string topology. Recent research demonstrates strong collaboration with Urs Frauenfelder on celestial mechanics problems, applying symplectic techniques to the restricted three-body problem and related orbital dynamics. Prof. Cieliebak has secured significant research funding throughout his career, including multiple DFG grants under project codes CI 45/1 through CI 45/12, NSF grants, and participation in European Science Foundation networking programs. His most notable grants include "Foundations of Symplectic Field Theory" (2009-2015) and the current "Rabinowitz Floer Homology" project (since 2023), both in collaboration with U. Frauenfelder. He has mentored numerous researchers and maintains an active research group at Augsburg University, including postdocs and collaborators working on symplectic geometry problems. His team includes researchers such as Dr. Filip Broćić, Zhen Gao, Dr. Hanna Häußler, Emilia Konrad, Shuaipeng Liu, Dominik Meidert, Dr. Airi Takeuchi, Dr. Evgeny Volkov, Milan Zerbin, and PD Dr. Lei Zhao. Prof. Cieliebak has also organized numerous workshops on symplectic geometry, including the annual "Symplectic Field Theory" workshop series.
Joachim Rosenthal is a Professor of Applied Mathematics at the University of Zurich's Department of Mathematics, leading the Applied Algebra Group. His research integrates coding theory, cryptography, and algebraic geometry with applications in communications and security systems. His primary research explores algebraic coding theory including convolutional codes, subspace codes, and post-quantum cryptography. He develops algorithms for error correction, code optimization, and cryptographic protocol analysis, with emphasis on mathematical structures in finite fields and rings. Professor Rosenthal serves as President of the Swiss Mathematical Society (2024-2025) and sits on IEEE Information Theory Society's Board of Governors. He has organized multiple international conferences on coding theory and cryptography, including the Zurich COST Meeting and Workshop on Convolutional Codes. His editorial contributions include roles at Archiv der Mathematik and SIAM Journal on Applied Algebra and Geometry. Recent publications focus on code construction methods, complexity analysis in group-based cryptography, and algebraic approaches to error-correcting codes.
Gábor Somlai is a mathematics researcher at Eötvös Loránd University's Faculty of Science, affiliated with the Department of Algebra and Number Theory since 2006. He is a core member of the HUN-REN-ELTE Geometric and Algebraic Combinatorics Research Group (previously MTA-ELTE until 2023) and participates in the Asymptotic Group Theory ERC project. His institutional roles include contributions to the Mathematics Doctoral School and the Institute of Mathematics. His research spans Algebra , Combinatorics , and Number Theory , with emphasis on spectral sets, tiling problems, group theory, and finite geometry. Recent work explores cyclotomic polynomials, the generalized trifference problem, and connections between tiling and spectral properties in finite abelian groups. His publications reveal a strong focus on combinatorial number theory and algebraic methods in discrete geometry. Somlai's publication trends show sustained contributions to theoretical foundations of tiling and spectral sets (testing Fuglede's conjecture in cyclic groups) Cayley graph properties and CI-group classifications polynomial methods in finite geometry and direction problems His work bridges pure algebra with combinatorial applications, often resolving long-standing conjectures in specialized domains. As part of the HUN-REN-ELTE research group, he collaborates on geometric and algebraic combinatorics projects, leveraging ERC funding for asymptotic group theory investigations. His research infrastructure includes access to the Alfréd Rényi Institute of Mathematics (http://www.renyi.hu) resources.
