Computing and ranking measures of presortedness (Q4323402): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1080/00207169208804137
+Normal rank
@@ Property / OpenAlex ID @@
+W2014975866
@@ Property / OpenAlex ID: W2014975866 / rank @@
+Normal rank
@@ Property / cites work @@
+Sorting roughly sorted sequences in parallel
@@ Property / cites work: Sorting roughly sorted sequences in parallel / rank @@
+Normal rank
@@ Property / cites work @@
+Q3138940
@@ Property / cites work: Q3138940 / rank @@
+Normal rank
@@ Property / cites work @@
+Smoothsort, an alternative for sorting in situ
@@ Property / cites work: Smoothsort, an alternative for sorting in situ / rank @@
+Normal rank
@@ Property / cites work @@
+A decomposition theorem for partially ordered sets
+Normal rank
@@ Property / cites work @@
+A new measure of presortedness
@@ Property / cites work: A new measure of presortedness / rank @@
+Normal rank
@@ Property / cites work @@
+How good is the information theory bound in sorting?
+Normal rank
@@ Property / cites work @@
+On computing the length of longest increasing subsequences
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for combinatorial problems
+Normal rank
@@ Property / cites work @@
+Q4057549
@@ Property / cites work: Q4057549 / rank @@
+Normal rank
@@ Property / cites work @@
+Measures of Presortedness and Optimal Sorting Algorithms
+Normal rank
@@ Property / cites work @@
+Q3359741
@@ Property / cites work: Q3359741 / rank @@
+Normal rank