Random Records and Cuttings in Binary Search Trees (Q3058297): Difference between revisions

@@ Property / cites work @@
+The profile of binary search trees
@@ Property / cites work: The profile of binary search trees / rank @@
+Normal rank
@@ Property / cites work @@
+Cutting down random trees
@@ Property / cites work: Cutting down random trees / rank @@
+Normal rank
@@ Property / cites work @@
+Probability: A Graduate Course
@@ Property / cites work: Probability: A Graduate Course / rank @@
+Normal rank
@@ Property / cites work @@
+Random cutting and records in deterministic and random trees
+Normal rank
@@ Property / cites work @@
+Q5624436
@@ Property / cites work: Q5624436 / rank @@
+Normal rank
@@ Property / cites work @@
+Quicksort asymptotics
@@ Property / cites work: Quicksort asymptotics / rank @@
+Normal rank
@@ Property / cites work @@
+A probabilistic proof of a weak limit law for the number of cuts needed to isolate the root of a random recursive tree
+Normal rank
@@ Property / cites work @@
+A limiting distribution for the number of cuts needed to isolate the root of a random recursive tree
+Normal rank
@@ Property / cites work @@
+A note on the height of binary search trees
@@ Property / cites work: A note on the height of binary search trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q4398780
@@ Property / cites work: Q4398780 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1017/s096354830999068x
+Normal rank
@@ Property / OpenAlex ID @@
+W2060679341
@@ Property / OpenAlex ID: W2060679341 / rank @@
+Normal rank