Olaf Burkart

678 total citations
6 papers, 50 citations indexed

About

Olaf Burkart is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, Olaf Burkart has authored 6 papers receiving a total of 50 indexed citations (citations by other indexed papers that have themselves been cited), including 6 papers in Computational Theory and Mathematics, 5 papers in Artificial Intelligence and 1 paper in Computer Networks and Communications. Recurrent topics in Olaf Burkart's work include Formal Methods in Verification (5 papers), Logic, Reasoning, and Knowledge (3 papers) and Logic, programming, and type systems (2 papers). Olaf Burkart is often cited by papers focused on Formal Methods in Verification (5 papers), Logic, Reasoning, and Knowledge (3 papers) and Logic, programming, and type systems (2 papers). Olaf Burkart collaborates with scholars based in Germany and United Kingdom. Olaf Burkart's co-authors include Bernhard Steffen and has published in prestigious journals such as Theoretical Computer Science, Lecture notes in computer science and Electronic Notes in Theoretical Computer Science.

In The Last Decade

Olaf Burkart

6 papers receiving 46 citations

Peers

Olaf Burkart

CTM

AI

SOFTW

CNC

SP

Tamir Heyman Israel

Soonho Kong United States

Catherine Dufourd France

David Janin France

Naiyong Jin China

Nathan Wetzler United States

S. Akshay India

Pierre Réty France

Russell Harmer United Kingdom

Arnaud Sangnier France

Tamir Heyman Israel

Olaf Burkart

42 ×1.0

CTM

15 ×0.4

AI

28 ×1.3

SOFTW

6 ×1.0

CNC

0 ×0.0

SP

Citations per year, relative to Olaf Burkart Olaf Burkart (= 1×) peers Tamir Heyman

Countries citing papers authored by Olaf Burkart

Since Specialization

Citations

This map shows the geographic impact of Olaf Burkart's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Olaf Burkart with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Olaf Burkart more than expected).

Fields of papers citing papers by Olaf Burkart

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Olaf Burkart. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Olaf Burkart. The network helps show where Olaf Burkart may publish in the future.

Co-authorship network of co-authors of Olaf Burkart

This figure shows the co-authorship network connecting the top 25 collaborators of Olaf Burkart. A scholar is included among the top collaborators of Olaf Burkart based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Olaf Burkart. Olaf Burkart is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

6 of 6 papers shown

1.

Burkart, Olaf & Bernhard Steffen. (1999). Model checking the full modal mu-calculus for infinite sequential processes. Theoretical Computer Science. 221(1-2). 251–270. 12 indexed citations

2.

Burkart, Olaf. (1997). Model checking rationally restricted right closures of recognizable graphs. Electronic Notes in Theoretical Computer Science. 9. 25–25. 5 indexed citations

3.

Burkart, Olaf, et al.. (1997). Model-Checking of Infinite Graphs Defined by Graph Grammars. Electronic Notes in Theoretical Computer Science. 5. 16–16. 3 indexed citations

4.

Burkart, Olaf, et al.. (1997). More Infinite Results. Electronic Notes in Theoretical Computer Science. 5. 1–1. 5 indexed citations

5.

Burkart, Olaf. (1997). Automatic Verification of Sequential Infinite-State Processes. Lecture notes in computer science. 6 indexed citations

6.

Burkart, Olaf & Bernhard Steffen. (1995). Composition, decomposition and model checking of pushdown processes. Nordic journal of computing. 2(2). 89–125. 19 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact