Skip lift: A probabilistic alternative to red-black trees. Bose, P., Douïeb, K., & Morin, P. J. Discrete Algorithms, 14:13-20, 2012.
Link
Paper bibtex @article{ journals/jda/BoseDM12,
added-at = {2012-06-19T00:00:00.000+0200},
author = {Bose, Prosenjit and Douïeb, Karim and Morin, Pat},
biburl = {http://www.bibsonomy.org/bibtex/27b326472109ab0817945e2799a425c30/dblp},
ee = {http://dx.doi.org/10.1016/j.jda.2011.12.017},
interhash = {c3bff02fefdc087b02376059eccc1318},
intrahash = {7b326472109ab0817945e2799a425c30},
journal = {J. Discrete Algorithms},
keywords = {dblp},
pages = {13-20},
title = {Skip lift: A probabilistic alternative to red-black trees.},
url = {http://dblp.uni-trier.de/db/journals/jda/jda14.html#BoseDM12},
volume = {14},
year = {2012}
}
Downloads: 0
{"_id":{"_str":"5398bffe77ca42a101001d70"},"__v":2,"authorIDs":["54805c31a29145d03f000f97"],"author_short":["Bose, P.","Douïeb, K.","Morin, P."],"bibbaseid":"bose-doueb-morin-skipliftaprobabilisticalternativetoredblacktrees-2012","bibdata":{"added-at":"2012-06-19T00:00:00.000+0200","author":["Bose, Prosenjit","Douïeb, Karim","Morin, Pat"],"author_short":["Bose, P.","Douïeb, K.","Morin, P."],"bibtex":"@article{ journals/jda/BoseDM12,\n added-at = {2012-06-19T00:00:00.000+0200},\n author = {Bose, Prosenjit and Douïeb, Karim and Morin, Pat},\n biburl = {http://www.bibsonomy.org/bibtex/27b326472109ab0817945e2799a425c30/dblp},\n ee = {http://dx.doi.org/10.1016/j.jda.2011.12.017},\n interhash = {c3bff02fefdc087b02376059eccc1318},\n intrahash = {7b326472109ab0817945e2799a425c30},\n journal = {J. Discrete Algorithms},\n keywords = {dblp},\n pages = {13-20},\n title = {Skip lift: A probabilistic alternative to red-black trees.},\n url = {http://dblp.uni-trier.de/db/journals/jda/jda14.html#BoseDM12},\n volume = {14},\n year = {2012}\n}","bibtype":"article","biburl":"http://www.bibsonomy.org/bibtex/27b326472109ab0817945e2799a425c30/dblp","ee":"http://dx.doi.org/10.1016/j.jda.2011.12.017","id":"journals/jda/BoseDM12","interhash":"c3bff02fefdc087b02376059eccc1318","intrahash":"7b326472109ab0817945e2799a425c30","journal":"J. Discrete Algorithms","key":"journals/jda/BoseDM12","keywords":"dblp","pages":"13-20","title":"Skip lift: A probabilistic alternative to red-black trees.","type":"article","url":"http://dblp.uni-trier.de/db/journals/jda/jda14.html#BoseDM12","volume":"14","year":"2012","bibbaseid":"bose-doueb-morin-skipliftaprobabilisticalternativetoredblacktrees-2012","role":"author","urls":{"Link":"http://dx.doi.org/10.1016/j.jda.2011.12.017","Paper":"http://dblp.uni-trier.de/db/journals/jda/jda14.html#BoseDM12"},"keyword":["dblp"],"downloads":0},"bibtype":"article","biburl":"http://www.bibsonomy.org/bib/author/Prosenjit Bose?items=1000","downloads":0,"keywords":["dblp"],"search_terms":["skip","lift","probabilistic","alternative","red","black","trees","bose","douïeb","morin"],"title":"Skip lift: A probabilistic alternative to red-black trees.","year":2012,"dataSources":["nTyQTvut7Rqwe9n5L"]}