Binary trees with choosable edge lengths (Q989581): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2009.07.002
+Normal rank
@@ Property / OpenAlex ID @@
+W1977899544
@@ Property / OpenAlex ID: W1977899544 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3994535
@@ Property / cites work: Q3994535 / rank @@
+Normal rank
@@ Property / cites work @@
+The repeater tree construction problem
@@ Property / cites work: The repeater tree construction problem / rank @@
+Normal rank
@@ Property / cites work @@
+An asymptotic theory for recurrence relations based on minimization and maximization.
+Normal rank
@@ Property / cites work @@
+Optimum lopsided binary trees
@@ Property / cites work: Optimum lopsided binary trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q5595624
@@ Property / cites work: Q5595624 / rank @@
+Normal rank
@@ Property / cites work @@
+Two inequalities implied by unique decipherability
+Normal rank
@@ Property / cites work @@
+Q4855565
@@ Property / cites work: Q4855565 / rank @@
+Normal rank