F. Ergun, S. C. Sahinalp, J. Sharp, and R. K. Sinha. Biased skip lists for highly skewed access patterns. In Proceedings of the 3rd Workshop on Algorithm Engineering and Experiments, volume 2153 of Lecture Notes in Computer Science, pages 216--29. Springer, 2001. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Biased Skip Lists - Bagchi, Buchsbaum, Goodrich (2004) (Correct)
....a partial result and omitted details and analysis of such a structure. Roura and Martnez [16] designed an algorithm that takes a probability distribution over accesses to a dictionary and builds a static weighted skip list structure that minimizes the average access cost. Recently, Ergun et al. [7, 8] presented a biased skip list structure that is designed for a specialized notion of biasing, in which access to an item i takes O(log r(i) expected time, where r(i) is the number of items accessed since the last time i was accessed. Their data structure is incomparable to a general biased ....
F. Ergun, S. C. Sahinalp, J. Sharp, and R. K. Sinha. Biased skip lists for highly skewed access patterns. In Proc. 3rd Wks. on Algorithm Engineering and Experiments, volume 2153 of Lecture Notes in Computer Science, pages 216--29. Springer, 2001.
Biased Skip Lists - Bagchi, Buchsbaum, Goodrich (Correct)
....lists that achieves similar bounds in the worst case using simple promote and demote operations. For biased skip lists, much less prior work exists. Mehlhorn and N aher [16] anticipated biased skip lists but claimed only a partial result and omitted details and analysis. Recently, Ergun et al. [7, 8] presented a biased skip list structure that is designed for a specialized notion of biasing, in which access to an item i takes O(log r(i) expected time, where r(i) is the number of items accessed since the last time i was accessed. Their data structure is incomparable to a general biased ....
F. Ergun, S. C. Sahinalp, J. Sharp, and R. K. Sinha. Biased skip lists for highly skewed access patterns. In Proc. 3rd ALENEX, volume 2153 of LNCS, pages 216{
Efficient Strategies for Topics in Internet Algorithmics - Bagchi (2002) (Correct)
....and demotion of node heights to ensure the desired access time. We also describe a randomized variation of this idea, which gives the same, although expected, bounds, and is much simpler to implement. Mehlhorn and N aher [58] anticipated our approach but claimed only a partial result. Ergun et al. [32, 33] designed a skip list that provides access to item i in O(log r(i) time, where r(i) is the number of accesses since the last time i was accessed. In Section 3.2, we de ne skip lists and biased skip lists. Section 3.3 describes how to update biased skip lists, and Section 3.4 demonstrates a ....
F. Ergun, S. C. Sahinalp, J. Sharp, and R. K. Sinha. Biased skip lists for highly skewed access patterns. In Proceedings of the 3rd Workshop on Algorithm Engineering and Experiments, volume 2153 of Lecture Notes in Computer Science, pages 216-29. Springer, 2001.
Efficient Strategies for Topics in Internet Algorithmics - Bagchi (2002) (Correct)
No context found.
F. Ergun, S. C. Sahinalp, J. Sharp, and R. K. Sinha. Biased skip lists for highly skewed access patterns. In Proceedings of the 3rd Workshop on Algorithm Engineering and Experiments, volume 2153 of Lecture Notes in Computer Science, pages 216--29. Springer, 2001.
Biased Skip Lists - Bagchi, Buchsbaum, Goodrich (2004) (Correct)
No context found.
F. Ergun, S. C. Sahinalp, J. Sharp, and R. K. Sinha. Biased skip lists for highly skewed access patterns. In Proc. 3rd Wks. on Algorithm Engineering and Experiments, volume 2153 of Lecture Notes in Computer Science, pages 216--29. Springer, 2001.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC