Some modified algorithms for Dijkstra's longest upsequence problem (Q1161300): Difference between revisions

@@ Property / cites work @@
+Some beautiful arguments using mathematical induction
+Normal rank
@@ Property / cites work @@
+A Simple Algorithm for Merging Two Disjoint Linearly Ordered Sets
+Normal rank
@@ Property / cites work @@
+Q4057549
@@ Property / cites work: Q4057549 / rank @@
+Normal rank
@@ Property / cites work @@
+Significant Improvements to the Hwang-Lin Merging Algorithm
+Normal rank
@@ Property / cites work @@
+The Ford-Johnson Sorting Algorithm Is Not Optimal
@@ Property / cites work: The Ford-Johnson Sorting Algorithm Is Not Optimal / rank @@
+Normal rank
@@ Property / cites work @@
+Some Observations Concerning Formal Differentiation of Set Theoretic Expressions
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf00625277
+Normal rank
@@ Property / OpenAlex ID @@
+W2024244897
@@ Property / OpenAlex ID: W2024244897 / rank @@
+Normal rank