On the upper bound of the complexity of sorting (Q2662813): Difference between revisions

@@ Property / author @@
+Igor S. Sergeev
@@ Property / author: Igor S. Sergeev / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q3948568
@@ Property / cites work: Q3948568 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5585020
@@ Property / cites work: Q5585020 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3219752
@@ Property / cites work: Q3219752 / rank @@
+Normal rank
@@ Property / cites work @@
+A Tournament Problem
@@ Property / cites work: A Tournament Problem / rank @@
+Normal rank
@@ Property / cites work @@
+The Ford-Johnson algorithm still unbeaten for less than 47 elements
+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 @@
+Improved average complexity for comparison-based sorting
+Normal rank
@@ Property / cites work @@
+QuickXsort: a fast sorting scheme in theory and practice
+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 @@
+Finding the median
@@ Property / cites work: Finding the median / rank @@
+Normal rank
@@ Property / cites work @@
+Selecting the Median
@@ Property / cites work: Selecting the Median / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1134/s0965542521020111
+Normal rank
@@ Property / OpenAlex ID @@
+W3150971374
@@ Property / OpenAlex ID: W3150971374 / rank @@
+Normal rank