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.
Chris De Sa is an Associate Professor in the Department of Computer Science at Cornell University, affiliated with the Cornell Machine Learning Group and leading the Relax ML Lab. His research focuses on algorithmic, software, and hardware techniques for high-performance machine learning, particularly relaxed-consistency stochastic algorithms like asynchronous and low-precision stochastic gradient descent (SGD). He earned his Ph.D. from Stanford University under advisors Kunle Olukotun and Chris Ré. His work emphasizes constructing efficient, parallel, and distributed machine learning frameworks for deep learning and data analytics. Education: Ph.D. in Computer Science, Stanford University (2017) Research Interests: Algorithmic techniques for scalable ML, quantization, distributed optimization, hyperbolic geometry in ML, and reliable measurement of ML systems. His group develops frameworks for efficient inference/training and explores the intersection of ML with domains like agriculture and plant science through courses like PLSCI 7202. Recent Highlights: DARPA YFA Grant (2024), NSF CAREER Award, Google Research Scholar Award, and multiple best paper recognitions. Key contributions include QuIP quantization methods, Coneheads attention mechanisms, and theoretical advances in decentralized training. Awards: NSF CAREER Award DARPA YFA Grant (2024) Google Research Scholar Award Mr. & Mrs. Richard F. Tucker Teaching Award Grants & Advising: Advises 8 Ph.D. students (including Ruqi Zhang, Yucheng Lu, A. Feder Cooper) and holds leadership roles in MLSys conferences. Active in grant-funded research (e.g., NSF Robust Intelligence). Labs/Teams: Leads the Relax ML Lab and participates in Cornell’s Institute for Digital Agriculture (CIDA).
William Gasarch is a Professor of Computer Science at the University of Maryland, College Park, with an affiliation in Mathematics. He holds a Ph.D. from Harvard University (1985) and a B.S. from SUNY Stony Brook (1980). His research focuses on complexity theory, combinatorics, and Ramsey Theory, with applications to computer science theory. Education: Ph.D., Harvard University, 1985 (Computer Science) B.S., SUNY Stony Brook, 1980 (Math and Applied Math) Research Interests: Gasarch specializes in theoretical computer science, particularly applying Ramsey Theory to computational problems. His work bridges combinatorics, logic, and algorithm design, emphasizing foundational questions in complexity theory. He is known for exploring how Ramsey Theory informs program termination proofs and lower bounds in computational models. Labs/Teams: Affiliated with the Computer Science department’s theory group, he contributes to collaborative projects on Ramsey applications and combinatorial algorithms. His REU (Research Experiences for Undergraduates) program highlights mentorship in combinatorial algorithms. Advising & Grants: Mentored numerous high school and undergraduate students, including Breakthrough Prize winner Jacob Lurie and Intel Science Talent finalist Louis Wasserman. Active in NSF-funded initiatives through UMD’s theory group (details unspecified).
Kord Eickmeyer is a Lecturer at Technische Universität Darmstadt in the Department of Mathematics, specializing in the mathematical logic group. He holds a PhD in mathematics from Humboldt University Berlin and has held postdoctoral positions at TU Darmstadt (2011–2017) and the National Institute of Informatics in Tokyo (2011–2013). His research focuses on finite model theory, graph structure theory, and computational complexity, particularly in descriptive and parameterized complexity, as well as randomization and derandomization techniques. Research interests include exploring the boundaries of computational complexity through logical frameworks, analyzing graph structures for efficient algorithm design, and investigating the role of randomness in computation. His work bridges theoretical computer science and mathematical logic, with applications in algorithm design and formal methods. Publications span topics from model-checking on ordered structures to gap-planar graphs and randomized logics. Collaborations include prominent institutions like the National Institute of Informatics and Humboldt University Berlin. No scientific awards are explicitly listed, but his extensive academic contributions reflect a strong research trajectory. Advising and grants are not detailed in the provided text, though his academic career includes supervision roles during his PhD and postdoctoral phases. His involvement with the mathematical logic group at TU Darmstadt highlights collaborative research efforts in foundational areas of computer science and mathematics.
Elette Boyle is an Associate Professor at Reichman University (IDC Herzliya) and a Senior Scientist at NTT Research . She holds a Ph.D. in Mathematics from MIT (advised by Shafi Goldwasser and Yael Tauman Kalai) and an undergraduate degree from Caltech . Education Ph.D. in Mathematics, MIT B.S. in Mathematics, Caltech Her research focuses on cryptographic solutions for secure data processing , particularly in secure multi-party computation , function/homomorphic secret sharing , and distributed point functions . Recent work explores topology-hiding communication , memory checking complexity , and sublinear-communication MPC . Key trends in her publications include: Advancements in Function Secret Sharing for branching programs and sparse vectors. Efficient Secure Multi-Party Computation protocols with preprocessing. Information-theoretic and computational Topology-Hiding Broadcast schemes. Optimized Oblivious Transfer with constant computational overhead. Scientific Awards European Research Council (ERC) Award Israeli Science Foundation (ISF) Grant United States Air Force Office of Scientific Research (AFOSR) Grant Google Research Scholar Award International Association for Cryptologic Research (IACR) Recognition As Director of the Foundations & Applications of Cryptography (FACT) Research Center , she leads collaborative work with institutions like Technion Israel , Cornell University , and NTT Research . Her students include Pierre Meyer (Ph.D.) , Matan Hamilis (Ph.D.) , and D'or Banon (MSc.) .
Ahmed El Alaoui is an Assistant Professor in the Department of Statistics and Data Science at Cornell University, with a secondary affiliation in the Department of Computer Science. He joined Cornell in 2021 after completing a postdoctoral fellowship at Stanford University under Andrea Montanari. His research focuses on high-dimensional statistics, probability theory, algorithms on random structures, and statistical physics, with particular emphasis on spin glasses and algorithmic thresholds. El Alaoui holds a PhD in Electrical Engineering and Computer Sciences from UC Berkeley (2018), advised by Michael I. Jordan, and a Master's from Ecole Normale Supérieure/Ecole des Ponts Paristech. His work bridges theoretical and applied domains, addressing challenges in high-dimensional inference, computational trade-offs, and probabilistic models. He has contributed to foundational results in random matrix theory, detection limits in spiked models, and algorithmic approaches to complex systems. His teaching includes courses on high-dimensional statistics, probability models, and theoretical computer science. He has been recognized for his innovative approaches to sampling and optimization in disordered systems, with publications in top journals like Annals of Probability and venues such as NeurIPS and FOCS. El Alaoui's research explores the interplay between statistical physics principles and algorithm design, aiming to uncover computational barriers in high-dimensional problems. His lab develops methodologies for analyzing complex systems and improving the efficiency of statistical estimation in challenging scenarios.
Amit Chakrabarti is a Professor in the Department of Computer Science at Dartmouth College, part of the School of Arts and Sciences. He holds a B.Tech. from IIT Bombay and a Ph.D. from Princeton University. His research focuses on theoretical computer science, emphasizing computational complexity, data stream algorithms, and approximation algorithms. He has contributed to foundational work in communication complexity, lower bounds, and graph algorithms. Chakrabarti has received prestigious awards including the NSF CAREER Award and the Karen E. Wetterhahn Award. He has organized workshops such as the Banff Communication Complexity and Applications conference and contributed to the IHP thematic program in Paris. He teaches courses like Data Stream Algorithms and Computational Complexity, and has advised numerous graduate and undergraduate students. His current research explores connections between information theory and complexity, memory-efficient graph algorithms, and algebraic techniques in computational complexity. Chakrabarti has served on committees for major conferences (e.g., FOCS, SODA) and editorial roles for Information Processing Letters.
Edith Hemaspaandra is a Professor in the Department of Computer Science at the Rochester Institute of Technology (RIT), located in the Golisano College of Computing and Information Sciences. She holds a BS, MS, and Ph.D. in Computer Science from the University of Amsterdam (the Netherlands). Her research focuses on computational social choice, computational complexity theory, logic complexity, and formal methods. She teaches courses such as CSCI-262/263 (Introduction to Computer Science Theory) and CSCI-664 (Computational Complexity). Her work explores the algorithmic aspects of voting systems, including election manipulation, control, and bribery, with a focus on their computational complexity. She has also contributed to formal methods for automata theory, educational tools like JFLAP extensions, and the study of complexity classes such as LWPP and WPP. Her research bridges theoretical computer science with practical applications in social choice theory and algorithm design. Her grants include an NSF-funded project on computationally protecting elections from manipulation (2011). She actively publishes in top venues like STACS and ISAAC, addressing topics ranging from graph reconstruction to hybrid election models. Though no awards are explicitly listed, her extensive publication record highlights her contributions to theoretical computer science. Her advising and grant activities include collaborative research projects and educational tool development. She is affiliated with RIT’s Department of Computer Science and maintains a personal website and ORCID profile.
Benjamin Steinberg is a Professor in the Mathematics Department at the City College of New York (CCNY) and the CUNY Graduate Center. He holds a Ph.D. from the University of California, Berkeley (1998) under John Rhodes and has held positions at the University of Porto (Portugal) and Carleton University (Canada). His research focuses on algebra, including semigroups, geometric group theory, algebraic combinatorics, representation theory, and automata theory, with notable work on etale groupoids, inverse semigroups, and ring theory. He is the author of several books, including *The q-theory of Finite Semigroups* and *Representation Theory of Finite Monoids*. Steinberg serves as Managing Editor of the *International Journal of Algebra and Computation* and has organized conferences such as the International Conference on Semigroups and Groups in Honor of John Rhodes. Research interests include the interplay between algebraic structures and their applications, such as in automata theory and Markov chains. His work bridges pure mathematics with combinatorial and geometric approaches, often involving categorical and topological methods. Recent articles explore topics like Nekrashevych algebras, twisted Steinberg algebras, and Lyndon's identity theorem for monoids. He has contributed to the study of profinite groups and their connections to symbolic dynamics. Steinberg’s editorial roles and conference organization reflect his leadership in the mathematical community. Despite his defunct blog, his academic contributions remain prolific, with ongoing editorial work and research in algebraic combinatorics and representation theory.
Ioannis Panageas is an Assistant Professor in Computer Science at UC Irvine's Donald Bren School, directing the GOALLab. His research develops theory for learning in multi-agent systems, game dynamics, and optimization. Funded by NSF and NRF, he focuses on last-iterate convergence guarantees in games, efficient equilibrium computation, and multi-agent reinforcement learning. Recent Work: Provides first exponential lower bounds for fictitious play in potential games (NeurIPS 2023), efficient Nash equilibrium computation methods (ICLR 2023), and semi-bandit learning dynamics with no-regret guarantees (ICML 2023). Teaching: Offers courses in Algorithmic Game Theory and Optimization for Machine Learning. Currently advising 3 PhD students and 2 MS students.
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 .
James Aspnes is the Harold W. Cheel Professor of Computer Science at Yale University, specializing in distributed algorithms and randomized methods. He holds a PhD from Carnegie Mellon University and degrees from MIT. His research focuses on distributed systems, peer-to-peer networks, and sensor networks, emphasizing tools for efficient data management and fault-tolerance. Education: PhD (CMU, 1992), SM & SB (MIT, 1987) Affiliations: Yale since 1993, IBM Almaden Research Center (1992–1993) Research interests include distributed algorithms, randomization, and applications in biology and economics. Notable contributions include skip graphs, population protocols, and consensus algorithms. He has received the ACM-EATCS Dijkstra Prize (2020) and Dylan Hixon Prize (2000). Publications span distributed computing, algorithms, and cryptography. Recent work explores consensus protocols and privacy in population models. Grants include NSF awards totaling over $2M. Active in editorial roles (Algorithmica, Distributed Computing) and conference organization (PODC 2005, DCOSS 2007).
Albert Atserias is a Professor in the Department of Computer Science at the Universitat Politècnica de Catalunya (UPC), affiliated with the Faculty of Informatics of Barcelona (FIB) and the ALBCOM research group (Algorithms, Bioinformatics, Complexity, and Formal Methods). He is also associated with the Institut de Matemàtiques de la UPC-BarcelonaTech. His research is central to theoretical computer science, with a strong emphasis on logic and complexity. Atserias's research interests span Computational Complexity, Logic in Computer Science, Finite Model Theory, Proof Complexity, and Constraint Satisfaction Problems . His work explores the fundamental limits of computation, the expressive power of logical languages over finite structures, and the complexity of proving mathematical statements. He investigates the algebraic and combinatorial properties of proof systems, the limits of efficient algorithms for constraint solving, and the theoretical foundations of databases. His research often bridges logic, algebra, and combinatorics to provide deep insights into computational phenomena. The trends in his recent publications show a sustained focus on the logical and algebraic underpinnings of computational problems. Key themes include the consistency and complexity of database queries , the power and limitations of proof systems (like resolution and sum-of-squares), and the expressive power of homomorphism counts in graph theory. His work on the hardness of automating resolution and the development of circular proof systems are particularly significant contributions to proof complexity. The 2024 PODS Best Paper Award for work on relational consistency underscores the impact and timeliness of his research. Among his notable scientific awards are the prestigious ICREA Acadèmia , the PODS 2024 Best Paper Award , the Premi Extraordinari de Doctorat (Extraordinary Doctoral Prize), and the Kleene Award for Best Student Paper . These accolades reflect both the excellence of his early work and his continued leadership in the field. Atserias has been a principal investigator on numerous competitive research projects, including funding from the European Research Council (ERC) and the Spanish Ministry of Science. He has advised doctoral students, such as Toni Hakoniemi, whose thesis on proof complexity he supervised. His extensive collaborative network includes leading researchers like Phokion Kolaitis, Anuj Dawar, and Victor Dalmau. He has also served on the scientific committees of major conferences, contributing to the academic community. He is a core member of the ALBCOM research group , a leading team at UPC focused on theoretical aspects of computer science, which provides a vibrant environment for research in algorithms, complexity, and formal methods. His work is also connected to the broader Institut de Matemàtiques de la UPC, fostering interdisciplinary collaboration between computer science and mathematics.
Tamon Stephen is a Professor in the Department of Mathematics at Simon Fraser University (SFU), part of the Faculty of Science. His research focuses on operations research, with an emphasis on combinatorial optimization, algorithms, discrete geometry, and computational biology. He holds a Ph.D. in Mathematics from the University of Michigan (2002). His work often bridges theoretical and computational aspects, addressing interdisciplinary applications. Stephen is affiliated with the Centre for Operations Research and Decision Sciences (CORDS) and has contributed to software tools for hypergraph transversals and colorful linear programming. He has taught courses such as Math 208W (Introduction to Operations Research) and has advised projects in metabolic network analysis and scheduling optimization. His office is located at the Surrey campus (SRYC 2886). Key research collaborations include studies on firefighter scheduling, nurse rostering, and metabolic pathway analysis. His methodologies often leverage algorithm design, polytope theory, and discrete mathematics. Stephen actively participates in academic service, organizing seminars and contributing to conferences such as the West Coast Optimization Meeting. His work emphasizes practical applications of theoretical results, with a focus on solving real-world optimization challenges.
Carles Padro Laimon is a Professor at the Universitat Politècnica de Catalunya (UPC), affiliated with the Department of Mathematics and the School of Telecommunications Engineering. He is a leading researcher in cryptography and information security, focusing on secret sharing schemes, combinatorial structures, and cryptographic protocols. His work integrates discrete mathematics, coding theory, and algorithmic design to address security challenges in digital systems. Padro leads the MAK Research Group (Mathematics Applied to Cryptography) and the ISG-MAK Information Security Group. He has been involved in numerous competitive research projects, including initiatives on post-quantum cryptography and secure multi-user systems. His contributions span over 211 documented activities, including articles, theses, and conference participations. His research interests include the theoretical foundations of cryptography, with a focus on optimizing secret sharing schemes, analyzing matroid-based structures, and developing secure communication protocols. He has collaborated extensively with institutions like the UPC and European research networks, contributing to both academic and practical advancements in cybersecurity. Padro holds a PhD in Mathematics from UPC and has supervised doctoral theses and mentored researchers in his field. His work frequently appears in top journals like IEEE Transactions on Information Theory, Designs, Codes and Cryptography, and SIAM Journal on Discrete Mathematics.
