Find Academic Supervisors

Axel PolleresView profile

Professor

• Semantic Web
• Knowledge Graphs
• Ontology Reasoning
• +7 more

Axel Polleres is a full professor at the Institute for Data, Process and Knowledge Management in Vienna University of Economics and Business (WU Wien). He leads the department of Information Systems and Operations Management while maintaining active research in knowledge graphs, semantic web technologies, and ontology engineering. PhD and Habilitation from Vienna University of Technology Former positions at University of Innsbruck, Universidad Rey Juan Carlos, DERI Ireland, and Siemens AG Co-chair of W3C SPARQL working group Editorial board member for Semantic Web Journal and IJSWIS His research focuses on: Querying and reasoning over ontologies Graph schema languages (SHACL, SPARQL) Wikidata constraint formalization Ontology reuse in collaborative platforms Crisis management knowledge graphs FAIR data principles implementation Recent publications analyze knowledge graph evolution, constraint validation methodologies, and semantic web standardization efforts. Key topics include: OWL/RDF interoperability solutions Unit conversion systems for Wikidata Partition-based query processing frameworks Network resilience analysis for urban planning Open data platform discovery tools Temporal analysis of collaborative knowledge graphs He has co-organized major conferences like ISWC2023 and ESWC workshops while maintaining active roles in European research projects. Current work involves spatiotemporal knowledge graphs for city resilience and semantic web infrastructure development.

• Database Theory
• Computational Logic
• Parameterized Complexity
• +4 more

Reinhard Pichler is a Full Professor at the Vienna University of Technology (TU Wien), affiliated with the Faculty of Informatics and the Department of Databases and Artificial Intelligence . His research focuses on Database Theory , Computational Logic , and Parameterized Complexity . He leads multiple research projects like DeConquer (2023–2027) and HyperTrac (2018–2022), addressing challenges in query optimization and hypergraph decompositions. He holds the prestigious START Prize (2014–2022) for young researchers. His work spans theoretical foundations (e.g., hypertree decompositions) and practical applications (e.g., SPARQL query processing systems like SparqLog). He contributes to academic governance, serving on faculty councils and curriculum commissions. His research innovations bridge algorithmic theory and real-world database systems, emphasizing efficient query evaluation and tractability analysis. Key contributions include advancing fractional hypertree decompositions , SPARQL query optimization , and consistent query answering . His projects often involve collaborations with industry and international funders like the Austrian Science Fund (FWF) and Vienna Science and Technology Fund (WWTF). He actively publishes in top venues like Journal of the ACM , ACM Transactions on Database Systems , and Proceedings of the VLDB Endowment . His academic leadership extends to course design, teaching advanced topics like Complexity Theory and Theoretical Computer Science . He mentors doctoral students and oversees research teams exploring cutting-edge areas like uncertain databases and cloud-based computational social choice .

• Algorithms
• Graph Neural Networks
• Problem decomposition techniques
• +4 more

Matthias Paul Lanzinger is an Assistant Professor at the Technische Universität Wien's Faculty of Informatics, Department of Database and Artificial Intelligence. His research focuses on algorithms, graph neural networks, hypergraph decomposition techniques, parameterized complexity, and computational logic. He leads projects like 'DeConquer' (Vienna Science Fund) and 'HyperTrac', exploring efficient query processing and hypergraph-based algorithms. Research interests include theoretical computer science, database systems, and applying logical frameworks to solve complex computational problems. Recent work emphasizes hypertree decompositions, fuzzy Datalog, and graph motif analysis via the Weisfeiler-Leman test. He co-edited the 2024 Datalog-2.0 workshop proceedings and has supervised students on topics like column-store performance and graph query languages. His publications span venues like ACM Transactions on Database Systems, ICLR, and IJCAI, highlighting contributions to algorithmic efficiency, database theory, and logical reasoning systems. Active in academic service, he teaches courses on database systems, scientific research, and advanced topics in informatics.

Vereshchagin Nikolay KonstantinovichView profile

Professor

• Computational Complexity
• Kolmogorov Complexity
• Shannon Entropy
• +2 more

