Professor Jennifer Whitty is an applied health economist at the University of East Anglia , affiliated with the Norwich Medical School and the Centre of Research Excellence in Telehealth . Her research bridges health economics, patient preferences, and health policy, with a focus on quality of life valuation and economic evaluation. Education: Doctor of Philosophy (Griffith University, 2008), Graduate Diploma in Clinical Pharmacy (University of Queensland, 2002), Bachelor of Pharmacy (University of Wales, 1992) Her work emphasizes person-centered methodologies , particularly discrete choice experiments, to evaluate patient and public preferences for healthcare delivery and outcomes. Key research areas include: Treatment burden and quality of life in chronic diseases like cystic fibrosis Economic evaluation of pharmaceuticals and health technologies Asset-based approaches to community health Priority-setting frameworks in health policy Prof. Whitty has secured over AU$27 million in research funding from organizations including the NHMRC and National Institute for Health and Care Research , and serves on editorial boards for Medical Decision Making and Applied Health Economics and Health Policy .
Mohsen Ghaffari is an Associate Professor at MIT's Department of Electrical Engineering and Computer Science (EECS), holding the Steven and Renee Finn Chair. His research focuses on theoretical computer science, particularly distributed and parallel algorithms, graph theory, and network optimization. Formerly, he was a tenured CS faculty member at ETH Zurich until 2022. PhD in Computer Science from MIT (2016) His research interests include distributed algorithms, parallel computing, graph decomposition, and network congestion management. His recent work addresses coreness decomposition, spanner construction, and Euclidean k-center optimization in massive parallel computation frameworks. Notable scientific awards include the ACM Doctoral Dissertation Award (Honorable Mention), ACM-EATCS Doctoral Dissertation Award, and multiple best paper awards at FOCS, PODC, and SODA. He has advised numerous PhD and Master's students, many of whom have transitioned to academic and industry roles. He has taught courses at MIT and ETH Zurich on distributed algorithms, advanced algorithms, and massively parallel computation. His professional activities include serving on program committees for SODA, FOCS, STOC, and organizing workshops like Highlights of Algorithms (HALG) and Workshop on Local Algorithms (WOLA).
Jan Dreier is a Research Fellow at the Institute of Logic and Computation at Vienna University of Technology. His research centers on structural graph theory and algorithmic meta-theorems, particularly exploring the boundaries of tractability for model checking problems. Dreier's work bridges theoretical computer science and discrete mathematics, focusing on graph decompositions, parameterized complexity, and logical expressiveness. Key research themes include monadic stability in graph classes, applications of model theory to computer science, and efficient algorithms for logical queries on structured graphs. His publication record shows consistent focus on graph sparsity concepts and algorithmic applications of logic, with recent work expanding into approximation methods for counting queries. Research demonstrates sophisticated applications of combinatorial methods to fundamental problems in computational complexity.
Alexandra Boldyreva is a Professor at the Georgia Institute of Technology, holding joint appointments in the School of Cybersecurity and Privacy and the School of Computer Science. She serves as Associate Chair for Graduate Studies in the School of Cybersecurity and Privacy and coordinates the Information Security Master’s program in the College of Computing. Her affiliations include the Institute for Information Security & Privacy (IISP), the Algorithms, Combinatorics and Optimization (ACO) program, and the Algorithms and Randomness Center (ARC). She earned her Ph.D. in Computer Science from the University of California, San Diego, and holds bachelor’s and master’s degrees in applied mathematics from St. Petersburg State Technical University, Russia. Her research focuses on cryptography and information security, with notable contributions to encryption methods, authentication protocols, and privacy-preserving systems. Boldyreva’s work emphasizes provable security analysis of protocols like FIDO2 and TLS 1.3, as well as searchable encryption and data privacy techniques. Her recent studies include secure communication channel establishment, leakage quantification in encryption systems, and applications of fuzzy search in encrypted databases. She has received Test of Time Awards for foundational contributions to cryptography. Boldyreva leads initiatives in cybersecurity education and has secured grants for research in secure communication protocols and human-computing approaches to key exchange. Her interdisciplinary collaborations span computer science, mathematics, and privacy engineering.
Professor Imre Leader is a distinguished mathematician at the University of Cambridge, where he serves as Professor of Pure Mathematics in the Department of Pure Mathematics and Mathematical Statistics (DPMMS), which is part of the Faculty of Mathematics. His office is located in room C2.02 at the DPMMS building. Professor Leader's research primarily focuses on Extremal Combinatorics and Ramsey Theory , two fundamental areas of discrete mathematics. His work explores deep connections between combinatorial structures, set theory, and algebraic properties. He has made significant contributions to understanding partition regularity, monochromatic structures, extremal set theory, and combinatorial geometry. His research often bridges the gap between pure combinatorics and applications in computer science and theoretical mathematics. Over his prolific career, Professor Leader has published numerous influential papers in top mathematical journals, collaborating with leading mathematicians worldwide. His work spans various aspects of combinatorics including hypergraph theory, geometric combinatorics, additive number theory, and combinatorial game theory. He has been particularly active in advancing our understanding of Ramsey-type phenomena in infinite structures and developing new techniques in extremal combinatorics. Research Group: Combinatorics Email: I.Leader@dpmms.cam.ac.uk Telephone: 01223 765902 Personal homepage: https://www.dpmms.cam.ac.uk/~ibl10
Kuldeep S. Meel is the Stephen Fleming Early-Career Associate Professor at the School of Computer Science, Georgia Institute of Technology, and an Associate Professor at the University of Toronto (on leave). He previously held a NUS Presidential Young Professorship at the National University of Singapore. His research focuses on automated reasoning, aiming to enable computing systems to handle uncertain real-world environments through scalable techniques integrating randomized algorithms, statistical inference, formal methods, distribution testing, and software engineering. Core research areas: Automated Reasoning, Formal Methods, Approximate Model Counting, Probabilistic Inference, Constraint Solving His research group has achieved significant recognition in both individual awards and publications. Key trends in his recent work include advancing model counting algorithms, developing frameworks for probabilistic explanations, and improving scalability in formal verification and constraint satisfaction. His tools have consistently ranked top in international competitions, demonstrating practical impact in automated reasoning. 2019 NRF Fellowship for AI 2022 ACP Early Career Researcher Award 2020 IEEE Intelligent Systems AI's 10 to Watch Top placements in Model Counting, SAT, and CAV competitions He mentors a diverse group of PhD and Master's students and collaborates with institutions worldwide. His group's publications span premier conferences in AI, formal methods, and design automation, reflecting interdisciplinary contributions to theoretical and applied computer science.
David Bindel is an Associate Professor in the Department of Mathematics at Cornell University, affiliated with the College of Arts and Sciences, College of Engineering, and Cornell Ann S. Bowers College of Computing and Information Science. He earned his Ph.D. in Mathematics from the University of California, Berkeley in 2006. His research focuses on applied numerical linear algebra, eigenvalue problems, and their applications in plasma physics, network analysis, and nonlinear systems. He develops methods for analyzing complex systems, including magnetic confinement in stellarators, stability of MHD systems, and community detection in networks. His work bridges theoretical foundations with practical computational tools, such as formal verification of linear algebra algorithms and scalable Gaussian process models. Bindel’s research explores the interplay between structure and computation, leveraging eigenvalue analysis to address challenges in computer vision, opinion dynamics, and engineering design. He has contributed to advancements in numerical methods for large-scale systems, including iterative solvers, spectral approximation techniques, and stochastic optimization. His interdisciplinary approach spans applied mathematics, computer science, and physics, with applications in fusion energy, machine learning, and network science. Recent work highlights include high-order expansions for magnetic confinement, adaptive filtering for dynamical systems, and Bayesian optimization strategies. His publications emphasize rigorous analysis alongside computational scalability, addressing both theoretical and practical aspects of modern scientific computing. Despite no explicitly listed awards, his contributions reflect significant impact in his fields.
Illya V. Hicks is a Professor in the Computational and Applied Mathematics Department at Rice University. He holds a PhD from Rice University (2000) and a BS from Texas State University (1995). His research focuses on combinatorial optimization, integer programming, graph theory, and matroid theory, with applications in social networks, cancer treatment, and network design. He has advised numerous doctoral, post-doctoral, and masters students. Education: PhD and MA in Computational and Applied Mathematics, Rice University, 2000 BS in Mathematics, Texas State University, 1995 Research Interests: Utilizing graph decomposition techniques to solve NP-complete problems, including branch decompositions and matroid circuit problems. Applications include sensor network design, healthcare logistics, and algorithmic graph theory. Awards: Recognized with the 2015 Presidential Mentoring Award (Rice University), 2010 Forum Moving Spirit Award (INFORMS), and the 2005 Optimization Prize for Young Researchers. Grants and Projects: Includes NSF-funded research on branch decomposition techniques, submodular optimization, and healthcare service distribution. Active in promoting minority participation in operations research through travel grants and mentoring initiatives. Labs/Teams: Engaged in collaborative research on graph algorithms, combinatorial optimization, and interdisciplinary applications in healthcare and engineering.
Emma Brunskill is an Associate Professor of Computer Science at Stanford University, with a courtesy appointment in Education. She holds a PhD in Computer Science from MIT (2009). Her research focuses on reinforcement learning, educational technology, and healthcare applications, aiming to develop AI systems that support human learning and decision-making. Notable projects include AI tutoring systems, policy evaluation methods, and behavior change interventions using large language models. Her work bridges theory and practice, addressing challenges in off-policy evaluation, fairness-aware decision making, and scalable educational tools. Brunskill has contributed to foundational research in reinforcement learning algorithms and their applications in real-world scenarios such as healthcare, education, and human-AI collaboration. She also leads initiatives to improve equity and efficiency in educational technologies through data-driven approaches. Brunskill's research has been supported by grants such as the NSF RI: Small grant for data-efficient reinforcement learning. She actively explores the ethical implications of AI systems, particularly in healthcare and education settings. Her recent work emphasizes leveraging large language models (LLMs) for personalized feedback and simulated training environments, as seen in studies like GPTCoach and LLM-based counselor upskilling.
Prof. Harry Hyungryul Baik is a Tenured Associate Professor at KAIST's Department of Mathematical Sciences since 2017. He holds a PhD from Cornell University (2014) and a B.S. from KAIST (2009), advised by William Thurston, John Hubbard, and Dylan Thurston. His research focuses on geometric topology, geometric group theory, and low-dimensional topology, with notable contributions to mapping class groups, Kleinian groups, and Teichmüller theory. Education: PhD in Mathematics (Cornell, 2014), B.S. in Mathematics (KAIST, 2009). Key research areas include asymptotic translation lengths, laminar groups, and circular orders of groups. He co-leads the KAIST-KIAS joint research group 2K-GATE as Director, emphasizing collaboration between topologists. Research highlights: Characterization of Fuchsian groups via laminations, unsmoothability of mapping class group actions on 1-manifolds, and exponential torsion growth in random 3-manifolds. His work bridges topology with dynamical systems and geometric group theory, often involving collaborations with institutions like KIAS and MPIM. Awards include the Sangsan Prize (2018), Young-KAST membership (2020–2023), and multiple grants from Samsung and POSCO. He advises 7 PhD students and has mentored 15+ alumni, many of whom hold postdoc positions globally. His lab actively hosts conferences like the KAIST Geometric Topology Fair. Labs/Teams: Director of 2K-GATE (KAIST-KIAS), core member of the KAIST Topology Research Group, collaborator with international networks including the Harvard-MIT-Princeton topology axis.
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.
Naresh R. Shanbhag is the Jack Kilby Professor in the Department of Electrical and Computer Engineering and the Coordinated Science Laboratory at the University of Illinois at Urbana-Champaign. He serves as Director of the Systems on Nanoscale Information fabriCs (SONIC) Center and held the D.J. Gandhi Distinguished Visiting Professorship at IIT Mumbai from 2015-2020. Previously, he was a visiting faculty member at National Taiwan University (2007) and Stanford University (2014). Dr. Shanbhag received his doctorate from the University of Minnesota (1993) in Electrical Engineering. From 1993 to 1995, he worked at AT&T Bell Laboratories as the lead chip architect for AT&T's 51.84 Mb/s transceiver chips over twisted-pair wiring for Asynchronous Transfer Mode (ATM)-LAN and very high-speed digital subscriber line (VDSL) chip-sets. His research focuses on the design of energy-efficient machine learning, communications, and signal processing systems on resource-constrained embedded platforms. He explores fundamental trade-offs between energy efficiency, latency and accuracy of decision-making systems implemented in nanoscale technologies, with applications to computer vision, biomedicine, automatic target recognition, and imaging. His work spans four primary focus areas: Resource-efficient Machine Learning for the Edge, In-memory Computing (IMC), Energy-efficient High Data Rate Communications, and Shannon-inspired Statistical Error Compensation (SEC). Analysis of his recent publications reveals a strong emphasis on in-memory computing architectures (SRAM, MRAM, RRAM) for machine learning acceleration. His work consistently addresses energy-accuracy trade-offs, with increasing attention to security aspects of hardware implementations and applications to MIMO signal processing and edge AI systems. His research demonstrates a progression from theoretical foundations to practical silicon implementations. 2024 Semiconductor Research Corporation Innovation Award 2018 Semiconductor Industry Association/Semiconductor Research Corporation University Researcher Award 2018 IEEE International Symposium on Circuits and Systems Best Paper Award 2006 IEEE Fellow 1996 National Science Foundation CAREER Award Professor Shanbhag has mentored over 50 graduate students who now work at leading technology companies including Qualcomm, Amazon, Nvidia, Intel, and Apple. His research has been generously supported by the National Science Foundation, DARPA, AFRL, Semiconductor Research Corporation, Texas Instruments, Sandia National Laboratories, and industry partners including IBM, GlobalFoundries, and Intel Corporation. He led the Alternative Computational Models research theme (2006-2012) and was the founding Director of the SONIC Center (2013-2017), a 5-year multi-university center funded by DARPA and SRC. Currently, he leads research themes in the SRC and DARPA funded JUMP 2.0 Program's Center for Co-Design of Cognitive Systems and the Center for Ubiquitous Connectivity, and in the NSF IUCRC Center for Advanced Semiconductor Chips with Accelerated Performance (ASAP). As Director of the Systems on Nanoscale Information fabriCs (SONIC) Center, Professor Shanbhag leads a multidisciplinary team exploring novel computing paradigms for the nanoscale era. His group has benchmarked an extensive collection of in-memory computing and digital accelerator IC designs, maintaining a publicly available IMC benchmarking repository of metrics extracted from published IC prototypes. His research philosophy integrates concepts from information theory, statistical signal processing, detection and estimation, VLSI architectures, and digital and analog integrated circuits to develop energy-efficient systems from algorithms to silicon implementations.
Brett Kolesnik is a Research Fellow in the Department of Statistics at the University of Warwick. His research focuses on probability theory, random structures, bootstrap percolation, and interactions with combinatorics. He has held postdoctoral fellowships at UC Berkeley, San Diego, and the University of Oxford, and was a Senior Demy at Magdalen College. His work includes organizing workshops on bootstrap percolation and collaborating with leading researchers in probability and combinatorics. Education: PhD in Mathematics from the University of British Columbia (advised by Omer Angel). Notable awards include the NSERC Postdoctoral Fellowship and the Florence Nightingale Bicentennial Fellowship in Statistics. Research interests span bootstrap percolation models, random graph dynamics, and stochastic processes. Recent work includes studies on Brownian map geometry, tournament score sequences, and Coxeter group structures. Selected articles explore topics such as critical beta-splitting processes, Catalan percolation, and random walks on algebraic structures. His publications appear in top journals like Electronic Journal of Probability and Annals of Applied Probability . Awards include the Florence Nightingale Fellowship and NSERC Postdoctoral Fellowship. Professional involvement includes organizing the 2024 BIRS workshop on Bootstrap Percolation and contributing to interdisciplinary collaborations in probability and combinatorics.
Kostas Bekris is a Professor in the Department of Computer Science at Rutgers University, specializing in Robotics and Artificial Intelligence. His research focuses on motion planning, autonomous manipulation, and robot control, with notable contributions to tensegrity robotics, perception-driven systems, and large-scale package handling. He leads a team conducting groundbreaking work in robotics, supported by grants from NSF, NASA, and industry collaborators like ExxonMobil. His group emphasizes interdisciplinary approaches, combining machine learning, topological methods, and differentiable physics modeling to advance robot capabilities in complex environments. Education details are not explicitly stated in the provided texts, but his academic career has included significant mentorship of PhD students and postdoctoral researchers. Key projects involve vision-driven manipulation pipelines, obstacle detection systems (PROBE), and resilient robot designs inspired by biological structures. He has been recognized for his work through prestigious awards including the NASA Early Career Grant and multiple NSF grants, as well as team achievements in robotics competitions like the Amazon Picking Challenge. Research interests span robotics subfields such as: Autonomous manipulation in cluttered environments Learning-based control for dynamic systems Topological data analysis for motion reasoning Tensegrity and soft robotics architectures Sim-to-real transfer in robotic tasks His team's work has produced open-source software tools and datasets, advancing benchmarks in manipulation and perception. Recent articles emphasize scalable solutions for industrial automation and robust navigation strategies in unstructured settings. Scientific achievements include: Development of PROBE for proprioceptive obstacle detection Advances in differentiable physics engines for tensegrity systems NSF-funded projects on robotic rearrangement and modular morphologies Advising contributions span over a decade, with current advisees focusing on topics like non-prehensile manipulation and large-scale storage optimization. Collaborations with industry (e.g., ExxonMobil) and academic partners (Yale University) reflect his commitment to applied robotics research. Labs and teams under his leadership include the Rutgers CS Robotics Group, contributing to projects like the ARIAC challenge platform and packing/industrial automation systems. Future work targets improved robot resilience in disaster scenarios and enhanced human-robot collaboration paradigms.
Shirshendu Ganguly is an Associate Professor in the Department of Statistics at the University of California, Berkeley. His research focuses on probability theory, statistical physics, and their applications, including percolation models, phase transitions, Markov chains, and random graphs. He holds a PhD in Mathematics from the University of Washington and has held postdoctoral positions at UC Berkeley. Ganguly has been recognized with the 2019 Sloan Research Fellowship. Education: PhD in Mathematics, University of Washington, 2011–2016 Miller Postdoctoral Fellow, UC Berkeley, 2016–2018 Research Interests: Probability Theory, Statistical Mechanics, Markov Chains, Random Graphs, Percolation Theory, Sparse Combinatorial Structures His work explores geometric and probabilistic phenomena in disordered systems, including polymer models, self-organized criticality, and random matrix theory. He has advised multiple PhD students and contributes to teaching advanced probability courses at Berkeley. Awards: 2019 Sloan Research Fellowship
