The m-version of binary search trees: an average-case analysis

Simple item page
dc.contributor.authorProdinger H
dc.date.accessioned2014-07-07T09:47:41Z
dc.date.available2014-07-07T09:47:41Z
dc.date.issued2013
dc.descriptionPlease help populate SUNScholar with the full text of SU research output. Also - should you need this item urgently, please snd us the details and we will try to get hold of the full text as quick possible. E-mail to scholar@sun.ac.za. Thank you.
dc.descriptionNatuurwetenskappe
dc.descriptionWiskunde
dc.identifier.citationISRN Journal of Combinatorics
dc.identifier.citation2013
dc.identifier.citation1
dc.identifier.citation8
dc.identifier.urihttp://hdl.handle.net/10019.1/91015
dc.titleThe m-version of binary search trees: an average-case analysis
dc.typeJournal Articles (NON-subsidised)
Files
Collections
2013 - Research Outputs (Non-Accredited)