On binary search trees (Q2366072): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q3792452
@@ Property / cites work: Q3792452 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3994535
@@ Property / cites work: Q3994535 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Computer Search Trees and Variable-Length Alphabetical Codes
+Normal rank
@@ Property / cites work @@
+Q5585020
@@ Property / cites work: Q5585020 / rank @@
+Normal rank
@@ Property / cites work @@
+Nearly optimal binary search trees
@@ Property / cites work: Nearly optimal binary search trees / rank @@
+Normal rank
@@ Property / cites work @@
+A Best Possible Bound for The Weighted Path Length of Binary Search Trees
+Normal rank
@@ Property / cites work @@
+Q3358643
@@ Property / cites work: Q3358643 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0020-0190(93)90212-r
+Normal rank
@@ Property / OpenAlex ID @@
+W2022352965
@@ Property / OpenAlex ID: W2022352965 / rank @@
+Normal rank