جستجوی استاد راهنمای دانشگاهی

Toghrul Karimovمشاهده پروفایل

پژوهشگر

• Theoretical Computer Science
• Formal Verification
• Dynamical Systems
• +۳ مورد دیگر

Toghrul Karimov is a postdoctoral researcher at the Max Planck Institute for Software Systems (MPI-SWS) in Saarbrücken, Germany, working on the ERC Synergy Grant “DynAMiCs” since April 1, 2025. He collaborates with Valérie Berthé on decision problems at the intersection of dynamical systems theory, logic, and number theory. His educational background includes: Bachelor’s and Master’s degrees from the University of Oxford (2019) Doctoral degree from Saarland University and MPI-SWS (2024) Dr. Karimov’s research focuses on the algorithmic analysis of linear dynamical systems, with emphasis on decidability, verification, and computational complexity. His work bridges theoretical computer science with mathematical logic and number theory, particularly investigating reachability problems, linear recurrence sequences, and the application of o-minimal structures to verification. He employs techniques from automata theory and model theory to solve long-standing problems in the field. His publication record demonstrates consistent contributions to top-tier venues including LICS, ICALP, and SODA, with a clear trajectory toward resolving fundamental questions in dynamical systems verification. Recent work shows increasing sophistication in handling parametric systems and probabilistic extensions, while maintaining strong connections to number-theoretic foundations. His scientific recognition includes: Distinguished Paper Award at LICS 2024 ACM SIGBED Best Paper Award at HSCC 2024 Currently supported by the ERC Synergy Grant “DynAMiCs”, Dr. Karimov maintains an active collaborative research program without current student supervision. His work involves frequent co-authorship with leading researchers across MPI-SWS and IRIF, reflecting the highly interdisciplinary nature of his investigations. He contributes to MPI-SWS’s theoretical computer science research cluster, focusing on the mathematical foundations of software systems verification through the lens of dynamical systems and logic.

Olga Tveretinaمشاهده پروفایل

پژوهشگر

• Hybrid Dynamical Systems
• Automated Theorem Proving
• Constraint Solving
• +۲ مورد دیگر

Dr. Olga Tveretina is a Researcher in the Biocomputation Research Group within the Department of Computer Science at University of Hertfordshire's School of Physics, Engineering & Computer Science. She earned her PhD in Computer Science from Eindhoven University of Technology and MSc in Applied Mathematics from University of Tartu. Postdoctoral research included positions at University College Cork, Radboud University Nijmegen, and Karlsruhe Institute of Technology. Tveretina's research investigates decidability and complexity in hybrid dynamical systems, automated theorem proving, and constraint satisfaction frameworks. Current projects analyze reachability problems in low-dimensional systems and automatic differentiation algorithms. Her teaching covers computational models, algorithms, programming (Python/C++), and mathematical foundations for AI/robotics, emphasizing conceptual rigor and practical implementation.

Antonin Kuceraمشاهده پروفایل

استاد

• Stochastic Processes
• Probabilistic Systems
• Markov Decision Processes
• +۸ مورد دیگر

Antonin Kucera is a Professor at the Faculty of Informatics , Masaryk University, Czech Republic. His work focuses on stochastic processes, probabilistic systems, Markov decision processes, stochastic games, infinite-state systems, and applications of game theory in security and operational research. He has led multiple research projects funded by institutions like the US Army Research Office and the Czech Science Foundation. Research Interests : Stochastic processes, probabilistic verification, infinite-state systems, multi-objective optimization, game theory, and security applications. Projects : Leading studies on adversarial security patrolling, probabilistic systems analysis, and game-theoretic verification. Past projects include European Network for Game Theory (COST) and Institute for Theoretical Computer Science. Advising : Mentored 13 PhD/Master's students, including Tomáš Brázdil, Petr Novotný, and Jan Křetínský. Teaching : Courses on Petri Nets, Semantics of Programming Languages, and Mathematical Logic.

William Petterssonمشاهده پروفایل

پژوهشگر

• Operations Research
• Integer Programming
• Graph Theory
• +۶ مورد دیگر

