جست‌وجوی استاد و پژوهشگر

Wei Liمشاهده پروفایل

استاد

• Mathematical Logic
• Concurrent Programming Languages
• Satisfiability Problems
• +۴ مورد دیگر

Wei Li is a Professor at the School of Computer Science and Engineering, Beihang University (since 1986), and Director of the State Key Laboratory of Software Development Environment (since 1992). He has held visiting positions at institutions including the University of Minnesota and Universität Saarlandes. Education: Ph.D. in Computer Science, University of Edinburgh (1979–1983) B.Sc. in Mathematics, Peking University (1961–1966) Research Interests span Mathematical Logic, Concurrent Programming Languages, Satisfiability Problems, Artificial Intelligence, Software Crowdsourcing, and Big Data. His work includes foundational contributions to logical frameworks for belief revision and specification evolution, with applications in software trustworthiness and constraint satisfaction. Publication Trends reveal a focus on formal methods (R-calculus, open logic systems), software crowdsourcing, and phase transitions in constraint satisfaction problems. His research integrates theoretical rigor with practical applications in information science and engineering. Scientific Awards include: Chinese Government Award for Publishing (2017) Tsiolkovsky Medal (2007) National Prize of First Class for Achievements in Education (2005) Ho Leung Ho Lee Prize (1998) Academician, Chinese Academy of Sciences (1997) He also supervised 8 post-docs, 52 Ph.D., and over 100 graduate students.

• Formal Verification
• Probabilistic Systems
• Game Theory
• +۵ مورد دیگر

Krishnendu Chatterjee is a Professor at the Institute of Science and Technology Austria (IST Austria) , Department of Computer Science. His research spans formal verification, probabilistic systems, game theory, and evolutionary dynamics, with over 300 peer-reviewed publications in top venues such as DISC, AAAI, LICS, PNAS, Nature , and Journal of the ACM . His research focuses on developing theoretical foundations and practical algorithms for analyzing complex systems, including Markov decision processes, stochastic games, probabilistic programs, and evolutionary models. He has made significant contributions to topics such as reachability analysis, termination of probabilistic programs, synthesis of controllers, and evolutionary game dynamics. Chatterjee's work is highly interdisciplinary, bridging computer science, mathematics, and biology. He has collaborated extensively with leading researchers worldwide and has been involved in editorial roles and program committees for major conferences in formal methods and theoretical computer science.

Günther Raidlمشاهده پروفایل

دانشیار

• Combinatorial Optimization
• Heuristic Optimization
• Metaheuristics
• +۷ مورد دیگر

Günther Raidl is an Associate Professor and Head of the Algorithms and Data Structures Group at the Institute of Computer Graphics and Algorithms, Faculty of Informatics, TU Wien. He holds a Dipl.-Ing. (1992), Ph.D. (1994), and Habilitation (2003) from TU Wien. His research focuses on combinatorial optimization, heuristic methods, and hybrid optimization techniques, addressing large-scale problems in transportation, network design, and cutting/packing. He leads a group of 1 PostDoc, 8 PhD candidates, and collaborates with institutions like the Vienna Graduate School on Computational Optimization (VGSCO). Education: Dipl.-Ing. in Computer Science (1992), TU Wien Ph.D. in Computer Science (1994), TU Wien Habilitation (2003), TU Wien Research Interests: Raidl’s work combines exact and heuristic optimization techniques, including mixed-integer programming, metaheuristics, and matheuristics. Applications span transportation systems (e.g., electric vehicle routing, bike-sharing systems), network design, and bioinformatics. His group leverages high-performance computing resources, such as the Vienna Scientific Cluster (VSC). Publications & Awards: Over 115 reviewed articles in journals/conferences like INFORMS Journal on Computing and Evolutionary Computation. Notable recognition includes the EvoStar 'Old Croc' Award (2012) for contributions to evolutionary computation. Advising & Grants: Supervises 8 funded PhD students and contributes to the Vienna Graduate School’s DK funding (€20,000/year for personnel and travel). Labs/Teams: Algorithms and Data Structures Group at TU Wien, collaborating with researchers like Monika Henzinger and Nysret Musliu.

Javier Esparzaمشاهده پروفایل

استاد

• Theoretical Computer Science
• Software Verification
• Model Checking
• +۹ مورد دیگر

