Inferring Complexity Bounds from Recurrence Relations

Didier Ishimwe. Inferring Complexity Bounds from Recurrence Relations. In Satish Chandra 0001, Kelly Blincoe, Paolo Tonella, editors, Proceedings of the 31st ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering, ESEC/FSE 2023, San Francisco, CA, USA, December 3-9, 2023. pages 2198-2200, ACM, 2023. [doi]

Authors

Didier Ishimwe

This author has not been identified. Look up 'Didier Ishimwe' in Google