Dr. William Pettersson is a Researcher at the School of Computing Science, University of Glasgow, focusing on optimization and algorithmic research. He leads projects like the EPSRC-funded IP-MATCH initiative, addressing resource allocation challenges such as kidney exchange and student-doctor hospital placement systems. His work bridges theoretical contributions (e.g., integer programming, graph decomposition) and practical software development, including the Regina topology tool and kep_solver for kidney exchange analysis. Prior to Glasgow, he specialized in parallel algorithms and combinatorial topology in Australia. Key Projects: IP-MATCH (EPSRC), Regina software, kidney exchange optimization Research Themes: Combinatorial optimization, parameterized complexity, high performance computing Publications span graph theory, operations research, and algorithm design, with notable contributions to kidney exchange program modeling and spatial correlation analysis. Active collaboration with Prof. David Manlove and international teams in healthcare and computational topology.

• Automata Theory
• Infinite-State Systems
• Theoretical Computer Science
• +۳ مورد دیگر

Wojciech Czerwiński is an Associate Professor at the Institute of Informatics, Faculty of Mathematics, Informatics and Mechanics of the University of Warsaw. His research focuses on automata theory and infinite-state systems, particularly addressing reachability problems in Vector Addition Systems (VASS) and related models. ERC Starting Grant Principal Investigator (2021-present) Organizer of Infinite Automata Workshop (2024) Co-organizer of Friday Afternoon Seminar Former editor of Delta popular science magazine (2013-2022) His research has produced significant results in computational complexity for VASS reachability, earning Best Paper Awards at CONCUR 2019 and STACS 2017. Current work explores separability problems, unambiguous systems, and structural properties of infinite-state models through the INFSYS ERC project. Key scientific contributions include determining the Ackermann-completeness of VASS reachability and developing new techniques for universality in unambiguous register automata. He actively participates in community-building efforts through workshops and seminars.

Todd Wimpfheimerمشاهده پروفایل

استاد

• Chemical Education
• Active Learning in Chemistry
• Inquiry-Based Learning
• +۲ مورد دیگر

Todd Wimpfheimer serves as a Professor in the Department of Chemistry and Physics at Salem State University, teaching courses including General Chemistry, Organic Chemistry, and Physical Chemistry from his office in Meier Hall 425C. He is reachable at 978.542.6238 or todd.wimpfheimer@salemstate.edu. His academic foundation includes: B.A. in Chemistry from Colgate University (1987) Ph.D. in Physical Chemistry from UCLA (1992) Professor Wimpfheimer specializes in chemical education innovation, focusing on student-active learning techniques like Guided Inquiry and ConcepTests. His research pioneers microscale laboratory methods to enhance accessibility and environmental sustainability in chemistry education, particularly targeting conceptual barriers in physical chemistry through hands-on, collaborative approaches that transform passive lectures into dynamic learning experiences. His publication trajectory since 2015 reveals a strategic shift toward gamified pedagogy, exemplified by chemistry-themed escape rooms that merge problem-solving challenges with core chemical principles. These immersive activities cultivate teamwork and critical thinking within time-constrained laboratory settings, demonstrating how game mechanics can demystify complex topics like quantum mechanics through applied scenarios such as the Schrödinger's Cat paradox. No major scientific awards (prizes, medals, or fellowships) were documented in the source material. His grant portfolio demonstrates sustained institutional investment in educational transformation: $70,000 Massachusetts Board of Higher Education grant (1999-2000) for campus-wide microscale laboratory conversion Salem State College Teaching and Learning Summer Grants (1999, 2007) totaling $1,750 for active-learning material development $2,400 Vice-President's Fund award (1999-2000) for community lead-paint analysis He has engineered specialized learning environments including microscale chemistry labs and narrative-driven escape rooms, where students apply theoretical knowledge to solve chemistry-based puzzles, effectively bridging abstract concepts with tangible experimental outcomes.

Paul C. Bellمشاهده پروفایل

مدرس ارشد

• Theoretical Computer Science
• Computability Theory
• Automata Theory
• +۲۲ مورد دیگر