Javier Esparza is a Professor and Chair of Foundations of Software Reliability and Theoretical Computer Science at the Technical University of Munich (TUM), Germany. He has held academic positions at several prestigious institutions including the University of Stuttgart, University of Edinburgh, and Technische Universität München since 1990. His work focuses on theoretical computer science with applications in software verification and formal methods. His educational background includes: M.S. in (Theoretical) Physics from the University of Zaragoza (Spain, 1987) Ph.D. in Computer Science from the University of Zaragoza (Spain, 1990) Habilitation in Computer Science from the University of Hildesheim (Germany, 1994) Professor Esparza's research interests span multiple areas of theoretical computer science and formal methods. He has made significant contributions to the fields of software verification, model checking, and Petri nets. His work on algorithms for the design and verification of reactive and distributed systems has been particularly influential. He has developed theoretical foundations and practical tools for analyzing systems with infinitely many states, pushing the boundaries of what can be formally verified. His research on formal models for distributed systems, particularly Petri nets and process algebras, has provided new insights into concurrency theory. Additionally, his work on the analysis of probabilistic systems and applications of linear and constraint programming to verification problems has opened new avenues for research. His recent publications demonstrate a continued focus on fundamental problems in verification and theoretical computer science, with particular emphasis on population protocols, model checking techniques, and theoretical foundations of distributed computing. His work bridges the gap between theoretical insights and practical applications in software reliability. His scientific achievements have been recognized with several prestigious awards: Doctor honoris causa in Informatics, Masaryk University (2009) Dissertation prize, University of Zaragoza (1990) TeachInf Award for best Bachelor course at TU München (2009) TeachInf Award for best Master course at TU München (2010) Diploma for excellent Teaching, TU München (2011) Member of Academia Europaea (2011) Professor Esparza has successfully advised numerous PhD students who have gone on to make their own significant contributions to computer science. His research has been consistently supported by competitive grants from major funding bodies including the German Research Council (DFG), the British Engineering and Physical Sciences Research Council, and the European Union. His research projects have often involved international collaborations, reflecting the global recognition of his work. He leads a vibrant research group at TUM focused on theoretical computer science and verification. The group has developed several influential software tools including Rabinizer, Peregrine, Owl, and Strix, which are widely used in both academia and industry for verification tasks. His group maintains strong collaborations with research institutions worldwide, particularly in Europe.

Emo Welzlمشاهده پروفایل

استاد

• Foundations of computer science
• Computational geometry
• Combinatorial models for optimization
• +۵ مورد دیگر

Emo Welzl has been a Full Professor of Computer Science at the Institute for Theoretical Computer Science, ETH Zurich since 1996. His academic journey spans institutions including Free University of Berlin, University of Denver, Rijks University Leiden, and collaborations through graduate programs like the Berlin-Zurich Graduate Program in 'Combinatorics, Geometry, and Computation'. 1996–Present: Full Professor of Computer Science, ETH Zurich 1987–1996: Full Professor of Mathematics (theory of computation), Free University of Berlin Education Diplom in Applied Mathematics, Graz University of Technology (1981) Ph.D. in Formal Languages, Graz University of Technology (1983) Habilitation in Foundations of Computer Science, Graz University of Technology (1988) Research Interests Welzl's work focuses on foundations of computer science , with emphasis on algorithms , data structures , and computational geometry . Key subfields include combinatorial optimization , randomized methods , and discrete geometry . His recent interests extend to satisfiability problems. Honours and Awards Max Planck Prize (1992) Gottfried Wilhelm Leibniz-Prize (1995) ACM Fellow (1998) Member of Leopoldina (2005), Academia Europaea (2006), and Berlin-Brandenburg Academy (2007) Service and Leadership He has chaired program committees for major conferences like the ACM Symposium on Computational Geometry (1995), ICALP (2000), and European Symposium on Algorithms (2007). He served on editorial boards of journals including the Journal of Discrete and Computational Geometry and ACM Transactions on Computation Theory .

Gregory Gutinمشاهده پروفایل

استاد

• Combinatorial Optimization
• Algorithms
• Graph Theory
• +۲ مورد دیگر

