| Anonymous |
Tue 2008-04-01 16:27 |
|
also see treaps Nice writeup.
Your method (very roughly) reminds me a bit of using a treap data structure (randomized binary tree + heap) to store sorted data with efficient access to the soonest expiring item and also efficient O(log N) binary-tree data access.
http://www.cs.aau.dk/~csj/Papers/Files/2006_schmidtDASFAA.pdf
Steve Yen |
|
![[personal profile]](https://www.dreamwidth.org/img/silk/identity/user.png){kind=small}