Dr Paul C. Bell is a Reader in Computability and Automata Theory at the School of Computer Science and Mathematics, Liverpool John Moores University, UK. He has held academic positions at Keele University (Reader), Loughborough University (Lecturer), and the University of Liverpool (University Teacher). He completed his PhD at the University of Liverpool in 2007 and held postdoctoral positions at Université catholique de Louvain (Belgium) and the University of Turku (Finland). Current Affiliation: Liverpool John Moores University, School of Computer Science and Mathematics Previous Positions: Keele University (Reader), Loughborough University (Lecturer), University of Liverpool (University Teacher) Postdoctoral Experience: UCLouvain (Belgium), University of Turku (Finland) PhD: University of Liverpool, 2007 Paul C. Bell's research lies at the intersection of theoretical computer science and mathematics. His work focuses on foundational problems in computability, automata, and formal systems. Key areas include reachability in dynamical and hybrid systems, matrix semigroups, linear recurrence sequences, and algorithmic verification. He also explores quantum and probabilistic automata, Markov chains, Petri nets, and complexity in algebraic and logical systems. Additional interests span online algorithms, GPU computing, energy-aware scheduling, and computational geometry. His research is supported by grants from the Royal Society and London Mathematical Society, and he has received an NVIDIA hardware grant. He is an active supervisor, having guided four PhD students to completion and currently mentoring two more. He serves on the editorial board of The Computer Journal and is involved in numerous programme committees, including STACS and ICTCS-FAW. Royal Society International Exchange Grant Two London Mathematical Society travel grants NVIDIA hardware grant (2015) Dr Bell has supervised four PhD students to completion and is currently supervising two PhD candidates in Theoretical Computer Science and Pure Mathematics. He has served as an external examiner for MEng programmes at the University of Liverpool and for PhD theses at Loughborough, Liverpool, and Turku universities. He has received research grants and collaborates internationally, particularly with institutions in Belgium and Germany. He has organized major conferences such as RP 2021 and BCTCS 2014. Dr Bell has been involved in organizing significant academic events, including serving as co-chair of the 15th International Conference on Reachability Problems (RP 2021) in Liverpool, co-chair of BCTCS 2014, and organizer of a special session on Reachability Problems at Computability in Europe 2022. He has also served on multiple programme committees and as an organizing chair for ICIDM 2018 at LJMU.

• Automata Theory
• Logic in Computer Science
• Infinite-State Systems
• +۷ مورد دیگر

Wojciech Czerwiński is an Associate Professor at the Institute of Informatics, Faculty of Mathematics, Informatics and Mechanics, University of Warsaw. His research lies at the intersection of automata theory, logic, and computational complexity, with a focus on infinite-state systems such as vector addition systems (VASS) and Petri nets. His research interests include: Automata and logic Infinite-state systems Reachability and separability problems Complexity of computational models Formal verification and concurrency theory His recent work has significantly advanced the understanding of the complexity of reachability in VASS, proving it to be Ackermann-complete. This line of research has been published in top venues including FOCS, STOC, LICS, and CONCUR, where several papers received Best Paper Awards. His publications reflect a strong trend toward resolving long-standing open problems in decidability, complexity, and logical definability in infinite-state models. Scientific awards include: Best Paper Award, CONCUR 2022 Best Paper Award, STOC 2019 He leads an ERC-funded project and is actively recruiting PhD students and post-docs. He organizes the Friday Afternoon Seminar and co-organized the Infinite Automata Workshop (2024). He has also contributed to public understanding of science as an editor and author for the journal Delta from 2013 to 2022. His work involves collaboration with leading researchers such as Sławomir Lasota, Jérôme Leroux, Georg Zetzsche, and others. He has made foundational contributions to problems like bisimilarity, language equivalence, and regular separability in various automata models.

• Logic in computer science
• linear dynamical systems
• automated verification
• +۳ مورد دیگر

James Worrell is a Professor of Computer Science at the University of Oxford , with a focus on logic in computer science , linear dynamical systems , and automated verification . He is also a Fellow of Green Templeton College. His research spans theoretical computer science and formal methods , including work on metric temporal logic , probabilistic semantics , and category theory . His publications address decision problems , verification of linear dynamical systems , and automata theory . James has received the EPSRC Established-Career Fellowship for his work in linear dynamical systems verification . His recent papers include polynomial invariants , polyhedral escape problems , and skolem problem solutions . He has advised students such as Mehran Hosseini , Pascale Gourdeau , and Ventsislav Chonev , and teaches courses like Computational Learning Theory and Logic and Proof . His work appears in venues like ICALP , LICS , and SODA .

