Author:
Pittard Jonathan J.,Tharp Alan L.
Publisher
Springer Berlin Heidelberg
Reference9 articles.
1. Pugh, W.: Skip lists: A probabilistic alternative to balanced trees. Comm. of the ACM (1990)
2. Ergun, F., Mittra, S., Sahinalp, S., Sharp, J., Sinha, R.: A Dynamic Lookup Scheme for Bursty Access Patterns. In: Proc. IEEE INFOCOM (2001)
3. Lecture Notes in Computer Science;F. Ergun,2001
4. Bagchi, A., Buchsbaum, A., Goodrich, M.: Biased skip lists. Algorithmica 42 (2005)
5. Bose, P., Douieb, K., Langerman, S.: Dynamic optimality for skip lists and B-trees. In: Proc. of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms (2008)