| LTL model checking of interval Markov chains M Benedikt, R Lenhardt, J Worrell Tools and Algorithms for the Construction and Analysis of Systems: 19th …, 2013 | 100 | 2013 |
| Complexity of two-variable logic on finite trees S Benaim, M Benedikt, W Charatonik, E Kieroński, R Lenhardt, ... ACM Transactions on Computational Logic (TOCL) 17 (4), 1-38, 2016 | 34 | 2016 |
| Gipfeli-high speed compression algorithm R Lenhardt, J Alakuijala 2012 Data Compression Conference, 109-118, 2012 | 26 | 2012 |
| Two variable vs. linear temporal logic in model checking and games M Benedikt, R Lenhardt, J Worrell CONCUR 2011–Concurrency Theory, 497-511, 2011 | 11 | 2011 |
| Model Checking Markov Chains Against Unambiguous Buchi Automata M Benedikt, R Lenhardt, J Worrell arXiv preprint arXiv:1405.4560, 2014 | 6 | 2014 |
| Tulip: Model checking probabilistic systems using expectation maximisation algorithm R Lenhardt Quantitative Evaluation of Systems: 10th International Conference, QEST 2013 …, 2013 | 6 | 2013 |
| Two variable and linear temporal logic in model checking and games R Lenhardt Oxford University, UK, 2013 | 5* | 2013 |
| Probabilistic automata with parameters R Lenhardt | 5 | 2009 |
| Two variable and linear temporal logic in model checking and games R Lenhardt Oxford University, UK, 2013 | 4 | 2013 |
| Verification of two-variable logic revisited M Benedikt, R Lenhardt, J Worrell 2012 Ninth International Conference on Quantitative Evaluation of Systems …, 2012 | 4 | 2012 |
| Controlling the depth, size, and number of subtrees for two-variable logic on trees S Benaim, M Benedikt, R Lenhardt, J Worrell arXiv preprint arXiv:1304.6925, 2013 | 2 | 2013 |
| Composite mathematical games R Lenhardt | 2 | 2007 |
| Proof of Concept: Fast Solutions to NP-problems by Using SAT and Integer Programming Solvers R Lenhardt arXiv preprint arXiv:1011.5447, 2010 | 1 | 2010 |
James WorrellProfessor of Computer Science, Oxford UniversityDirección de correo verificada de cs.ox.ac.uk
