Diarmuid Early, Michel P. Schellekens. Running time of the Treapsort algorithm. Theoretical Computer Science, 487:65-73, 2013. [doi]
@article{EarlyS13,
title = {Running time of the Treapsort algorithm},
author = {Diarmuid Early and Michel P. Schellekens},
year = {2013},
doi = {10.1016/j.tcs.2013.03.012},
url = {http://dx.doi.org/10.1016/j.tcs.2013.03.012},
researchr = {https://researchr.org/publication/EarlyS13},
cites = {0},
citedby = {0},
journal = {Theoretical Computer Science},
volume = {487},
pages = {65-73},
}