World's Best Scientists 2026 revealed!

D-Index & Metrics

Mathematics

D-Index
40
Citations
5232
World Ranking
2095
National Ranking
141

Overview

James Worrell is affiliated with the University of Oxford in the United Kingdom and has contributed extensively to the field of Computer Science, with a focus on Computational Theory and Mathematics. Their work spans multiple subfields including Artificial Intelligence, Geometry and Topology, Software, and Statistical and Nonlinear Physics.

Their main research topics include:

  • Formal Methods in Verification
  • Semigroups and Automata Theory
  • Logic, Programming, and Type Systems
  • Polynomial and Algebraic Computation
  • Machine Learning and Algorithms
  • Computability, Logic, AI Algorithms
  • Advanced Algebra and Logic

Worrell has published frequently in venues such as arXiv (Cornell University), Leibniz-Zentrum für Informatik (Schloss Dagstuhl), Proceedings of the ACM on Programming Languages, Journal of the ACM, and Information and Computation.

Several recent papers co-authored by Worrell demonstrate a focus on theoretical computer science topics, including:

  • "What's decidable about linear loops?" (2022), Proceedings of the ACM on Programming Languages
  • "Probabilistic automata of bounded ambiguity" (2020), Information and Computation
  • "Deciding ω-regular properties on linear recurrence sequences" (2021), Proceedings of the ACM on Programming Languages
  • "On Strongest Algebraic Program Invariants" (2023), Journal of the ACM
  • "Markov chains and unambiguous automata" (2023), Journal of Computer and System Sciences

Frequent collaborators include Joël Ouaknine, Toghrul Karimov, Engel Lefaucheux, Florian Luca, and Mahsa Shirmohammadi, highlighting a pattern of sustained joint research efforts.

Best Publications

  • On the decidability of metric temporal logic

    J. Ouaknine;J. Worrell

  • Some Recent Results in Metric Temporal Logic

    Joël Ouaknine;James Worrell

  • Nets with Tokens which Carry Data

    Ranko Lazic;Tom Newcomb;Joël Ouaknine;A. W. Roscoe

  • A behavioural pseudometric for probabilistic transition systems

    Franck van Breugel;James Worrell

  • Towards Quantitative Verification of Probabilistic Transition Systems

    Franck van Breugel;James Worrell

  • On the decidability and complexity of Metric Temporal Logic over finite words

    Joël Ouaknine;James Worrell

  • On the language inclusion problem for timed automata: closing a decidability gap

    J. Ouaknine;J. Worrell

  • Positivity problems for low-order linear recurrence sequences

    Joël Ouaknine;James Worrell

  • On the final sequence of a finitary set functor

    James Worrell

  • An Algorithm for Quantitative Verification of Probabilistic Transition Systems

    Franck van Breugel;James Worrell

  • Tractable reasoning in a fragment of separation logic

    Byron Cook;Christoph Haase;Joël Ouaknine;Matthew Parkinson

  • Reachability in Succinct and Parametric One-Counter Automata

    Christoph Haase;Stephan Kreutzer;Joël Ouaknine;James Worrell

  • On metric temporal logic and faulty turing machines

    Joël Ouaknine;James Worrell

  • Terminal sequences for accessible endofunctors

    James Worrell

  • LTL model checking of interval markov chains

    Michael Benedikt;Rastislav Lenhardt;James Worrell

  • Revisiting digitization, robustness, and decidability for timed automata

    J. Ouaknine;J. Worrell

  • Approximating and computing behavioural distances in probabilistic transition systems

    Franck van Breugel;James Worrell

  • Axioms for Probability and Nondeterminism

    Michael W. Mislove;Joël Ouaknine;James Worrell

  • Decision problems for linear recurrence sequences

    Joël Ouaknine;James Worrell

  • On the complexity of computing probabilistic bisimilarity

    Di Chen;Franck van Breugel;James Worrell

Frequent Co-Authors

Joël Ouaknine
Joël Ouaknine Max Planck Institute for Software Systems
Michael Benedikt
Michael Benedikt University of Oxford
Nicolas Markey
Nicolas Markey French Institute for Research in Computer Science and Automation - INRIA
Patricia Bouyer
Patricia Bouyer University of Paris-Saclay
Jean-François Raskin
Jean-François Raskin Université Libre de Bruxelles
A. W. Roscoe
A. W. Roscoe University of Oxford
Laurent Doyen
Laurent Doyen École Normale Supérieure
Christel Baier
Christel Baier TU Dresden
Parosh Aziz Abdulla
Parosh Aziz Abdulla Uppsala University
Marta Kwiatkowska
Marta Kwiatkowska University of Oxford

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

For students pursuing Mathematics in the USA, there are several related online degrees that complement analytical and quantitative skills. A masters in digital marketing, for example, combines data-driven decision-making with business strategy, opening doors to marketing analytics and digital campaign management careers.

If you're interested in advancing your business acumen alongside your math expertise, consider enrolling in one of the cheapest 1 year online mba programs. These programs offer a fast-track way to boost leadership skills and management knowledge while balancing work or study commitments.

Many students wonder, can you transfer mba credits? The answer is yes, and this flexibility can save time and money when pursuing online MBAs, especially if you've completed relevant graduate coursework or certifications.

Additionally, data analysis programs are an excellent fit for math graduates aiming for careers in big data, machine learning, and statistical modeling. These specialized programs build on mathematical foundations to address real-world data challenges across industries.

Best Scientists Citing James Worrell

Trending Scientists