Fine Grained Algorithms & Complexity Professors and Supervisors

Frank StaalsView profile

Assistant Professor

InriaFrance

Frank Staals is an Assistant Professor in the Department of Information and Computing Sciences at Utrecht University. He holds a PhD from Utrecht University and was previously a PostDoc at MADALGO, Aarhus University. His research focuses on Computational Geometry , with emphasis on algorithms for moving objects, geometric data structures, and shortest-path problems. Applications include Geographic Information Science (GIS) and Visualization. Research Interests: Staals develops theoretically rigorous and efficient algorithms for geometric data. Key areas include: Trajectory analysis (grouping, segmentation) Geodesic computations in polygons and terrains Dynamic data structures for spatial queries Robust classification of geometric data His publications demonstrate a trend toward scalable algorithms for real-world spatial data, including trajectory grouping, visibility queries, and terrain analysis. Recent work addresses the computational complexity of geodesic spanners and dynamic connectivity in geometric graphs. Awards: Best Paper Award at SIGSPATIAL 2019 Staals leads courses in Functional Programming and Geometric Algorithms and develops open-source software (HGeometry). He collaborates with international teams on projects in GIS and algorithmic geometry.

Official University Profile

Ryan WilliamsView profile

Professor

Massachusetts Institute of TechnologyUnited States

Ryan Williams is a Professor of Electrical Engineering and Computer Science at MIT's Computer Science and Artificial Intelligence Laboratory (CSAIL) and the Department of Electrical Engineering and Computer Science. Previously, he held a faculty position at Stanford University from 2011 to 2016. He obtained his PhD in Computer Science from Carnegie Mellon University under Manuel Blum and completed his undergraduate studies at Cornell University. His research focuses on computational complexity theory, exploring the boundaries of efficient computation and connections between algorithm design and complexity lower bounds. He teaches advanced courses such as Automata, Computability, and Complexity Theory at MIT. Education: PhD in Computer Science, Carnegie Mellon University (Advisor: Manuel Blum) Bachelor's Degree in Computer Science, Cornell University Research Interests: His work addresses fundamental questions in theoretical computer science, including the P vs. PSPACE problem, circuit lower bounds, and the development of algorithms with provable efficiency. He investigates connections between algorithmic techniques and complexity-theoretic limitations, aiming to establish barriers to solving computational problems efficiently. Publications and Trends: Ryan Williams' recent work spans topics like space-bounded computation, probabilistic polynomial sparsity, circuit lower bounds, and algorithms for compression and graph problems. His research often bridges theoretical insights with practical algorithm design, emphasizing the interplay between computational models and their limitations. Advising and Grants: Current advisees include Rahul Ilango, Ce Jin, and Ted Pyne. He has mentored numerous PhD students who have contributed to areas like fine-grained complexity and circuit analysis. While specific grants are not detailed, his research aligns with foundational studies in theoretical computer science. Labs and Teams: Williams is affiliated with MIT CSAIL, where he collaborates on projects exploring computational complexity and algorithmic foundations.

Official University Profile

Gregory ValiantView profile

Associate Professor

Stanford UniversityUnited States

Gregory Valiant is an Associate Professor of Computer Science at Stanford University , specializing in Algorithms, Machine Learning, Statistics, and Information Theory. He holds a PhD from UC Berkeley and a BA in Mathematics from Harvard University. His research focuses on designing efficient algorithms for inferring information from limited data, addressing challenges in computation, memory, communication, and data quality. He advises multiple PhD students and collaborates with institutions like Microsoft Research New England. Educations: PhD, Computer Science, UC Berkeley (2012) BA, Mathematics, Harvard University (2006) Research Interests: Gregory’s work centers on the interplay between algorithms and statistical inference, particularly in high-dimensional settings. His lab explores topics like distribution learning, sample amplification, and adversarial robustness. Recent projects include developing algorithms for trace reconstruction, matrix completion, and transformer-based in-context learning. His methodologies often combine theoretical rigor with practical applications in machine learning and data science. Key Article Trends: His publications span theoretical foundations (e.g., sample amplification, convex optimization complexity) and applied machine learning (e.g., transformer capabilities, adversarial testing). Notable work includes contributions to distribution testing, statistical estimation under constraints, and algorithmic lower bounds. Advising: Current advisees include Annie Marsden, Steven Cao, and Chirag Pabbaraju. Former students have pursued roles at institutions like Harvard, Berkeley, and companies like Google, Waymo, and Facebook.