Neng-Fa Zhouمشاهده پروفایل

استاد

• Programming Languages
• Constraint Programming
• Logic Programming
• +۶ مورد دیگر

Neng-Fa Zhou is a Professor of Computer and Information Science at Brooklyn College and the Graduate Center of the City University of New York (CUNY). He holds a BS from Nanjing University (1984), and MS and PhD from Kyushu University (1988, 1991). Before joining CUNY, he served as an Associate Professor at Kyushu Institute of Technology (1991-1999) and held visiting positions at Yale, Alberta, Tokyo Tech, and Melbourne. Specializes in programming languages, constraint logic programming, and compiler design Developed Picat and B-Prolog languages with constraint-based graphics libraries Contributed to SAT encodings, multi-agent pathfinding, and declarative programming Scientific Awards: Most Practical Paper Award at PADL 2017 Award in ASP Solver Competition for BPSolver (2011)

• Computer Science Education
• Algorithms
• Graph Theory
• +۴ مورد دیگر

Eleni Akrida is an Associate Professor in the Department of Computer Science at Durham University and serves as Deputy Executive Dean (Academic Student Experience) in the Faculty of Science. She joined Durham in 2019 after studying Mathematics at Patra, Greece, and Computer Science at Liverpool, UK. Between 2020-2025, she held the role of Director of Undergraduate Studies for Computer Science. Research Focus Her research bridges theoretical computer science and education, with primary interests in: Computer Science Education : Pedagogical frameworks, neurodiversity inclusion, and abstraction skill development Algorithms & Complexity : Temporal networks, graph optimization, and stochastic processes Applied AI : Paraphrase generation/identification using deep learning She leads the Pedagogical Innovations in Computer Science and Algorithms & Complexity research groups. Publication Trends Recent works (2022-2025) demonstrate a dual focus: education research (developing pedagogical frameworks and addressing multi-track programming challenges) and technical innovations (temporal graph algorithms and NLP applications for plagiarism detection). Earlier work (2016-2021) established expertise in temporal network optimization and stochastic graph theory. Grants & Supervision Awarded grants include: CPHC Special Project (2025/26): Exploring Neurodivergent Student Experiences in UK CS Education CPHC Special Project (2022/23): Building a Theoretical CS Commons for hybrid learning She currently supervises postgraduate students Arwa Al saqaabi and Saira Richardson.

Qirun Zhangمشاهده پروفایل

دانشیار

• Program Analysis
• Programming Languages
• Software Engineering
• +۴ مورد دیگر

Qirun Zhang is the Catherine M. and James E. Allchin Early Career Associate Professor in the School of Computer Science at Georgia Institute of Technology. His research focuses on program analysis, compiler optimization, and formal language theory, with numerous publications in top-tier programming language and software engineering conferences including PLDI, POPL, OOPSLA, and FSE. He teaches courses on compilers, program analysis, and software testing. Dr. Zhang's research interests center on improving software reliability and security through advanced program analysis techniques. He approaches problems from perspectives including computational complexity, analytic combinatorics, graph theory, and formal languages. His work often bridges theoretical foundations with practical applications in compiler design and program verification. His recent publications show a strong focus on context-free language reachability, Dyck-language based analyses, and SMT solving techniques. His research demonstrates consistent innovation in making program analysis more precise while maintaining scalability, with applications ranging from debug information validation to software debloating and type inference. PLDI Distinguished Paper Award (2020) SIGSOFT Distinguished Paper Award (2023) OOPSLA Distinguished Artifact Award (2022) Dr. Zhang actively mentors PhD and MS students, with current advisees including Camille Bossut and Benjamin Mikek. His service to the academic community includes Artifact Evaluation Co-Chair roles for PLDI 2025 and 2026, and program committee membership for numerous top conferences including PLDI, POPL, and OOPSLA. He leads research projects including SLOT, Context-Free Language Reachability with Transitive Redundancy Elimination, and Debug Information Validation.

Olivier Serreمشاهده پروفایل

استاد

• theoretical computer science
• automata theory
• formal languages
• +۷ مورد دیگر

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.