Professor Catherine Greenhill is a faculty member at the School of Mathematics and Statistics, UNSW Sydney , where she serves as Professor and head of the Combinatorics group. Her academic career spans institutions including the University of Queensland, University of Oxford, University of Leeds, University of Melbourne, and Australian National University. D.Phil., University of Oxford (1996) M.Sc. (Research) in Combinatorics (1992) B.Sc. (Hons) in Pure Mathematics (1991) Her research focuses on the intersection of discrete mathematics , theoretical computer science , and probability , particularly in asymptotic combinatorics , probabilistic methods , and analysis of algorithms . Her work includes asymptotic enumeration of combinatorial structures and design of randomized algorithms for graph sampling and counting. Her recent publications (2025–2021) center on random graphs and hypergraphs , with key contributions to switch Markov chains , degree sequence analysis , and chromatic number bounds . These works reflect her expertise in probabilistic combinatorics and algorithmic complexity . Scientific Awards: Fellow of the Australian Academy of Science (2022) Christopher Heyde Medal in Pure Mathematics (2015) June Griffith Fellowship (2013) Hall Medal (2010) Advising and Grants: She has supervised numerous PhD/Masters students and secured multiple ARC Discovery Grants (2019–2021, 2014–2016, 2012–2014). Her grants address topics like hypergraph modeling, random discrete structures, and network analysis in illicit drug trafficking.
Yang P. Liu is an Assistant Professor at Carnegie Mellon University 's Department of Computer Science . He received his PhD from Stanford University under the supervision of Aaron Sidford and previously studied at MIT . Fields of Interest : Graph Algorithms, Optimization, High-Dimensional Geometry, Additive Combinatorics, Theoretical Computer Science. His research focuses on algorithmic design and analysis for graph problems, optimization, and combinatorics, with applications in machine learning and complexity theory. Recent work includes advancements in parallel repetition games , combinatorial lines , and dynamic graph algorithms . In 2024, his research spanned FOCS , STOC , and RANDOM conferences, addressing problems in k-CSPs , min-cost flow , and hypergraph sparsification . Earlier contributions (2023) included deterministic flow algorithms and spectral hypergraph techniques. Scientific Awards : NDSEG Fellowship (2018-2021), Google PhD Fellowship (2022-2023), FOCS Best Paper (2022), STOC Best Student Paper (2022), FOCS Best Student Paper (2021). He teaches CS 15-759 , a graduate course on convex optimization theory and applications, covering gradient descent, interior point methods, and algorithmic sparsification techniques.
Ashley Montanaro is Professor of Quantum Computation in the School of Mathematics at the University of Bristol, and co-founder of the quantum software startup Phasecraft. He is a member of the Quantum Information Theory research group at Bristol. His research focuses on the theory of quantum computing, with particular interest in quantum algorithms, computational complexity, quantum query and communication complexity, and classical algorithms. His work spans both theoretical foundations and practical applications of quantum computing. Montanaro's research output shows significant trends toward quantum algorithms for optimization problems, quantum computational supremacy, and bridging theoretical advances with practical implementation challenges. His publications span foundational quantum information theory to applied quantum algorithms, demonstrating a versatile research program that connects computer science with quantum physics. Among his professional activities, Montanaro served on the QIP steering committee (2016-2018) and was an editor for the Quantum journal until 2019. He has been active in conference organization, serving on program committees for ITCS 2018, AQIS 2017 and 2015, QIP 2015, and TQC 2014 and 2013, reflecting his standing in the quantum computing research community. He has supervised numerous PhD students including Josh Blake, Jorja Kirk, Sheila Perez Garcia, Sami Boulebnane, Jan Lukas Bosse, Lana Mineh, Joao F. Doriguello, Chris Cade, Sam Pallister, and Stephen Piddock. His teaching includes Quantum Computation (MATHM0023) which he has taught since 2014 and Advanced Quantum Information Theory which he taught in 2015 and 2016. As co-founder of Phasecraft, Montanaro is actively translating theoretical quantum computing advances into practical software solutions, positioning him at the intersection of academic research and quantum technology commercialization.
Brendan O'Connor is an Associate Professor in the Manning College of Information and Computer Sciences (CICS) at the University of Massachusetts Amherst. His research focuses on computational social science and natural language processing (NLP), particularly exploring how social factors influence language technologies and using text analysis to understand societal trends. His work includes studies on racial bias in NLP, political event analysis, and social media linguistics. He holds a PhD in Machine Learning from Carnegie Mellon University (2014) and dual MS/BS in Symbolic Systems from Stanford University (2006). Education: PhD in Machine Learning, Carnegie Mellon University (2014) MS in Symbolic Systems, Stanford University (2006) BS in Symbolic Systems, Stanford University (2006) Research interests span AI ethics, social media analysis, and computational methods for studying language and society. Notably, he investigates racial disparities in NLP systems, linguistic variation in African American English, and event detection in news and social media. His work has been recognized with NSF CAREER and Google Faculty awards, and his research has been cited thousands of times. His lab, the Statistical Social Language Analysis Lab, develops tools for analyzing large-scale text data. He is affiliated with the Center for Data Science, Center for Intelligent Information Retrieval, and Computational Social Science Institute. Recent projects include analyzing global news coverage of critical events and developing frameworks for zero-shot argument explication. Awards and Honors: NSF CAREER Award Google Faculty Research Award Best Paper Award Advising and Grants: O'Connor has advised projects on social media polling representativeness and demographic analysis. His grants include collaborative research on sociopolitical event extraction and bias mitigation in AI systems. He has also contributed to platforms like Rookie for news archive exploration and ezCoref for coreference resolution. Labs/Teams: Leads the Statistical Social Language Analysis Lab and collaborates with the UMass NLP Group and Harvard Institute for Quantitative Social Science. His work bridges NLP with social science methodologies, emphasizing transparency in algorithms and causal inference using text data.
Sanjit A. Seshia is the Cadence Founders Chair Professor in the Department of Electrical Engineering and Computer Sciences at the University of California, Berkeley . He is affiliated with the Group in Logic and the Methodology of Science and participates in centers like the Industrial Cyber-Physical Systems Center , Berkeley AI Research , and the Simons Institute for the Theory of Computing . Research interests include formal methods for automated verification and synthesis of dependable systems, with applications to cyber-physical systems , AI-based autonomy , and computer security . His work spans SMT solving, model counting, syntax-guided synthesis, and algorithmic improvisation, with tools like UCLID5 , VerifAI , and Scenic for verifying autonomous systems and educational platforms like CPSGrader . Students and collaborators include notable researchers such as Dorsa Sadigh (Stanford), Daniel Fremont (UC Santa Cruz), and Hazem Torfah (Chalmers). He has co-founded startups like Decyphir and 20ⁿ Labs based on his research.
Anand V Natarajan is the ITT Career Development Professor in Computer Technology and Assistant Professor in the Department of Electrical Engineering and Computer Science (EECS) at MIT, with affiliation to the Computer Science and Artificial Intelligence Laboratory (CSAIL). He holds a PhD in Physics from MIT (2018), advised by Aram Harrow, and previously served as a postdoc at Caltech's Institute for Quantum Information and Matter. His research focuses on theoretical quantum information, emphasizing quantum complexity theory (e.g., MIP* and QMA(2) classes), nonlocality (Bell inequalities, nonlocal games), and semidefinite programming hierarchies. He teaches courses such as Quantum Cryptography, Quantum Systems Engineering, and Introduction to Algorithms at MIT. Notable contributions include resolving the MIP* = RE problem and the FOCS 2019 Best Paper Award for NEEXP ⊆ MIP*. He advises PhD students in quantum computing topics and collaborates extensively on quantum verification protocols and entanglement testing.
Ashley M R Montanaro is a Professor of Quantum Computation at the School of Mathematics, University of Bristol . Active in quantum computing research since at least 2014, they lead projects at the intersection of quantum algorithms , computational complexity , and quantum information theory , affiliated with the Bristol Quantum Information Institute. Research interests focus on quantum algorithm design , computational complexity analysis , and quantum simulation . Key work includes developing variational quantum algorithms for phase transition detection, Hamiltonian simulation techniques, and quantum-classical hybrid methods for solving complex problems in physics and optimization. Recent publications demonstrate expertise in: Quantum phase diagram simulation with low-depth circuits Quantum speedups for constraint satisfaction problems Quantum communication complexity of machine learning tasks Quantum-enhanced optimization heuristics Hamiltonian simulation with time-dependent product formulas Quantum algorithm complexity analysis Scientific awards include: EPSRC Fellowship (2014-2019) - "New insights in quantum algorithms and complexity" Active in quantum software development through projects like: "Quantum Algorithms from Foundations to Applications" (ERC-2018-COG) "Quantum Computing and Simulation Hub" (2019-2024) "Prosperity Partnership in Quantum Software" (2019-2023)
Faez Ahmed is an Associate Professor at the Department of Mechanical Engineering, Massachusetts Institute of Technology (MIT), where he serves as the Doherty Chair in Ocean Utilization. He leads the Design Computation and Digital Engineering (DeCoDE) Lab, focusing on integrating machine learning and optimization with engineering design to enhance human-AI collaboration and accelerate design processes. Ph.D., Mechanical Engineering, University of Maryland College Park (2019) B.Tech.-M.Tech., Mechanical Engineering, Indian Institute of Technology Kanpur (2012) His research interests include generative design methodologies, AI-driven optimization techniques, and the development of algorithms that facilitate collaboration between human designers and artificial intelligence systems. This interdisciplinary work spans applications in automotive design , ship hull synthesis , and wind turbine optimization , with a strong emphasis on creating open-source tools and datasets for the engineering community. Recent publications demonstrate his lab's leadership in fields such as 3D CAD generation , multimodal design datasets , and constraint-aware generative models . These works often address challenges in design space exploration , performance prediction , and data-driven design frameworks . Scientific Awards NSF CAREER Award (2025) ASME Young Investigator Award (2024) Google Research Scholar Award (2024) 3M Non-Tenured Faculty Award (2022) University of Maryland Alumni Research Award (2022) Faez Ahmed's lab has trained numerous Ph.D. candidates and postdoctoral researchers, fostering a collaborative research environment that bridges mechanical engineering , artificial intelligence , and computational methods . The DeCoDE Lab actively engages with industry partners and academic institutions, contributing to large-scale datasets and benchmarks that power the next generation of engineering design research.
Euiwoong Lee is an Assistant Professor in the Computer Science and Engineering Division at the University of Michigan. He holds a PhD from Carnegie Mellon University, advised by Venkatesan Guruswami, and has held postdoctoral positions at New York University and the Simons Institute for the Theory of Computing. His research focuses on approximation algorithms, hardness of approximation, and parameterized complexity. **Education:** PhD in Computer Science, Carnegie Mellon University (2017), advised by Venkatesan Guruswami Postdoctoral Fellowships: NYU (2017–2020), Simons Institute (2017–2020) **Research Interests:** Approximation Algorithms & Hardness of Approximation Convex Hierarchies (e.g., Sum-of-Squares) Clustering Algorithms (e.g., Correlation Clustering) Parameterized Complexity Facility Location & Metric Optimization **Awards:** Edmund M. Clarke Doctoral Dissertation Award (2017) Simons Award for Graduate Students in Theoretical Computer Science **Advising & Grants:** PhD Students: Anthony Della Pella, Aditya Anand, Amatya Sharma, Ian DeHaan Co-organizes the Michigan Theory Seminar **Labs/Teams:** Collaborates with researchers in approximation algorithms, optimization, and theoretical computer science at the University of Michigan and beyond.
Yang Song is an ARC Future Fellow and Scientia Associate Professor at the School of Computer Science and Engineering , University of New South Wales (UNSW) . She serves as Associate Head of School (Research) and Co-Director of iCinema , focusing on AI and Computer Vision applications for social good. Education: BEng in Computer Engineering (Nanyang Technological University, Singapore), PhD in Computer Science (UNSW, 2013) Research Areas: Biomedical image analysis, human-centred AI, graph data modeling, neuro-symbolic learning, and AI trustworthiness. Her work develops domain-specific deep learning models for radiological segmentation, histopathology cancer analysis, and 3D reconstruction. Recent projects address explainability in LLMs, fairness in AI, and human-robot interaction frameworks. With over 200 peer-reviewed publications in top venues like CVPR , MICCAI , and NeurIPS , her research spans biomedical imaging, robotics, and general multimodal AI. Scientific Awards include: 2024: ARC Industrial Transformation Research Hub for Human-Robot Teaming 2023: Google Inclusion Research Award 2022: NHMRC Ideas Grant for computational brain imaging 2021: UNSW Engineering Research Excellence Award 2020: Scientia Fellowship (UNSW) 2019: ARC Future Fellowship She supervises 24 current PhD/MPhil students and has graduated 15 advisees, including placements at Harvard University and Siemens Healthineers. Her grants include collaborations with Surf Life Saving Australia and industry partnerships for AI-driven solutions.
Satish Rao is a Professor in the Computer Science Division at the University of California, Berkeley. He is affiliated with the Simons Institute for the Theory of Computing and the Center for the Theoretical Foundations of Learning, Inference, Information, Intelligence, Mathematics and Microeconomics at Berkeley (CLIMB). His research focuses on algorithms, combinatorial optimization, graph theory, and theoretical computer science with applications to computational biology and machine learning. Rao has held teaching roles for courses such as CS 70 (Discrete Mathematics and Probability Theory) and CS 270 (Spring 2024). He has been recognized with prestigious awards including ACM Fellow (2013), the Delbert Ray Fulkerson Prize (2012), and the Okawa Research Grant (1999). Research Interests: Algorithm design, graph algorithms, combinatorial optimization, computational biology, and machine learning. Key Contributions: Pioneering work on metric embeddings, approximation algorithms, and network flow problems. Notable publications include foundational papers on tree metrics, distributed object location, and electrical flow-based optimization. Rao’s work bridges theoretical computer science with practical applications, including contributions to phylogeny estimation, anomaly detection, and parallel computing frameworks like the BSP model.
Aaron Roth is the Henry Salvatori Professor of Computer and Cognitive Science at the University of Pennsylvania, affiliated with the Department of Computer and Information Science in the School of Engineering and Applied Science. He holds a secondary appointment in the Department of Statistics and Data Science at the Wharton School and is associated with several research centers including PRiML, the Warren Center for Network and Data Sciences, and the AMCS program. He received his PhD from Carnegie Mellon University under Avrim Blum and was a postdoc at Microsoft Research New England. His research focuses on algorithms and machine learning, particularly in private data analysis, fairness in machine learning, game theory, mechanism design, and learning theory. His work bridges theoretical computer science with societal concerns, advocating for ethically aware algorithm design. He co-authored the book The Ethical Algorithm with Michael Kearns, which explores how to embed social values like privacy and fairness into algorithmic systems. His recent publications show a strong trend toward uncertainty quantification, multicalibration, conformal prediction, and fairness in reinforcement learning and high-dimensional settings. He frequently publishes in top-tier venues such as STOC, FOCS, ICML, NeurIPS, and COLT, often with a focus on rigorous theoretical foundations with practical implications. Hans Sigrist Prize Presidential Early Career Award for Scientists and Engineers (PECASE) Alfred P. Sloan Research Fellowship NSF CAREER award Google Faculty Research Award Amazon Research Award Yahoo Academic Career Enhancement award Roth has advised numerous PhD students and postdocs, many of whom now hold academic or industry research positions. He is also an Amazon Scholar at AWS and has served in advisory roles for companies like Apple, Facebook, Leapyear, and Spectrum Labs. He has been active in organizing workshops and tutorials on differential privacy, fairness, and adaptive data analysis, and has given keynotes at major conferences and institutions worldwide. He leads research groups and collaborates widely across Penn, focusing on responsible AI, privacy, and algorithmic fairness. His lab produces foundational work on calibration, unlearning, privacy-preserving learning, and equitable decision-making systems.
Miguel Nacenta is a Professor in the Department of Computer Science at the University of Victoria (UVic), Canada, and a founding member of the Victoria Interactive eXperiences with Information (VIXI) research group. Previously affiliated with the University of St Andrews (UK), his work bridges Human-Computer Interaction (HCI), Information Visualization, and Cognitive Science. He specializes in designing interactive systems that enhance human cognition, with a focus on Infotypography (using typography to encode data), collaborative problem-solving tools, and perceptual input/output devices. Research Interests: His key areas include cognitive augmentation, visualization techniques for complex tasks, multi-display environments, and tools for constraint problem-solving. Notable projects include the WriteReason tool for essay writing, InfoTypography studies on perceptual typographic parameters, and Solvi for visual constraint modeling. Grants & Collaborations: He collaborates internationally, including with the University of St Andrews on PhD scholarship programs. His work is supported by grants focusing on HCI innovations and accessibility. He actively mentors students (e.g., Adam Binks, Johannes Lang) and supervises postdoctoral researchers. Affiliations: Member of the VIXI group,他曾是St Andrews计算机科学学院的教授, 并参与多个学术服务活动, including conference program committees and journal reviews. Labs & Teams: Leads the VIXI lab at UVic, focusing on interactive technologies for cognitive tasks. Collaborates with industry partners on projects like TypoCartographer for infoTypographic maps and HaptiQ for accessible graph exploration.
Venkatesan Guruswami is a Chancellor's Professor in the Department of EECS and a Senior Scientist at the Simons Institute for the Theory of Computing at UC Berkeley . He also holds a Professor position in the Department of Mathematics . His academic journey began with a B.Tech in Computer Science from the Indian Institute of Technology, Madras (1997) , followed by a Ph.D. in Computer Science from the Massachusetts Institute of Technology (2001) . After a Miller Research Fellowship at UC Berkeley (2001–02), he held faculty roles at the University of Washington and Carnegie Mellon University before returning to UC Berkeley in January 2022. Education : B.Tech, IIT Madras (1997) Ph.D., MIT (2001) Professional Affiliations : Chancellor's Professor, UC Berkeley (EECS) Senior Scientist & Interim Director, Simons Institute Professor, UC Berkeley (Mathematics) Guruswami's research spans multiple domains within Theoretical Computer Science , focusing on Error-Correcting Codes , Approximation Algorithms , Randomness in Computing , Probabilistically Checkable Proofs , and Computational Complexity . His groundbreaking work in List Decoding has enabled codes with minimal redundancy for correcting worst-case errors, while recent advancements include Polar Codes , Deletion-Correcting Codes , and Constraint Satisfaction Problems . He has also contributed to Quantum Coding Theory , Locally Recoverable Codes , and Approximation Hardness in various computational contexts. His publications reflect a deep engagement with interdisciplinary topics. Key trends include: Quantum Information Theory : Quantum LDPC codes, transversal gates, and quantum storage. Algebraic Coding : Reed-Solomon codes, AG codes, and polynomial-based constructions. Computational Complexity : Hardness of approximation, CSPs, and parameterized intractability. Data Transmission : Polar codes, deletion channels, and feedback mechanisms. Algorithmic Techniques : Spectral methods, semirandom models, and Lasserre hierarchy applications. Guruswami has received numerous accolades, including the Simons Investigator Award , Presburger Award , Packard Fellowship , Sloan Research Fellowship , ACM Doctoral Dissertation Award , and the IEEE Information Theory Society Paper Award . He is an ACM Fellow (2017) and IEEE Fellow (2019) , with recent honors like the Guggenheim Fellowship (2023) and AMS Fellow (2023) . As an advisor, he has mentored over 25 PhD and postdoctoral researchers , including Atri Rudra , Prasad Raghavendra , and Peter Manohar , whose work has won awards like the Edmund M. Clarke Doctoral Dissertation Award and CRA Outstanding Undergraduate Researcher Award . His research is supported by grants from the National Science Foundation , Packard Foundation , and Sloan Foundation . He also serves as Editor-in-Chief of the Journal of the ACM and holds leadership roles in IEEE and arXiv moderation. Guruswami is actively involved in Simons Institute programs and co-organized workshops on Coded Computation and Information Theory . His work bridges theoretical advancements with practical applications in Cloud Storage , Quantum Computing , and Group Testing , including pandemic-era contributions like AC-DC: Amplification Curve Diagnostics for SARS-CoV-2 .
Norman Sadeh is a Professor in the School of Computer Science at Carnegie Mellon University (CMU), where he has made significant contributions to cybersecurity, privacy, and AI research. He has co-founded and co-directed several groundbreaking graduate programs at CMU, including the Privacy Engineering Program (2012-present), the Ph.D. Program in Societal Computing (2003-2013), and the MBA track in Technology Strategy and Product Management (2005-2017). Carnegie Mellon University, School of Computer Science Software and Societal Systems Department CyLab Security and Privacy Institute Manufacturing Futures Institute Dr. Sadeh received his Ph.D. in Computer Science at CMU with a major in Artificial Intelligence and a minor in Operations Research. He holds an M.Sc. in computer science from the University of Southern California and a BS/MS degree in electrical engineering and applied physics from the Free University of Brussels (Belgium) as 'Ingénieur Civil Physicien.' Professor Sadeh's research spans cybersecurity, online privacy, Human-AI Interaction, AI governance, mobile computing, the Internet of Things, user-oriented machine learning, and language technologies. He is particularly known for his pioneering work on AI-based privacy enhancing technologies, including privacy assistants, automated privacy compliance tools, and NLP-based privacy solutions. His work has influenced the design of privacy features at major technology companies including Apple, Google, and Facebook/Meta, as well as privacy policies at regulatory agencies like the Federal Trade Commission and the California Office of the Attorney General. Analysis of his recent publications shows a strong focus on practical privacy solutions, particularly in mobile and IoT contexts, with an emphasis on making privacy more usable and understandable for end users. His work bridges technical innovation with policy implications, addressing both the technological and human aspects of privacy protection. 2018 Outstanding Entrepreneur of the Year award from the Pittsburgh Venture Capital Association Test of time award by the AAAI Conference on Web and Social Media (ICWSM) Gartner Group's Magic Quadrant leader in Security Awareness Computer-Based Training for 4 consecutive years Deloitte's Technology Fast 500 recognition for 3 consecutive years Professor Sadeh has advised numerous students, including PhD candidates like Aerin (Shikhun) Zhang, whose dissertation focused on understanding diverse privacy attitudes. His research has been funded through various grants, including NSF SaTC projects, and has resulted in technologies that protect tens of millions of users worldwide. He also founded Wombat Security Technologies, which was acquired by Proofpoint in 2018 and whose technologies are used by over 75% of Fortune 100 companies. Professor Sadeh leads several research initiatives including the Privacy Engineering Program, the Usable Privacy Policy Project, the Personalized Privacy Assistant Project, and CMU's Privacy Infrastructure for the Internet of Things. His Mobile Commerce Lab and E-Supply Chain Management Lab have produced influential research that has been commercialized by major organizations including IBM, Raytheon, Boeing, and the U.S. Army.