Gregory Gutin is a Professor of Computer Science at Royal Holloway, University of London, UK. He has held academic positions at Brunel University (Lecturer in Mathematics, 1996), Odense University (Visiting Lecturer in Computer Science, 1995; Postdoctoral Researcher, 1993), and was a PhD student at Tel Aviv University's School of Mathematics (1991). His career spans roles as a School Teacher in Gomel (Byelorussia, 1979), Researcher in Byelorussian institutions (1982-1987), and academic staff in the UK, Denmark, and Israel. He earned a PhD in Mathematics from Tel Aviv University, with prior research roles in Byelorussia (geology, oil, mathematics). His work bridges theoretical and applied computer science, focusing on combinatorial optimization, parameterized algorithms, and information security. Dr. Gutin's research centers on combinatorial optimization and parameterized algorithms , with applications in graph theory , constraint satisfaction , and access control in information security. His publications address arc routing problems, workflow satisfiability, and probabilistic methods for parameterized complexity, contributing both to foundational theory and practical implementations. His selected publications highlight a focus on fixed-parameter tractable algorithms for constraint satisfaction, arc routing in operations research, and access control mechanisms. These works solved open problems in algorithm design and influenced subsequent research in parameterized complexity and security systems. Best Paper Award at ACM SACMAT 2016 Best Paper Award at ACM SACMAT 2015 Royal Society Wolfson Research Merit Award 2014 Kirkman Medal 1996 Wolf Prize for PhD Students 1992 Dr. Gutin has collaborated extensively with researchers like Magnus Wahlstrom, Anders Yeo, and David Karapetyan. His work on workflow satisfiability introduced novel constraint classes used in access control systems, and he co-authored the influential textbook Digraphs: Theory, Algorithms and Applications (2009). The Royal Society award in 2014 recognized his sustained contributions to algorithmic research.

Kazuo Iwamaمشاهده پروفایل

استاد

• Stable Matchings
• Boolean Satisfiability
• Auction algorithms
• +۱۳ مورد دیگر

Kazuo Iwama is a Professor at the School of Informatics, Kyoto University, where he has been employed since 1997. He previously served as a Professor at Kyushu University's Department of Information Science (1992–1997) and held various academic positions, including Associate Professor and Visiting Associate Professor, at institutions such as Kyoto Sangyo University and UC Berkeley's Computer Science Division. Education Ph.D., Electrical Engineering, Kyoto University (1980) M.E., Electrical Engineering, Kyoto University (1975) B.E., Electrical Engineering, Kyoto University (1980) His research spans theoretical computer science, with a focus on algorithms, computational complexity, and quantum computing. Key areas include stable matchings, approximation algorithms, Boolean satisfiability, and quantum network coding. Scientific Awards 2008 Honorary Doctorate from University of Latvia 2005 Member, Science Council of Japan

Martin Rienerمشاهده پروفایل

مدرس ارشد

• Automated Theorem Proving
• Higher-Order Logic
• Formal Methods
• +۳ مورد دیگر

Martin Riener is a Senior Lecturer at the Department of Theory and Logic, Faculty of Informatics, TU Wien. His research focuses on automated theorem proving, higher-order logic, and formal methods. He contributes to the GAPT framework for proof theory and collaborates on the Vampire theorem prover. He has worked on projects like CERESω cut-elimination and TLAPM for TLA+. Education: PhD (2017) and MSc (2011) in Computer Science from TU Wien. Research projects include an Austrian Science Fund (FWF) project (2010–2012) on proof-theoretic applications of CERES. Teaching includes courses on programming fundamentals, digital systems, and formal modeling. He is involved in outreach activities explaining computer science concepts through unplugged activities for diverse age groups. Software contributions include GAPT, Vampire, and TLAPS. Contactable via three email addresses and ORCID: 0000-0001-8836-7808 .

• Algorithms
• Constraint Programming
• SAT Solving
• +۲ مورد دیگر

Florentina Voboril is a Research Fellow in the Algorithms and Complexity group at Technische Universität Wien. Her research explores how Large Language Models can solve Constraint Programming instances efficiently, with additional focus on SAT-solving and algorithm design. She investigates applications of AI in combinatorial optimization problems and develops innovative approaches to algorithmic challenges. Voboril has developed methods for SAT-based local improvement in string problems and generates streamlining constraints using LLMs. Her work bridges theoretical computer science with practical applications in computational biology and AI-assisted programming.

Katalin Fazekasمشاهده پروفایل

استادیار

• Formal Verification
• SAT Solving
• SMT Solving
• +۳ مورد دیگر

