Jan Dreier is a Research Fellow at the Institute of Logic and Computation at Vienna University of Technology. His research centers on structural graph theory and algorithmic meta-theorems, particularly exploring the boundaries of tractability for model checking problems. Dreier's work bridges theoretical computer science and discrete mathematics, focusing on graph decompositions, parameterized complexity, and logical expressiveness. Key research themes include monadic stability in graph classes, applications of model theory to computer science, and efficient algorithms for logical queries on structured graphs. His publication record shows consistent focus on graph sparsity concepts and algorithmic applications of logic, with recent work expanding into approximation methods for counting queries. Research demonstrates sophisticated applications of combinatorial methods to fundamental problems in computational complexity.
Kuldeep S. Meel is the Stephen Fleming Early-Career Associate Professor at the School of Computer Science, Georgia Institute of Technology, and an Associate Professor at the University of Toronto (on leave). He previously held a NUS Presidential Young Professorship at the National University of Singapore. His research focuses on automated reasoning, aiming to enable computing systems to handle uncertain real-world environments through scalable techniques integrating randomized algorithms, statistical inference, formal methods, distribution testing, and software engineering. Core research areas: Automated Reasoning, Formal Methods, Approximate Model Counting, Probabilistic Inference, Constraint Solving His research group has achieved significant recognition in both individual awards and publications. Key trends in his recent work include advancing model counting algorithms, developing frameworks for probabilistic explanations, and improving scalability in formal verification and constraint satisfaction. His tools have consistently ranked top in international competitions, demonstrating practical impact in automated reasoning. 2019 NRF Fellowship for AI 2022 ACP Early Career Researcher Award 2020 IEEE Intelligent Systems AI's 10 to Watch Top placements in Model Counting, SAT, and CAV competitions He mentors a diverse group of PhD and Master's students and collaborates with institutions worldwide. His group's publications span premier conferences in AI, formal methods, and design automation, reflecting interdisciplinary contributions to theoretical and applied computer science.
Shiyu Su is an Assistant Professor in the Department of Electrical and Computer Engineering at the University of Waterloo. His research focuses on high-speed data converters, wireless transceivers, digital phase-locked loops (PLL), and AI-assisted analog/mixed-signal design automation. He holds a Ph.D. from the University of Southern California (2019) and teaches courses such as ECE 340 (Electronic Circuits 2) and ECE 432 (Radio Frequency Integrated Devices and Circuits). Education: B.S. from Beijing University of Post and Telecommunication (China) and Queen Mary, University of London (UK), 2011; M.S. and Ph.D. from USC, 2013 and 2019, all in electrical engineering. Research Interests: High-speed ADCs/DACs RF/mm-wave transceivers Time-approximation filters (TAF) Analog/mixed-signal design automation Memristor-based computing Biomedical interfaces Key Awards: IEEE SSCS Predoctoral Achievement Award (2017–2018) Best Student Paper Award at IEEE RFIC (2022) Ming Hsieh Institute Scholar (2019–2020) Lab Focus: The Shiyu Su Lab develops integrated circuits for communications, sensing, and computing, with a focus on AI-driven methodologies and digital-analog co-design. Collaborations include work with Prof. Wei Wu (USC) on memristor-based systems.
Leslie Ann Goldberg is a Senior Research Fellow at St Edmund Hall and Professor of Computer Science at the University of Oxford. She currently serves as Head of the Department of Computer Science (on sabbatical 2025-26) and focuses on foundational problems in Algorithms and Complexity Theory , particularly randomised algorithms for network communication, machine learning, and statistical physics models. Her research includes solving Aldous' 1987 conjecture on backoff protocol instability (with John Lapinskas), developing rigorous mathematical analysis frameworks for algorithmic efficiency, and advancing approximate counting techniques via Markov Chain Monte Carlo methods (with Andreas Galanis and collaborators). Key projects involve graph homomorphisms , Moran process dynamics , and #BIS complexity class analysis. Recent publications (2023-2024) span topics like Sybil defense mechanisms, low-temperature sampling on random graphs, and parameterised subgraph counting modulo 2. Her work demonstrates cross-disciplinary impact in computational biology, statistical physics, and database theory. Scientific Awards include Best Paper Prizes at ICALP 2016, ICALP 2010, and IPEC 2017. She supervises PhD student Paulina Smolarova and collaborates extensively with researchers in Oxford and beyond.
Dr. Muhammad Rashed is an Assistant Professor in the Department of Computer Science and Engineering at the University of Texas at Arlington, within the College of Engineering. He holds a Ph.D. in Computer Engineering from the University of Central Florida (2024) and a B.S. in Electrical and Electronics Engineering from Bangladesh University of Engineering and Technology (2015). Ph.D. : Computer Engineering, University of Central Florida, 2024 B.S. : Electrical and Electronics Engineering, Bangladesh University of Engineering and Technology, 2015 His research focuses on electronic design automation (EDA), in-memory computing, AI acceleration, and sustainable computing. He explores novel computing paradigms to overcome the limitations of traditional architectures, particularly in data-intensive applications such as AI and scientific computing. His work emphasizes hardware-software co-design and leveraging emerging non-volatile memories for energy-efficient processing. The 15 most recent publications highlight a consistent focus on in-memory computing, particularly in path-based and flow-based architectures, logic synthesis, and AI acceleration. Key themes include optimization, fault tolerance, verification, and the use of advanced data structures like sentential decision diagrams. His work is published in top-tier venues such as DAC, ICCAD, ASP-DAC, and IEEE/ACM journals. Scientific Awards: UTA CARES Grant for OER Creation Research Experiences for Undergraduates (REU) Grant Alireza Seyedi Doctoral Research Innovation Endowed Scholarship David T. & Jane M. Donaldson Memorial Scholarship IEEE/ACM William J. McCalla ICCAD Best Paper Award Nomination Best Research Video Award, Design Automation Conference (DAC) Dr. Rashed advises several graduate and undergraduate students in the NextGen Computing Lab and is involved in research grants including the UTA CARES Grant and REU funding. He actively contributes to academic service through roles such as conference TPC member, journal reviewer (e.g., IEEE TCAD, ACM TODAES), and committee participation in the department and college. His lab, the NextGen Computing Lab, is dedicated to building scalable, energy-efficient computing systems for next-generation AI and scientific workloads, aligning with national initiatives in advanced computing.
Uzi Vishkin is a Professor at the University of Maryland's Institute for Advanced Computer Studies (UMIACS) and Department of Electrical and Computer Engineering, with additional affiliation in the Department of Computer Science. His work focuses on parallel computing, including the PRAM-On-Chip vision to bridge parallel algorithms and hardware. He holds a D.Sc. from Technion (1981), M.Sc. and B.Sc. in Mathematics from Hebrew University (1975/1974). Research interests span parallel algorithms, PRAM (Parallel Random Access Machine) architecture, machine learning applications, and pattern matching. His PRAM-On-Chip project aims to create a coherent computing stack for many-core processors. Vishkin has contributed to theoretical foundations and practical implementations, including the XMT architecture and compiler. He has been recognized with ACM Fellow (1996), Highly Cited Researcher (2003), and National Academy of Inventors Fellow (2024). Awards highlight his pioneering work in parallel algorithms and computing systems. Teaching spans courses like Parallel Algorithms and Mathematical Foundations for Computer Engineering. He emphasizes parallel algorithmic thinking in education and has developed teaching materials for high school and university levels. Key projects include the XMT architecture, simulations, and tools for parallel programming. His work integrates algorithmic theory with hardware design to address programming challenges in many-core systems.
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.
Sharad Malik is the George Van Ness Lothrop Professor of Engineering at Princeton University's Department of Electrical and Computer Engineering. His research focuses on designing functionally correct and secure computing systems, combining system design with mathematical modeling for verification. He pioneered the Instruction-Level Abstraction (ILA) model for SoC verification and has contributed extensively to Boolean satisfiability (SAT) solvers. Education: PhD (1990), M.S. (1987) in Computer Science from UC Berkeley; B.Tech. (1985) in Electrical Engineering from IIT Delhi. Research Interests: Formal Verification of Digital Systems Hardware Security and Trust Boolean Satisfiability Solvers System-on-Chip (SoC) Design Accelerator-rich Platform Architectures Notable Achievements: IEEE CEDA A. Richard Newton Technical Impact Award (2017) 2013 IEEE/ACM DAC Most Cited Paper Award Princeton President’s Distinguished Teaching Award (2009) Advising & Labs: Leads the Malik Group, advising over 50 graduate students and postdocs. Active in postdoc recruitment and mentorship programs.
John Wawrzynek is a Professor of Electrical Engineering and Computer Sciences at the University of California, Berkeley. He is affiliated with the Department of Electrical Engineering and Computer Sciences in the College of Engineering and serves as Co-Director of the Berkeley Wireless Research Center and Co-PI of the CONIX Research Center, one of the six centers in the Joint University Microelectronics Program sponsored by DARPA. Dr. Wawrzynek received his B.S. in Electrical Engineering from SUNY, Buffalo (1977), M.S. in EE from the University of Illinois, Urbana/Champaign (1979), and Ph.D. in Computer Science from Caltech (1987). Before joining the Berkeley faculty in 1988, he worked as a consultant at Schlumberger Palo Alto Research. His research focuses on Computer Architecture, Reconfigurable Computing, Wireless Systems, and Integrated Circuit and System Design . His work spans both theoretical foundations and practical implementations, with particular emphasis on FPGA-based computing systems, reconfigurable architectures, and wireless communication systems. His research group has made significant contributions to the field of reconfigurable computing, including the development of the Garp architecture and various tools for reconfigurable computing systems. Analysis of his recent publications (2022-2025) reveals continued focus on reconfigurable computing, FPGA design, wireless networking, and formal methods for hardware verification. His work shows an evolution from traditional computer architecture towards specialized hardware acceleration, machine learning for EDA, and wireless systems research, with particular emphasis on SAT sampling, differentiable computing, and efficient FPGA implementation of neural networks. DAC's Most Influential Paper Award (2025) NSF Presidential Young Investigator (PYI) (1989) Charles Lee Powell Fellowship (1985) NASA Certificate of Recognition (1983) Rensselaer Engineering and Science Medal (1975) Professor Wawrzynek has advised numerous graduate students throughout his career, many of whom have gone on to prominent positions in both industry and academia including Google, Xilinx, and MIT Lincoln Laboratory. His research has been supported by various grants from NSF, DARPA, and industry partners. He leads the Berkeley Wireless Research Center, which focuses on next-generation wireless communication systems and technologies, and is actively involved in the CONIX Research Center which explores connected intelligence at the network's edge.
Omar Rifki is an Associate Professor (Maître de Conférences) specializing in combinatorial optimization and artificial intelligence applications. His research bridges theoretical computer science with practical logistics challenges, focusing on routing problems, process mining, and machine learning integration for complex decision systems. His core research interests include phase transitions in NP-hard problems, vehicle routing optimization under time constraints, and healthcare process modeling. Rifki's work demonstrates a consistent pattern of integrating reinforcement learning with traditional optimization techniques to solve large-scale real-world problems in transportation and logistics, with particular emphasis on spatio-temporal data effects and collaborative systems. Analysis of his 15 publications (2019-2025) reveals three dominant research thrusts: (1) Fundamental studies of combinatorial problem hardness using phase transition frameworks, (2) Practical applications of deep reinforcement learning in vehicle routing and taxi assignment, and (3) Healthcare process optimization through advanced process mining techniques. His work consistently addresses scalability challenges in real-world implementations while maintaining theoretical rigor. No scientific awards were documented in the provided materials. His collaborative work with researchers like Christine Solnon and Thierry Garaix indicates active participation in European operations research communities, though specific grant details remain unreported. Rifki's research shows increasing integration of graph theory and machine learning in transportation applications, particularly evident in his Lyon City case studies on autonomous ride-sharing systems.
Xujie Si is an Assistant Professor in the Department of Computer Science at the University of Toronto. He is also a faculty affiliate at the Vector Institute and an affiliate member at Mila - Quebec AI Institute, holding a Canada CIFAR AI Chair. Previously, he served as an Assistant Professor at McGill University's School of Computer Science. Education: Ph.D., Computer and Information Science, University of Pennsylvania (advised by Mayur Naik) M.S., Computer Science, Vanderbilt University B.E. (with Honors), Nankai University Research Focus: His work bridges AI and program reasoning, emphasizing the integration of statistical and logical methods. Key areas include: Static analysis and verification using deep learning/reinforcement learning Neuro-symbolic systems for urban simulation (e.g., LogiCity) Automated theorem proving via LLMs and symbolic reasoning Program repair and compiler fuzzing Recent Article Trends: Recent work focuses on synergizing LLMs with symbolic reasoning (e.g., Olympiad inequality proving), advancing SAT solving with graph neural networks, and applying neuro-symbolic methods to Euclidean geometry formalization. Awards: Canada CIFAR AI Chair (2023) Lab/Teams: Leads research teams exploring program analysis, neuro-symbolic AI, and formal verification at the University of Toronto and Vector Institute.
Martin Müller is a Professor in the Department of Computing Science at the University of Alberta, where he conducts research in artificial intelligence, game theory, and heuristic search. He holds the Canada CIFAR AI Chair at Amii and is an Amii Fellow, underscoring his leadership in AI. His research group focuses on Monte Carlo tree search, reinforcement learning, combinatorial game theory, and automated planning, with applications in games such as Go, Hex, and NoGo. His research interests span Monte Carlo and exact methods in game-tree search , exploration in heuristic search and machine learning , and algorithms in combinatorial game theory . He has developed open-source software like MCGS (Minimax-based Combinatorial Game Solver) and contributes to game-playing systems such as Fuego for Go. His work bridges theoretical foundations with practical implementations in AI-driven game solvers. Recent publications show a strong trend in reinforcement learning , particularly in deep Q-learning, policy gradient methods, and anomaly detection in deep RL. His team also explores combinatorial game solving , sparse reward environments , and imperfect information games . The research integrates machine learning with classical AI techniques, emphasizing empirical validation and algorithmic innovation. Canada CIFAR AI Chair Amii Fellow Best student paper award at IEEE Conference on Games 2024 Best paper award at IEEE COG 2021 Outstanding paper award at AAAI-18 Faculty of Science Dissertation Award (2016) Dissertation Award from the Canadian Artificial Intelligence Association (2013) Müller has supervised numerous PhD and MSc students, including Hongming Zhang, Henry Du, and Timo Bertram, many of whose theses focus on game AI, reinforcement learning, and combinatorial optimization. He is funded by NSERC, Mitacs, and Compute Canada. His group collaborates on projects involving neural networks for game playing, SAT solving, and planning algorithms. He is currently on sabbatical but remains academically active, teaching a graduate course on combinatorial games in 2025 and hosting visiting researchers. His lab is involved in the development of MCGS, a solver for sum games, and contributes to open-source AI software. The team publishes regularly in top venues such as NeurIPS, ICML, AAAI, and IEEE Transactions on Games. Future work includes advancing combinatorial game solvers, improving deep RL robustness, and exploring generalization in game representations.
Fahiem Bacchus is a Professor in the Department of Computer Science at the University of Toronto, within the Faculty of Arts and Science. His research is centered on foundational problems in Artificial Intelligence, particularly in reasoning, representation, and algorithm design. Institution: University of Toronto School: Faculty of Arts and Science Department: Department of Computer Science Email: fbacchus@cs.toronto.edu His work spans key areas including constraint satisfaction, satisfiability (SAT), automated planning, Bayesian inference, and constraint optimization. He focuses on developing algorithms that exploit domain-specific knowledge and structural properties to improve performance. His research has led to significant contributions such as the TLPlan planning system, which won the AIPS2002 international planning competition, and the 2clseq SAT solver, which demonstrated that extensive binary clause reasoning can dramatically improve solver efficiency. His work on preprocessors like Hypre further advanced formula simplification techniques. The recent articles reflect a strong focus on improving search algorithms through richer reasoning mechanisms, particularly in SAT solving and non-clausal logic. His publications show a consistent trend toward enhancing DPLL-based solvers with advanced inference techniques, reducing search space through preprocessing, and leveraging structural knowledge in logical theories. No scientific awards are explicitly mentioned in the provided text. Bacchus has supervised research and developed educational materials, with involvement in teaching and academic conference organization. While specific grants are not listed, his software releases (2clseq, Hypre, NoClause) suggest externally supported research activity. He has contributed tutorials, talks, and online teaching resources, indicating an active role in academic dissemination and mentoring. His research group has produced several software systems available for non-commercial research use, including 2clseq, Hypre, and NoClause, reflecting a strong applied and experimental component to his work. These tools are used in SAT solving, preprocessing, and non-clausal reasoning, and are documented with detailed technical information and usage instructions.
Pierre Marquis is a distinguished Professor of Computer Science at Université d'Artois , affiliated with the Centre de Recherche en Informatique de Lens (CRIL-CNRS, UMR 8188) . Since December 2024, he has served as the vice-president for research and doctoral studies at Université d'Artois. His research focuses on Artificial Intelligence , particularly knowledge representation , automated reasoning , inconsistency handling , and knowledge compilation , with recent emphasis on Explainable AI (XAI) . Research Interests: Marquis's work spans foundational AI topics including abduction , induction , belief revision , and preference modeling . He has pioneered knowledge compilation techniques to optimize AI tasks and developed frameworks for reasoning under inconsistency through paraconsistent logics and argumentation. His EXPEKTATION chair (2020-2026) under France's national AI program drives his current focus on interpretable machine learning models. Scientific Awards: 2025: CNRS Silver Medal 2022: AAIA Fellow 2017: Senior Member of Institut Universitaire de France (IUF) 2009: EurAI (ECCAI) Fellow Doctoral Students: Mentoring Clément Lens (critical patient monitoring systems) and Mehdi Sabiri (data-knowledge integration for AI explanations). Collaborating with students like Louenas Bounia (formal XAI models) and Romain Wallon (pseudo-Boolean constraints). Grants & Projects: Leads the EXPEKTATION research chair (2020-2026) and participates in ANR PING/ACK (2019-2023), ANR THEMIS (2021-2025), CNRS IRP MAKC (2020-2024), and H2020 TAILOR (2020-2024). Previously led PIA4 MAIA (2023-2032) and Pint (2022-2023). Labs & Teams: Active in CRIL-CNRS, contributing to PyXAI (Python XAI library) and d4 (model counting), while mentoring teams on consensus belief merging and dynamic constraint processing .
Hans Tompits is an Associate Professor in the Department of Knowledge-Based Systems at Technische Universität Wien (Vienna University of Technology). His research focuses on computational logic, declarative logic programming, and formal methods, with a particular emphasis on Answer-Set Programming (ASP). He coordinates the Master's program in Logic and Computation and leads projects in areas such as formal methods for optimization, fault-tolerant autonomous systems, and algorithmic composition. His work bridges theoretical advancements with practical applications, including tools like SeaLion (an ASP IDE with debugging support) and dlvhex (an ASP-based semantic web reasoner). He has contributed to foundational topics like program equivalence, debugging techniques, and integration of ASP with external systems. His recent projects address challenges in autonomous vehicle architectures, music composition algorithms, and safety-critical system design. Tompits has published extensively on topics ranging from nonmonotonic reasoning and modal logics to the development of declarative programming tools. His interdisciplinary approach spans computer science, mathematics, and AI, with applications in both academic and industrial contexts.
