At http://cstheory.stackexchange.com/questions/1539/whats-new-in-purely-functional-data-structures-since-okasaki http://cstheory.stackexchange.com/questions/15

At http://cstheory.stackexchange.com/questions/1539/whats-new-in-purely-functional-data-structures-since-okasaki http://cstheory.stackexchange.com/questions/1539/whats-new-i... I found a reference to Skip-trees, an alternative data structure to Skip-lists in a concurrent approach[1] by Xavier Messegue (1997). [1] http://www.lsi.upc.edu/~peypoch/investigacio/reports.dir/RAIRO.ps.gz http://www.lsi.upc.edu/~peypoch/investigacio/reports.dir/RAI...