The m-version of binary search trees: an average-case analysis
dc.contributor.author | Prodinger H | |
dc.date.accessioned | 2014-07-07T09:47:41Z | |
dc.date.available | 2014-07-07T09:47:41Z | |
dc.date.issued | 2013 | |
dc.description | Please 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.description | Natuurwetenskappe | |
dc.description | Wiskunde | |
dc.identifier.citation | ISRN Journal of Combinatorics | |
dc.identifier.citation | 2013 | |
dc.identifier.citation | 1 | |
dc.identifier.citation | 8 | |
dc.identifier.uri | http://hdl.handle.net/10019.1/91015 | |
dc.title | The m-version of binary search trees: an average-case analysis | |
dc.type | Journal Articles (NON-subsidised) |