Christopher Schommer-Pries is an Associate Professor in the Department of Mathematics at the University of Notre Dame's College of Science. His research focuses on the intersection of topology, higher category theory, and quantum field theory, with notable contributions to classification of topological field theories and foundational work on higher categories. Education: Ph.D. in Mathematics (2009, UC Berkeley), B.S. in Mathematics (2003, Harvey Mudd College) Career: Taught at Notre Dame since 201?, previously at University of Bonn (2013) Research emphasizes dualizability in higher categories, TFTs' algebraic structures, and categorical unicity theorems. Key publications include foundational papers on tensor categories, invertible TFTs, and bordism classifications. Active in teaching advanced topology courses and mentoring graduate students, though no formal advisees listed here.
Goong Chen is a Professor at Texas A&M University (TAMU) within the College of Arts & Sciences. His research focuses on Control Theory, Applied Mathematics, and interdisciplinary applications in computational mechanics, fluid dynamics, and quantum systems. He holds a Ph.D. from the University of Wisconsin (1977) and a B.S. from National Tsing-Hua University (1972). His research interests span computational biomechanics, forensic modeling, nanofluidics, and mathematical physics. Recent work includes modal analysis of animal motion, crash mechanics of aircraft, and forensic reconstruction of disasters. He has contributed to theoretical advancements in PDEs, nonlinear dynamics, and quantum computing. Chen’s articles address cutting-edge topics like thermoelastic plates, Volterra equations, and DFIM systems. He has pioneered numerical methods for complex systems using OpenFOAM and finite element techniques. His computational models have been applied to real-world scenarios such as submarine implosions and chemical warfare forensics. No academic awards are explicitly listed, but his extensive publication record reflects significant contributions to applied mathematics and engineering. He leads research teams focused on interdisciplinary challenges in computational science and engineering.
Bojan Popov is a Professor in the Department of Mathematics at Texas A&M University, part of the College of Arts & Sciences. His research focuses on numerical analysis, nonlinear partial differential equations, and approximation theory, with a particular emphasis on invariant domain preserving schemes and hyperbolic conservation laws. He holds a Ph.D. from the University of South Carolina (1999) and an M.S. from the University of Sofia (1992). Popov has led or co-led numerous grants from agencies like NSF, DOD, and DOE, totaling over $30 million. He has advised four Ph.D. students and organized major conferences, including the 2007 'Approximation and Learning in High Dimensions' and the 2008 'Nonlinear Approximation Techniques Using L1'. His work bridges numerical methods with applications in fluid dynamics, materials science, and high-performance computing. Recent research includes invariant domain preserving techniques for hyperbolic systems, entropy viscosity methods, and robust finite element approximations. He teaches advanced courses such as Hyperbolic Conservation Laws (Math 638) and Linear Algebra (Math 304).
Jake Levinson is an Assistant Professor in the Department of Mathematics and Statistics at Université de Montréal. His research focuses on algebraic geometry and algebraic combinatorics, with particular interests in moduli spaces, Schubert calculus, toric varieties, and equivariant free resolutions. He previously held positions at Simon Fraser University (2020–2023), the University of Washington (2017–2020), and completed a postdoctoral fellowship at LaCIM (UQAM). His Ph.D. from the University of Michigan (2017) was advised by David Speyer. Research Interests: - Algebraic Geometry: Moduli spaces, Schubert calculus, toric varieties, homological algebra. - Algebraic Combinatorics: Crystal graphs, Young tableaux, representation theory, combinatorial aspects of algebraic geometry. - Recent work includes studies on Schubert curves, Springer fibers, and applications of algebraic methods to problems in combinatorics and theoretical computer science. Teaching: - Taught MAT 6620 (Algebraic Geometry: Schemes) at Université de Montréal (Winter 2024). - Previously taught courses on intersection theory, representation theory, and Lean formal proof systems. Key Contributions: - Developed combinatorial models for Schubert curves using crystals and tableaux. - Contributed to Boij-Söderberg theory for Grassmannians and studies of class groups in algebraic geometry. - Collaborated on projects linking algebraic geometry to neural networks and random matrix theory.
Seth Sullivant is a Distinguished Professor in the Department of Mathematics at North Carolina State University (NC State), within the College of Sciences. His research focuses on algebraic statistics, computational and combinatorial algebra, and mathematical phylogenetics. He holds a Ph.D. in Mathematics from the University of California, Berkeley (2005). His expertise spans interdisciplinary areas, including algebraic approaches to statistical problems, combinatorial methods in phylogenetics, and the development of algebraic tools for graphical models. He is affiliated with research groups in Algebra and Combinatorics, Mathematical Biology, and Symbolic Computation at NC State. Recent research trends in his publications emphasize the application of algebraic geometry and combinatorics to statistical models, phylogenetic network analysis, and identifiability problems in systems biology. His work bridges abstract mathematical concepts with practical statistical methodologies, addressing challenges in data analysis and model interpretation. No specific scientific awards are listed in the provided texts. His advising and grant activities are not detailed here, though his extensive publication record suggests active research collaborations. He is part of research teams focused on advancing algebraic methods in statistics and computational biology.
Christian Ikenmeyer is Professor in Computer Science and Mathematics at the University of Warwick. His research focuses on algebraic complexity theory, geometric complexity theory (GCT), and representation theory, with emphasis on tensor rank, Kronecker coefficients, and polynomial identity testing. Research Focus: Dr. Ikenmeyer develops mathematical frameworks to solve fundamental problems in computational complexity, including P vs NP. His work connects representation theory with algebraic geometry to establish complexity lower bounds and classify computational hardness. Leadership: He organizes workshops on algebraic complexity and GCT, including the 2023 Algebraic Complexity Theory Workshop at ICALP. His research is funded by EPSRC and DFG grants, supporting investigations into homogeneous complexity and branching programs. Teaching: Courses include 'Groups and Representations' and programming contest coaching. He has previously taught at MIT, Texas A&M, and Saarland University, developing lecture notes on GCT.
Wilfried Gansterer is a Professor at the Faculty of Computer Science, University of Vienna, leading the Theory and Applications of Algorithms research group. His work focuses on numerical algorithms, distributed computing, and machine learning, with notable contributions to graph neural networks and fault-tolerant systems. Active in projects such as Algorithmic Data Science for Computational Drug Discovery (2020–2028) and REPEAL (Resilience vs. Performance in Numerical Linear Algebra, 2016–2020). Research Interests: Dr. Gansterer’s expertise spans graph neural networks, matrix compression, adversarial defense mechanisms, and high-performance computing. His work addresses challenges in efficient computation, resilience against node failures, and optimizing distributed systems. Projects : Algorithmic Data Science for Computational Drug Discovery (2020–2028) REPEAL: Resilience vs. Performance in Numerical Linear Algebra (2016–2020) Verteiltes Rechnen (Distributed Computing, 2007–2014) Awards : 2023 Best Paper Award for work on Crossfire: An Elastic Defense Framework for Graph Neural Networks. Labs/Teams : Directs the Theory and Applications of Algorithms group, focusing on algorithmic innovation in distributed and high-performance computing environments.
Giulia Guidi is an Assistant Professor of Computer Science at Cornell University, affiliated with the Cornell Ann S. Bowers College of Computing and Information Science. She leads the Cornell High-Performance Computing (HPC) Group and is an Affiliate Faculty at Lawrence Berkeley National Laboratory’s Performance and Algorithms Research Group. Her research focuses on high-performance computing for computational sciences, sparse linear algebra, and scalable software infrastructure for parallel systems. She holds a PhD in Computer Science from UC Berkeley (2022) and has been recognized with awards including the 2024 SIAG/Supercomputing Early Career Prize and the 2023 ISSNAF Young Investigator Award. Her work addresses challenges in genomics, population genetics, and scalable computational methods through collaborations like the NSF-funded 'ACED' project with April Wei’s Lab. Guidi mentors a diverse group of PhD, MEng, and undergraduate students, emphasizing parallel programming and HPC applications. Her lab’s research spans GPU-accelerated algorithms, sparse matrix computations, and bioinformatics tools like the Popcorn and BELLA aligners. She is also a Graduate Field Faculty in Computational Biology and Applied Mathematics at Cornell.
Dr. Dipanwita Thakur serves as Assistant Professor at the Department of Computer Engineering, Modeling, Electronics and Systems (DIMES) at the University of Calabria, Italy since July 2023. She is an active member of the European Cooperation in Science & Technology (COST Action CA22104) focusing on cybersecurity and serves in the IEEE Future Networks Working Group for Artificial Intelligence/Machine Learning. Previously, she held a 15-year Assistant Professor position at Banasthali University, Rajasthan, and has industry experience at TechMahindra and C-DAC. Education: Ph.D. in Smart Healthcare from West Bengal University of Technology, Kolkata M.Tech. in Software Engineering from Banasthali Vidyapith MCA from NIELIT, Government of India B.Sc. from University of Calcutta Her research pioneers Green Artificial Intelligence with emphasis on energy-efficient federated learning and smart healthcare applications. She develops privacy-preserving human activity recognition systems using multimodal data fusion, focusing on performance evaluation and environmental sustainability. Her work bridges theoretical machine learning with practical healthcare solutions, optimizing AI systems for reduced carbon footprint while maintaining clinical efficacy through hardware-algorithm co-design and quantization techniques. Recent publications reveal a strong trajectory toward sustainable AI, with increasing focus on energy-aware federated learning frameworks, multimodal medical segmentation, and non-IID data handling. Her work consistently addresses the critical balance between model accuracy, convergence speed, and energy consumption across edge devices, with growing emphasis on quantization techniques and hardware-algorithm co-design for real-world deployment. Scientific Awards: Elevated to IEEE Senior Member (2024) Dr. B.C. Roy Memorial Scholarship for outstanding 10th Board results (1992) Student Science Seminar Award by West Bengal Government (1990) Dr. Thakur actively mentors students as evidenced by her congratulations to advisee Farwa for paper acceptances. She serves as Associate Editor for Information Fusion (Elsevier) and IEEE Sensors Journal, and holds editorial roles at Scientific Reports. Her research is advanced through COST Action CA22104 and IEEE working groups, though specific grant details aren't listed in the source material. She has organized key workshops including Green-Aware AI 2024 and Green Federated Learning at IJCNN 2025. She leads research within the MONAI community on data quality and federated learning, and contributes to IEEE IoT and Future Networks initiatives. Her work with the COST Action CA22104 Behavioral Next Generation in Wireless Networks connects cybersecurity with sustainable AI development, while her Missouri S&T visiting scholar position focuses on energy optimization for federated learning systems.
Dr. Thomas Chaffey is a Lecturer in the School of Electrical and Computer Engineering at The University of Sydney. His research focuses on nonlinear control theory, convex optimization, and neuromorphic systems. He obtained his PhD from the University of Cambridge (2022) and held the Maudslay-Butler Fellowship at Pembroke College, Cambridge (2022–2025). Education: PhD in Control Theory, University of Cambridge (2022) Maudslay-Butler Fellowship in Engineering, Pembroke College, Cambridge (2022–2025) Master's in Mechanical Engineering, University of Sydney (Australia) Bachelor's in Mathematics and Computer Science, University of Sydney (Australia) Research Interests: Nonlinear control theory and its intersections with optimization and circuit theory Development of neuromorphic systems and analog hardware simulation Monotone operator methods and large-scale optimization algorithms Key Research Trends in Articles: Advances in graphical methods for nonlinear system analysis (e.g., scaled relative graphs) Analysis of neuromorphic circuits using convex optimization frameworks Exploration of symmetry properties in physical systems Awards: Best Student Paper Award, 2021 European Control Conference Outstanding Student Paper Award, 2021 IEEE Conference on Decision and Control Labs/Teams: Leading projects on learning in physical systems and monotone circuits Collaborations with institutions like Lund University and University of British Columbia
Jaakko Timo Henrik Järvi is a Professor in the Department of Informatics at the University of Bergen, Norway, with additional affiliations at the University of Turku, Finland. His research focuses on programming language design, generic programming, and human-computer interaction, particularly in GUI frameworks and software reuse. His research interests include generic programming, programming language design (especially the Magnolia language), high-performance computing, array programming, and GUI engineering. He emphasizes formal methods and algebraic specifications to build reusable and efficient software systems. His work bridges theoretical foundations with practical applications in software development and education. The recent publications highlight a strong trend in declarative GUI frameworks, multi-selection models, and generic programming. His work explores domain-specific languages for GUI structure manipulation, reusable selection semantics across platforms, and optimizing array computations using the Mathematics of Arrays. These efforts reflect a consistent focus on software abstraction, correctness, and reusability. Jaakko Järvi has supervised doctoral students, including Tetiana Yarygina, whose dissertation explored microservice security. While no specific grants are detailed, his work on VisAST was supported by the Research Council of Norway (Project 250683), indicating active external funding. He frequently collaborates with researchers like Magne Haveraaen, Knut Anders Stokke, and Sean Parent. He contributes to tools and frameworks such as the MultiselectJS library and the VisAST educational tool. These are outcomes of collaborative research teams focused on improving software development practices and computer science education.
Nikhil Bansal holds the prestigious Patrick C. Fischer Professorship of Theoretical Computer Science in the Department of Computer Science & Engineering at the University of Michigan's College of Engineering. His research program has established him as a leading figure in theoretical computer science, with significant contributions to algorithm design and analysis, particularly in discrete optimization problems. Bansal's research focuses on theoretical computer science with emphasis on design and analysis of algorithms for discrete optimization problems. His work spans multiple areas including discrepancy theory, approximation algorithms, randomized algorithms, combinatorial optimization, complexity theory, machine learning theory, and probability. He has made significant contributions to understanding the limits of approximation algorithms and developing novel techniques for combinatorial optimization problems. Analysis of Bansal's recent publications reveals a strong focus on discrepancy theory, online algorithms, and combinatorial optimization. His work often bridges theoretical computer science with discrete mathematics and probability theory. A recurring theme across his publications is the development of novel algorithmic techniques for solving NP-hard problems with provable guarantees. His research has evolved from foundational work in approximation algorithms to more recent contributions in quantum computing complexity and stochastic optimization. Patrick C. Fischer Professor of Theoretical Computer Science Bansal has advised numerous PhD students including Marek Elias, Shashwat Garg, and Greg Koumoutsous, as well as mentoring several postdoctoral researchers. He has served on editorial boards for top journals including Journal of the ACM, Theory of Computing, and Stochastic Models, and has been active on program committees for major conferences such as STOC, FOCS, SODA, and ICALP, including serving as chair for ICALP 2021. Bansal has organized multiple academic workshops including the STOC 2020 Workshop on Recent Advances in Discrepancy and Applications, several SDP Days at CWI Amsterdam, and the Semester on Bridging Continuous and Discrete Optimization at UC Berkeley in Fall 2017.
Nikhil Bansal is a Professor in Theoretical Computer Science at the University of Michigan, Ann Arbor. He earned his PhD from Carnegie Mellon University and previously worked at IBM Research, TU Eindhoven, and CWI Amsterdam. His research focuses on algorithm design, discrepancy theory, and combinatorial optimization. Education: PhD, Carnegie Mellon University Bansal's work bridges classical and quantum computing, with recent publications exploring k -Forrelation, vector balancing, and stochastic scheduling. His algorithmic approaches often combine geometric insights and probabilistic methods. Scientific Awards: Patrick C. Fischer Professor of Theoretical Computer Science NSF Career Award (2023) He has advised numerous PhD and postdoctoral researchers, including Marek Elias, Shashwat Garg, and Makrand Sinha. Bansal actively contributes to program committees (ICALP 2021, STOC 2020, FOCS 2018) and organizes workshops on discrepancy theory and optimization.
Jonathan Leake is an Assistant Professor in the Department of Combinatorics and Optimization at the University of Waterloo. His research lies at the intersection of combinatorics, optimization, and theoretical computer science, with a focus on log-concave and Lorentzian polynomials and their applications in discrete and continuous settings. Assistant Professor, University of Waterloo (2022–present) Dirichlet Postdoctoral Fellow, TU Berlin (2020–2022) Postdoctoral Fellow, Institut Mittag-Leffler, Stockholm (Spring 2020) Postdoctoral Fellow, KTH, Stockholm (Fall 2019) James H. Simons Fellow, Simons Institute, UC Berkeley (Spring 2019) His research explores the deep connections between algebraic structures and combinatorial phenomena, particularly through polynomial capacity and Lorentzian polynomials. He applies these tools to problems in optimization, sampling, and representation theory. His work often involves developing new algebraic and analytic techniques to tackle longstanding conjectures and algorithmic challenges. The recent publications highlight a consistent focus on Lorentzian polynomials, capacity bounds, and their applications in combinatorics, optimization, and theoretical computer science. Key themes include matroid theory, log-concavity, sampling algorithms, volume approximation, and connections to Lie theory and representation theory. The research spans both theoretical developments and algorithmic applications, often in collaboration with leading researchers in the field. Dirichlet Postdoctoral Fellowship, TU Berlin Postdoc Fellowship in Algebraic and Enumerative Combinatorics, Institut Mittag-Leffler James H. Simons Fellowship, Simons Institute, UC Berkeley Jonathan Leake has advised or collaborated with several researchers, though formal advisees are not listed in the provided text. His work has been supported by prestigious fellowships and collaborations with institutions such as the Simons Institute and TU Berlin. He has taught courses including CO 250: Introduction to Optimization, MATH 239: Introduction to Combinatorics, and CO 739: Lorentzian Polynomials at the University of Waterloo and TU Berlin. While specific lab or research group names are not mentioned, Leake's collaborative work with researchers like Petter Brändén, Nisheeth Vishnoi, and Leonid Gurvits suggests active participation in research teams focused on algebraic combinatorics, optimization, and theoretical computer science. His publicly shared code for sampling from HCIZ densities and verifying positivity in Lie-theoretic contexts indicates an active computational research component.
Carlos Palazuelos Cabezón is a Professor in the Department of Mathematical Analysis and Applied Mathematics at the Faculty of Mathematical Sciences, Universidad Complutense de Madrid (UCM), with a joint affiliation at the Instituto de Ciencias Matemáticas (ICMAT). He holds a Ramón y Cajal contract and has been a Full Professor since 2024, following his role as Associate Professor from 2019 to 2024. His work bridges deep mathematical theory and quantum information science. Research Interests: His primary research lies at the intersection of functional analysis and quantum information theory. He investigates operator spaces and their applications to quantum entanglement, Bell inequalities, quantum channels, and nonlocal games. A second major line involves noncommutative harmonic analysis, particularly hypercontractivity in von Neumann algebras. His work is highly theoretical and appears in top mathematical and physics journals. Publication Trends: His recent publications demonstrate a consistent focus on the mathematical foundations of quantum information, particularly using tools from operator space theory and Banach space geometry to analyze quantum nonlocality, entanglement, and computational models. There is a strong trend toward solving foundational problems in quantum theory using advanced functional analysis. Scientific Awards: Premio Extraordinario de Doctorado (2008/2009) Doctorado Europeo Advising and Grants: While no specific students are listed, he is part of the MathQI research group and has likely mentored graduate students. He has been supported by prestigious postdoctoral and permanent research contracts in Spain, including the Juan de la Cierva and Ramón y Cajal programs, which are highly competitive grants for early-career and established researchers, respectively. Labs and Teams: He is a member of the MathQI research group (Mathematical Quantum Information) at UCM and is affiliated with ICMAT, a leading mathematics research institute in Spain. These affiliations provide a collaborative environment for interdisciplinary research in mathematical physics and quantum information.
