By Dr Paul Hunter

Conference Papers

Hunter P; Ouaknine J; Worrell J, 2013, 'Expressive Completeness for Metric Temporal Logic', in 2013 28TH ANNUAL IEEE/ACM SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS), IEEE, LA, Tulane Univ, New Orleans, pp. 349 - 357, presented at 28th Annual IEEE/ACM Symposium on Logic in Computer Science (LICS), LA, Tulane Univ, New Orleans, 25 June 2013 - 28 June 2013, http://dx.doi.org/10.1109/LICS.2013.41

Hunter P; Bouyer P; Markey N; Ouaknine J; Worrell J, 2010, 'Computing Rational Radical Sums in Uniform TC⁰', in Lodaya K; Mahajan M (ed.), IARCS ANNUAL CONFERENCE ON FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE (FSTTCS 2010), SCHLOSS DAGSTUHL, LEIBNIZ CENTER INFORMATICS, INDIA, Inst Math Sci, Chennai, pp. 308 - 316, presented at 30th International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), INDIA, Inst Math Sci, Chennai, 15 December 2010 - 18 December 2012, http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2010.308

Hunter P; Kreutzer S, 2007, 'Digraph Measures: Kelly Decompositions, Games, and Orderings', in PROCEEDINGS OF THE EIGHTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SIAM, LA, New Orleans, pp. 637 - 644, presented at 18th ACM-SIAM Symposium on Discrete Algorithms, LA, New Orleans, 07 January 2007 - 09 January 2007

Hunter P; Dawar A, 2005, 'Complexity bounds for regular games (Extended abstract)', in Jedrzejowicz J; Szepietowski A (ed.), MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2005, PROCEEDINGS, SPRINGER-VERLAG BERLIN, POLAND, Gdansk, pp. 495 - 506, presented at 30th International Symposium on Mathematical Foundations of Computer Science, POLAND, Gdansk, 29 August 2005 - 02 September 2005

Back to profile page