Katalin Fazekas is an Assistant Professor in the Formal Methods in Systems Engineering group at TU Wien. Her research focuses on improving incremental reasoning methods for SAT/SMT solvers and advancing formal verification techniques. She holds a PhD from the Johannes Kepler University Linz, supervised by Armin Biere. Education: PhD in Logical Methods in Computer Science (LogiCS), JKU Linz (2016–2021) Research Interests: Incremental SAT/SMT solving Formal verification of distributed systems Algorithm optimization for constraint solving Automated reasoning and proof generation Key Projects: INCR (2021–2024) : Austrian Science Fund (FWF) project on scalable verification via incremental reasoning REVEAL-AI and SLIM : Collaborative projects on AI-driven formal methods Awards: Hertha Firnberg Fellowship (FWF), 2021–2024 Tools Developed: CaDiCaL 2.0: Advanced SAT solver QSM: Quantified symmetric minimization framework for distributed protocols Lab/Affiliations: FORSYTE research group, TU Wien.

Neeldhara Misraمشاهده پروفایل

دانشیار

• Design and analysis of algorithms
• Computational social choice
• Parameterized complexity
• +۵ مورد دیگر

Neeldhara Misra is an Associate Professor in the Department of Computer Science & Engineering at the Indian Institute of Technology Gandhinagar (IITGN). She holds the Smt. Amba and Sri. V S Sastry Chair position. Prior to this, she served as an Assistant Professor at IITGN (2015–2021), and held an INSPIRE Faculty Fellowship at the Indian Institute of Science (2013–2015). Her research focuses on algorithm design, computational social choice, extremal combinatorics, and combinatorial game theory. Education : BSc in Mathematics from Mount Carmel College, Bangalore (2007) PhD in Theoretical Computer Science from The Institute of Mathematical Sciences, Chennai (2012) Research Interests : Her work spans parameterized complexity, algorithm design for combinatorial problems, and applications in social choice theory. Recent contributions include studies on equitable fair division, eternal vertex cover numbers in graphs, and efficient algorithms for graph problems like perfect matching cuts. Professional Activities : She has actively contributed to organizing conferences such as FSTTCS, IPEC, and AAMAS. Her work has been recognized with awards like the NASI Platinum Jubilee Young Scientist Award (2023). Awards : NASI Platinum Jubilee Young Scientist Award (2023) Grants & Advising : Details on grants or advising are not explicitly listed in the provided texts, though her involvement in interdisciplinary research and academic service is notable.

• Blockchain Technology
• Smart Contracts
• Security
• +۴ مورد دیگر

Gernot Salzer is an Associate Professor in the Department of Theory and Logic at Technische Universität Wien. His research focuses on Security of Blockchain Programs (Smart Contracts), Complexity Theory, and Automated Reasoning. He holds roles in curriculum commissions for Informatics and Computer Engineering. His work bridges formal methods with practical applications in blockchain technology, emphasizing vulnerability detection and formal verification. Salzer’s research interests include Constraint Satisfaction Problems, Formal Methods in Computer Science, and the intersection of computational complexity with blockchain systems. He actively contributes to the development of tools like SmartBugs 2.0 for analyzing smart contracts and has published extensively on topics such as automated weakness detection and Ethereum bytecode analysis. His recent publications highlight advancements in smart contract security, compiler vulnerability studies, and empirical evaluations of blockchain systems. Salzer has advised numerous students on projects related to smart contracts, blockchain vulnerabilities, and decentralized technologies. He has led grants from the Austrian Science Fund (FWF) and the Austrian Research Promotion Agency (FFG), focusing on constraint satisfaction and blockchain analysis. Salzer collaborates on projects like the development of decision support systems for dermatology and tools for configuration management using UML. His interdisciplinary approach integrates theoretical computer science with practical applications in distributed systems and security.

Leslie Ann Goldbergمشاهده پروفایل

استاد

• Algorithms
• Complexity Theory
• Randomized Algorithms
• +۶ مورد دیگر

