An improved reliability bound of a probabilistic parallel integer sorting algorithm (Q1941705): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2012.09.003
+Normal rank
@@ Property / OpenAlex ID @@
+W2091940879
@@ Property / OpenAlex ID: W2091940879 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3347928
@@ Property / cites work: Q3347928 / rank @@
+Normal rank
@@ Property / cites work @@
+A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
+Normal rank
@@ Property / cites work @@
+Parallel Merge Sort
@@ Property / cites work: Parallel Merge Sort / rank @@
+Normal rank
@@ Property / cites work @@
+Probabilistic integer sorting
@@ Property / cites work: Probabilistic integer sorting / rank @@
+Normal rank
@@ Property / cites work @@
+Hybridsort revisited and parallelized
@@ Property / cites work: Hybridsort revisited and parallelized / rank @@
+Normal rank
@@ Property / cites work @@
+On parallel integer sorting
@@ Property / cites work: On parallel integer sorting / rank @@
+Normal rank
@@ Property / cites work @@
+Finding the maximum, merging, and sorting in a parallel computation model
+Normal rank