Small Complexity Gaps for Comparison-Based Sorting (Q6163631): Difference between revisions

@@ Property / cites work @@
+A variant of the Ford-Johnson algorithm that is more space efficient
+Normal rank
@@ Property / cites work @@
+Counting linear extensions
@@ Property / cites work: Counting linear extensions / rank @@
+Normal rank
@@ Property / cites work @@
+QuickXsort: Efficient Sorting with n logn − 1.399n + o(n) Comparisons on Average
+Normal rank
@@ Property / cites work @@
+A Tournament Problem
@@ Property / cites work: A Tournament Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal merging of 2 elements with n elements
@@ Property / cites work: Optimal merging of 2 elements with n elements / rank @@
+Normal rank
@@ Property / cites work @@
+Improved average complexity for comparison-based sorting
+Normal rank
@@ Property / cites work @@
+Q4349924
@@ Property / cites work: Q4349924 / rank @@
+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 @@
+Merging of 4 or 5 elements with n elements
@@ Property / cites work: Merging of 4 or 5 elements with n elements / rank @@
+Normal rank
@@ Property / cites work @@
+Q4411410
@@ Property / cites work: Q4411410 / rank @@
+Normal rank
@@ Property / cites work @@
+New results in minimum-comparison sorting
@@ Property / cites work: New results in minimum-comparison sorting / rank @@
+Normal rank
@@ Property / cites work @@
+The Ford-Johnson algorithm still unbeaten for less than 47 elements
+Normal rank
@@ Property / cites work @@
+Q5801732
@@ Property / cites work: Q5801732 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal expected-time algorithms for merging
@@ Property / cites work: Optimal expected-time algorithms for merging / rank @@
+Normal rank