James Worrell

3.9k total citations
92 papers, 735 citations indexed

About

James Worrell is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Software. According to data from OpenAlex, James Worrell has authored 92 papers receiving a total of 735 indexed citations (citations by other indexed papers that have themselves been cited), including 78 papers in Computational Theory and Mathematics, 63 papers in Artificial Intelligence and 14 papers in Software. Recurrent topics in James Worrell's work include Formal Methods in Verification (49 papers), Logic, programming, and type systems (39 papers) and semigroups and automata theory (35 papers). James Worrell is often cited by papers focused on Formal Methods in Verification (49 papers), Logic, programming, and type systems (39 papers) and semigroups and automata theory (35 papers). James Worrell collaborates with scholars based in United Kingdom, Germany and France. James Worrell's co-authors include Joël Ouaknine, Franck van Breugel, Michael Mislove, Peter Johnstone, Stefan Kiefer, John Power, Hiroshi Watanabe, Michael Makkai, Claudio Hermida and Paul Hunter and has published in prestigious journals such as SHILAP Revista de lepidopterología, Mathematics of Computation and Journal of the ACM.

In The Last Decade

James Worrell

83 papers receiving 695 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
James Worrell United Kingdom	15	596	521	131	76	53	92	735
Franck van Breugel Canada	14	287 0.5×	276 0.5×	63 0.5×	47 0.6×	77 1.5×	43	583
Volker Diekert Germany	11	596 1.0×	372 0.7×	51 0.4×	46 0.6×	135 2.5×	82	702
Silvio Ghilardi Italy	19	711 1.2×	921 1.8×	60 0.5×	27 0.4×	18 0.3×	82	1.0k
Tarmo Uustalu Estonia	15	416 0.7×	631 1.2×	50 0.4×	72 0.9×	41 0.8×	85	692
Andrzej Tarlecki Poland	17	624 1.0×	829 1.6×	182 1.4×	26 0.3×	10 0.2×	57	947
Hans Zantema Netherlands	12	354 0.6×	487 0.9×	48 0.4×	15 0.2×	46 0.9×	78	573
Zoltán Ésik Hungary	18	1.0k 1.8×	952 1.8×	55 0.4×	64 0.8×	34 0.6×	161	1.2k
Murdoch J. Gabbay United Kingdom	15	916 1.5×	1.2k 2.4×	54 0.4×	25 0.3×	15 0.3×	60	1.3k
R. D. Tennent Canada	12	367 0.6×	656 1.3×	80 0.6×	31 0.4×	18 0.3×	37	745
Paweł Sobociński United Kingdom	12	193 0.3×	290 0.6×	115 0.9×	24 0.3×	15 0.3×	49	392

Countries citing papers authored by James Worrell

Since Specialization

Citations

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

Fields of papers citing papers by James Worrell

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of James Worrell

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

Cheval, Vincent, et al.. (2024). On Learning Polynomial Recursive Programs. Proceedings of the ACM on Programming Languages. 8(POPL). 1001–1027. 3 indexed citations

Berthé, Valérie, et al.. (2024). On the Decidability of Monadic Second-Order Logic with Arithmetic Predicates. SPIRE - Sciences Po Institutional REpository. 1–14. 1 indexed citations

Ouaknine, Joël, et al.. (2023). On the Zeros of Exponential Polynomials. Journal of the ACM. 70(4). 1–26. 1 indexed citations

Ouaknine, Joël, et al.. (2022). What’s decidable about linear loops?. Proceedings of the ACM on Programming Languages. 6(POPL). 1–25. 7 indexed citations

Ouaknine, Joël, et al.. (2021). Decision Problems for Second-Order Holonomic Recurrences. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations

Ouaknine, Joël, et al.. (2021). On the Complexity of the Escape Problem for Linear Dynamical Systems over Compact Semialgebraic Sets. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations

Ouaknine, Joël, et al.. (2020). On LTL Model Checking for Low-Dimensional Discrete Linear Dynamical Systems. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations

Fränzle, Martin, et al.. (2019). Effective Definability of the Reachability Relation in Timed Automata. arXiv (Cornell University). 2 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

10.

Forejt, Vojtěch, Petr Jančar, Stefan Kiefer, & James Worrell. (2018). Game Characterization of Probabilistic Bisimilarity, and Applications to Pushdown Automata. SHILAP Revista de lepidopterología. 2 indexed citations

11.

Jurdziński, Marcin, et al.. (2018). When is containment decidable for probabilistic automata. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 107. 14. 3 indexed citations

12.

Almagor, Shaull, et al.. (2018). O-Minimal Invariants for Discrete-Time Dynamical Systems. arXiv (Cornell University). 3 indexed citations

13.

Worrell, James, et al.. (2017). Revisiting reachability in timed automata. arXiv (Cornell University). 1–12. 1 indexed citations

14.

Benedikt, Michael, et al.. (2017). Polynomial automata: zeroness and applications. 1–12. 2 indexed citations

15.

Ouaknine, Joël & James Worrell. (2014). Positivity problems for low-order linear recurrence sequences. arXiv (Cornell University). 366–379. 17 indexed citations

16.

Ouaknine, Joël & James Worrell. (2013). Effective Positivity Problems for Simple Linear Recurrence Sequences.. arXiv (Cornell University). 1 indexed citations

17.

Ouaknine, Joël, et al.. (2012). A STATIC ANALYSIS FRAMEWORK FOR LIVELOCK FREEDOM IN CSP ∗. 4 indexed citations

18.

Ouaknine, Joël & James Worrell. (2007). On the decidability and complexity of Metric Temporal Logic over finite words. Logical Methods in Computer Science. Volume 3, Issue 1. 41 indexed citations

19.

Abdulla, Parosh Aziz, et al.. (2007). Zone-based universality analysis for single-clock timed automata. 98–112. 3 indexed citations

20.

Ouaknine, Joël & James Worrell. (2003). Timed CSP = closed timed ε-automata. Nordic journal of computing. 10(2). 99–133. 13 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