Martin Kutrib
About
In The Last Decade
Martin Kutrib
90 papers receiving 492 citations
Peers
Comparison fields: 5 of 39
- Computational Theory and Mathematics 473
- Artificial Intelligence 337
- Molecular Biology 332
- Computer Networks and Communications 35
- Mechanical Engineering 17
Countries citing papers authored by Martin Kutrib
This map shows the geographic impact of Martin Kutrib'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 Martin Kutrib with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Martin Kutrib more than expected).
Fields of papers citing papers by Martin Kutrib
This network shows the impact of papers produced by Martin Kutrib. 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 Martin Kutrib. The network helps show where Martin Kutrib may publish in the future.
Co-authorship network of co-authors of Martin Kutrib
This figure shows the co-authorship network connecting the top 25 collaborators of Martin Kutrib. A scholar is included among the top collaborators of Martin Kutrib 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 Martin Kutrib. Martin Kutrib is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 0 | |
| 2 | 1 | |
| 3 | 1 | |
| 4 | Recent Trends in Descriptional Complexity of Formal Languages | 5 |
| 5 | The Size Impact of Little Iterative Array Resources. | 1 |
| 6 | 15 | |
| 7 | 22 | |
| 8 | State Complexity of NFA to DFA Conversion of Subregular Language Families. | 0 |
| 9 | 5 | |
| 10 | 1 | |
| 11 | Variable Complexity of Simple Programs | 0 |
| 12 | Descriptional Complexity of Deterministic Restarting Automata. | 2 |
| 13 | The Fault-Tolerant Early Bird Problem | 0 |
| 14 | 6 | |
| 15 | On the Descriptional Power of Heads, Counters, and Pebbles. | 1 |
| 16 | Space- and time-bounded nondeterminism for cellular automata | 1 |
| 17 | 1 | |
| 18 | Real-Time One-Way Pushdown Cellular Automata Languages. | 3 |
| 19 | The firing squad synchronization problem in defective cellular automata | 8 |
| 20 | Ein Satz über Free-Choice-Petrinetze. | 1 |
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.