Abstract
To any sequence of real numbers 〈a n 〉n≥0, we can associate another sequence 〈â s 〉 s ≥0, called its binomial transform. This transform is defined through the rule
We study the properties of this transform, obtaining rules for its manipulation and a table of transforms, that allow us to invert many transforms by inspection.
We use these methods to perform a detailed analysis of skip lists, a probabilistic data structure introduced by W. Pugh as an alternative to balanced trees. In particular, we obtain the mean and variance for the cost of searching for the first or the last element in the list (confirming results obtained previously by other methods), and also for the cost of searching for a random element (whose variance was not known). We obtain exact (albeit sometimes complicated) expressions for all n≥0, and from them we find the corresponding asymptotic expressions.
This research was supported in part by the Natural Sciences and Engineering Research Council of Canada under grant No. A-8237, the Information Technology Research Centre of Ontario, and FONDECYT(Chile) under grant 1940271. Part of this work was done while the first author was on sabbatical and the third author a post doc at the University of Waterloo.
Preview
Unable to display preview. Download preview PDF.
References
M. Abramowitz and I.A. Stegun, Handbook of Mathematical Functions, Dover, 1972.
L. Comtet, Advanced Combinatorics, D. Reidel, Dordrecht, 1974.
L. Devroye, Expected Time Analysis of Skip Lists, Technical Report, School of Computer Science, McGill University, Montreal, 1990.
L. Devroye, “A Limit Theory for Random Skip Lists,” Annals of Applied Probability, 2(3), August 1992, 597–609.
P. Flajolet, M. Régnier and R. Sedgewick, “Some Uses of the Mellin Integral Transform in the Analysis of Algorithms,” in NATO Advanced Research Workshop on Combinatorial Algorithms on Words, A. Apostolico and Z. Galil (Eds.), Maratea, Italy, June 1984, 241–254.
P. Flajolet, B. Salvi and P. Zimmermann, “Automatic average-case analysis of algorithms,” Theoretical Computer Science 79(1), 1991, 37–109.
G.H. Gonnet and J.I. Munro, “The Analysis of a Linear Probing Sort by the Use of a New Mathematical Transform,” Journal of Algorithms 5(4), Dec. 1984, 451–470.
R.L. Graham, D.E. Knuth and O. Patashnik, Concrete Mathematics, Addison-Wesley, 1989.
P. Kirschenhofer and H. Prodinger, “The Path Length of Random Skip Lists,” Acta Informatica 31 (8), November 1994, 775–792.
H. Prodinger, “Some Information about the Binomial Transform,” The Fibonacci Quarterly 32 (5), November 1994, 412–415.
D.E. Knuth, The Art of Computer Programming, vol. 1: Fundamental Algorithms, Addison-Wesley, 1973.
D.E. Knuth, The Art of Computer Programming, vol. 3: Sorting and Searching, Addison-Wesley, 1973.
H. Mellin, “Über den Zusammenhang Zwischen den Linearen Differential-und Differenzengleichungen,” Acta Mathematica 25, 1902, 139–164.
T. Papadakis, J.I. Munro and P.V. Poblete, “Average Search and Update Costs in Skip Lists,” BIT 32, 1992, 316–332.
T. Papadakis, Skip Lists and Probabilistic Analysis of Algorithms, Ph.D. Thesis, University of Waterloo, Waterloo, Ontario, Canada (May 1993). [Available as Technical Report CS-93-28.]
P.V. Poblete, “Approximating Functions by their Poisson Transform,” Information Processing Letters 23(3), Oct. 1986, 127–130.
W. Pugh, “Skip Lists: A Probabilistic Alternative to Balanced Trees,” Comm. ACM 33(6), June 1990, 668–676.
J. Riordan, Combinatorial Identities, John Wiley & Sons, 1968.
S. Sen, “Some Observations on Skip Lists,” Information Processing Letters 39(4), August 1991, 173–176.
W. Szpankowski and V. Rego, “Yet Another Application of a Binomial Recurrence. Order Statistics,” Computing 43, 1990, 401–410.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Poblete, P.V., Munro, J.I., Papadakis, T. (1995). The binomial transform and its application to the analysis of skip lists. In: Spirakis, P. (eds) Algorithms — ESA '95. ESA 1995. Lecture Notes in Computer Science, vol 979. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60313-1_170
Download citation
DOI: https://doi.org/10.1007/3-540-60313-1_170
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60313-9
Online ISBN: 978-3-540-44913-3
eBook Packages: Springer Book Archive