On rotations in fringe-balanced binary trees

This publication has 21 references indexed in Scilit:

• Martingale Functional Central Limit Theorems for a Generalized Polya Urn
  The Annals of Probability, 1993
• Limit laws for local counters in random binary search trees
  Random Structures & Algorithms, 1991
• On the Distribution of Leaves in Rooted Subtrees of Recursive Trees
  The Annals of Applied Probability, 1991
• A martingale approach to strong convergence in a generalized Pólya-Eggenberger urn model
  Statistics & Probability Letters, 1989
• Two Applications of Urn Processes The Fringe Analysis of Search Trees and The Simulation of Quasi-Stationary Distributions of Markov Chains
  Probability in the Engineering and Informational Sciences, 1988
• Improving time and space efficiency in generalized binary search trees
  Acta Informatica, 1987
• Asymptotic Normality in the Generalized Polya–Eggenberger Urn Model, with an Application to Computer Data Structures
  SIAM Journal on Algebraic Discrete Methods, 1985
• Two Probability Models of Pyramid or Chain Letter Schemes Demonstrating that Their Promotional Claims are Unreliable
  Operations Research, 1984
• The theory of fringe analysis and its application to 23 trees and b-trees
  Information and Control, 1982
• Embedding of Urn Schemes into Continuous Time Markov Branching Processes and Related Limit Theorems
  The Annals of Mathematical Statistics, 1968