Nikolay Konstantinovich Vereshchagin is a Professor at Lomonosov Moscow State University's Faculty of Mechanics and Mathematics. He also holds affiliations with the Poncelet Lab (since 2005), Yandex School of Data Analysis (since 2007), and Higher School of Economics (since 2013). Education: Moscow State University (Faculty of Mechanics and Mathematics) Degrees: Ph.D. (1987), Doctor of Physical and Mathematical Sciences (1996), Full Professor (1997) His research focuses on computational complexity, Kolmogorov complexity, Shannon entropy, and tiling problems. His work connects algorithmic information theory with machine learning, cryptography, and theoretical computer science. Publications demonstrate expertise in algorithmic statistics, oracle complexity, and randomness foundations, with collaborations in theoretical computer science journals and conferences like CiE (Computability in Europe).

Milo TovaView profile

Professor

• Database Management
• XML and Semi-Structured Information
• Data Integration
• +3 more

Tova Milo is a Full Professor and Head of the Department of Computer Science at Tel Aviv University, where she has held academic roles since 1995. She specializes in database systems, XML, data integration, and crowd-sourcing. Her research bridges theoretical foundations and practical applications in data management. Education: Ph.D. in Computer Science from Hebrew University (1992). She has led major initiatives such as the ERC Advanced Investigators grant (MoDaS project) and holds ACM Fellow status. She chairs key committees like the ACM SIGACT-SIGMOD PODS executive committee and has organized over 50 international conference programs. Research interests focus on database management, XML, data-centric business processes, and leveraging crowd-sourcing for data tasks. Her work has been recognized with the ACM PODS Test-of-Time Award (2010) and an IBM Faculty Award (2008). Grants and funding include over 20 awards from the European Union, US-Israel Binational Science Foundation, and industry partners like IBM and Microsoft. She contributes to editorial boards of ACM Transactions on Database Systems and The VLDB Journal.

• Theoretical Computer Science
• Complexity Analysis
• Automated Reasoning
• +4 more

Univ.-Prof. Dr. Georg Moser is a Professor in the Department of Computer Science at the University of Innsbruck. His research focuses on theoretical computer science, complexity analysis, automated reasoning, and formal methods. He leads the Theoretical Computer Science (TCS) group, with expertise in term rewriting systems, programming language semantics, and algorithmic learning theory. Key research areas include: complexity analysis of programs via rewriting techniques, automated tools for resource analysis (e.g., ATLAS), and foundational work on proof theory and logic. His work bridges theory and practice, addressing challenges in program verification and probabilistic systems. Selected publications (2021–2025) highlight advancements in reinforcement learning, quantum program analysis, and modular rule-based systems. He teaches courses like 'Discrete Mathematics' and 'Introduction to Theoretical Computer Science'.

• Formal Methods
• Program Synthesis
• Recursive Programming
• +3 more

Eva Maria Wagner is a PreDoc Researcher in the Department of Formal Methods in Systems Engineering at Vienna University of Technology (E192-04). Her contact email is eva.maria.wagner@tuwien.ac.at, and she works in Room HA0305 at Favoritenstrasse 9, Vienna. Education: Diploma Thesis (2024): Program synthesis of provable recursive functions, Technische Universität Wien Research Focus: Eva specializes in formal methods, program synthesis, and recursive programming. Her work bridges theoretical computer science with practical systems engineering, particularly in automated reasoning and software verification. Recent Publications: Her research explores the synthesis of recursive programs using saturation techniques and the development of provable recursive functions. These contributions align with advancements in automated deduction and formal verification.

Val TannenView profile

Professor

• Database Theory
• Programming Language Theory
• Data Provenance
• +5 more

Val Tannen is a Professor in the Department of Computer and Information Science (CIS) at the University of Pennsylvania, holding appointments since 1987. He has undertaken numerous visiting roles, including at Simons Institute (2023), EPFL (2020, 2011-2012), NUS (2019), and institutions in Greece, France, and elsewhere. Education: Polytechnic Institute of Bucharest (Engineer Diploma, 1977) MIT (PhD in Applied Mathematics/Computer Science, 1983-1987) His research spans database theory, programming language theory, logic, and applications to bioinformatics. Key contributions include provenance frameworks and complex object modeling , impacting data integration, uncertainty management, and systematic biology. Notable awards include ACM Fellowship , Mendelzon Test-of-Time Award , and NSF Presidential Young Investigator . His work has been disseminated through 30+ conference program committee roles and editorial contributions. Scientific Awards: 10 years Mendelzon Test-of-Time Award ACM Fellow 20 years Test-of-Time Award NSF Presidential Young Investigator

