Florian Kerschbaum is a Professor and NSERC/RBC Industrial Research Chair in Data Security at the Cheriton School of Computer Science, University of Waterloo. His research focuses on data security and privacy, applied cryptography, and confidentiality in data science. Research interests span data collection/preparation management, secure multi-party computation, homomorphic encryption, differential privacy, and machine learning robustness/privacy. His work develops cryptographic solutions for practical data management challenges in distributed systems.
Amit Kumar is the Jaswinder and Tarwinder Chadha Chair Professor in the Department of Computer Science and Engineering at IIT Delhi. His research focuses on combinatorial optimization, online algorithms, and algorithmic fairness. He has taught courses such as Approximation Algorithms (COL 754), Design and Analysis of Algorithms (COL 351), and Numerical Analysis (COL 726). His work spans theoretical computer science with applications to clustering, scheduling, and fairness in evaluation processes. Research Interests Kumar's research emphasizes developing efficient algorithms for online and dynamic settings, particularly in constrained optimization and biased evaluation systems. He explores theoretical foundations of clustering, load balancing, and resource allocation, with recent contributions to fair food delivery systems and coreset constructions. Publications His recent work includes advancements in online convex paging (STOC 2025), consensus clustering (SODA 2025), and fairness-aware algorithms (AAAI 2024). Over 70 papers across top venues like STOC, SODA, and ICML reflect his expertise in algorithm design and analysis. Awards Best Paper Award at ISAAC 2023 for 'Clustering What Matters in Constrained Settings' Teaching & Mentorship Kumar instructs graduate and undergraduate courses in algorithms, data structures, and numerical methods. He advises students through these courses and collaborates with researchers on NSF-funded projects related to approximation algorithms and streaming systems.
Sainyam Galhotra is an Assistant Professor in the Department of Computer Science at Cornell University. His research focuses on developing data science tools for trustworthy analytics, integrating causal inference, data management, and machine learning to enhance robustness, explainability, and fairness in algorithmic systems. PhD: University of Massachusetts Amherst (2020), advised by Barna Saha B.Tech: Indian Institute of Technology Delhi (2014), advised by Amitabha Bagchi Postdoctoral Research: University of Chicago (Computing Innovation Fellow) His work spans artificial intelligence, causal inference, and responsible data science, emphasizing ethical algorithm design and reliable data integration. Recent publications highlight advancements in fair clustering, causal feature selection, and entity resolution frameworks. His research trends from 2023–2024 include contributions to spatio-temporal data correlation, community detection in geometric graphs, and distribution-aware dataset search. Key themes are fairness in machine learning, causal modeling, and scalable data management solutions. Computing Innovation Fellowship (2021) DAAD AInet Fellow (2021) ACM SIGMOD Entity Resolution Programming Contest Finalist (2021) Krithi Ramamritham Computer Science Scholarship (2019) BEST Paper Award in SIGSOFT FSE 2017 He actively seeks PhD or Master’s students interested in data science and trustworthy AI. Contact via email: sg@cs.cornell.edu .
Ali Vakilian is a Research Assistant Professor at the Toyota Technological Institute at Chicago (TTIC), with a strong academic background in theoretical computer science and algorithms. He will join the Department of Computer Science at Virginia Tech as an Assistant Professor in Fall 2025. His research bridges algorithmic theory and machine learning, focusing on scalable, fair, and efficient algorithms for massive data. Education: Ph.D. in EECS, Massachusetts Institute of Technology (MIT), advisors: Erik Demaine and Piotr Indyk M.S. in Computer Science, University of Illinois at Urbana-Champaign (UIUC), advisor: Chandra Chekuri B.S. in Computer Engineering, Sharif University of Technology Research Interests: Ali Vakilian's work centers on the algorithmic foundations of machine learning and data science. He develops streaming, sketching, and sublinear-time algorithms for massive datasets, and pioneers learning-augmented algorithms that use machine learning predictions to improve performance while maintaining worst-case guarantees. His research in trustworthy ML includes algorithmic fairness, fair clustering, and learning with strategic agents. He also contributes to combinatorial optimization and approximation algorithms for network design, set cover, and low-rank approximation. His recent publications (2023–2025) show a consistent focus on fair clustering (individual and group fairness), streaming graph algorithms , learning-augmented methods , and frequency estimation . These works appear in top venues such as NeurIPS, ICML, SODA, and ICALP, often with recognitions like oral or spotlight presentations. Scientific Awards: Outstanding Student Paper Highlight Award, AISTATS 2024 Notable-top-25% paper, ICLR 2023 Oral presentation, AISTATS 2024 Spotlight presentation, NeurIPS 2023 Advising and Grants: Ali Vakilian mentors several students and interns, including summer interns at TTIC and Fatima Fellows. His research is supported by the National Science Foundation (TRIPODS program), as noted in the press coverage of his work on LearnedSketch. He actively contributes to the academic community through advising, organizing workshops (e.g., Algorithms with Predictions, Learning-Augmented Algorithms), and serving on program committees (e.g., NeurIPS, ICML, AISTATS). Labs and Teams: He is affiliated with the theory and algorithms group at TTIC and collaborates with researchers at MIT, UIUC, and other institutions. His work on learning-augmented algorithms has led to influential workshops and collaborations with leading figures such as Piotr Indyk and Erik Demaine.
Aram Harrow is a Professor of Physics at the Massachusetts Institute of Technology (MIT) , affiliated with the MIT Center for Theoretical Physics and MIT Center for Quantum Engineering . He focuses on quantum information science and quantum algorithms , with additional interests in representation theory and optimization . His recent work explores quantum computing applications in chemical physics and statistical mechanics . Undergraduate and graduate degrees in Physics at MIT Faculty positions: MIT (2013-present), University of Washington (2010-12), University of Bristol (2005-10) Research Interests: His work bridges quantum information theory and many-body physics , including: Quantum algorithm design for chemistry and optimization Quantum circuit complexity and t-designs Entanglement dynamics in quantum systems Quantum-classical hybrid computing models Key Publications: Recent articles demonstrate quantum speedups for biomolecular free energy calculations , Hamiltonian simulation , and jet clustering algorithms . His research combines quantum complexity theory with practical implementations on near-term quantum devices. Scientific Awards: 2023 Simons Investigator 2018 APS Bennett Award 2017 IEEE Best Paper Award 2016 Kavli Frontiers Fellow Mentorship: He advises current PhD students Shankar Balasubramanian , Angus Lowe , and Norah Tan , with 12 former advisees including Anand Natarajan and Saeed Mehraban . His 2026 recruitment seeks one new graduate student.
Dr. Primoz Skraba is a Professor in Applied and Computational Topology at the School of Mathematical Sciences, Queen Mary University of London. As Deputy Head of the Centre for Probability, Statistics and Data Science, he bridges theoretical topology with practical applications in data analysis, machine learning, and optimization. Education : PhD in Electrical Engineering from Stanford University (2009) Prior Roles : Positions at INRIA, France; Jozef Stefan Institute, Slovenia; University of Primorska; University of Nova Gorica His research focuses on applying topological methods to analyze complex data. Key areas include: Stability of persistence diagrams for quantitative control in finite sampling Variants of persistence (zig-zag, robustness, multiparameter) Algorithmic Complexity in computational topology Stochastic Topology for random geometric models (Poisson, Boolean) Recent publications emphasize persistent homology in random geometric complexes, universality theorems, and integrating topological methods into machine learning. He received grants from the Leverhulme Trust, EPSRC, and Alan Turing Institute for projects on topological universality and AI foundations. His advisee Gabryel Mason-Williams explores wireless sensor network applications of homology.
Dr. Konstantin (Kostia) M. Zuev serves as Teaching Professor in the Computing + Mathematical Sciences Department at California Institute of Technology , where he has made significant contributions to network science and computational statistics since 2016. His dual PhDs in Mathematics (Moscow State University, 2008) and Civil Engineering (HKUST, 2009) underpin his interdisciplinary research spanning differential geometry, stochastic simulation, and network dynamics. Education PhD in Mathematics, Lomonosov Moscow State University (2008) PhD in Civil Engineering, Hong Kong University of Science & Technology (2009) His research focuses on network science , particularly course-prerequisite networks and complex financial systems , with recent work extending to network navigability in cosmological models and rare event simulation. Over his career, he has developed innovative Bayesian inference methods and geometric preferential attachment theories while maintaining active collaborations across mathematics, physics, and biomedical domains. Recent publications highlight network analysis in education ( 2023 ), hyperbolic graph theory ( 2024 ), and pandemic-informed cancer mortality studies ( 2023 ). His 15 most recent articles demonstrate methodological innovations across disciplines including statistics, physics, finance, and cosmology. Scientific recognition includes Humboldt Research Fellowship (2021) Carver Mead Seed Fund Grant (2023) ASCIT Teaching Award (2018, 2023) Northrop Grumman Teaching Excellence Prize (2019) As Graduate Option Representative for Information and Data Sciences at Caltech and faculty advisor for multiple student organizations including the Caltech Karate Club and Caltech Chess Club , he actively bridges academic rigor with community engagement through outreach initiatives like the virtual math education channel and university math circles for K-12 students.
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.
Alessandra Meddis serves as an Assistant Professor in the Section of Biostatistics within the Department of Public Health at the University of Copenhagen's Faculty of Health and Medical Sciences. Her academic work centers on developing and applying advanced statistical methodologies for longitudinal and time-to-event data analysis, with significant contributions to public health research in Denmark and internationally. Her institutional affiliation is clearly established through university contact details and departmental listings. Her primary research interests include correlated survival data analysis, competing risk modeling, informative cluster size methodology, causal inference techniques for observational studies, and environmental epidemiology applications. Dr. Meddis has developed specialized expertise in handling complex survival data structures while maintaining focus on real-world public health problems, particularly in HIV comorbidity patterns, environmental exposure effects, and pandemic-related mortality analyses. Her methodological innovations directly address challenges in clustered and censored data common across medical research domains. Analysis of Dr. Meddis's recent publication record reveals a consistent trajectory of high-impact interdisciplinary research spanning clinical medicine, epidemiology, and statistical methodology. Her work appears in leading journals across biostatistics, infectious diseases, and public health, demonstrating strong collaborative networks with clinical researchers and epidemiologists. Key thematic areas include HIV treatment outcomes, environmental health exposures, and critical care applications during the pandemic, with recent methodological papers advancing survival analysis techniques for complex data structures. Scientific Awards: No scientific awards were specified in the available institutional profile. Advising and Grants: The institutional profile does not provide details regarding graduate student supervision or specific research grant funding. Her collaborative publications suggest involvement in multi-investigator projects including the COCOMO HIV cohort study and pandemic-related research initiatives. Labs and Teams: Dr. Meddis is affiliated with the Section of Biostatistics within the Department of Public Health, though specific laboratory facilities or dedicated research teams are not described in the source material. Her extensive co-authorship patterns indicate active participation in multiple research consortia across medical specialties.
Peter Aronow is a Professor at Yale School of Public Health , with appointments in the Department of Statistics and Data Science , Economics Department , and the Institute for Social and Policy Studies . His interdisciplinary work bridges political science, biostatistics, and epidemiology. Professor of Public Health (Biostatistics) Secondary appointments in Political Science and Economics Associate Professor in the Institute for Social and Policy Studies Dr. Aronow specializes in causal inference and statistical methodology, particularly in non-traditional field research contexts. His research encompasses: Design-based approaches to causal inference Complex experimental designs Social network analysis Survey methodology with incomplete data His recent publications focus on spatial experiments under unknown interference, bias correction in RCTs, and temporal validity challenges. While no formal awards are listed, his work is cited across disciplines including: Political Analysis Econometrics Biostatistical Modeling Observational Study Design
Linyi Li is an Assistant Professor in the School of Computing Science at Simon Fraser University (SFU), leading the Trustworthy Artificial Intelligence (TAI) Lab. His research focuses on certifiably trustworthy deep learning systems, combining machine learning and computer security. He holds a PhD from the University of Illinois Urbana-Champaign (UIUC) and a B.Eng. from Tsinghua University. Affiliations: Simon Fraser University, TAI Lab Education: PhD in Computer Science, UIUC, 2023 B.Eng (Cum Laude), Tsinghua University, 2018 His research interests include deep learning , trustworthy machine learning , large language models , and software engineering . He emphasizes rigorous certification of robustness, fairness, and numerical reliability in AI systems. Recent work includes the InfiBench benchmark for evaluating code LLMs and advancements in neural network verification. Recent Research Trends: His publications span certified robustness, fairness guarantees, and scalable verification techniques for deep learning models. He also explores scientific evaluation of foundation models and adversarial defense mechanisms. Awards: Rising Stars in Data Science AdvML Rising Star Award Wing Kai Cheng Fellowship Finalist: Qualcomm Innovation Fellowship (2022) Winner: VNN-COMP'23 Competition (Team α, β-CROWN) Advising & Grants: As a PI, he oversees the TAI Lab's research. Though no specific grants are listed, his work is funded through competitive awards and university resources. Labs/Teams: Leads the TAI Lab at SFU, focusing on foundational and applied research in trustworthy AI.
Harri Lähdesmäki is an Associate Professor (tenured) at the Department of Computer Science, Aalto University, where he leads the Computational Systems Biology research group. His work focuses on probabilistic machine learning and deep generative models with applications in biomedicine and molecular biology. Key Research Interests: Probabilistic machine learning, deep generative models, computational biology, bioinformatics, longitudinal data modeling Contact: harri.lahdesmaki@aalto.fi | Konemiehentie 2, 02150 Espoo, Finland His recent publications highlight advancements in: Gaussian process priors for scalable deep generative models Single-cell analysis of immune repertoires in leukemia and diabetes Probabilistic deconvolution methods for RNA-seq data Epigenetic analysis using hidden Markov and mixed models Transformer-based survival prediction and missing data handling Harri’s work integrates mechanistic modeling with Bayesian inference, particularly applied to immunology, cancer biology, and early disease prediction.
Clark Olson is a Professor in the Division of Computing & Software Systems at the University of Washington Bothell, part of the School of Science, Technology, Engineering & Mathematics. He earned his Ph.D. in Computer Science from UC Berkeley (1994), M.S. in Electrical Engineering (1990), and B.S. in Computer Engineering (1989) from the University of Washington, Seattle. Education: Ph.D. in Computer Science (2017) from University of California, Berkeley M.S. in Electrical Engineering (1990) from University of Washington, Seattle B.S. in Computer Engineering (1989) from University of Washington, Seattle His research focuses on computer vision, robot navigation, and clustering algorithms. He has developed techniques for Mars rover terrain mapping, subspace clustering, and geometric feature matching. His work bridges theory and application in autonomous systems and image analysis. Analysis of his publications reveals expertise in computer vision (8 papers), clustering algorithms (4 papers), and robotics (5 papers). Key subtopics include Mars exploration (3 papers), Hough transforms (3 papers), and probabilistic methods (3 papers). Professor Olson teaches courses ranging from introductory programming (CSS 161-162) to advanced topics in computer vision (CSS 487-587) and algorithm design (CSS 549). He also advises on the CSSE Capstone (CSS 497) projects requiring rigorous prerequisites and structured evaluation criteria.
Marco Castronovo serves as an Assistant Professor in the Mathematics Department at Columbia University, with his office located in Mathematics Hall 614. His academic work bridges continuous and discrete mathematical structures through the lens of symplectic geometry and topology. His research focuses on Symplectic Topology , particularly exploring symplectic structures as frameworks for quantization of classical invariants. Key interests include: Developing open-string versions of Schubert calculus Investigating cluster structures in positroid varieties Constructing Landau-Ginzburg models for Grassmannians Studying Lagrangian cobordisms and exotic tori Analyzing connections between Dubrovin spectra and Fukaya algebras His recent publications reveal a consistent trajectory toward unifying symplectic geometry with combinatorial algebraic structures, particularly through Grassmannian varieties and their mirror symmetric counterparts. The work demonstrates increasing sophistication in connecting Fukaya categories with cluster algebraic frameworks, while maintaining strong ties to quantum topological invariants. As an academic mentor, Castronovo supervises undergraduate researchers including B. Basson (Barnard Summer Research Institute) and S. Kesavan (Columbia Summer Research Fellowship). He actively contributes to the mathematical community through refereeing and co-organizing the Columbia SGGTC Seminar, demonstrating commitment to both research dissemination and academic service. His computational work manifests through three significant open-source projects: Posetroids for exploring Zariski closure orders in Grassmannians, DubrovinDynamics for visualizing spectral evolution in truncated Dubrovin operators, and ClusterExplorer for conducting random walks on cluster structures of Grassmannians. These tools have become valuable resources for researchers working at the intersection of symplectic geometry and combinatorics.
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.
