Diarmuid Early

According to our database, Diarmuid Early authored at least 3 papers between 2008 and 2013.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of five.

2013

Running time of the Treapsort algorithm.

Diarmuid Early, Michel P. Schellekens

Theor. Comput. Sci., 2013

2012

Frugal Encoding in Reversible MOQA: A Case Study for Quicksort.

Diarmuid Early, Ang Gao, Michel P. Schellekens

Proceedings of the Reversible Computation, 4th International Workshop, 2012

2008

A tool for average and worst-case execution time analysis.

David Hickey, Diarmuid Early, Michel P. Schellekens

Proceedings of the 8th Intl. Workshop on Worst-Case Execution Time (WCET) Analysis, 2008