Sug Woo Shin is a Professor of Mathematics at the University of California, Berkeley ( Math Genealogy , MathSciNet Profile ). His research focuses on Number Theory and Automorphic Forms, with significant contributions to the Langlands Program, Shimura varieties, and cohomology of arithmetic spaces. Editorial roles: Astérisque , Manuscripta Mathematica , Journal of the Korean Mathematical Society Recent research explores cohomological properties of locally symmetric spaces, tempered A-packets for classical groups, and modularity of symplectic Galois representations Collaborators include Ana Caraiani, Mark Kisin, Arno Kret, and Peter Scholze He has supervised PhD theses on topics like affine Deligne-Lusztig varieties, specialization maps in Scholze's category of diamonds, and statistical properties of automorphic representations. Teaching includes graduate courses on Number Theory (254A/254B), undergraduate Linear Algebra (110), and Calculus (1A), as well as seminars on global Langlands reciprocity and p-adic cohomology theories. Co-organized conferences include the BIRS workshop on Langlands programs (2025), PRIMA algebraic number theory sessions (2022), and KAST Symposium on automorphic forms (2021). His work appears in journals like Annals of Mathematics, Duke Mathematical Journal, and Compositio Mathematica.
Bahar Asgari is an Assistant Professor in the Department of Computer Science at the University of Maryland, College Park. She holds appointments in CS, UMIACS, and ECE, and directs the Computer Architecture and Systems Lab (CASL). Her research focuses on domain-specific architecture design, near memory processing, and reconfigurable computing. Before joining UMD, she worked at Google, contributing to system optimization and memory utilization strategies. Education: Ph.D., Georgia Institute of Technology, 2021. Research Interests: Developing energy-efficient architectures for sparse problems, scientific computing acceleration, FPGA optimizations, and reconfigurable hardware systems. Her work addresses challenges in memory efficiency, parallelization, and hardware-software co-design across domains like machine learning and IoT. Key Awards: 2024 UMD Excellence in Teaching Award 2023 DOE Early Career Award Advising & Grants: Supervises 9 graduate students and leads projects sponsored by NSF, DOE, and industry partnerships. Her lab explores systolic arrays, near-data processing, and fault-tolerant computing. Labs/Teams: Directs CASL, which builds next-generation computing systems through hardware innovation and algorithm-architecture co-design.
Liping Liu is a Professor in the Department of Management at The University of Akron's College of Business. He holds a Ph.D. in Business from the University of Kansas (1995), Master of Engineering in Systems Engineering (1991), and dual bachelor's degrees in Applied Mathematics (1986) and River Dynamics (1987). Ph.D., University of Kansas MS, Huazhong University of Science and Technology B.E., Wuhan University BS, Huazhong University of Science and Technology His research spans Artificial Intelligence , Electronic Business , Systems Analysis , Data Quality , and Belief Function Theory . He pioneered coarse utility theory and linear belief functions , now taught in top Ph.D. programs across multiple disciplines. Key trends in his publications include Belief Function Applications (2012-2024), Medical Data Systems (2003-2015), and Decision Theory (2004-2014). Recent works focus on Gamma Belief Functions (2024) and computational improvements in linear belief function operations (2019-2016). Scientific contributions recognized via: Microsoft Azure Educator Grant (2014-2016) Inclusion in Who's Who in America (2010-2013) and Who's Who in the World (2011-2013) As an editor and committee member for major conferences (INFORMS, AMCIS, Belief Functions conferences), he bridges academic research with practical systems implementation in e-business and healthcare domains.
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.
Lukas Brantner is a Royal Society University Research Fellow at the Mathematical Institute of the University of Oxford. His research focuses on geometry, topology, and derived algebraic structures, with a particular emphasis on partition Lie algebras, deformation theory, and higher algebraic frameworks. His recent work spans topics such as derived foliations, Poincaré-Birkhoff-Witt theorems, and the complexity of geometric objects like Calabi-Yau varieties in characteristic p. This reflects a deep interplay between algebraic topology, homotopy theory, and modern algebraic geometry. Major Themes: Derived Algebraic Geometry, Homotopy Theory, Deformation Theory, Galois Theory Collaborators: Magidson, Nuiten, Antolín-Camarena, Heuts, Taelman, Campos, Waldron, Hahn, Knudsen, Mathew, Arone, Manners Scientific Awards & Honors: Royal Society University Research Fellow Brantner actively contributes to foundational research in algebraic topology and derived structures, often bridging pure algebra with topological phenomena. His publications highlight the evolution of partition Lie algebras, configuration spaces, and Goodwillie calculus in modern mathematics.
Nate Foster is a Professor of Computer Science at Cornell University and currently serves as the Associate Dean for Research in the Ann S. Bowers College of Computing and Information Science. He is also a Visiting Researcher at Jane Street and served as a Visiting Professor at École Polytechnique Fédérale de Lausanne during the 2023-24 academic year. His research uses ideas from programming languages to solve problems in networking, databases, and security. BA in Computer Science, Williams College (2001) MPhil in History and Philosophy of Science, University of Cambridge (2008, all work completed in 2003) PhD in Computer and Information Science, University of Pennsylvania (2009) Foster's research focuses on developing languages and tools that make it easy for programmers to build secure and reliable systems. His current work centers on the design and implementation of languages and tools for programmable networks, particularly using the P4 language. His past work includes bidirectional languages (also known as 'lenses'), database query languages, data provenance, type systems, mechanized proof, and formal semantics. His research group at Cornell has made significant contributions to network verification, software-defined networking, and formal foundations for programmable data planes. Analysis of Foster's recent publications reveals a strong focus on network verification and programming language foundations for networking. His work consistently applies formal methods to practical networking problems, with a particular emphasis on the NetKAT and P4 languages. Over the past five years, his research has evolved toward more complex network verification techniques, including infinite state verification, active learning of network models, and dependently-typed approaches to network programming. His work bridges theoretical computer science with practical networking systems, making formal methods accessible to network engineers. ACM Fellow (2025) ACM SIGPLAN Robin Milner Award (2023) ACM SIGCOMM Rising Star Award (2018) NSF CAREER Award (2013) Alfred P. Sloan Fellowship (2012) Multiple distinguished paper awards across top conferences including POPL, PLDI, and SIGCOMM Foster has advised numerous PhD and Master's students who have gone on to prominent positions in both industry and academia, with many continuing work in programming languages and networking. He has led multiple significant research grants including an NSF CAREER Award and has been involved in the P4 Language Consortium, serving as Chair of the P4 Language Governing Board. His work has been supported by various organizations including NSF, DARPA, and industry partners like Intel and Jane Street. Foster is also active in the programming languages research community, serving on numerous program committees and as Vice Chair of DARPA's Information Science and Technology (ISAT) study group. Foster leads a vibrant research group at Cornell focused on programming languages for networks, with collaborators from academia and industry. His group has developed several influential tools and frameworks including NetKAT, Petr4, and KATch. They maintain strong connections with the P4 community and work closely with industry partners to ensure their research has practical impact on real-world networking systems.
Jelani Nelson is a Professor and Department Chair in the UC Berkeley EECS Department (College of Engineering). His work focuses on theoretical computer science , particularly algorithms , data streams , dimensionality reduction , and privacy-preserving computation . Advising : Current students include Ishaq Aden-Ali, Xin Lyu, Mihir Singhal, and Hongxun Wu (co-advised with leading researchers). Education : PhD from MIT (George M. Sprowls Award), M.Eng from MIT. Research Highlights : Developed foundational results in Johnson-Lindenstrauss dimensionality reduction (optimality, sparse embeddings). Advancements in differential privacy (lower bounds, private mean estimation, threshold learning). Pioneering work on streaming algorithms for heavy hitters, norm estimation, and graph problems. Innovations in compressed sensing and oblivious subspace embeddings . Scientific Awards : PODS Best Paper Award (2011, 2022) IBM Pat Goldberg Memorial Best Paper Award (2011) George M. Sprowls Award for MIT doctoral thesis (2009) NeurIPS 2020 Spotlight Presentation
Geoffrey Pleiss is an Assistant Professor in the Department of Statistics at the University of British Columbia's Faculty of Science. He is also a CIFAR AI Chair at the Vector Institute and an inaugural member of CAIDA's AIM-SI (AI Methods for Scientific Impact) cluster. His work bridges statistical theory, machine learning, and computational methods with applications across various scientific domains. Pleiss received his PhD from the Computer Science department at Cornell University in 2020, where he was advised by Kilian Weinberger and worked closely with Andrew Gordon Wilson. Prior to his faculty position at UBC, he was a postdoctoral researcher at Columbia University with John P. Cunningham. His research focuses on the intersection of deep learning and probabilistic modeling, particularly on developing heuristic and approximate notions of uncertainty from machine learning models. His work has significant implications for reliable and optimal decision-making in experimental design and scientific discovery. Major research thrusts include neural network uncertainty quantification, Bayesian optimization, Gaussian processes, and ensemble methods. Pleiss develops theoretical frameworks while maintaining strong connections to practical applications across scientific domains. An analysis of his recent publications reveals a strong focus on uncertainty quantification in deep learning models, with particular attention to the limitations and capabilities of ensemble methods in the era of overparameterized models. His work increasingly addresses practical challenges in Bayesian optimization for scientific discovery, especially in materials science. There's also a growing emphasis on computational efficiency in Gaussian process methods, reflecting his commitment to making advanced statistical techniques accessible for real-world applications. CIFAR AI Chair Pleiss currently advises several graduate students including Donney Fan (PhD, Computer Science), Tim G. Zhou (MSc, Computer Science), Zachary Lau (MSc, Statistics), Nathan Cantafio (BSc, Statistics), and Tristan Cinquin (Research Intern at Vector Institute). His research is supported by multiple funding sources including his CIFAR AI Chair position, which provides significant research resources for advancing machine learning methodologies with scientific impact. Pleiss co-created and maintains GPyTorch, a highly efficient and modular implementation of Gaussian processes in PyTorch designed for speed, modularity, and prototyping. He is also involved with CoLA (Compositional Linear Algebra), a library for structured linear algebra operations in JAX and PyTorch that enables fast linear algebra computations by automatically exploiting matrix structure.
Anoosheh Heidarzadeh is an Assistant Professor in the Department of Electrical and Computer Engineering at Santa Clara University's School of Engineering. He holds a Ph.D. in Electrical and Computer Engineering from Carleton University (2012) and previously served as a Visiting Assistant Professor at Texas A&M University (2018-2022) and Associate Research Scientist at the same institution (2015-2017). His postdoctoral research was conducted at the California Institute of Technology (2013-2014). His research focuses on: Information and coding theory : Fundamental limits of data transmission and storage systems Private and secure computing : Protocols for confidential data processing in networked environments Fault-tolerant distributed systems : Resilient computation frameworks for large-scale applications Distributed machine learning : Scalable algorithms for collaborative learning architectures Recent publications (2021-2022) demonstrate strong emphasis on privacy-preserving computation (covering 73% of articles) and distributed coding techniques (67% of articles), with innovations in private information retrieval, matrix operations, and group testing methodologies. Theoretical contributions dominate (87%), while 13% address applied challenges like COVID-19 screening.
Brent Pym is an Associate Professor in the Department of Mathematics and Statistics at McGill University. His research focuses on the intersection of differential, algebraic, and noncommutative geometry, with a particular emphasis on Poisson varieties and deformation quantization. He has held academic positions at the University of Edinburgh, University of Oxford, and was a Postdoctoral Fellow at McGill and the University of Toronto. Education: BScE in Engineering Physics, Queen's University (2007) MSc in Mathematics, University of Toronto (2008) PhD in Mathematics, University of Toronto (2013) Research Interests: Pym studies Poisson structures, their quantizations, and connections to mathematical physics. His work involves classical/derived algebraic geometry, D-modules, moduli spaces, the Stokes phenomenon, and multiple zeta values. Recent projects include holonomic Poisson manifolds, log symplectic structures, and software for symbolic calculations in deformation quantization. Awards: Lichnerowicz Prize (2018) Advising & Grants: Pym has openings for graduate students (admission 2026) and undergraduate projects (2026–27). He develops the Star Products software package for symbolic calculations in Poisson brackets and quantization. His work is supported by research collaborations and institutional grants. Labs & Teams: Pym collaborates with researchers in geometry and mathematical physics, contributing to projects in noncommutative algebra and geometric quantization. His software tools enhance symbolic computation in these fields.
Fatma Kılınç-Karzan is an Associate Professor of Operations Research at Carnegie Mellon University's Tepper School of Business, with a courtesy appointment as Associate Professor of Computer Science. She is also affiliated with the Algorithms Combinatorics and Optimization (ACO) PhD Program and was a Visiting Scientist at Berkeley's Simons Institute for the Theory of Computing during Fall 2017. Her educational background includes a PhD from Georgia Institute of Technology's H. Milton Stewart School of Industrial & Systems Engineering with a minor in Mathematics, supervised by Prof. Arkadi Nemirovski. She earned her B.S. and M.S. degrees from the Industrial Engineering Department of Middle East Technical University with a minor in Information Systems. Dr. Kılınç-Karzan's research spans mathematical optimization with emphasis on convex and non-convex optimization theory, algorithms, and applications. Her work bridges theoretical foundations with practical implementations in optimization under uncertainty (robust optimization, chance constraints, distributionally robust optimization), machine learning (preference learning from limited data), and business analytics. She develops foundational theory for large-scale optimization problems with applications in decision making under uncertainty and high-dimensional statistical inference. Analysis of her recent publications reveals a strong focus on convex hull characterizations, semidefinite programming relaxations, distributionally robust optimization, and online convex optimization frameworks. Her work demonstrates increasing integration of optimization theory with machine learning applications, particularly in developing data-driven approaches for decision making under uncertainty. NSF CAREER Award (2015) INFORMS Optimization Society Young Researcher Prize (2015) INFORMS Junior Faculty Interest Group (JFIG) Best Paper Award (2014) BP Junior Faculty Chair (2014-2015) Faculty Giving Chair (2012-2013) Wimmer Fellowship (2012-2013) Dr. Kılınç-Karzan has successfully mentored numerous PhD students who have received prestigious awards, including the 2021 INFORMS Optimization Society Best Student Paper (1st prize) and multiple honorable mentions. Her research has been supported by significant grants including an NSF CAREER Award, an ONR grant (with S. Küçükyavuz), and an AFOSR grant. She serves on editorial boards for Mathematical Programming, Operations Research, Mathematics of Operations Research, and other leading journals, and has held leadership positions in professional societies including the Mathematical Optimization Society and INFORMS Computing Society. Through her affiliations with CMU's Tepper School, Computer Science Department, and ACO Program, she collaborates across disciplines to advance optimization theory and its applications. Her professional service includes committee chair roles for major INFORMS competitions and program committee leadership for international optimization conferences.
Seth Lloyd is a Professor of Mechanical Engineering at the Massachusetts Institute of Technology (MIT), where he directs the Center for Extreme Quantum Information Theory (xQIT). His work bridges theoretical physics, quantum information science, and complex systems theory. He has made significant contributions to the foundations of quantum computing and quantum information processing. Lloyd received his education from prestigious institutions: B.A. from Harvard College (1982) M.Phil from Cambridge University (1984) as a Marshall Scholar Ph.D. in Physics from Rockefeller University (1988) Lloyd's research focuses on quantum information science, particularly quantum computation and quantum communications. He has pioneered work in quantum analog computation, quantum error correction, and quantum metrology. His research explores how quantum mechanics can be harnessed for information processing tasks, with applications ranging from quantum computing to understanding biological processes like photosynthesis. Lloyd is also known for his work on complex systems and the relationship between information and physical systems, arguing that the universe itself can be viewed as a quantum computer. His publication record shows a clear progression from foundational quantum computing work to applications in quantum machine learning and quantum biology. The most recent articles reveal a strong focus on quantum algorithms for machine learning, quantum metrology, and the intersection of quantum mechanics with biological systems. His work on the HHL algorithm for solving linear systems has been particularly influential in quantum machine learning, though its practical advantages have been debated following Ewin Tang's classical algorithms. Lloyd has received numerous scientific honors: Lindbergh Fellow (1994) Finmeccanica Professorship (1996) Edgerton Prize (2001) Fellow of the American Physical Society (2007) Quantum Communication Award (2012) International Quantum Communication Award (2012) Throughout his career, Lloyd has mentored numerous students and researchers in quantum information science. He has secured significant research funding for his work in quantum computing and complex systems. His research has been supported by various foundations and government agencies interested in advancing quantum technologies. Lloyd has also been involved in interdisciplinary collaborations, particularly with biologists studying quantum effects in photosynthesis. Lloyd directs the Center for Extreme Quantum Information Theory (xQIT) at MIT, which brings together researchers from physics, computer science, and engineering to tackle fundamental challenges in quantum information processing. His lab has been at the forefront of developing theoretical frameworks for quantum computing and exploring practical implementations of quantum information protocols.
Michael O'Boyle is a Professor at the University of Edinburgh's School of Informatics, where he serves as Director of the ARM Research Centre of Excellence and the EPSRC Centre for Doctoral Training in Pervasive Parallelism. Holding an EPSRC Established Career Research Fellowship, he leads pioneering work in compiler technology for heterogeneous architectures, bridging theoretical advances with practical high-performance computing applications. Professor O'Boyle's research spans multiple cutting-edge areas including heterogeneous code discovery and optimization, neural machine translation for program synthesis, deep neural network system stack optimization, software-defined hardware, and compiler/architecture co-design. His approach integrates constraint analysis, program synthesis, and machine learning to address complex challenges in high-performance computing across diverse hardware platforms. His recent publications reveal a strong trend toward integrating machine learning with traditional compiler techniques, particularly in neural program synthesis, tensor optimization, and architecture-aware compilation. This work represents a paradigm shift in compiler design, moving from rule-based systems to learning-based approaches that can automatically adapt to diverse hardware targets. IEEE/ACM CGO 2025 Distinguished Paper Award for 'Tensorize: Fast Synthesis of Tensor Programs from Legacy Code' IEEE/ACM CGO 2024 Test of Time Award ACM GPCE 2023 Best Paper Award for 'C2TACO: Lifting Tensor Code to TACOM' ACM ASPLOS 2021 Distinguished Paper Award IEEE HPCA 2021 Best Paper Award for 'Prodigy: Improving the Memory Latency of Data-Indirect Irregular Workloads' Professor O'Boyle has successfully mentored numerous PhD students who have secured prominent positions in academia (including at Cambridge, Edinburgh, Leeds, and McGill) and industry (including Meta, NVIDIA, Qualcomm, Huawei, and Microsoft). His research is supported by significant funding from EPSRC, ARM, and European projects including Bonseyes and Transmuter, demonstrating strong international recognition and industry impact. He leads the influential Compiler and Architecture Design (CArD) Group at the University of Edinburgh and is a founder of the HiPEAC Network of Excellence, which has grown into a major European initiative connecting researchers and practitioners in high-performance and embedded computing.
Prof. David Kerr is a Professor at the University of Münster's Department of Mathematics, within the Faculty of Mathematics and Computer Science. His research focuses on operator algebras, ergodic theory, and mathematical physics. He has contributed to projects such as the CRC 1442 on entropy and group dynamics, and has organized conferences including 'Group Actions: Dynamics, Measure, Topology' in 2022. His work spans topics like C*-algebras, sofic groups, and dynamical systems. Education: Not explicitly detailed in the text, but his career indicates advanced training in mathematics. Research Interests: Operator algebras, ergodic theory, entropy theory, and their applications to group actions and dynamical systems. Grants/Projects: Involved in CRC 1442 projects D04 and D05, exploring entropy, C*-algebras, and dynamical tilings. Labs/Teams: Collaborates with researchers like Hanfeng Li and Robin Tucker-Drob on projects involving operator algebras and group dynamics.
Andrew Childs is a Professor at the University of Maryland, affiliated with the Department of Computer Science and the Institute for Advanced Computer Studies (UMIACS). He serves as Director of the NSF Quantum Leap Challenge Institute for Robust Quantum Simulation (RQS) and is a Fellow at the Joint Center for Quantum Information and Computer Science (QuICS). His research focuses on quantum algorithms for simulating physical systems, algebraic problems, and quantum walk protocols, with applications in quantum computing and computational complexity. University of Maryland Institute for Advanced Computer Studies (UMIACS) Joint Center for Quantum Information and Computer Science (QuICS) NSF Quantum Leap Challenge Institute for Robust Quantum Simulation Childs' research spans quantum simulation, quantum Fourier transform, phase estimation, and Hamiltonian dynamics. He has developed techniques to reduce quantum computational resources for simulating quantum systems and explored limitations of quantum computers through hidden subgroup problems and non-unitary dynamics. His publications cover diverse areas including quantum walk optimization, Hamiltonian simulation methods, and applications to cryptography and condensed matter physics. Recent works address spatial search algorithms, product formulas for commutators, and quantum routing protocols. As an educator, Childs has taught courses on quantum algorithms and information processing at both the University of Maryland and University of Waterloo, with lecture notes and materials spanning multiple years. Contact: amchilds@umd.edu | Office: ATL 3359 | Affiliated with University of Maryland's quantum research institutes.
