Ben Green is the Waynflete Professor of Pure Mathematics at the University of Oxford and a Fellow of Magdalen College. His work spans additive combinatorics, analytic number theory, harmonic analysis, ergodic theory, discrete geometry, and group theory, with a focus on interdisciplinary approaches. Research Interests: Additive combinatorics and its applications to primes Analytic number theory (prime distribution, L-functions) Harmonic analysis (Fourier methods, spectral theory) Ergodic theory and its combinatorial applications Discrete geometry (ordinary lines, convex structures) Group theory (approximate groups, expansion) Article Trends: His recent work emphasizes multiplicative functions, Ramsey-type problems in number theory, expansion in finite groups, and extremal set theory. Themes include prime gaps, arithmetic progressions, and interactions between analysis and algebra. Scientific Awards: Clay Research Award (2004) Ostrowski Prize (2005) Whitehead Prize (2005) Leverhulme Prize (2007) European Mathematical Society Prize (2008) Royal Society Fellow (2010) Sylvester Medal (2014) Senior Whitehead Prize (2019) Advising: Ben has supervised numerous D.Phil students across additive combinatorics, analytic number theory, and related fields. Past students hold postdoctoral and academic positions globally.
Leslie Valiant is the T. Jefferson Coolidge Professor of Computer Science and Applied Mathematics in Harvard University's School of Engineering and Applied Sciences, where he has held a faculty position since 1982. A foundational figure in theoretical computer science, his work bridges artificial and natural computational phenomena across multiple disciplines. His academic background includes education at: King's College, Cambridge Imperial College, London Ph.D. in Computer Science from Warwick University (1974) Valiant's research spans computational complexity , machine learning theory , parallel systems , and computational neuroscience . He pioneered the PAC (Probably Approximately Correct) learning framework that established computational learning theory as a rigorous field. His holographic algorithms work revealed deep connections between computational complexity and statistical physics, while his neuroidal model and evolvability theory provide computational explanations for cognitive processes and biological evolution. Current investigations focus on cortical computation primitives and knowledge infusion architectures. His publication trends show increasing integration of neuroscience with computational theory since 2010, with dominant themes in holographic computation (2006-2018), cortical modeling (2012-2018), and evolvability (2009-2017). The work consistently applies computational complexity analysis to biological and cognitive systems. Major recognitions include: Nevanlinna Prize (1986) for mathematical aspects of computer science Knuth Award (1997) for foundational algorithms contributions EATCS Award (2008) for theoretical computer science impact Turing Award (2010) for computational learning theory and complexity Fellowship in the Royal Society and National Academy of Sciences Valiant's research has been supported by NSF and international grants enabling cross-disciplinary work in computational neuroscience and evolutionary algorithms. While specific advisees aren't documented in source materials, his theoretical frameworks have shaped generations of researchers in machine learning and complexity theory. His current research group explores neuroidal architectures for cognitive computation, investigating how cortical circuits achieve robust information processing through in-circuit testing methodologies. Ongoing projects aim to identify fundamental computational primitives in neural systems and develop biologically inspired AI frameworks.
Zhe Zeng is an incoming Assistant Professor in the Department of Computer Science at the University of Virginia starting July 2025. Currently, she serves as a Faculty Fellow in the Computer Science Department at New York University. She earned her Ph.D. in Computer Science from UCLA in 2024 under Professor Guy Van den Broeck, and her B.S. in Mathematics from Zhejiang University in 2018. Research Focus: Dr. Zeng specializes in neurosymbolic AI and probabilistic machine learning, developing methods that integrate symbolic knowledge (logical constraints, graph structures) with probabilistic uncertainty. Her work spans three core areas: Reasoning: Probabilistic inference, tractable probabilistic models Learning: Constrained deep learning, graph ML, weakly supervised learning Trustworthiness: Explainability, uncertainty quantification, domain-knowledge integration Awards & Honors: Rising Star in EECS (2023) Amazon Doctoral Fellowship (2022) NEC Research Fellowship (2021) ICML Travel Award (2018) Outstanding Graduate, Zhejiang University (2018) Advising & Mentoring: Has supervised six students including PhD candidates and undergraduates at UCLA, Tsinghua, and CAS, with placements at Princeton and UT Austin. Academic Service: Regularly reviews for NeurIPS, ICML, ICLR, UAI; served as UAI 2023 discussant; active in WiML mentorship programs.
Günter Rote is a Professor in the Department of Computer Science at Freie Universität Berlin, specifically within the Theoretical Computer Science group (Arbeitsgruppe Theoretische Informatik). He holds a formal academic title of Professor Dr. and is affiliated with the Faculty of Mathematics and Computer Science. His research focuses on theoretical computer science, computational geometry, algorithms, and discrete mathematics. Key research interests include geometric algorithms, optimization problems (e.g., shortest paths, traveling salesman problems), and algorithm design for parallel computing systems. His work spans topics such as systolic arrays, convex hulls, and combinatorial optimization. Rote’s contributions include foundational studies on computational geometry problems, algorithmic complexity, and practical applications in energy equity and infrastructure design. Publications highlight contributions to solving extremal equations, polygon transformations, and the quadratic assignment problem. He has been active in academic leadership, mentoring students, and contributing to computational science communities. His email is rote@inf.fu-berlin.de, and his office is located at Takustraße 9 in Berlin.
Dan Suciu is a Microsoft Endowed Professor in the Paul G. Allen School of Computer Science & Engineering at the University of Washington. His research focuses on data management, query optimization, probabilistic databases, parallel data processing, and information theory applications to databases. Awards : ACM Fellow (2011), American Academy of Arts and Sciences (2024), ACM SIGMOD Codd Innovation Award (2022), NSF Career Award (2001), Alfred P. Sloan Fellow (2001-2002). Research Trends : Recent work emphasizes cardinality estimation using Lp-norms, submodular width for query evaluation, dynamic query processing, and tensor program optimization. His publications highlight intersections between database systems and formal methods, driven by mathematical rigor. Key Collaborators : Mahmoud Abo Khamis, Dan Olteanu, Amir Shaikhha, Maximilian Schleich, Kyle Deeds, Moe Kayali. Advising : PhD students Gerome Miklau (2006), Christopher Re (2010), Paris Koutris (2016), Nilesh Dalvi (2008 runner-up), Yisu Remy Wang (2024 runner-up) have excelled in dissertation awards.
James Aspnes is the Harold W. Cheel Professor of Computer Science at Yale University, specializing in distributed algorithms and randomized methods. He holds a PhD from Carnegie Mellon University and degrees from MIT. His research focuses on distributed systems, peer-to-peer networks, and sensor networks, emphasizing tools for efficient data management and fault-tolerance. Education: PhD (CMU, 1992), SM & SB (MIT, 1987) Affiliations: Yale since 1993, IBM Almaden Research Center (1992–1993) Research interests include distributed algorithms, randomization, and applications in biology and economics. Notable contributions include skip graphs, population protocols, and consensus algorithms. He has received the ACM-EATCS Dijkstra Prize (2020) and Dylan Hixon Prize (2000). Publications span distributed computing, algorithms, and cryptography. Recent work explores consensus protocols and privacy in population models. Grants include NSF awards totaling over $2M. Active in editorial roles (Algorithmica, Distributed Computing) and conference organization (PODC 2005, DCOSS 2007).
Amir Mohammadi is a Professor in the Department of Mathematics at the University of California, Berkeley , appointed in 2025. He is a member of the Senate Faculty and conducts research in the College of Letters and Science. His research interests lie at the intersection of ergodic theory , dynamical systems , and discrete subgroups of Lie groups . He explores deep connections between homogeneous dynamics, number theory, and geometry, with a focus on effective equidistribution, measure rigidity, and Diophantine approximation. His recent publications reflect a strong emphasis on effective results in homogeneous dynamics, including studies on unipotent flows, quadratic forms, and geodesic planes in hyperbolic manifolds. The work often involves collaboration with leading mathematicians and appears in top-tier journals such as Inventiones Mathematicae , Duke Mathematical Journal , and the Journal of the American Mathematical Society . Research is supported in part by the National Science Foundation (NSF) .
Albert Atserias is a Professor in the Department of Computer Science at the Universitat Politècnica de Catalunya (UPC), affiliated with the Faculty of Informatics of Barcelona (FIB) and the ALBCOM research group (Algorithms, Bioinformatics, Complexity, and Formal Methods). He is also associated with the Institut de Matemàtiques de la UPC-BarcelonaTech. His research is central to theoretical computer science, with a strong emphasis on logic and complexity. Atserias's research interests span Computational Complexity, Logic in Computer Science, Finite Model Theory, Proof Complexity, and Constraint Satisfaction Problems . His work explores the fundamental limits of computation, the expressive power of logical languages over finite structures, and the complexity of proving mathematical statements. He investigates the algebraic and combinatorial properties of proof systems, the limits of efficient algorithms for constraint solving, and the theoretical foundations of databases. His research often bridges logic, algebra, and combinatorics to provide deep insights into computational phenomena. The trends in his recent publications show a sustained focus on the logical and algebraic underpinnings of computational problems. Key themes include the consistency and complexity of database queries , the power and limitations of proof systems (like resolution and sum-of-squares), and the expressive power of homomorphism counts in graph theory. His work on the hardness of automating resolution and the development of circular proof systems are particularly significant contributions to proof complexity. The 2024 PODS Best Paper Award for work on relational consistency underscores the impact and timeliness of his research. Among his notable scientific awards are the prestigious ICREA Acadèmia , the PODS 2024 Best Paper Award , the Premi Extraordinari de Doctorat (Extraordinary Doctoral Prize), and the Kleene Award for Best Student Paper . These accolades reflect both the excellence of his early work and his continued leadership in the field. Atserias has been a principal investigator on numerous competitive research projects, including funding from the European Research Council (ERC) and the Spanish Ministry of Science. He has advised doctoral students, such as Toni Hakoniemi, whose thesis on proof complexity he supervised. His extensive collaborative network includes leading researchers like Phokion Kolaitis, Anuj Dawar, and Victor Dalmau. He has also served on the scientific committees of major conferences, contributing to the academic community. He is a core member of the ALBCOM research group , a leading team at UPC focused on theoretical aspects of computer science, which provides a vibrant environment for research in algorithms, complexity, and formal methods. His work is also connected to the broader Institut de Matemàtiques de la UPC, fostering interdisciplinary collaboration between computer science and mathematics.
Cem Say is a Professor in the Department of Computer Engineering at Boğaziçi University's Faculty of Engineering, where he has established himself as a leading researcher in theoretical computer science and artificial intelligence. His academic journey began with the completion of his doctoral dissertation titled Qualitative System Identification in 1992, which was the first thesis of Boğaziçi University's Computer Engineering PhD program. Professor Say's research interests span multiple domains of computer science, with significant contributions to quantum computing, artificial intelligence, and theoretical computer science. His early work focused on qualitative reasoning and simulation, particularly through the QSIM algorithm, where he made significant improvements to filtering techniques and addressed challenges in representing physical systems. Over time, his research evolved toward quantum computation, where he has made substantial contributions to quantum finite automata theory, space-bounded quantum computation, and quantum complexity classes. His recent work explores the energy complexity of computation, bridging theoretical computer science with thermodynamics. His publication record shows a clear evolution from classical AI and qualitative reasoning toward quantum computation. The most recent articles demonstrate his focus on space-bounded quantum computation, energy complexity of regular languages, and interactive proof systems with minimal resources. His work consistently addresses fundamental questions about computational limits, particularly in quantum and sublogarithmic-space models. Professor Say has also made significant contributions to science communication through several books written for general audiences, including 50 Soruda Yapay Zekâ (2018), Yeni Dünya, Yeni Ağ (2020), and En Hakiki Mürşit (2021), which explain complex concepts in artificial intelligence and scientific methodology in accessible terms. Throughout his career, Professor Say has been actively involved in the Turkish academic community, editing proceedings for multiple Turkish symposia on artificial intelligence and neural networks. His doctoral dissertation established foundational work in qualitative system identification, and his subsequent research has consistently pushed boundaries in theoretical computer science, particularly in quantum computation where he has collaborated extensively with Abuzer Yakaryılmaz and other researchers.
Qile Chen is an Associate Professor in the Department of Mathematics at Boston College . His research focuses on Algebraic Geometry , particularly in Logarithmic Geometry , Moduli Spaces , and Gromov-Witten Theory . He has made significant contributions to understanding A^1-connectedness , Stable Log Maps , and Virtual Cycles in geometric contexts. His publications include collaborations with leading mathematicians such as Dan Abramovich , Felix Janda , Yi Zhu , and Dawei Chen . Key topics span Logarithmic GLSM , Multi-scale Differentials , and Spin/Hyperelliptic Structures . Recent Articles : Punctured logarithmic maps (2025), Gorenstein contractions (2024), Campana rational connectedness (2024) Co-advised Student : Zijian Han (Ph.D. in progress at Boston College)
Carolina Osorio is a Professor at HEC Montréal, holding the Scale AI Research Chair in Artificial Intelligence for Urban Mobility and Logistics. She is affiliated with the Department of Decision Sciences and is a member of the Group for Research in Decision Analysis (GERAD) and the Interuniversity Research Centre on Enterprise Networks, Logistics and Transportation (CIRRELT). Her research focuses on transportation optimization, urban mobility, and data-driven simulation-based methods. She has been recognized among the world’s most influential researchers in 2023 and 2024. Education: Ph.D. in Mathematics, École Polytechnique Fédérale de Lausanne (EPFL) M.Sc. in Statistics, University College London (UCL) Bachelor’s in Engineering, École nationale supérieure d'informatique et de mathématiques appliquées de Grenoble (ENSIMAG) Research Interests: Her work emphasizes scalable transportation modeling, simulation-based optimization, and AI applications for urban logistics. She develops methods for large-scale network analysis, traffic demand estimation, and sustainable urban mobility solutions. Key areas include traffic signal optimization, car-sharing service design, and high-dimensional stochastic systems. Publications: Recent articles highlight advancements in scalable traffic demand estimation, Bayesian optimization for transportation systems, and simulation-based toll optimization. Her work addresses challenges in global highway networks, urban congestion dynamics, and multi-city calibration. Awards: Scale AI Research Chair (Artificial Intelligence for Urban Mobility and Logistics) Recognition as a world-leading researcher in transportation science Advising & Grants: Osorio collaborates on projects funded by Scale AI and leads research initiatives through GERAD and CIRRELT. Her supervision activities include teaching courses such as Decision Analysis and Sample Efficient Optimization at HEC Montréal. Labs & Teams: She contributes to interdisciplinary teams at GERAD and CIRRELT, focusing on integrating advanced analytics into urban transportation systems.
Can Firtina is a Lecturer at ETH Zurich's Department of Information Technology and Electrical Engineering and a Senior Researcher in the SAFARI Research Group. His research focuses on accelerating genome analysis through algorithm-architecture co-design, particularly leveraging hardware-software integration for bioinformatics workloads. He holds a PhD in Electrical and Computer Engineering from ETH Zurich and degrees from Bilkent University. As of Fall 2025, he will join the University of Maryland, College Park (UMD) as an Assistant Professor of Computer Science. Education: PhD in Electrical and Computer Engineering (D-ITET), ETH Zurich MSc in Computer Engineering, Bilkent University BSc in Computer Engineering, Bilkent University Research Interests: His work bridges bioinformatics and computer architecture, emphasizing real-time, accurate, and energy-efficient genome analysis. Key areas include raw nanopore signal processing (e.g., RawHash, Rawsamble), hardware-software co-design for bioinformatics, and scalable metagenomic analysis. His algorithms address noise mitigation and accelerate applications like assembly polishing (Apollo) and alignment remapping (AirLift). Labs & Collaborations: He leads research within the SAFARI Group, collaborating with institutions like NVIDIA, AMD, and Huawei. His contributions span tools like GenASM (approximate string matching) and BLEND (fuzzy seed matching). He also organizes workshops on bioinformatics acceleration and serves on review boards for venues like ISMB and RECOMB. Future Directions: Future work includes end-to-end raw signal analysis without basecalling, reference-free genome assembly, and leveraging emerging hardware for real-time field applications. He will expand these efforts at UMD, hiring students in Fall 2025.
Felix Xiaozhu Lin serves as Associate Professor and William Wulf Faculty Fellow in the Department of Computer Science at the University of Virginia's School of Engineering and Applied Science, where he directs the Computer Science Ph.D. Program and MCS/MS Program. Previously a tenured Associate Professor at Purdue University's School of Electrical and Computer Engineering, Lin joined UVA Engineering in August 2020 after completing his doctoral research at Rice University. His educational credentials include: Ph.D. in Computer Science, Rice University (2014) M.S. in Computer Science, Tsinghua University (2008) B.S. in Automation, Tsinghua University (2006) Lin's research centers on systems software at the intersection of operating systems, compilers, and computer architecture, with emphasis on accelerating and safeguarding software systems. His current projects target on-device large language models and speech processing for low-cost hardware ( Analysis of his recent publications reveals a strong trajectory in edge computing and efficient AI systems. His research demonstrates increasing focus on hardware-software co-design for autonomous devices, with significant contributions in video analytics for energy-constrained cameras, kernel virtualization for heterogeneous architectures, and stream processing frameworks leveraging emerging memory technologies. The work consistently addresses real-world constraints like power limitations and network intermittency while maintaining rigorous academic standards. His scientific recognition includes: National Science Foundation CAREER Award (2019) Google Faculty Research Award (2016) NSF CISE Research Initiation Initiative Award (2015) ACM ASPLOS Best Paper Award (2014) Lin leads the XSEL research group mentoring graduate and undergraduate students in systems software development. His educational initiatives include CS4414/CS6456, a modern operating systems course featuring Arm64 baremetal kernel development, multicore systems, trusted execution environments, and filesystem forensics. The course's experiential approach has received strong student feedback for its modern content and practical relevance. His group actively recruits for projects spanning on-device AI, hardware-accelerated speech processing, and next-generation OS development. Based in Charlottesville, Virginia, Lin's research benefits from UVA's proximity to Shenandoah National Park and collaborative opportunities within the university's vibrant computing ecosystem, including the 2024 LLM Workshop he co-organized with Professor Yangfeng Ji.
Will Perkins is an Associate Professor in the School of Computer Science at Georgia Institute of Technology. Previously, he held faculty positions at the University of Illinois at Chicago, the University of Birmingham (UK), and was an NSF Postdoc at Georgia Tech. He earned his PhD in 2011 from New York University's Courant Institute under Joel Spencer. His research focuses on algorithms, statistical physics, and discrete mathematics, particularly exploring algorithmic tractability of random computational problems, statistical physics spin models, and combinatorial methods derived from algorithmic intuition. Research Interests : Algorithms, statistical physics, combinatorics, phase transitions, random graphs, and Gibbs measures. His work bridges theoretical computer science and statistical mechanics, addressing questions about sampling, phase coexistence, and algorithmic barriers. Recent Activities : Director of the Algorithms and Randomness Center at Georgia Tech, Managing Editor of Combinatorial Theory , and Associate Editor of Random Structures and Algorithms and SIAM Journal on Discrete Mathematics . Upcoming engagements include the Rocky Mountain Summer Workshop (2024), Park City Mathematics Institute (2024), and conferences on Random Structures and Algorithms (2025). Teaching : Courses include Design and Analysis of Algorithms (CS 3510), Advanced Algorithms (CS 4540), and specialized topics like Statistical Physics in Algorithms and Combinatorics (CS 8803). He has taught across institutions, including at the University of Birmingham and University of Illinois at Chicago. Key Contributions : His work on phase transitions in combinatorial structures, algorithmic sampling in statistical physics models, and rigorous analysis of Gibbs measures has been published in top venues like FOCS, STOC, and Communications in Mathematical Physics. Notable results include hardness of sampling for anti-ferromagnetic Ising models and novel contour methods for Pirogov-Sinai theory.
Sofya Raskhodnikova is a Professor in the Department of Computer Science at Boston University, part of the College of Arts and Sciences. She holds a Ph.D. from MIT and has held positions at Penn State University and postdoctoral fellowships at the Hebrew University of Jerusalem and the Weizmann Institute of Science. Her research focuses on sublinear-time algorithms, data privacy, approximation algorithms, and complexity theory. She is a recipient of the NSF CAREER Award and has contributed significantly to the theoretical foundations of privacy-preserving computation and algorithm design. Education: Ph.D. in Computer Science from MIT (2003), postdoctoral research at Hebrew University of Jerusalem and Weizmann Institute of Science (2003–2006). Visiting positions at UCLA, Harvard University, and the Simons Institute for the Theory of Computing. Research Interests: Sofya’s work bridges theoretical computer science and practical applications, emphasizing algorithms that operate efficiently on large datasets. Key areas include property testing (e.g., monotonicity, sortedness), differential privacy, and sublinear-time algorithms. She explores how algorithms can analyze data while preserving privacy guarantees and minimizing computational resources. Publications: Over 50 peer-reviewed articles in top venues such as STOC, FOCS, and SODA, with recent contributions focusing on dynamic graph algorithms under privacy constraints and robust property testing against adversarial noise. Professional Activities: Editor for ACM Transactions on Computation Theory and Algorithmica ; program committee chair for WOLA 2021 and CSR 2022; active in mentoring initiatives like Sigma Camp and Artemis. Advising & Students: Current advisees include Ephraim Linder and Debanuj Nayak. Notable alumni include Iden Kalemaj (Meta Research) and Nithin Varma (Max Planck Institute). She has supervised over 15 Ph.D. students and postdocs, fostering a collaborative research environment.
