Richard Mayr

2.9k total citations
44 papers, 505 citations indexed

About

Richard Mayr is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Software. According to data from OpenAlex, Richard Mayr has authored 44 papers receiving a total of 505 indexed citations (citations by other indexed papers that have themselves been cited), including 37 papers in Computational Theory and Mathematics, 24 papers in Artificial Intelligence and 10 papers in Software. Recurrent topics in Richard Mayr's work include Formal Methods in Verification (33 papers), Logic, programming, and type systems (13 papers) and Petri Nets in System Modeling (12 papers). Richard Mayr is often cited by papers focused on Formal Methods in Verification (33 papers), Logic, programming, and type systems (13 papers) and Petri Nets in System Modeling (12 papers). Richard Mayr collaborates with scholars based in United Kingdom, Germany and Sweden. Richard Mayr's co-authors include Javier Esparza, Antonı́n Kučera, Alain Finkel, Tobias Nipkow, Parosh Aziz Abdulla, Noomene Ben Henda, Petr Jančar, Ahmed Bouajjani, Peter Habermehl and Lorenzo Clemente and has published in prestigious journals such as SHILAP Revista de lepidopterología, Theoretical Computer Science and Journal of Computer and System Sciences.

In The Last Decade

Richard Mayr

40 papers receiving 470 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Richard Mayr United Kingdom	11	408	316	113	93	31	44	505
Philippe Schnoebelen France	7	267 0.7×	233 0.7×	108 1.0×	50 0.5×	30 1.0×	20	385
Kārlis Čerāns Latvia	7	209 0.5×	175 0.6×	88 0.8×	71 0.8×	20 0.6×	29	321
Stéphane Demri France	12	466 1.1×	512 1.6×	91 0.8×	70 0.8×	21 0.7×	63	611
Jiřı́ Srba Denmark	9	231 0.6×	186 0.6×	67 0.6×	85 0.9×	12 0.4×	68	353
Antoni Mazurkiewicz Poland	7	329 0.8×	209 0.7×	30 0.3×	109 1.2×	31 1.0×	18	412
C.A. Middelburg Netherlands	8	264 0.6×	226 0.7×	50 0.4×	68 0.7×	14 0.5×	66	350
Jan Małuszyński Sweden	13	247 0.6×	415 1.3×	118 1.0×	87 0.9×	10 0.3×	43	527
Ruurd Kuiper Netherlands	10	306 0.8×	272 0.9×	105 0.9×	82 0.9×	24 0.8×	40	417
Adriano Peron Italy	10	196 0.5×	206 0.7×	62 0.5×	90 1.0×	8 0.3×	66	361
Rob Gerth Netherlands	11	391 1.0×	247 0.8×	186 1.6×	64 0.7×	17 0.5×	29	453

Countries citing papers authored by Richard Mayr

Since Specialization

Citations

This map shows the geographic impact of Richard Mayr'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 Richard Mayr with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Richard Mayr more than expected).

Fields of papers citing papers by Richard Mayr

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Richard Mayr. 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 Richard Mayr. The network helps show where Richard Mayr may publish in the future.

Co-authorship network of co-authors of Richard Mayr

This figure shows the co-authorship network connecting the top 25 collaborators of Richard Mayr. A scholar is included among the top collaborators of Richard Mayr 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 Richard Mayr. Richard Mayr 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:

20 of 20 papers shown

Kiefer, Stefan, et al.. (2024). Strategy Complexity of Reachability in Countable Stochastic 2-Player Games. Dynamic Games and Applications. 15(3). 980–1036.

Mayr, Richard, et al.. (2023). Strategy Complexity of Point Payoff, Mean Payoff and Total Payoff Objectives in Countable MDPs. Logical Methods in Computer Science. Volume 19, Issue 1. 1 indexed citations

Clemente, Lorenzo & Richard Mayr. (2019). Efficient reduction of nondeterministic automata with application to language inclusion testing. SHILAP Revista de lepidopterología. 5 indexed citations

Mayr, Richard, et al.. (2018). Model Checking Flat Freeze LTL on One-Counter Automata. Logical Methods in Computer Science. Volume 14, Issue 4. 1 indexed citations

Kiefer, Stefan, et al.. (2017). Parity objectives in countable MDPs. 1–11. 1 indexed citations

Mayr, Richard, et al.. (2017). MDPs with energy-parity objectives. 1–12. 1 indexed citations

Kučera, Antonı́n & Richard Mayr. (2017). A generic framework for checking semantic equivalences between pushdown automata and finite-state automata. Journal of Computer and System Sciences. 91. 82–103. 2 indexed citations

Lasota, Sławomir, et al.. (2016). Simulation Problems Over One-Counter Nets. Logical Methods in Computer Science. Volume 12, Issue 1. 5 indexed citations

Mayr, Richard & Parosh Aziz Abdulla. (2013). Priced Timed Petri Nets. Logical Methods in Computer Science. Volume 9, Issue 4. 4 indexed citations

10.

Göller, Stefan, et al.. (2009). On the Computational Complexity of Verifying One-Counter Processes. Edinburgh Research Explorer. 235–244. 11 indexed citations

11.

Abdulla, Parosh Aziz, Noomene Ben Henda, Richard Mayr, & Sven Sandberg. (2006). Eager Markov Chains. KTH Publication Database DiVA (KTH Royal Institute of Technology).

12.

Abdulla, Parosh Aziz, Noomene Ben Henda, Susanne Sandberg, & Richard Mayr. (2006). Limiting Behavior of Markov Chains with Eager Attractors. Edinburgh Research Explorer. 1785. 253–264. 4 indexed citations

13.

Esparza, Javier, Antonı́n Kučera, & Richard Mayr. (2004). Model checking probabilistic pushdown automata. arXiv (Cornell University). 2. 12–21. 58 indexed citations

14.

Mayr, Richard. (2003). Undecidable problems in unreliable computations. Theoretical Computer Science. 297(1-3). 337–354. 41 indexed citations

15.

Bouajjani, Ahmed, Peter Habermehl, & Richard Mayr. (2003). Automatic verification of recursive procedures with one integer parameter. Theoretical Computer Science. 295(1-3). 85–106. 11 indexed citations

16.

Kučera, Antonı́n & Richard Mayr. (2002). Why is simulation harder than bisimulation. 2 indexed citations

17.

Kučera, Antonı́n & Richard Mayr. (2002). Simulation Preorder over Simple Process Algebras. Information and Computation. 173(2). 184–198. 8 indexed citations

18.

Kučera, Antonı́n & Richard Mayr. (2002). Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time. Theoretical Computer Science. 270(1-2). 677–700. 9 indexed citations

19.

Jančar, Petr, Antonı́n Kučera, & Richard Mayr. (2001). Deciding bisimulation-like equivalences with finite-state processes. Theoretical Computer Science. 258(1-2). 409–433. 22 indexed citations

20.

Mayr, Richard & Tobias Nipkow. (1998). Higher-order rewrite systems and their confluence. Theoretical Computer Science. 192(1). 3–29. 55 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