School of Computing

Publications by Dr Hugo Feree

Also view these in the Kent Academic Repository

Férée, H. (2017). Game semantics approach to higher-order complexity. Journal of Computer and System Sciences [Online] 87:1-15. Available at:
Férée, H. et al. (2015). Characterizing polynomial time complexity of stream programs using interpretations. Theoretical Computer Science [Online] 585:41-54. Available at:
Férée, H., Gomaa, W. and Hoyrup, M. (2014). Analytical properties of resource-bounded real functionals. Journal of Complexity [Online] 30:647-671. Available at:
Conference or workshop item
Férée, H. et al. (2018). Formal Proof of Polynomial-Time Complexity with Quasi-Interpretations. in: CPP 2018 - The 7th ACM SIGPLAN International Conference on Certified Programs and Proofs. ACM. Available at:
Férée, H., Hoyrup, M. and Gomaa, W. (2013). On the query complexity of real functionals. in: 28th ACM/IEEE Symposium on Logic in Computer Science. IEEE, pp. 103-112. Available at:
Total publications in KAR: 5 [See all in KAR]

School of Computing, University of Kent, Canterbury, Kent, CT2 7NF

Enquiries: +44 (0)1227 824180 or contact us.

Last Updated: 18/12/2018