Michael A Osborne is Professor of Machine Learning at the University of Oxford and leads the Bayesian Exploration Lab . He serves as Director of the EPSRC Centre for Doctoral Training in Autonomous Intelligent Machines and Systems and co-directs the Oxford Martin AI Governance Initiative. His research focuses on Bayesian optimization, Gaussian processes, and probabilistic numerics with applications in quantum devices, battery modeling, and AI governance. Key Positions: Professor of Machine Learning, University of Oxford Official Fellow, Exeter College Co-founder of Mind Foundry Lead Researcher, Oxford Martin Programme on Technology and Employment Research Themes: Probabilistic modeling for quantum systems Uncertainty quantification in energy storage AI safety and societal impact analysis Automated experimental design Quantum device calibration Probabilistic numerical methods Technical Contributions: Bridging reality gap in quantum devices Efficient Bayesian quadrature techniques Personalized neurostimulation algorithms Automated measurement protocols Quantum-classical hybrid ML
Brian Lawrence is an Assistant Professor in the Department of Mathematics at the University of Wisconsin–Madison, currently on leave as of 2025. Previously, he held positions at UCLA, the University of Chicago, and Columbia University, following doctoral studies at Stanford University under Akshay Venkatesh. His educational background includes: PhD in Mathematics from Stanford University (advisor: Akshay Venkatesh) Lawrence's research centers on arithmetic geometry, specializing in Diophantine problems through p-adic methods. His work develops innovative approaches to Mordell's conjecture, Shafarevich-type results, and rational point distribution using p-adic Hodge theory, étale cohomology, and period mappings. He bridges theoretical number theory with computational frameworks, particularly in algorithmic solutions for Diophantine equations. His publication trends reveal sustained focus on foundational Diophantine geometry problems, with recent work emphasizing conditional algorithms for the Mordell problem and sparsity phenomena in integral points. Collaborations with leading mathematicians like Venkatesh and Sawin demonstrate interdisciplinary engagement across number theory and algebraic geometry. Lawrence actively mentors undergraduate researchers, supervising projects on resultants, Hodge theory, and symmetric polynomials by students including Pramana Saldin, Yuchen Chen, Anuj Sakarda, and Spencer Dembner. His organizational roles include founding the Crystalline Cohomology seminar at Columbia and co-organizing the University of Chicago Number Theory Seminar, fostering collaborative research environments. He contributes extensively through expository notes on schemes, polynomials on lattices, and Fibonacci numbers modulo p, reflecting commitment to mathematical education and knowledge dissemination across multiple institutions.
Yang P. Liu is an Assistant Professor at Carnegie Mellon University 's Department of Computer Science . He received his PhD from Stanford University under the supervision of Aaron Sidford and previously studied at MIT . Fields of Interest : Graph Algorithms, Optimization, High-Dimensional Geometry, Additive Combinatorics, Theoretical Computer Science. His research focuses on algorithmic design and analysis for graph problems, optimization, and combinatorics, with applications in machine learning and complexity theory. Recent work includes advancements in parallel repetition games , combinatorial lines , and dynamic graph algorithms . In 2024, his research spanned FOCS , STOC , and RANDOM conferences, addressing problems in k-CSPs , min-cost flow , and hypergraph sparsification . Earlier contributions (2023) included deterministic flow algorithms and spectral hypergraph techniques. Scientific Awards : NDSEG Fellowship (2018-2021), Google PhD Fellowship (2022-2023), FOCS Best Paper (2022), STOC Best Student Paper (2022), FOCS Best Student Paper (2021). He teaches CS 15-759 , a graduate course on convex optimization theory and applications, covering gradient descent, interior point methods, and algorithmic sparsification techniques.
Giovanni De Micheli is a Full Professor at École Polytechnique Fédérale de Lausanne (EPFL), holding appointments in both the School of Computer and Communication Sciences (IC) and the School of Engineering (STI). He is affiliated with the Integrated Systems Laboratory (LSI) and serves as Scientific Director of EcoCloud. His primary office is located in INF 341 building at EPFL's Lausanne campus where he conducts research and teaching activities. Professor De Micheli's research spans multiple domains in electronic design automation and integrated circuit design. His primary interests include: Integrated Circuit Design and Hardware Synthesis Logic Optimization and Boolean Methods Nanoelectronics and 2D Electronics Quantum Computing and Emerging Technologies Low-Power Electronics and Energy-Efficient Systems Electronic Design Automation for Novel Computing Paradigms His recent publications demonstrate a strong focus on advancing logic synthesis techniques for both conventional and emerging technologies. Professor De Micheli's work bridges theoretical foundations with practical applications, particularly in adapting traditional EDA methods to novel computing paradigms like quantum computing and superconducting electronics. His research group has made significant contributions to the development of efficient algorithms for circuit optimization across multiple technology domains, with particular emphasis on area, power, and delay optimization while maintaining functional correctness. Professor De Micheli has supervised numerous doctoral students throughout his career at EPFL, mentoring over 40 PhD candidates whose research spans various aspects of electronic design automation, circuit design, and emerging technologies. His students have gone on to make significant contributions in both academia and industry. As Scientific Director of EcoCloud, Professor De Micheli leads research initiatives focused on energy-efficient computing systems and sustainable cloud infrastructure. His laboratory, the Integrated Systems Laboratory, serves as a hub for interdisciplinary research connecting computer science, electrical engineering, and materials science, with particular focus on next-generation computing technologies.
Subhasish Mitra is the William E. Ayer Professor of Electrical Engineering and Computer Science at Stanford University, holding dual appointments in both departments. He leads the Stanford Robust Systems Group and serves on the leadership team of the Microelectronics Commons AI Hardware Hub under the US CHIPS and Science Act. His research spans Robust Computing, NanoSystems, Electronic Design Automation (EDA), and Neurosciences, with breakthroughs in X-Compact test compression, carbon nanotube computing, and 3D integration. He has held international roles like the Carnot Chair at CEA-LETI and Visiting Professorships globally. Education & Honors: Recipient of over 40 awards including the IEEE Computer Society’s Harry H. Goode Memorial Award, ACM/IEEE’s A. Richard Newton Technical Impact Award, and the Intel Achievement Award. He earned top academic accolades from IIT Kharagpur and Jadavpur University, and is a Fellow of ACM and IEEE. Research Impact: Pioneered first-of-their-kind systems like the carbon nanotube computer and monolithic 3D integration. His work on robust computing techniques like QED validation and X-Compact compression has industry-wide adoption, saving billions in manufacturing costs. Collaborates with industry leaders like Intel, Google, and Samsung. Publications & Grants: Over 400 publications, including award-winning papers in DAC, ISSCC, and IEEE journals. Leads grants from NSF, DoE, and industry partnerships. His lab explores cutting-edge topics like neuromorphic computing, 3D thermal scaffolding, and AI hardware acceleration. Administration & Outreach: Serves as Associate Chair (Faculty Affairs) for Stanford’s Computer Science Department. Recognized by students for mentorship, and frequently invited to global forums like the World Economic Forum and National Academy of Engineering.
Maxim Kontsevich has been a permanent professor at the Institut des Hautes Études Scientifiques (IHÉS) since 1995, holding the AXA-IHES Chair for Mathematics . He is also Professor at Rutgers University (one month per year since 1997) and was Professor at University of California, Berkeley (1993–1995). Born 25 August 1964 in Khimki, former USSR, he became a French citizen in 1999. Education: Ph.D. in Mathematics, University of Bonn, March 1992. Research Interests: Prof. Kontsevich’s work lies at the intersection of algebraic geometry , mathematical physics , and quantum theory . He introduced revolutionary ideas in mirror symmetry , non-commutative geometry , and deformation quantization , creating new algebraic structures that have found applications far beyond their original contexts. His current ERC Synergy Grant “ReNew Quantum” (2019-2025) explores recursive and exact new quantum theory . Publications & Trends: Across more than 50 influential papers, Kontsevich has consistently pushed the boundaries of enumerative geometry , motivic integration , and topological field theory . His recent work delves into symplectic aspects of homological algebra , motivic Donaldson-Thomas invariants , non-archimedean geometry , and integrable systems , revealing deep connections between geometry, algebra, and physics. Scientific Awards & Honors: Fields Medal (1998) Crafoord Prize (2008) Shaw Prize in Mathematical Sciences (2012) Breakthrough Prize in Fundamental Physics (2012) Breakthrough Prize in Mathematics (2014) ERC Synergy Grant “ReNew Quantum” (2019) AMS Moore Prize (2025) Doctor Honoris Causa: Aarhus University (2014), Universität Wien (2015), Syddansk Universitet (2023) Member of Académie des Sciences, Institut de France, Academia Europaea, National Academy of Sciences (foreign), London Mathematical Society (honorary) Grants & Leadership: As Principal Investigator of the ERC Synergy Grant “ReNew Quantum” (€10 million, 2019-2025), Kontsevich coordinates an international team advancing exact methods and resurgence in quantum field and string theories. Editorial Service & Community Roles: He serves on the editorial boards of Compositio Mathematica , Publications Mathématiques IHÉS , Journal of Noncommutative Geometry , and several other leading journals, shaping the direction of contemporary mathematical research.
Caterina Consani is a Professor of Mathematics at Johns Hopkins University's Krieger School of Arts & Sciences. She holds a PhD from the University of Chicago (1996) and a Dottore di Ricerca in Matematica from the Universities of Genoa and Turin (1993). Her research focuses on arithmetic geometry, non-commutative geometry, and the development of absolute geometry over the 'absolute point.' She has contributed to foundational work on the BC-system, the Arithmetic Site, and the Scaling Site, linking number theory with geometric frameworks. Education: PhD in Mathematics, University of Chicago (1996); Dottore di Ricerca in Matematica, Universities of Genoa & Turin (1993). Prior to Johns Hopkins, she taught at MIT (1996–1999) and the University of Toronto (1999–2005). Research Interests: Arithmetic geometry, non-commutative geometry, absolute geometry in characteristic one, connections to number theory and the Riemann Hypothesis. Collaborations include work with Alain Connes on adele class spaces and non-commutative algebraic geometry. Awards: Fellow of the American Mathematical Society (2024); 2025 Best Paper AOFA Award (Annals of Functional Analysis). Editorial roles include the Journal of Number Theory and Journal of Noncommutative Geometry. Teaching: Offers advanced courses in algebraic geometry and number theory, including topics like étale cohomology and the yoga of weights in 'Weil II.' Grants: Supported by the Simons Foundation. Organized major conferences such as the JAMI Conference on Riemann-Roch in Characteristic One (2019).
Alexander Gorodnik is a Professor of Mathematics at the University of Zurich, focusing on the interplay between dynamical systems and number theory. His work bridges ergodic theory, homogeneous dynamics, and Diophantine approximation, with applications to arithmetic counting problems and geometric distribution of lattice orbits. Current lectures include MAT121: Analysis I and MAT221: Analysis III at the University of Zurich Co-author of the book The ergodic theory of lattice subgroups (Princeton University Press, 2010) Editor of the journal Ergodic Theory and Dynamical Systems His research explores Diophantine approximation through dynamical systems, investigating how orbits of group actions distribute in homogeneous spaces. Key topics include mixing properties , central limit theorems , and metric theorems for multiplicative approximation. Recent publications address automorphic density estimates , discrepancy in intrinsic Diophantine approximation , and effective equidistribution of translated measures. His work often employs tools from representation theory and spectral analysis . Current working group members include Zhiyuan Deng , Zouhair Ouaggag , and Yuval Yifrach . He has taught courses at institutions in Zurich, Bristol, Princeton, and Mumbai, with lecture materials covering topics from ergodic theorems to Každan's property (T) .
Prof. Hayden Kwok Hay SO is an Associate Professor at the University of Hong Kong (HKU), affiliated with the Department of Electrical and Electronic Engineering. He currently serves as Acting Director of the School of Innovation and previously co-directed the Computer Engineering Program. His research focuses on reconfigurable computing systems, FPGA-based architectures, and their applications in AIoT, medical imaging, and high-performance computing. He holds a B.S., M.S., and Ph.D. in Electrical Engineering and Computer Sciences from UC Berkeley (1998–2007). Prof. So has been recognized with awards such as the IEEE-HKN Teaching Award (2021), Croucher Innovation Award (2013), and multiple teaching excellence awards. He leads the Computer Architecture & System Research Lab (CASR) and co-founded the Joint Lab on Future Cities (JLFC). His work spans FPGA overlay architectures, graph processing systems, and hardware-software co-design for efficient computing. Key research contributions include advancements in FPGA-based reconfigurable systems, sparse dataflow architectures, and medical imaging accelerators. He has secured grants for projects like 'Advanced machine vision guided aquatic surface vehicles' and 'Efficient and Productive Parallel Data Processing in Hybrid FPGA-CPU Clusters.' Prof. So has advised numerous students and researchers, contributing to over 150 peer-reviewed publications. His current projects explore AI hardware acceleration, neuromorphic computing, and FPGA-driven solutions for big data challenges.
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.
Holger Fröning is a full professor at Heidelberg University’s Institute of Computer Engineering (ZITI), where he leads the Hardware and Artificial Intelligence (HAWAII) Lab. His research focuses on embedded machine learning , high-performance computing , and hardware-software co-design , with emphasis on resource efficiency, power optimization, and emerging architectures like analog , photonic , and resistive memory systems. He has held leadership roles including Managing Director of ZITI (2023–present) and Dean of Studies for Computer Science (2019–2022) , and has collaborated with institutions such as NVIDIA Research, Chinese Academy of Sciences, and Graz University of Technology. Research Trends : His recent publications explore Bayesian neural networks , green machine learning , analog computing noise mitigation , and GPU/FPGA optimization . Articles highlight photonic computing for AI , memory-efficient training , and hardware-aware DNN compression . Scientific Awards : 2025 HiPEAC Paper Award (Nature Computational Science) 2014 Google Faculty Research Award Multiple Best Paper Awards (IPDPS, ICPP, ECML-PKDD workshops) Leadership & Service : Organized workshops (WEML, ITEM, F4HD), chaired tracks at EuroPar and ISC, and served on program committees for ICPR, ECAI, and FPL. Education & Affiliations : PhD and MSc from University of Mannheim (2007/2001). Sponsors include DFG, FWF, FFG, NVIDIA, SAP, and XILINX.
Prof. Dr. Ralf Schindler is a Professor at the Institute for Mathematical Logic and Fundamental Research within the Department of Mathematics and Computer Science at the University of Münster. His primary research focuses on foundational aspects of mathematical logic, particularly in set theory and model theory. Schindler's research explores core areas including inner model theory, forcing techniques, large cardinals, determinacy axioms, and descriptive set theory. His investigations address fundamental questions about the structure of mathematical universes, consistency proofs, and connections between set theory and other mathematical disciplines. Recent work emphasizes applications of determinacy hypotheses and extensions of Martin's Maximum. Schindler's publications demonstrate consistent focus on advanced set theory concepts from 2000 to 2021. Key trends include deep investigations into inner models (especially core models and mouse constructions), forcing axioms and their consequences, determinacy hypotheses, and the interplay between large cardinals and descriptive set theory. His collaborative works frequently appear in premier logic journals. Schindler has received significant recognition for his contributions: Hausdorff Medal (2022) Dov Gabbay Prize (2024) He leads the research project EXC 2044 - A2: Groups, model theory and sets , which investigates applications of model theory to arithmetic geometry, topological dynamics, and group theory, while addressing fundamental questions in geometric group theory and set theory foundations.
Prof. Dr. Philipp Habegger is a faculty member at the University of Basel's Department of Mathematics and Computer Science . His research focuses on Number Theory , specifically Diophantine Geometry, heights on abelian varieties, unlikely intersections, and algebraic number theory. He leads the Research Group in Number Theory and participates in collaborative seminars like the Number Theory Web Seminar with Mike Bennett and Alina Ostafe. Contact : philipp.habegger@unibas.ch | +41 61 207 26 98 Office : Spiegelgasse 1, 4051 Basel, Switzerland Academic Role : Research and teaching in number theory and Diophantine problems Research Overview Habegger's work addresses fundamental questions about the distribution of special points on algebraic varieties and the arithmetic properties of polynomial dynamics. His recent publications analyze degeneracy loci in abelian families, canonical heights, and the geometric Bogomolov conjecture. The 15 most recent articles reflect a focus on number theory, algebraic geometry, and effective bounds in Diophantine problems. Scientific Collaborations Collaborated with Ziyang Gao, Harry Schmidt, Umberto Zannier, and others Contributed to journals: Annals of Mathematics , Forum of Mathematics, Sigma , Compositio Mathematica Key themes: Abelian varieties , Heights , Unlikely intersections , CM jacobians
Nicole Wein is an Assistant Professor in the Computer Science and Engineering Division of the Department of Electrical Engineering and Computer Science (EECS) at the University of Michigan, College of Engineering. Her research lies in theoretical computer science, focusing on graph algorithms, dynamic algorithms, parameterized algorithms, distributed algorithms, online algorithms, and fine-grained complexity. She is part of the Theory of Computation Lab and advises both PhD and undergraduate researchers. PhD, Massachusetts Institute of Technology (MIT), advised by Virginia Vassilevska Williams Postdoctoral Fellow, DIMACS Research Fellow, Simons Institute, UC Berkeley MS, Stanford University BS, Computer Science/Math, Harvey Mudd College Her research explores fundamental algorithmic questions in combinatorial settings, particularly how algorithms handle dynamic data, extract information efficiently (e.g., in linear time), and understand shortest path structures in graphs—especially directed ones. She investigates problems in distance estimation, spanners, hopsets, dynamic graph algorithms, and hardness of approximation. Her work combines theoretical depth with practical implications for algorithm design. The recent publications reflect a strong trend in fine-grained complexity and graph algorithm design, with a focus on proving tight bounds, developing efficient approximations, and understanding structural limitations in directed and dynamic graphs. Her work frequently appears in top venues such as STOC, FOCS, SODA, and ICALP, often in collaboration with leading researchers in the field. Scientific Awards and Recognition: Invited to special issue of SIAM Journal on Computing (SICOMP) (FOCS 2022 paper) Invited to Highlights of Algorithms (HALG) (FOCS 2022 paper) Invited to minisymposium at CANADAM (ESA 2022 paper) Work featured in Quanta Magazine Nicole Wein actively mentors students, including current PhD student Jubayer Nirjhor and former undergraduate researchers like Sam Hiken (now pre-doc at MIT). She has served on program committees for major conferences including SODA, FOCS, ICALP, and ITCS, and co-organized the DIMACS workshop on Modern Techniques in Graph Algorithms (2023). She also contributes to the academic community through outreach, such as her article offering reassurance to early-stage PhD students in theoretical computer science. She leads and participates in collaborative research groups and workshops, emphasizing supercollaboration and interdisciplinary communication in algorithms. Her lab fosters a strong research environment in theoretical computer science at the University of Michigan.
Leslie Ann Goldberg is a Senior Research Fellow at St Edmund Hall and Professor of Computer Science at the University of Oxford. She currently serves as Head of the Department of Computer Science (on sabbatical 2025-26) and focuses on foundational problems in Algorithms and Complexity Theory , particularly randomised algorithms for network communication, machine learning, and statistical physics models. Her research includes solving Aldous' 1987 conjecture on backoff protocol instability (with John Lapinskas), developing rigorous mathematical analysis frameworks for algorithmic efficiency, and advancing approximate counting techniques via Markov Chain Monte Carlo methods (with Andreas Galanis and collaborators). Key projects involve graph homomorphisms , Moran process dynamics , and #BIS complexity class analysis. Recent publications (2023-2024) span topics like Sybil defense mechanisms, low-temperature sampling on random graphs, and parameterised subgraph counting modulo 2. Her work demonstrates cross-disciplinary impact in computational biology, statistical physics, and database theory. Scientific Awards include Best Paper Prizes at ICALP 2016, ICALP 2010, and IPEC 2017. She supervises PhD student Paulina Smolarova and collaborates extensively with researchers in Oxford and beyond.
