Pei Wu is an Assistant Professor in the field of Computer Science and Engineering, with a focus on theoretical and quantum computing research. Their work explores fundamental aspects of computational complexity, quantum information theory, and algorithm design. Their research interests span quantum entanglement, query complexity, and interactive coding, addressing challenges in unentangled quantum proofs, anti-concentration phenomena, and threshold degree analysis. Key contributions include advancements in understanding quantum computing limitations and optimal separations between randomized and quantum query complexities. Recent publications highlight collaborations with researchers like Jeronimo, Eldan, and Wigderson, appearing in prestigious venues such as the Computational Complexity Conference and ACM Symposium on Theory of Computing. Topics range from unentanglement-based disentanglers to near-optimal lower bounds in AC⁰ circuit complexity. Scientific awards and recognitions are not explicitly mentioned in the provided data. No details about educational background, grants, or laboratory affiliations are available in the scraped text.
José Manuel Vasconcelos Valério Carvalho is a Full Professor at the School of Engineering, University of Minho, and Senior Researcher at Algoritmi Research Center's SEOR R&D Group. His academic career spans decades with significant contributions to combinatorial optimization and operations research. His educational background includes: PhD in Production Engineering (Operational Research major) from University of Minho MSc in Industrial Engineering and Operations Research from Virginia Polytechnic Institute (Fulbright scholar) Research focuses on large-scale integer programming applications in cutting/packing, network design, and operations planning. He develops exact and heuristic algorithms for complex optimization problems, frequently integrating domains like bin packing with vehicle routing using arc-flow formulations and column generation. Recent publications (2016-2025) reveal strong trends toward integrated logistics solutions, emphasizing temporal aspects, multi-trip scenarios, and combined routing/packing challenges. His methodologies consistently yield robust formulations for real-world supply chain applications. He has supervised 7 postdoctoral and 12 PhD students, many achieving award-winning work. Research leadership includes coordination of FCT-funded national projects and European project workpackages. As core member of Algoritmi's SEOR Group and former coordinator of the SEOOR Research Line (consistently rated 'Excellent' by international panels), he contributes to Portugal's leading operations research team.
Rachid Guerraoui is a Moroccan-Swiss computer scientist and Full Professor in the School of Computer and Communication Sciences at EPFL. He is renowned for his significant contributions to distributed and concurrent computing, holding the prestigious Chair in Distributed Computing at the Collège de France (2018-19). As an ACM Fellow (2012) and recipient of the Dahl-Nygaard Senior Prize (2024), his work has shaped both theoretical foundations and practical implementations in distributed systems. Guerraoui earned simultaneous Master's degrees in Computer Engineering from École supérieure d'informatique électronique automatique (ESIEA) and in Computer Science from Pierre and Marie Curie University in 1989. He completed his PhD at Université d'Orsay in 1992 under the supervision of Christian Fluhr, with a dissertation titled "Programmation Répartie par Objets: Études et Propositions." Following postdoctoral research at EPFL, he joined the computer science faculty in 1999 after working at HP Labs and MIT. Guerraoui's research spans distributed computing, concurrent systems, transactional memory, and asynchronous algorithms. His work on establishing theoretical foundations of Transactional Memory, including the concept of opacity, has been highly influential. He has also made significant contributions to scalable information dissemination methods, asynchronous distributed computations, and the mathematical abstraction of indulgence. His research bridges theoretical rigor with practical implementations, as evidenced by systems like SwissTM and STMBench7. His publication record shows a clear evolution from theoretical foundations to practical implementations and broader applications. Early work focused on fundamental problems like consensus and renaming, while more recent publications address machine learning applications and public understanding of AI. The consistent thread throughout his career is a focus on making distributed systems more reliable, efficient, and accessible. Guerraoui has received numerous prestigious awards including: ACM Fellow (2012) ERC Advanced Grant Award (2013) Google Focused Award (2014) Middleware Best Paper Award (2014) Middleware 10-Years Best Paper Award Chair in Distributed Computing, Collège de France (2018-19) Dahl-Nygaard Senior Prize (2024) As an academic advisor, Guerraoui has mentored students including El Mahdi El Mahmdi, with whom he co-created the Wandida project - a collection of educational videos on computer science. His research has been supported by significant grants from the European Research Council and Google. Beyond research, Guerraoui actively participates in public discourse, particularly regarding computer science education and technology policy. Guerraoui leads the Distributed Computing Laboratory (DCL) at EPFL, which focuses on advancing the state of the art in distributed systems. The lab's work spans theoretical foundations, practical implementations, and educational outreach, reflecting Guerraoui's holistic approach to computer science research and education.
Bin Gao is an Associate Professor at the Academy of Mathematics and Systems Science (AMSS), Chinese Academy of Sciences. He holds a Ph.D. in Applied Mathematics (2019, University of Chinese Academy of Sciences) and a B.Sc. in Mathematics (2014, Sichuan University). His postdoctoral experience includes positions at UCLouvain (2019-2021) and the University of Münster (2021-2022). Research Interests: Riemannian optimization, tensor computation, parallel/distributed algorithms for orthogonality constraints, machine learning applications. Key Contributions: Development of retraction-free methods on Stiefel manifolds, preconditioned Riemannian algorithms, and geometric frameworks for symplectic eigenvalue problems. Article Trends: Recent work focuses on overcoming the curse of dimensionality via manifold-based optimization, including distributed algorithms for Stiefel manifolds, graph-regularized tensor completion, and second-order methods for symplectic structures. Keywords span numerical analysis, quantum information, and machine learning. Scientific Awards: 2021 Zhong Jiaqing Mathematics Award 2018 Best Student Paper Award (CSIAM) 2018 CAS Special President Scholarship 2017 National Scholarship for Doctoral Students (China) 2016 Honor Student Award (International Workshop on Modern Optimization and Application) Advising & Collaborations: Collaborates with researchers from UCLouvain, University of Münster, and AMSS. Mentors students in Riemannian optimization and tensor computation. Leads the popman research group.
Prof. Frits C.R. Spieksma is a full professor in the Department of Mathematics and Computer Science at Eindhoven University of Technology (TU/e) , where he leads research within the Combinatorial Optimization Group. He has held academic positions at Maastricht University, KU Leuven, and the University of British Columbia, and has been at TU/e since 2018. Education: M.Sc. in Econometrics, University of Groningen (1987) Ph.D. in Operations Research, Maastricht University (1992) Research Focus: His work lies at the intersection of combinatorial optimization and real-world applications . Key themes include: Scheduling and clustering problems, especially in sports tournaments Organ allocation optimization for Eurotransplant Assignment and transportation problems Approximation algorithms and graph-theoretic optimization Scientific Service & Leadership: Founder and ex-Chair, EURO Working Group OR in Sports Member, Steering Committees of MAPSP and MathSports International President, EURO (Association of European Operational Research Societies) Former Vice-President, IFORS Former President, Belgian Society of Operations Research (ORBEL) Editorial Boards: Associate Editor, 4OR (2015–present) Associate Editor, Journal of Quantitative Analysis in Sports (2014–present) Associate Editor, Operations Research Letters (2008–2024) Former Associate Editor, INFORMS Transactions on Education , OMEGA , Computers & Operations Research , IIE Transactions , Naval Research Logistics PhD Supervision & Mentoring: He has supervised more than 25 PhD theses at KU Leuven and TU/e, many of whom now hold academic positions worldwide. Conference & Workshop Organisation: Recent leadership roles include General Chair of IPCO 2022 (Eindhoven), organiser of Benders Day 2024 , and co-organiser of the Dagstuhl Seminar on Fairness in Scheduling and Resource Allocation (March 2025).
Michael Lampis is a Maître de conférences HDR (Assistant Professor) at LAMSADE , Universite Paris Dauphine. His research focuses on theoretical computer science , particularly in approximation algorithms , parameterized complexity , and graph algorithm design . He has held post-doctoral positions at Kyoto University and KTH, Stockholm, and earned his PhD from the Graduate Center of CUNY under Amotz Bar-Noy. Research Interests include: Structural Graph Parameters (treewidth, pathwidth, clique-width) Algorithmic Meta-Theorems Approximation Schemes Combinatorial Optimization Computational Complexity Recent Research Trends highlight his work on parameterized approximation algorithms for graph problems (e.g., feedback vertex set, matching) and complexity analysis of games/puzzles. His projects S-EX-AP-PE-AL (ANR JCJC), COAL-GAS (CNRS-PSL), and collaborations with Japanese institutions (PARAGA, GRAPA) emphasize cross-border innovation. Scientific Awards include: Best Student Paper Award at WG 2025 Best Paper Award at SOFSEM 2024 Advising involves PhD students Ioannis Katsikarelis, Louis Dublois, and Manolis Vasilakis, alongside Master's advisees like Edouard Nemery and Alban Guerbois. He actively participates in peer review for conferences (ICALP, ESA, STACS) and journals (Algorithmica, JCSS, DAM).
Piotr Hofman is an Assistant Professor at the Institute of Informatics, Faculty of Mathematics, Informatics and Mechanics , University of Warsaw. His research focuses on theoretical computer science, particularly automata theory, formal verification, and computational complexity related to systems with infinite alphabets and data constraints. PhD in Computer Science (2014) from the University of Warsaw under Sławomir Lasota. Postdoc (2013-2014) at University of Bayreuth with Wim Martens. Postdoc (2014-2016) at LSV de Cachan with Stefan Göller. His work explores algorithmic problems in automata over infinite alphabets, including one-counter nets, Petri nets with data, and unambiguous vector addition systems (VASS). Key contributions include decidability results for bisimulation and simulation problems, complexity bounds for equivalence checking, and novel techniques for reachability and coverability analysis. Recent publications address orbit-finite linear equations, Parikh's theorem for infinite alphabets, and lower bounds for coverability in pushdown VAS. He has received grants like NCN UMO-2016/21/D/ST6/01368 for algebraic invariants in data nets. He supervises research projects and collaborates with institutions in Poland, France, and India. His teaching includes concurrency theory and software engineering courses.
Scott J Aaronson is the David J. Bruton Jr. Centennial Professor of Computer Science at the University of Texas at Austin , where he explores the theoretical foundations of quantum computing and computational complexity theory . A pioneer in the field, he has bridged quantum physics, computer science, and mathematics to clarify the capabilities and limitations of quantum computers. A summa cum laude graduate of Cornell University and holder of a PhD from UC Berkeley , Aaronson has shaped public understanding through his popular blog Shtetl-Optimized , his book Quantum Computing Since Democritus , and TED Talks. His research has established critical insights into: Quantum Supremacy : Theoretical frameworks for experimental validation without full fault tolerance Cryptographic Security : Demonstrating quantum lower bounds for collision problems Classical Complexity : The invention of algebrization as a tool for complexity class analysis Awarded the ACM Prize in Computing (2020) , ACM Fellow (2019) , and the Simons Investigator Award , his work has been recognized as foundational to the digital age. He has also mentored graduate students in quantum complexity theory, with projects advancing topics like Boson Sampling , Forrelation , and Quantum Zero-Knowledge Protocols . Scientific Awards: ACM Prize in Computing (2020) ACM Fellow (2019) Tomassoni-Chisesi Prize in Physics (2018) Simons Investigator Award (2017) Alan T. Waterman Award (2012) Aaronson’s advocacy for Deep Zionism and reflections on AI’s existential implications reflect his broader engagement with ethics and societal impact in technology.
Alain Hertz is a Full Professor in the Department of Mathematics and Industrial Engineering at Polytechnique Montréal. He is affiliated with two major research centers: Institut de valorisation des données (IVADO) and Groupe d'études et de recherche en analyse des décisions (GERAD). His expertise spans operations research, management science, and algorithm development with applications across multiple industries. Professor Hertz specializes in combinatorial optimization, graph theory, algorithms, heuristics and metaheuristics. His research bridges theoretical mathematics with practical applications in scheduling, vehicle routing, and decision support systems. Recent work explores graph-based approaches for recommender systems and chemical graph theory, demonstrating the versatility of his mathematical frameworks. His publication record shows consistent output across top journals in operations research and graph theory. Recent articles (2021-2025) focus on extremal graph theory, chemical graphs, graph coloring variants, and applications of graph theory to recommender systems. This demonstrates both theoretical depth and practical relevance in his research trajectory. Prix de la ministre de l'Éducation, du Loisir et du Sport - Gouvernement du Québec (2011) Professor Hertz has supervised 13 doctoral students and 18 master's students, with thesis topics ranging from optimization methods for semi-supervised clustering to wind farm network design. His supervision approach emphasizes both theoretical foundations and practical applications, preparing students for careers in both academia and industry. His research has been supported by various grants enabling collaborative work with international partners. Through his affiliations with IVADO and GERAD, Professor Hertz contributes to interdisciplinary research initiatives that connect mathematical theory with real-world problems in data science, artificial intelligence, and industrial engineering.
Robin Rajamäki is a Visiting Professor in the Department of Information and Communications Engineering at Aalto University, Finland. He is affiliated with the Visa Koivunen Group and holds an ORCID ID (0000-0002-5028-6022). His academic credentials include a Doctor of Technology (Tekn. toht.) in Electrical Engineering (2021), a Master's in Engineering and Technology (2016), and a Bachelor's in Telecommunications Engineering (2014), all from Aalto University. Research interests focus on Sparse Arrays , Beamforming , ISAC (Integrated Sensing and Communications) , and Array Configuration models. His work explores optimal array geometries, waveform design, and identifiability guarantees in active sensing systems, with applications to MIMO radar, millimeter-wave communications, and future 6G networks. Key methodologies include statistical signal processing, machine learning, and computational optimization. Recent publications highlight advancements in generative deep synthesis , array geometry optimization , and sensor array applications in ISAC. His research spans 2015–2025, including 5 projects (e.g., FUN-ISAC, INSTINCT) and collaborations with institutions like the University of California, San Diego (2019–2020), Technion (2017–2018), and University of Pennsylvania (2016). Scientific Awards: Best Student Paper Award (3rd place, 2019) Projects include fundamental limits in ISAC, joint sensing-communications systems for immersive connectivity, and sparse antenna array processing for 6G and millimeter-wave applications. His work has been cited in Scopus and supported by the Academy of Finland and EU Horizon grants.
Olivier Serre is a CNRS Research Director working at the Institute for Research in Fundamental Computer Science (IRIF), a joint research unit of CNRS and University of Paris. Since September 2021, he serves as Deputy Scientific Director at the Institute for Information Sciences and Technologies (INS2I) at CNRS. His research focuses on theoretical computer science with particular emphasis on automata theory and formal verification frameworks. Dr. Serre completed his education at ENS Cachan (1999-2003) and earned his PhD in Computer Science from Paris-Diderot University (now University of Paris) in 2004. Following a postdoctoral position at RWTH Aachen, he joined LIAFA (now IRIF) as a research fellow in 2005 and became a CNRS Research Director in 2016. His academic journey reflects deep engagement with foundational theoretical problems and their practical verification applications. His research centers on automata theory and formal languages, with particular expertise in games and logic, infinite structures, and verification of higher-order functional programs. Dr. Serre has made significant contributions to collapsible pushdown systems, recursion schemes, and parity games, bridging theoretical foundations with practical applications in program verification. His work demonstrates exceptional depth in developing decision procedures for complex verification problems previously considered intractable. Dr. Serre's extensive publication record in premier theoretical venues shows consistent contribution to advancing the state of the art. His research trajectory reveals a clear evolution from foundational automata theory toward increasingly sophisticated systems involving higher-order computation and imperfect information, with notable breakthroughs in establishing decidability results for complex verification problems.
Daniel Wichs is a tenured Professor at the Khoury College of Computer Sciences at Northeastern University in Boston. He is a prominent researcher in the field of cryptography and serves as a Senior Scientist at NTT Research. His academic journey includes a PhD from New York University under Yevgeniy Dodis, a postdoctoral fellowship at IBM Research T.J. Watson, and degrees from Stanford University. Current Position: Professor at Northeastern University Prior Positions: IBM Josef Raviv Memorial Postdoctoral Fellow (2011-2013) Education: PhD NYU (2011), BS/MS Stanford (2005) Professor Wichs specializes in cryptography with research interests spanning computing on encrypted data, program obfuscation, lattice-based cryptography, information-theoretic cryptography, and foundational aspects of cryptography. He also maintains broad interests in computer security, algorithms, complexity theory, coding theory, and information theory. His research group includes current PhD students Manu Kondapaneni, LaKyah Tyner, and Ethan Mook, along with numerous successful alumni who have become professors at institutions worldwide. His recent publications demonstrate a strong focus on advanced cryptographic primitives including homomorphic encryption, zero-knowledge proofs, private information retrieval, and functional encryption. These works frequently appear at top-tier conferences like STOC, FOCS, CRYPTO, and EUROCRYPT, with several receiving best paper awards. His research often bridges theoretical foundations with practical applications in privacy-preserving computation. Best Paper at STOC 2023 Alfred P. Sloan Research Fellowship (2018) NSF CAREER Award (2018) J.P. Morgan Faculty Research Award (2022) IBM Postdoctoral Fellowship (2011-2013) Professor Wichs actively contributes to the academic community through service as Area Chair for CRYPTO 2025 and EUROCRYPT 2024, Program Chair for ITC 2020, General Chair for STOC 2016, and membership on numerous program committees. He teaches advanced courses including Foundations of Cryptography (CS 7810) and Theory of Computation (CS 3800), and has organized events like the Charles River Crypto Day and the Simons Summer Program in Cryptography 2025. His research group operates at the forefront of cryptographic theory, addressing fundamental questions about secure computation on encrypted data while developing practical cryptographic tools for real-world applications.
Thomas Rothvoss is a Professor at the University of Washington with a joint appointment in the Mathematics and Computer Science departments, conducting pioneering research at the intersection of theoretical computer science and discrete mathematics. His work has fundamentally advanced multiple subfields through breakthrough algorithmic developments. Rothvoss is renowned for solving longstanding problems including exponential lower bounds for extension complexity of combinatorial polytopes, optimal approximation algorithms for Steiner tree and bin packing, and efficient discrepancy minimization techniques. His recent focus on integer programming culminated in the first major running-time improvement in over 30 years, resolving a conjecture by Kannan and Lovász that had stood since 1988. His publication trajectory demonstrates consistent innovation in leveraging geometric and number-theoretic methods to solve NP-hard optimization problems, with recent work bridging lattice theory and algorithmic design to achieve breakthrough complexity results in integer programming. Professor Rothvoss has received top honors in theoretical computer science: Delbert Ray Fulkerson Prize (2018) Gödel Prize (2023) Best Paper Award at FOCS 2023 While specific advising relationships aren't detailed in available sources, his sabbatical collaborations—like the May-June 2025 engagement with CWI's Networks & Optimization group—reflect active mentorship within international research communities. His work continues to attract significant funding, evidenced by support for extended research visits from institutions like CWI. Rothvoss maintains strong ties with European research groups, particularly through his ongoing collaboration with CWI's Networks & Optimization team during sabbatical periods, where he develops lattice-based approaches to combinatorial optimization problems.
Thomas Ströder is a Lecturer in Business Informatics at FHDW University of Applied Sciences since 2022, specializing in software engineering and formal methods. Previously, he served as Head of Full Stack Development at METRO (2016-2019) and Site Manager at IT-P GmbH (2020-2022), combining academic research with industrial leadership in software development organizations. His educational background includes: Diploma in Computer Science with Business Administration minor from RWTH Aachen University (2004-2010), featuring an exchange semester at UNSW Sydney (2008) funded by the Studienstiftung des Deutschen Volkes PhD in Computer Science from RWTH Aachen University (2019) focused on automatic quality assurance and software synthesis Ströder's research bridges theoretical computer science and industrial software engineering through core interests in program verification, formal methods, and software architecture. His work emphasizes practical applications of automated reasoning for termination analysis, memory safety, and complexity bounds in real-world systems, while extending to organizational development and data-driven decision processes in agile environments. This dual focus enables translation of formal verification techniques into enterprise software solutions. His 15 publications (2009-2018) reveal a consistent trajectory in program termination analysis and verification, primarily through the AProVE framework. Early work established foundations in term rewriting and logic program analysis, evolving toward memory-safe C program verification and bitvector arithmetic handling. Publications in top venues like Journal of Automated Reasoning and TACAS demonstrate specialization in bridging theoretical formal methods with practical software engineering challenges, particularly in pointer arithmetic and memory manipulation contexts. Professional activities include research collaborations with Microsoft Research Cambridge (2013) and leadership in building in-house software development organizations at METRO, reflecting strong industry-academia integration in his career trajectory.
Umesh V. Vazirani is the Roger A. Strauch Professor of Electrical Engineering and Computer Science at the University of California, Berkeley, where he also serves as Director of the Berkeley Quantum Computation Center (BQIC). His academic journey began with a BS from MIT in 1981, followed by a PhD from UC Berkeley in 1986 under the supervision of Manuel Blum. With over three decades of contributions to theoretical computer science, Professor Vazirani has established himself as one of the founders of quantum computing. His research interests span multiple areas within theoretical computer science with a primary focus on quantum computing. Professor Vazirani's work encompasses quantum complexity theory, quantum algorithms, quantum information, computational complexity, and connections between quantum computation and other fields such as cryptography, game theory, and quantum gravity. His research has evolved from foundational work on quantum Turing machines and quantum complexity classes to contemporary investigations of quantum supremacy, verifiable quantum advantage, and certifiable randomness. Professor Vazirani has received numerous prestigious recognitions for his work, including: Election to the National Academy of Sciences (2018) Fulkerson Prize for outstanding papers in discrete mathematics (2012) ACM Fellow for contributions to theoretical computer science and quantum computation (2005) As an advisor, Professor Vazirani has mentored numerous successful students who have gone on to prominent positions in academia and industry. His current advisees include Jonah Sherman, Guoming Wang, Anupam Prakash, Urmila Mahadev, and Seung Woo Shin. His former students include notable researchers such as Scott Aaronson (MIT), Madhu Sudan (Harvard), Sanjeev Arora (Princeton), and Andris Ambainis (University of Latvia). His research has been consistently funded through various grants supporting quantum computing research, allowing him to maintain an active research group exploring fundamental questions in quantum information science. Professor Vazirani leads the Berkeley Quantum Computation Center, which serves as a hub for quantum information research at UC Berkeley, fostering collaboration between computer scientists, physicists, and engineers working on quantum technologies. The center supports research in quantum algorithms, quantum complexity, quantum error correction, and the theoretical foundations of quantum computing.