Official University Profile

Tselil SchrammView profile

Assistant Professor

University of California, San DiegoUnited States

Tselil Schramm is an Assistant Professor in the Department of Statistics at Stanford University, with courtesy appointments in Computer Science and Mathematics. She is actively engaged in research and teaching in theoretical computer science and statistics. Department: Department of Statistics School: School of Humanities and Sciences University: Stanford University Office: CoDa E254 Email: tselil@stanford.edu She earned her PhD from UC Berkeley under Prasad Raghavendra and Satish Rao, followed by postdoctoral work at Harvard and MIT with Boaz Barak, Jon Kelner, Ankur Moitra, and Pablo Parrilo. Her research lies at the intersection of theoretical computer science and statistics, focusing on high-dimensional estimation, information-computation tradeoffs, sum-of-squares algorithms, and random graph theory. She develops algorithms for statistical problems and investigates the boundaries between what is statistically possible and what is computationally feasible. Her recent publications span topics including the overlap-gap property, discrepancy algorithms, robust message passing, semidefinite programming, spectral clustering, and random geometric graphs, appearing in top venues such as STOC, FOCS, COLT, NeurIPS, and The Annals of Statistics. She teaches a range of courses, including Introduction to Statistics (STATS 60), Theory of Statistics II (STATS 300B), and Machine Learning Theory (STATS 214 / CS 228M), reflecting her expertise in both foundational and advanced statistical theory. Runner-up for Best Paper at COLT 2021 Invited to STOC 2022 special issue of SICOMP Invited to SODA 2016 special issue of ACM Transactions on Algorithms Invited to CCC 2019 special issue of Theory of Computing Tselil Schramm advises and collaborates with numerous students and researchers, including Shuangping Li, Misha Ivkov, and Siqi Liu. She has been involved in multiple research grants and projects, particularly in the areas of high-dimensional inference and algorithmic robustness. Her work often bridges theoretical guarantees with practical algorithmic design. She is affiliated with Stanford’s theoretical computer science and statistics research groups, contributing to a vibrant academic environment. Her future work is expected to further explore the limits of efficient computation in statistical settings, with potential applications in machine learning, signal processing, and network analysis.

Official University Profile

Victor LagerkvistView profile

Associate Professor

Linköping UniversitySweden

Victor Lagerkvist is an Associate Professor at the Department of Computer Science (IDA) , Linköping University, Sweden. He is affiliated with the Theoretical Computer Science Laboratory (TCSLAB) and the Artificial Intelligence and Integrated Computing Systems (AIICS) division. His research focuses on the algebraic method for analyzing computational complexity , particularly in constraint satisfaction problems (CSPs), SAT, and graph homomorphism problems. PhD in Computer Science (2016, Linköping University) Habilitation (2020, Linköping University) His recent work investigates fine-grained complexity , twin-width , and universal algebra to improve algorithms for NP-hard problems. Publications span topics like propositional abduction, Allen's interval algebra, and semiring-based dynamic programming. His scientific awards include the Swedish Research Council Starting Grant (2020) and the 2017 Young Researcher Prize from the Ruth and Nils-Erik Stenbäck Foundation. He supervises PhD students such as Leif Eriksson and serves as a secondary supervisor for others at Linköping University and Université de Lorraine.

Official University Profile

Rabih YounesView profile

Associate Professor

Duke UniversityUnited States

