Amar Goudjil

  • Citations Per Year
Learn More
Luc Devroye and Amar Goudjil School of Computer Science McGill University Abstract. We study binary search trees constructed from Weyl sequences fn g; n 1, where is an irrational and f:g denotes \mod 1". We explore various properties of the structure of these trees, and relate them to the continued fraction expansion of . If Hn is the height of the tree(More)
  • 1