CiteULike is a free online bibliography manager. Register and you can start organising your references online.
Tags

Biased Skip Lists

by: Amitabha Bagchi, Adam L. Buchsbaum, Michael T. Goodrich
In Proceedings of the 13th International Symposium on Algorithms and Computation (2002), pp. 1-13  Key: citeulike:12161864

Formatted Citation


Show HTML

Likes (beta)

This copy of the article hasn't been liked by anyone yet.

View FullText article


Abstract

We design a variation of skip lists that performs well for generally biased access sequences. Given n items, each with a positive weight wi, 1 ¿ i ¿ n, the time to access item i is O(1 + log W/wi), where W = ¿i = 1nwi; the data structure is dynamic. We present deterministic and randomized variations, which are nearly identical; the deterministic one simply ensures the balance condition that the randomized one achieves probabilistically. We use the same method to analyze both.


RhysU's tags for this article

Citations (CiTO)

No CiTO relationships defined

X There are no reviews yet

X Posting History


X Export records

Privacy Statement | Terms & Conditions
CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.