• Databases
• Database Theory
• Complexity Theory
• +2 more

Christoph Koch is an Associate Professor at Technische Universität Wien specializing in databases and artificial intelligence. His research spans database theory, complexity theory, and logic in computer science, with a focus on XML processing, query optimization, and parallel data science techniques. Lead projects: KnowledgeGraph (2020–2028), HINT (2012–2017), Weblearn (2005–2008) Developed the Lixto visual extraction system and contributed to DLV knowledge representation framework Supervised T. Lukasser's diploma thesis on XPath query processing

Berry GérardView profile

Professor

• Models of computation
• Programming language design
• Synchronous programming
• +5 more

Berry Gérard is a distinguished Professor at Collège de France, holding the Chair in Algorithms, Machines, and Languages since 2012. He previously served as Director of Research at INRIA Sophia Antipolis and Chief Scientist at Esterel Technologies. His academic journey includes roles at École des Mines de Paris and École Polytechnique. Gérard specializes in models of computation, programming language design, and synchronous systems. He has contributed significantly to the development of the Esterel language for embedded systems and formal verification techniques. Education: Docteur d’Etat in Mathematics, Université Paris VII (Computer Science option), 1979 Ingénieur des Mines, Corps National des Ingénieurs des Mines, 1970 École Polytechnique, 1967 Research Interests: Focuses on computational models (e.g., lambda-calculus, synchronous concurrency), programming languages (Esterel, Hop/HipHop), circuit synthesis, and formal verification. His recent work explores diffuse programming and web orchestration. Key Awards: 2014: Médaille d'or du CNRS 2005: Member, Académie des technologies 1993: Member, Academia Europaea 1979: Bronze Medal of CNRS Professional Roles: President of the Council of Education and Research at École Polytechnique Member of the Scientific Council of IRCAM Former President of the INRIA Evaluation Committee Labs/Teams: Active in INRIA’s Indes project on diffuse programming and collaborates with IRCAM on real-time music systems.

Markus KubaView profile

Professor

• Theoretical Computer Science
• Analysis of Algorithms
• Analytic Combinatorics
• +4 more

Markus Kuba is a Professor (FH-Professor) at FH-Technikum Wien in Vienna, Austria, where he leads the Department of Applied Mathematics and Physics. He holds a habilitation (Privatdozent) from TU Wien's Faculty of Mathematics and Geoinformation, granting him the venia docendi. He is also a teacher at HTL-Spengergasse, a higher technical institute, specializing in mathematics and computer science. His academic journey includes a PhD in Mathematics from TU Wien (2006) and a habilitation in 2013. His research focuses on theoretical computer science, analysis of algorithms, analytic combinatorics, and random structures. Notable specializations include tree structures, urn models, multiple zeta values, and SAT-problems. His work bridges combinatorial theory with practical applications in network analysis and stochastic processes. Key contributions include studies on urn models, tree growth models, and interdisciplinary projects like integrating traffic simulation tools. His publications span prestigious journals such as Theoretical Computer Science , Combinatorics, Probability and Computing , and Journal of Combinatorial Theory . Teaching spans secondary schools and universities of applied sciences since 2009, with a focus on mathematics and programming. Collaborations include co-authors from institutions worldwide, reflecting his active role in international academic networks.

Nikolaj PopovView profile

Research Professor

• Program Verification
• Symbolic Computation
• Formal Methods
• +3 more

