Mostra el registre d'ítem simple
Randomized binary search trees
dc.contributor.author | Martínez Parra, Conrado |
dc.contributor.author | Roura Ferret, Salvador |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Ciències de la Computació |
dc.date.accessioned | 2016-02-26T08:31:42Z |
dc.date.available | 2016-02-26T08:31:42Z |
dc.date.issued | 1997-01 |
dc.identifier.citation | Martinez, C., Roura, S. "Randomized binary search trees". 1997. |
dc.identifier.uri | http://hdl.handle.net/2117/83474 |
dc.description.abstract | In this paper we present randomized algorithms over binary search trees such that: a) the insertion of a set of keys, in any fixed order, into an initially empty tree always produces a random binary search tree; b) the deletion of any key from a random binary search tree results in a random binary search tree; c) the random choices made by the algorithms are based upon the sizes of the subtrees of the tree; this implies that we can support accesses by rank without additional storage requirements or modification of the data structures; and d) the cost of any elementary operation, measured as the number of visited nodes, is the same as the expected cost of its standard deterministic counterpart; hence, all search and update operations have guaranteed expected cost O(log n), but now irrespective of any assumption on the input distribution. |
dc.format.extent | 32 p. |
dc.language.iso | eng |
dc.subject | Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica |
dc.subject.other | Binary search trees |
dc.subject.other | Randomized algorithms |
dc.subject.other | BST |
dc.title | Randomized binary search trees |
dc.type | External research report |
dc.rights.access | Open Access |
local.identifier.drac | 1849549 |
dc.description.version | Postprint (author's final draft) |
local.citation.author | Martinez, C.; Roura, S. |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Reports de recerca [1.107]