Leslie Ann Goldberg is Professor of Computer Science at the University of Oxford and Senior Research Fellow at St Edmund Hall. She has held academic positions at the University of Liverpool (2006-2013) and the University of Warwick (1995-2006), and previously worked at Sandia National Labs (1992-1995). Currently serving as Head of Department (sabbatical planned for 2025-26), she leads research in theoretical computer science with focus on algorithms and complexity theory. Her research interests span algorithms for approximately counting and randomly sampling combinatorial structures , analysis of Markov-chain based sampling algorithms , complexity of counting , and stochastic processes in computer science . She specializes in randomized algorithms, particularly their mathematical analysis regarding runtime and accuracy. Current projects include contentions resolution via backoff protocols, random sampling and approximate counting algorithms, counting complexity theory, and analyzing processes on networks like the Moran process. Professor Goldberg has published over 100 papers in top theoretical computer science venues, with recent work focusing on spin systems, graph homomorphisms, subgraph counting, and network processes. Her publications show consistent output in premier venues including ICALP (where she has won three Best Paper Prizes), SODA, STOC, and RANDOM. ERC Advanced Grant 'Mapping the Complexity of Counting' (2014-2019) Best Paper Prize at ICALP 2012, 2010, and 2006 UK Distinguished Dissertations in Computer Science (1991-1992) She actively supervises PhD students and collaborates with researchers including Andreas Galanis, Marc Roth, John Lapinskas, and Paulina Smolarova. Her work bridges theoretical computer science with statistical physics, combinatorics, and network theory, with applications to database systems, evolutionary dynamics, and communication protocols.

Martina Seidlمشاهده پروفایل

استاد

• Artificial Intelligence
• Symbolic AI
• Quantified Boolean Formulas (QBF)
• +۳ مورد دیگر

Martina Seidl is a Professor at the Johannes Kepler University Linz , serving as Head of the Institute for Symbolic Artificial Intelligence . She leads research initiatives in formal verification, quantified Boolean formulas, and symbolic AI. Key Projects : Industrial problem solving using symbolic AI (2025–2026), Cluster of Excellence "Bilateral AI" (2024–2029), LOGTECHEDU (2018–2020) Leadership Roles : PhD Committee member at TU Wien, Associate Editor for the Artificial Intelligence Journal Her research focuses on automated reasoning , QBF solving , and formal methods in computer science. She has developed tools like PyQBF and Booleguru for propositional logic and constraint solving. Recent publications analyze semantic feature model differences, solution counting for QBF families, and tree-based model counters. She contributes to educational programs through lectures on formal models, SAT solving, and neurosymbolic AI. Scientific activities include organizing workshops like "Alles Logisch?" and participating in program committees. Current funded projects emphasize interdisciplinary AI applications and logic-based educational technologies.

• Information Systems
• Vocational Education and Training
• Knowledge Management
• +۳ مورد دیگر

Dr. Florian Fahrenbach is a Lecturer at the Knowledge Management Group at Vienna University of Economics and Business (WU Vienna). He teaches bachelor courses in the Process and Knowledge Management specialization (SBWL) on Knowledge-based Management and Organizational Learning. His academic journey began with a bachelor's degree in psychology from the University of Vienna, followed by a master's degree from MEi:CogSci, an interdisciplinary joint master program in Cognitive Science at the University of Vienna and Medical University of Vienna. He completed his doctorate at WU Vienna in September 2020 with honors, under the supervision of Prof. Dr. Alexander Kaiser. Dr. Fahrenbach's research focuses on the intersection of information systems research and vocational education and training. His doctoral research employed the design science research methodology to develop an assessment system for professional competences with the goal to support the validation of prior formal, non-formal and informal learning in the Austrian Skilled Crafts and Trades sector. His publications reveal a consistent thread of inquiry into knowledge management, organizational learning, professional competence assessment, and the validation of prior learning. His recent work has expanded into sustainability, organizational purpose during crises, and the development of tools for assessing transversal professional competences. His research demonstrates a strong methodological foundation in design science research, systems thinking, and ontology development. The analysis of his publication trends shows increasing focus on practical applications of knowledge management principles, particularly in the context of vocational education, organizational transformation, and sustainability. His work often involves interdisciplinary collaboration, particularly with colleagues in the Knowledge Management Group at WU Vienna. Doctorate with Honors from WU Vienna (2020) Dr. Fahrenbach has supervised or co-supervised numerous research projects focusing on knowledge management applications in vocational training, organizational learning processes, and competence assessment systems. His work has practical implications for the Austrian Skilled Crafts and Trades sector, particularly regarding the validation of prior learning. He has collaborated extensively with Prof. Dr. Alexander Kaiser and other members of the Knowledge Management Group at WU Vienna on various research initiatives and publications. His research activities are closely tied to the Knowledge Management Group at WU Vienna, where he contributes to both theoretical development and practical applications of knowledge management principles. His work bridges academic research with practical implementation in vocational education and organizational settings.