Rabih Younes is an Associate Professor of the Practice in the Department of Electrical and Computer Engineering at Duke University's Pratt School of Engineering. He also serves as the Associate Director of Undergraduate Studies and is a Faculty Network Member of the Duke Institute for Brain Sciences. Additionally, he is the Duke FRC Program Director for team 8429, Valence Robotics, and Head of the Duke KEEN Leadership Team. Dr. Younes received his PhD in Computer Engineering from Virginia Tech in 2018, following his MSE in Computer Engineering from the Lebanese American University in 2013 and his BE in Computer Engineering from the same university in 2011. He speaks nine languages (fluent in three) and holds various certificates including Engineering Education and Future Professoriate, Cisco Networking Academy certifications (CCNP, CCNA, ITE Instructor Trainer), National Instruments CLAD, and USPA A-Licensed Skydiver. His research spans wearable computing, ubiquitous/pervasive computing, activity recognition, context awareness, machine learning, engineering education, and Middle Eastern politics. Dr. Younes has published extensively on topics ranging from wearable health monitoring systems to innovative approaches in engineering education. His recent work demonstrates a growing integration of machine learning techniques with wearable sensor data for health applications, activity recognition, and educational assessment tools. Dr. Younes' scholarly output shows a consistent trajectory from fundamental wearable computing research toward practical applications in health monitoring and educational technology. His publications reveal an increasing focus on real-world implementation challenges, data augmentation techniques, and educational assessment tools that bridge engineering theory with practical classroom applications. Tau Beta Pi honor society member Eta Kappa Nu honor society member Phi Kappa Phi honor society member Golden Key honor society member KEEN Annual Support grant (2024-2026) Dr. Younes actively mentors students through various programs including EGR 393: Research Projects in Engineering and ECE 899: Special Readings in Electrical Engineering. He has received grant support through the KEEN Annual Support program for 2024-2026, focusing on innovative engineering education approaches. His teaching philosophy emphasizes student development beyond academics, incorporating life skills and critical thinking. As Director of Valence Robotics (team 8429), Dr. Younes leads high school robotics initiatives that have earned state championship qualifications. His lab work focuses on wearable computing systems with applications in health monitoring (including pet emotional health tracking), activity recognition, and educational technology tools. He utilizes agile project management frameworks like Scrum in his courses and implements tools to enhance student learning retention.

Official University Profile

Chethan KamathView profile

Assistant Professor

Indian Institute of Technology Bombay (IITB)India

Chethan Kamath is an Assistant Professor in the Department of Computer Science and Engineering at IIT Bombay, where he is a member of the Theory Group and Trust Lab. His primary research focus is on cryptography, particularly its foundations, with broader interests extending to theoretical computer science. His educational journey includes: PhD from IST Austria (2014-2020) under Krzysztof Pietrzak, with thesis titled "On the Average-Case Hardness of Total Search Problems" Master's in CS from IISc Bangalore (2010-2013) under Sanjit Chatterjee, with thesis titled "Constructing Provably Secure Identity-Based Signature Schemes" Bachelor's in CS from University of Kerala (2005-2009) at TKM College of Engineering, Kollam Dr. Kamath's research interests span the theoretical foundations of cryptography, with particular focus on secure computation, complexity theory, and cryptographic hardness assumptions. His work often bridges theoretical computer science with practical cryptographic applications, exploring the boundaries of what can be efficiently computed while maintaining security guarantees. His research frequently addresses fundamental questions about the relationship between cryptographic primitives and complexity classes, especially the PPAD and TFNP complexity classes. His recent publications demonstrate a consistent focus on foundational aspects of cryptography, with particular emphasis on secure computation (garbled circuits, Yao's protocol), proofs systems (proofs of work, proofs of exponentiation), and complexity-theoretic aspects of cryptographic primitives. A notable trend is his exploration of the connections between complexity classes like PPAD and cryptographic assumptions, as well as his work on verifiable delay functions and their underlying number-theoretic assumptions. His research often employs tools from algorithmic graph theory (treewidth, separators) to analyze cryptographic protocols. His notable scientific achievement includes: Azrieli Fellowship during his post-doc at Tel Aviv University Dr. Kamath actively mentors students and researchers, currently advising several PhD and MS students at IIT Bombay, often in collaboration with Sruthi Sekar. His service to the academic community includes extensive program committee memberships for major conferences including Crypto, Eurocrypt, and TCC, demonstrating his standing in the cryptographic research community. He has co-organized educational events like the "Introduction to Cryptography" school as part of the ACM India Summer School 2025 and the "Theoretical Foundations of Cryptography" school as part of the ACM India Summer School 2024. He leads research activities within the Trust Lab at IIT Bombay, which focuses on theoretical and applied aspects of cryptography and security. The lab actively recruits MS/PhD students and post-docs, with ongoing research in foundational cryptography and its applications to secure computation, verifiable delay functions, and complexity-theoretic aspects of cryptographic security.

