Skip to main content
SpringerLink
Log in

Binary search trees based on Weyl and Lehmer sequences

  • Conference paper
Monte Carlo and Quasi-Monte Carlo Methods 1996

Part of the book series: Lecture Notes in Statistics ((LNS,volume 127))

Abstract

This paper is based upon the presentation at the meeting in Salzburg. As a courtesy to those who attended the meeting, I will try to faithfully reproduce—with minor omissions and additions—what I said at that meeting. There are two basic background references for mathematical details, Devroye (1987) and Devroye and Goudjil (1996).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Aho, A.V., Hoperoft, J.E., and Ullman, J.D., 1983. Data Structures and Algorithms. Reading, Mass.: Addison-Wesley.

    Google Scholar 

  • Beck, J., 1991. Randomness of nv (mod 1) and a Ramsey property of the hyperbola. Colloquia Mathematica Societatis János Bolyai 60. Budapest.

    Google Scholar 

  • BĂ©jian, R., 1982. Minoration de la discrĂ©pance d’une suite quelconque sur T. Acta Arithmetica 41. 185–202.

    Article  Google Scholar 

  • Bennett, C.H., 1979. On random and hard-to-describe numbers. IBM Watson Research Center Report RC 7483 (no 32272). Yorktown Heights, N.Y.

    Google Scholar 

  • Bohl, P., 1909. Ăśber ein in der Theorie der säkularen Störungen vorkommendes Problem. Jl. Reine und Angewandte Mathematik 135. 189–283.

    Article  Google Scholar 

  • Boyd, D.W. and Steele, J.M., 1978. Monotone subsequences in the sequence of fractional parts of multiples of an irrational. Jl. Reine und Angewandte Mathematik 204. 49–59.

    Google Scholar 

  • Chatterji, S.D., 1966. Masse, die von regelmässigen KettenbrĂĽchen induziert sind. Mathematische Annalen 164. 113–117.

    Article  MathSciNet  Google Scholar 

  • Chow, Y.S., and Teicher, H., 1978. Probability Theory. New York, N.Y.: Springer-Verlag.

    Book  Google Scholar 

  • del Junco, A. and Steele, J.M., 1979. Hammersley’s law for the van der Corput sequence: an instance of probability theory for pseudorandom numbers. Annals of Probability 7. 267–275.

    MathSciNet  Google Scholar 

  • Devroye, L., 1986. A note on the height of binary search trees. Journal of the ACM 33. 489–498.

    Article  MathSciNet  Google Scholar 

  • Devroye, L., 1987. Branching processes in the analysis of the heights of trees Acta Informatica 24. 277–298.

    Article  MathSciNet  Google Scholar 

  • Devroye, L., 1988. Applications of the theory of records in the study of random trees. Acta Informatica 26. 123–130.

    Article  MathSciNet  Google Scholar 

  • Devroye, L., and Goudjil, A., 1996. A study of random Weyl trees. Technical Report, School of Computer Science, McGill University, Montreal.

    Google Scholar 

  • Diaconis, P., 1977. The distribution of leading digits and uniform distribution mod 1. Annals of Probability 5. 72–81.

    Article  MathSciNet  Google Scholar 

  • Ellis, M.H., and Steele, J.M., 1981. Fast sorting of Weyl sequences using comparisons. SIAM Journal on Computing 10. 88–95.

    Article  MathSciNet  Google Scholar 

  • Franklin, J N, 1963. Deterministic simulation of random sequences. Mathematics of Computation 17. 28–59.

    Article  MathSciNet  Google Scholar 

  • Freiberger, W., and Grenander, U., 1971. A Short Course in Computational Probability and Statistics. New York: Springer-Verlag.

    Book  Google Scholar 

  • Fushimi, M., and Tezuka, S., 1983. The k-distribution of generalized feedback shift register pseudorandom numbers. Communications of the ACM 26. 516–523.

    Article  Google Scholar 

  • Fushimi, M., 1988. Designing a uniform random number generator whose subsequences are k-distributed. SIAM Journal on Computing 17. 89–99.

    Article  MathSciNet  Google Scholar 

  • Galambos, J., 1972. The distribution of the largest coefficient in continued fraction expansions. Quarterly Journal of Mathematics Oxford Series 23.147–151.

    Article  MathSciNet  Google Scholar 

  • Graham, R.L., Knuth, D.E., and Patashnik, 0., 1989. Concrete Mathematics-A Foundation for Computer Science. Reading, MA: Addison-Wesley.

    Google Scholar 

  • Hlawka, E., 1984. The Theory of Uniform Distribution. Berkhamsted, U.K.: A B Academic.

    Google Scholar 

  • Kesten, H., 1960. Uniform distribution mod 1. Annals of Mathematics 71. 445–471.

    Article  MathSciNet  Google Scholar 

  • Khintchine, A., 1924. Einige Sätze ĂĽber KettenbrĂĽche, mit Anwendungen auf die Theorie der Diophantischen Approximationen, Mathematische Annalen 92. 115–125.

    Article  MathSciNet  Google Scholar 

  • Khintchine, A., 1935. Metrische Kettenbruchprobleme. Compositio Mathematica 1. 361–382.

    MathSciNet  Google Scholar 

  • Khintchine, A., 1936. Metrische Kettenbruchprobleme. Compositio Mathematica 2. 276–285.

    MathSciNet  Google Scholar 

  • Khintchine, A., 1963. Continued Fractions. Groningen: Noordhoff.

    Google Scholar 

  • Knuth, D.E., 1973. The Art of Computer Programming, Vol. 3: Sorting and Searching. Reading, MA: Addison-Wesley.

    Google Scholar 

  • Knuth, D.E., 1981. The Art of Computer Programming, Vol. 2, 2nd Ed.. Reading, Mass.: Addison-Wesley.

    Google Scholar 

  • Kuipers, L., and Niederreiter, H., 1974. Uniform Distribution of Sequences. New York: John Wiley.

    Google Scholar 

  • Kusmin, R.O., 1928. On a problem of Gauss. Reports of the Academy of Sciences A. 375–380.

    Google Scholar 

  • Lang, S., 1966. Introduction to Diophantine Approximations. Reading, MA: Addison-Wesley.

    Google Scholar 

  • L’Ecuyer, P. and Blouin, F., 1988. Linear congruential generators of order k > 1. Proceedings of the 1988 Winter Simulation Conference, ed. M. Abrams P. Haigh and J. Comfort. 432–439. ACM.

    Google Scholar 

  • L’Ecuyer, P., 1989. A tutorial on uniform variate generation. Proceedings of the 1989 Winter Simulation Conference, ed. E.A. MacNair, K.J. Musselman and P. Heidelberger. 40–49. ACM.

    Google Scholar 

  • L’Ecuyer, P., 1990. Random numbers for simulation. Communications of the ACM 33. 85–97.

    Article  Google Scholar 

  • LeVeque, W.J., 1977. Fundamentals of Number Theory. Reading, MA: Addison-Wesley.

    Google Scholar 

  • LĂ©vy, P., 1929. Sur les lois de probabilitĂ© dont dĂ©pendent les quotients complets et incomplets d’une fraction continue. Bulletin de la SociĂ©tĂ© MathĂ©matique de France 57. 178–193.

    Article  MathSciNet  Google Scholar 

  • LĂ©vy, P., 1937. ThĂ©orie de l’addition des variables alĂ©atoires. Paris.

    Google Scholar 

  • Lynch, W.C., 1965. More combinatorial problems on certain trees. Computer Journal 7. 299–302.

    Article  MathSciNet  Google Scholar 

  • Mahmoud, H.M., 1992. Evolution of Random Search Trees. New York: John Wiley.

    Google Scholar 

  • Martin-Löf, P., 1966. The definition of random sequences. Information and Control 9. 602–619.

    Article  MathSciNet  Google Scholar 

  • Niederreiter, H., 1977. Pseudo-random numbers and optimal coefficients. Advances in Mathematics 26. 99–181.

    Article  MathSciNet  Google Scholar 

  • Niederreiter, H., 1978. Quasi-Monte Carlo methods and pseudo-random numbers. Bulletin of the American Mathematical Society 84. 957–1042.

    Article  MathSciNet  Google Scholar 

  • Niederreiter, H., 1991. Recent trends in random number and random vector generation. Annals of Operations Research 31. 323–346.

    Article  MathSciNet  Google Scholar 

  • Niederreiter, H., 1992. Random Number Generation and Quasi-Monte Carlo Methods 63. SIAM CBMS-NSF Regional Conference Series in Applied Mathematics. Philadelphia: SIAM.

    Book  Google Scholar 

  • Peskun, P.H., 1980. Theoretical tests for choosing the parameters of the general mixed linear congruential pseudorandom number generator. Journal of Statistical Computation and Simulation 11. 281–305.

    Article  MathSciNet  Google Scholar 

  • Philipp, W., 1969. The central limit problem for mixing sequences of random variables. Zeitschrift fĂĽr Wahrscheinlichkeitstheorie and verwandte Gebiete 12. 155–171.

    Article  MathSciNet  Google Scholar 

  • Philipp, W., 1970. Some metrical theorems in number theory II. Duke Mathematical Journal 38. 477–485.

    MathSciNet  Google Scholar 

  • Robson, J.M., 1979. The height of binary search trees. The Australian Computer Journal 11. 151–153.

    MathSciNet  Google Scholar 

  • Robson, J.M., 1982. The asymptotic behaviour of the height of binary search trees. Australian Computer Science Communications 88–88.

    Google Scholar 

  • Schmidt, W.M., 1972. Irregularities of distribution. Acta Arithmetica 21. 45–50. Sedgewick, R., 1977. The analysis of quicksort programs. Acta Informatica 4. 327–355.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, McGill University Montreal, Montreal, H3A 2K6, Canada

    Luc Devroye

Authors
  1. Luc Devroye
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Information Processing, Austrian Academy of Sciences, Vienna, A-1010, Austria

    Harald Niederreiter

  2. Department of Mathematics, University of Salzburg, Salzburg, A-5020, Austria

    Peter Hellekalek , Gerhard Larcher  & Peter Zinterhof ,  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer Science+Business Media New York

About this paper

Cite this paper

Devroye, L. (1998). Binary search trees based on Weyl and Lehmer sequences. In: Niederreiter, H., Hellekalek, P., Larcher, G., Zinterhof, P. (eds) Monte Carlo and Quasi-Monte Carlo Methods 1996. Lecture Notes in Statistics, vol 127. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-1690-2_3

Download citation

  • DOI: https://doi.org/10.1007/978-1-4612-1690-2_3

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-0-387-98335-6

  • Online ISBN: 978-1-4612-1690-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation