Auflistung nach Schlagwort "Upper-end"

Sortiert nach: Sortierung: Ergebnisse:

  • Dennert, Florian; Grübel, Rudolf (Cambridge : Cambridge University Press, 2010)
    For random trees T generated by the binary search tree algorithm from uniformly distributed input we consider the subtree size profile, which maps k ∈ ℕ to the number of nodes in T that root a subtree of size k. Complementing ...