Nikolaj Popov is a Research Professor at the Research Institute for Symbolic Computation (RISC) of Johannes Kepler University, Linz, Austria. His work focuses on program verification, formal methods, and automated reasoning, particularly within the Theorema system. He specializes in verifying functional and recursive programs, combining symbolic computation with logical techniques to ensure correctness and termination. Education: PhD in Computer Science, RISC, Johannes Kepler University (2008) Research Interests: Popov’s research bridges theoretical computer science and practical applications, emphasizing automated theorem proving, program analysis, and formal verification. He develops methods for verifying complex program structures like mutual recursion and nested recursion, leveraging computer algebra systems. His work also explores the integration of formal methods into software engineering workflows. Key Contributions: Popov has co-authored foundational papers on verification condition generation, termination proofs, and automated debugging frameworks. His collaborations with Tudor Jebelean and others have advanced Theorema’s capabilities in handling functional programs and bridging logical and algebraic methodologies. Labs/Teams: Core member of RISC, contributing to its mission in symbolic computation and mathematical theory exploration.

Hu ZhenjiangView profile

Professor

• Bidirectional Transformation
• Functional Programming
• Software Engineering
• +4 more

Zhenjiang Hu is a Chair Professor at Peking University, China, and previously held professorships at the National Institute of Informatics, University of Tokyo, and SOKENDAI. He specializes in bidirectional transformation, functional programming, and software engineering. His research focuses on foundational theories and applications in programming languages, including parallelization and formal methods. Education: BSc, Shanghai Jiao Tong University (1988) MSc, Shanghai Jiao Tong University (1991) PhD, University of Tokyo (1996) Research Interests: Development of bidirectional languages and frameworks Optimization of functional programs Automated parallelization techniques Formal verification of transformations Awards: Yangtze River Scholar (2015) ACM Distinguished Scientist (2016) Basic Research Achievement Award (2015) Multiple Best Paper Awards including Takahashi Awards (1997, 2008) Grants & Leadership: PI of 14 national grants totaling over 250 million Yen Founder and Chair of NII Shonan Meetings (2010-2018) Leadership roles in ICFP, MODELS, APLAS, and other top conferences Labs/Teams: Active in the NII Shonan Meetings, fostering collaborative research in informatics and software engineering.

Marc BezemView profile

Professor

• Proof theory
• Recursion theory
• Homotopy type theory
• +9 more

Marc Bezem is a Professor of Informatics at the University of Bergen since July 2000. His research spans mathematical logic, type theory, and automated reasoning, with significant contributions to proof theory, homotopy type theory, and logic programming. He has held visiting positions at Carnegie Mellon University and participated in the Univalent Foundations program at the Institute for Advanced Study in Princeton. Education: MSc (1981) and PhD (1986) in Mathematics from Utrecht University, supervised by Barendregt/van Dalen and Troelstra/van Dalen, respectively. Key Research: Isomorphy of type structures (ECF/ICF^E, HEO/HRO^E), strongly majorizable functionals, computational interpretation of univalence in homotopy type theory, and termination of logic programs. His work on bar recursion and cubical set semantics has influenced proof theory and type theory, with applications in proof mining and automated verification. He has collaborated extensively with Coquand, Berardi, Groote, and Ponse. Honors: Member of the School of Mathematics at the Institute for Advanced Study (2013). Leadership Roles: Co-editor of handbooks, editor of Indagationes Mathematicae , President of EACSL (1997-2002), and organizer of international conferences (TLCA, CSL, TYPES).

• Cyber-Physical Systems
• Formal Verification
• Probabilistic Systems
• +3 more

Francesco Pontiggia is a PreDoc Researcher at the Institute of Computer Engineering, Faculty of Informatics at TU Wien. His research focuses on formal verification of probabilistic systems, cyber-physical systems, and automated controller synthesis. He contributes to the ProbInG project (2020–2025), developing model checkers for probabilistic operator precedence languages and related formalisms. Key research interests include probabilistic hyperproperties, formal methods for probabilistic programming, and verification techniques for recursive stochastic systems. His work bridges theoretical foundations with practical tools such as POPACheck and POMC, targeting applications in automated planning and program analysis. Recent publications (2019–2025) emphasize advancements in model checking algorithms for probabilistic systems, operator precedence languages, and exception handling mechanisms. These works address challenges in verifying complex systems with stochastic behaviors and conditional probabilities. He collaborates on projects integrating formal methods with compiler design, runtime verification, and cyber-physical system design. His research has led to tool implementations and theoretical frameworks published in top-tier venues like QEST and ACM Transactions on Programming Languages and Systems.