Official University Profile

Petr HájekView profile

Professor

Mesoyios CollegeCyprus

Petr Hájek is a Professor at the University of Pardubice in the Institute of System Engineering and Informatics, Czech Republic. With 236 publications, 71,463 reads, and 5,595 citations, he has established himself as a prominent researcher in computational intelligence and machine learning applications. His research interests span multiple domains of computational intelligence, with particular focus on: Machine learning applications in financial forecasting and risk management Neural networks and fuzzy logic systems for time series prediction Sentiment analysis for financial markets and social media Fraud detection and fake news identification systems Cryptocurrency price forecasting and market analysis ESG analytics and sustainable finance applications Analysis of his recent publications (2023-2025) reveals an expanding research scope that increasingly integrates sustainability considerations with financial technology. His work demonstrates sophisticated methodological approaches, frequently employing hybrid neural network architectures, ensemble learning techniques, and advanced text mining methods. Professor Hájek's research shows strong international collaboration patterns with scholars across Europe, Asia, and North America. His scholarly contributions have focused on developing practical AI solutions for complex financial problems, with particular attention to handling class imbalance issues in financial datasets and creating interpretable models for financial decision-making. Professor Hájek maintains an active research program with consistent publication output across top venues in computational intelligence and financial technology. His work bridges theoretical advances in machine learning with practical applications in finance, demonstrating both academic rigor and real-world relevance.

Official University Profile

Marie-Christine ROUSSETView profile

Professor

ENSAE ParisFrance

Marie-Christine ROUSSET is a Professor of Computer Science at the University of Grenoble Alpes (UGA) in France, where she is a member of the LIG (Laboratoire d'Informatique de Grenoble) in the SLIDE group. Previously affiliated with Paris-Saclay (LRI), she has established herself as a leading researcher in Knowledge Representation and Information Integration. She holds the distinguished position of Senior member of the Institut Universitaire de France (IUF) (2011-2016, renewed for 2016-2021) and serves as co-responsible for the chair Explainable and Responsible AI within MIAI Grenoble Alpes. Her research focuses on ontology-based data access, logic-based mediation between distributed data sources, query rewriting using views, data linkage, and distributed reasoning for the Semantic Web. She skillfully combines artificial intelligence and database techniques to address complex information integration challenges, with applications spanning biomedical informatics, educational technology, and trustworthy AI. Her work demonstrates consistent innovation from foundational research to practical implementations, as evidenced by her co-authorship of the book 'Web Data Management' published by Cambridge University Press. Professor ROUSSET's recent publications (2019-2022) reveal a growing emphasis on data privacy, RDF graph anonymization, and interactive ontology engineering, while maintaining her strong contributions to semantic web technologies and knowledge representation. Her research shows increasing attention to trustworthy AI concerns, aligning with her leadership roles in relevant projects. Scientific Recognition Senior member of Institut Universitaire de France (IUF) (2011-2016, renewed for 2016-2021) Junior member of Institut Universitaire de France (IUF) from 1997 to 2002 Chevalier de l'Ordre National du Merite (July 11, 2011) EurAI Fellow (nominated ECCAI Fellow in 2005) Best Paper Award at AAAI'96 for 'Verification of Knowledge Bases based on Containment Checking' Professor ROUSSET maintains an active role in the scientific community through editorial work and organizational leadership. She serves on the Editorial Board of Communications of the ACM (CACM) and has held significant roles including PC chair of EGC 2019, Workshops co-Chair of WWW 2018, and Area Chair of IJCAI 2017. Her consistent service on program committees of major international conferences demonstrates her standing in the field. Her laboratory, the SLIDE group within LIG, focuses on semantic web technologies, knowledge representation, and data integration. The group maintains strong connections with the international research community and participates in collaborative projects addressing cutting-edge challenges in artificial intelligence and data management, with particular emphasis on trustworthy and explainable AI systems.

Official University Profile