Yves Rosseel is a Professor at Ghent University (UGent) specializing in Structural Equation Modeling (SEM) , Psychometrics , and Statistical Methodology . With over 15 recent publications (2024-2025), he focuses on small-sample SEM solutions, factor score regression, measurement error, and Bayesian extensions. His work bridges Statistics with applications in Psychology , Education , and Neuroimaging . Research Trends Developed Mixture Multigroup SEM for cross-group comparisons Proposed Information-Theoretic Hypergraphs in psychometrics Advanced Two-Stage Estimation for round-robin data Created blavaan R package for Bayesian SEM Investigated Measurement Error in hypothesis testing Scientific Contributions Published 84 Social Sciences papers, 37 Statistics works, and 11 Neuroimaging studies Promoted 8 PhDs including Sara Dhaene and Julie De Jonckere Co-authored 12+ works with Marijke Welvaert and 10+ with Stijn Vanheule
Matthew Jenssen is a Reader in Probability at King's College London and a UKRI Future Leaders Fellow. He holds a BA and MMath from the University of Cambridge (2012–2013) and a PhD from the London School of Economics (supervised by Jozef Skokan and Julia Boettcher). His research focuses on the intersection of combinatorics, statistical physics, and theoretical computer science, particularly on large-scale structure formation in systems with local interactions. Notable contributions include advancements in sphere packing, Ramsey numbers, and random matrix theory. Jenssen has held postdoctoral positions at the University of Oxford and the University of Birmingham before joining King’s in 2023. His research group at King’s explores discrete probability, extremal combinatorics, and algorithms, with applications to statistical physics and high-dimensional geometry. Key achievements include a groundbreaking improvement on sphere packing lower bounds and resolving extremal questions in graph theory. Jenssen’s work often bridges combinatorial theory with computational methods, yielding impactful results in probabilistic combinatorics. Scientific awards include the UKRI Future Leaders Fellowship (2020). His grants include a 2023–2026 project on statistical physics methods in combinatorics and geometry. Jenssen collaborates widely, with notable co-authors including Will Perkins, Jozef Skokan, and Felix Joos. He is actively involved in the Probability Group at King’s and contributes to international conferences and arXiv publications.
Eric TOTEL is a Professor at Telecom SudParis, specializing in cybersecurity and network security. His research focuses on intrusion detection systems, graph-based anomaly detection, machine learning applications in security, and data confidentiality in distributed systems. He has contributed to projects such as DAMS (DDoS mitigation using deep reinforcement learning), Sec2Graph (novelty detection on graph-structured data), and DAEMON (dynamic autoencoder-based anomaly detection). His work emphasizes scalable solutions for multi-step attack detection and privacy-preserving infrastructure for encrypted DNS logs. Key contributions include developing correlation engines for distributed systems, formalizing invariant-based attack detection in web applications, and exploring static analysis for information flow control. He has authored over 50 peer-reviewed publications and served on program committees for conferences like RAID, CRiSIS, and EuroS&P. His HDR (2012) formalized error-detection techniques applied to intrusion detection. Advising and grants: He collaborates on projects funded by French national research agencies and has mentored students in cybersecurity, AI for defense (CAID conferences), and cloud infrastructure security. His research often bridges theoretical models and practical implementations, with tools like STARLORD for 3D graph visualization of security data.
Aviad Rubinstein is an Assistant Professor of Computer Science at Stanford University, specializing in theoretical computer science with a focus on algorithms, complexity, and game theory. He has taught courses such as Design and Analysis of Algorithms (CS161), Incentives in Computer Science (CS269i), and Topics in Intractability (CS354). His research interests include approximation algorithms, computational complexity, and fair division, with notable work on envy-free cake-cutting and prophet inequalities. He advises several PhD students including Joshua Brakensiek and Ruiquan Gao, and mentors postdocs like Soheil Behnezhad. His undergraduate mentoring includes students from Tsinghua and Berkeley. Rubinstein has received the Kalai Prize from the Game Theory Society and a FOCS Best Paper Award for his work on inapproximability of Nash equilibria. Rubinstein co-authored Algorithms for Toddlers with Mary Wootters, a book simplifying computational concepts for younger audiences. He also organizes workshops on topics like fine-grained complexity and early career mentoring in computer science. Beyond academia, he consults part-time for the blockchain startup Lava. His research frequently bridges theoretical foundations with practical implications, such as developing algorithms with real-world applications in auctions, mechanism design, and optimization under constraints.
Lin Cai is a Professor in the Department of Electrical & Computer Engineering at the University of Victoria, Canada. She holds prestigious fellowships including NSERC Steacie, IEEE, CAE, and Royal Society of Canada. Her research focuses on wireless communications, networking, and mobile computing, with emphasis on protocols for multimedia and IoT systems. She has led projects in vehicular networks, UAV-assisted systems, and federated learning for edge intelligence. Dr. Cai has advised over 20 students, many of whom have received awards and prominent roles in academia and industry. She has authored numerous high-impact papers, secured grants from NSERC, CFI, and industry partners, and serves in leadership roles at IEEE and educational institutions. Notable contributions include work on congestion control, network security, and autonomous systems. Education: BEng (Nanjing U. of Sci. & Tech.), MASc/PhD (University of Waterloo) Affiliations: IEEE Vehicular Technology Society Board of Governors, IEEE ComSoc Distinguished Lecturer Awards: 2020 IEEE N2Women 'Star in Networking', RSC Fellow 2024, Best Paper Awards (ICC 2008, WCNC 2011) Research Labs: Connected Autonomous Vehicles (CAV) Lab, AI-driven Networking Group Her work integrates networking, AI, and control theory to address challenges in 6G, IoT, and smart transportation. She actively promotes diversity through initiatives like the 'Riko-chan' STEM manga series.
Nathan Sturtevant is a Professor at the University of Alberta's Department of Computing Science, an Amii Fellow, and Canada CIFAR Chair. His research spans heuristic and combinatorial search problems, with applications in game AI and pathfinding algorithms. He collaborates with the games industry to implement his research in commercial products. Dr. Sturtevant's research explores search algorithms for single and multiple agents, covering areas such as bidirectional search, meta-learning for game theory, procedural content generation, and multi-agent pathfinding. His work integrates machine learning techniques with classical search algorithms to solve complex problems in game environments. Recent publications demonstrate innovations in search optimization, including novel frameworks for suboptimal bidirectional search, new puzzle difficulty metrics, and applications of transformer models to card game planning. His FarmQuest player telemetry dataset provides resources for studying player behavior in farming simulations.
Sagar Samtani is an Associate Professor and Weimer Faculty Fellow at the Kelley School of Business , Indiana University. He serves as Director of the Kelley’s Data Science and Artificial Intelligence Lab (DSAIL) . His research focuses on Artificial Intelligence for Cybersecurity , including cyber threat intelligence, deep learning, and dark web analytics. He holds a PhD from the University of Arizona (2018), and has received prestigious awards such as the Indiana University Outstanding Junior Faculty Award (2023) and IEEE Big Data Security Junior Research Award (2023). Education : PhD in Information Systems, University of Arizona, 2018 MSMIS, University of Arizona, 2014 BSBA, University of Arizona, 2013 Research Interests : Samtani’s work addresses cybersecurity challenges through AI, including proactive threat detection, vulnerability assessment, and healthcare analytics. He emphasizes explainable AI (XAI) for transparency in cybersecurity systems. Grants & Awards : NSF Grant: CyberCorps SFS Program ($2.3M, 2020–2025) NSF Grant: AI4Cyber Research Education ($300K, 2020–2022) Multiple teaching awards, including the Trustees Teaching Award (2023) and recognition as one of Top 50 Undergraduate Professors (2022) Labs & Teams : Leads the DSAIL lab, focusing on AI-driven solutions for business and cybersecurity. Collaborates with NSF-funded initiatives on cyber AI education and threat intelligence.
Alberto Santini is an Associate Professor of Operational Research and a Ramon y Cajal fellow at Universitat Pompeu Fabra in Barcelona, Spain. He is also an affiliate professor at the Barcelona Graduate School of Mathematics and the Data Science Centre at the Barcelona School of Economics. During 2025-2027, he coordinates the Transportation group of the Spanish O.R. Society. His research focuses on optimization methods applied to transportation, logistics, and sustainability, including scheduling, vehicle routing, and heuristic algorithms. He has contributed to solving complex problems like last-mile delivery integration with public transport, airline flight scheduling, and energy-efficient vertical farming. His work often employs advanced techniques like column generation and decomposition strategies. Notable contributions include decomposition strategies for vehicle routing heuristics and the application of metaheuristics such as Adaptive Large Neighbourhood Search (ALNS). He is the founder of EUROYoung and AIROYoung, youth branches within prominent operational research societies. His GitHub repositories, such as cvrp-decomposition , provide open-source implementations of his algorithms. Santini’s research addresses real-world challenges like epidemic resource allocation and sustainable logistics, reflecting his commitment to both theoretical and applied operational research. Awards: Ramon y Cajal Fellow Labs/Teams: Leads Transportation group (Spanish O.R. Society), Founded EUROYoung/AIROYoung.
Lenwood S. Heath is a Professor in the Department of Computer Science at Virginia Tech's College of Engineering. He holds a Ph.D. in Computer Science from the University of North Carolina at Chapel Hill (1985), an M.S. in Mathematics from the University of Chicago (1976), and a B.S. in Mathematics from the University of North Carolina at Chapel Hill (1975). Before joining Virginia Tech in 1987, he was an Instructor of Applied Mathematics and member of the Laboratory of Computer Science at MIT. His research focuses on algorithms, theoretical computer science, computational biology, bioinformatics, computational genomics, complex networks, and computational epidemiology. He is a lifetime member of SIAM and a senior member of the IEEE. Heath is retiring in 2025 and currently does not accept new graduate students. His work spans computational methods for analyzing genomic data, including taxonomic classification, pathogen detection, and evolutionary genomics. Notable contributions include frameworks for genome-based taxonomy (e.g., LINgroups), metagenomic pipelines for antibiotic resistance genes (ARGem), and epidemic modeling using social contact networks. His publications address challenges in plant pathology, viral evolution (e.g., SARS-CoV-2 variants), and computational tools for microbial identification. Key research areas include alignment-free sequence analysis, genomic island detection, and phylogenetic reconstruction. He has developed tools like genomeRxiv for microbial genome databases and PEAK for gene regulatory network inference. His work emphasizes interdisciplinary applications of computational methods to biological and epidemiological problems.
Shuangping Li is an Assistant Professor in the Department of Statistics and Data Science at Yale University. She was previously a Stein Fellow in the Department of Statistics at Stanford University (2022–2025). Her research lies at the intersection of probability theory, high-dimensional statistics, theoretical machine learning, and the theory of algorithms. Ph.D. in Applied and Computational Mathematics, Princeton University (2022) B.Sc. in Mathematics, University of Hong Kong Her research interests include probability theory , high-dimensional statistics , theoretical machine learning , and theory of algorithms . She investigates foundational aspects of random constraint satisfaction problems, neural networks, spectral methods, and phase transitions in high-dimensional models. Her work often draws from statistical physics and combinatorics to explain algorithmic behavior. The recent articles highlight a strong focus on binary perceptrons , clustering in network models , and algorithmic phase transitions . Keywords across publications include probability, theoretical computer science, machine learning, and statistical inference. Subfields reveal deep engagement with spin glass theory, discrepancy minimization, spectral embedding, and information-computation gaps. Scientific awards include: Stein Fellow, Department of Statistics, Stanford University (2022–2025) She has advised and taught at both Stanford and Yale, including courses such as Advanced Probability , Theory of Probability , and Stochastic Processes . She has organized seminars at Stanford and has delivered invited talks at institutions including Cornell, Duke, UC Berkeley, and Princeton. Her collaborative research involves prominent scholars such as Allan Sly, Emmanuel Abbe, and Tselil Schramm. There is no mention of external grants, but her postdoctoral fellowship suggests research funding support. She is involved in academic service through organizing the Stanford Statistics and Probability Seminars. She maintains an active research presence with publications in top venues like STOC, FOCS, COLT, ICLR, and journals such as Annals of Probability and Annals of Statistics .
Zhe Hou is a Senior Lecturer at the School of Information and Communication Technology , Griffith University, Australia. His academic journey includes a PhD in automated reasoning for separation logic from the Australian National University (2015) and prior research roles at Nanyang Technological University, Singapore (2015-2017). He joined Griffith University in 2017 and became permanent faculty in late 2019. Research Interests : Formal methods for software verification Automated reasoning with logical frameworks Blockchain technology and security Quantum computing verification Integration of LLMs with rigorous reasoning Sports analytics via model checking Recent Publications demonstrate expertise in neural-symbolic reasoning, blockchain security, quantum SAT solvers, and runtime verification frameworks. His work combines formal logic with machine learning for applications in cybersecurity and AI trustworthiness. Scientific Awards : ACM SIGSOFT Distinguished Paper Award (2025) Supervision Roles : Principal/Associate Supervisor for 6+ doctoral projects in blockchain security, AI verification, and network security. Professional Activities : Editor for Springer-Nature and Formal Aspects of Computing special issues, conference chair for ICFEM, ICECCS, and ISACE symposia.
Anna R. Karlin is a Professor and the Bill & Melinda Gates Chair in Computer Science & Engineering at the University of Washington's Paul G. Allen School of Computer Science & Engineering. She serves as Associate Director of Graduate Studies and leads research in theoretical computer science within the Theory & Models of Computation focus area. Ph.D. from Stanford University (1987) Former researcher at Digital Equipment Corporation's Systems Research Center (5 years) Professor Karlin's research centers on theoretical computer science, with specific expertise in algorithm design and analysis, particularly probabilistic and online algorithms. Her work spans multiple interdisciplinary domains including algorithmic game theory, economics and computation, data mining, operating systems, networks, and distributed systems. Her research has evolved from foundational algorithmic work to impactful applications in market design, auction theory, and pricing mechanisms. Karlin's publication record demonstrates a consistent trajectory from classical theoretical computer science toward algorithmic game theory and mechanism design. Her recent work focuses on approximation algorithms for NP-hard problems, auction design, revenue maximization, and stable matching problems, with applications in online advertising, network economics, and resource allocation. She has developed influential algorithms for the Traveling Salesman Problem and made significant contributions to understanding interdependent valuations in combinatorial auctions. Bill & Melinda Gates Chair in Computer Science & Engineering Professor Karlin has advised numerous doctoral students throughout her career, with former students including prominent researchers like Jason Hartline, Frank McSherry, and Kira Goldner. Her collaborative research has been supported by various grants, including NSF funding (CCF-1813135 mentioned in her publications). She co-authored the influential textbook Game Theory, Alive with Yuval Peres, which serves as a rigorous introduction to game theory with applications across multiple disciplines. As a leader in theoretical computer science, Professor Karlin maintains active involvement in the Theory of Computation research group at the Allen School, fostering collaboration between theoretical foundations and practical applications in computer science.
Lieven Vandenberghe is a Professor in the Electrical and Computer Engineering Department and Department of Mathematics at the University of California, Los Angeles (UCLA). His research focuses on convex optimization, semidefinite programming, and applications in signal processing, system identification, and control theory. Books: Co-author of Convex Optimization (2004) and Introduction to Applied Linear Algebra (2018) Courses: Teaches graduate-level courses in linear programming, convex optimization, and numerical computing (ECE236A/B/C, ECE133A/B) Software: Developer of CVXOPT, CHOMPACK, and SMCP for optimization algorithms His research group has produced significant work in sparse matrix computations, operator splitting methods, and applications to machine learning and control systems. Publications span topics like Bregman splitting, proximal gradient methods, and semidefinite programming for signal processing. His advisees include PhD students in optimization and postdoctoral researchers in applied mathematics.
Fabrizio Riguzzi is a Full Professor at the Department of Mathematics and Computer Science of the University of Ferrara, Italy. His academic career spans over two decades at the same institution, having served as Associate Professor (2014-2020) and Assistant Professor/Ricercatore (1999-2014). He is an active researcher in the fields of Logic Programming and Statistical Relational Artificial Intelligence with numerous publications and leadership roles in international conferences. His educational background includes: PhD in Electronic and Computer Engineering from the University of Bologna (1999) Laurea in Computer Engineering from the University of Bologna (1995) Riguzzi's research focuses on probabilistic approaches to artificial intelligence, particularly probabilistic logic programming and statistical relational AI. His work bridges symbolic reasoning with probabilistic methods, developing frameworks for uncertain knowledge representation and reasoning. He has made significant contributions to probabilistic answer set programming, neuro-symbolic integration, and applications in areas like network intrusion detection and knowledge graph completion. His research demonstrates how logical formalisms can be enhanced with probabilistic reasoning to tackle real-world problems with uncertainty. An analysis of his recent publications reveals a strong trend toward integrating neural and symbolic approaches in AI, with significant work on probabilistic answer set programming frameworks. His research spans theoretical foundations of probabilistic logic programming, practical implementations, and applications in cybersecurity, knowledge graphs, and decision-making under uncertainty. The interdisciplinary nature of his work connects computer science theory with practical AI applications. His notable awards include: Alain Colmerauer 10-Year Test-of-Time Award at ICLP 2021 Best Paper Award for "BUNDLE: A Reasoner for Probabilistic Ontologies" at RR-2013 Highly Commended Paper Award for "Probabilistic declarative process mining" at KSEM 2010 Riguzzi has supervised several PhD students to completion, including Elena Bellodi, Riccardo Zese, and Giuseppe Cota, who have gone on to win prestigious awards for their theses. He has served in numerous editorial roles, including Associate Editor of the Journal of Artificial Intelligence Research and Editor in Chief of Intelligenza Artificiale. His leadership extends to organizing major conferences like ILP 2018 and serving on program committees for top AI venues including IJCAI, AAAI, and ECAI. He is a member of the ML@unife research group and has developed several online systems including cplint, TRILL, and an Online AUC calculator. His work has fostered collaborations across the AI research community, particularly in the areas of probabilistic logic programming and neuro-symbolic AI.
James B. Orlin is the E. Pennell Brooks (1917) Professor in Management and a Professor of Operations Research at the MIT Sloan School of Management. He specializes in network and combinatorial optimization with applications spanning transportation, computer science, operations, and marketing. BA in Mathematics, University of Pennsylvania MA in Mathematics, California Institute of Technology MMath, University of Waterloo PhD in Operations Research, Stanford University His research focuses on designing efficient algorithms for network optimization problems, including shortest path, max flow, and min cost flow. He has contributed to algorithmic theory in logistics, telecommunications, and inventory management, with work on stochastic demand models and data-driven inventory policies. Recent publications include advancements in directed shortest path algorithms, robust submodular function maximization, and energy storage problem complexity. His seminal textbook Network Flows: Theory, Algorithms, and Applications (1993) remains a foundational reference. Leonard G. Abraham Prize Khachiyan Prize Test of Time Award As a mentor, he has advised numerous researchers through collaborative publications and teaching. His work addresses both theoretical algorithm development and practical implementation across diverse domains including airline scheduling, logistics, and network design.
