A Linear Time Algorithm for Ordered Partition (Q3452555): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-319-19647-3_9
+Normal rank
@@ Property / OpenAlex ID @@
+W1167245303
@@ Property / OpenAlex ID: W1167245303 / rank @@
+Normal rank
@@ Property / cites work @@
+Sorting in linear time?
@@ Property / cites work: Sorting in linear time? / rank @@
+Normal rank
@@ Property / cites work @@
+Expected Linear Time Sorting for Word Size Ω(log2 n loglogn)
+Normal rank
@@ Property / cites work @@
+Time bounds for selection
@@ Property / cites work: Time bounds for selection / rank @@
+Normal rank
@@ Property / cites work @@
+A Reliable Randomized Algorithm for the Closest-Pair Problem
+Normal rank
@@ Property / cites work @@
+Deterministic sorting in O(nloglogn) time and linear space
+Normal rank
@@ Property / cites work @@
+Conservative algorithms for parallel and sequential integer sorting
+Normal rank
@@ Property / cites work @@
+Parallel Integer Sorting Is More Efficient Than Parallel Comparison Sorting on Exclusive Write PRAMs
+Normal rank
@@ Property / cites work @@
+Upper bounds for sorting integers on random access machines
+Normal rank
@@ Property / cites work @@
+Priority queues: Small, monotone and trans-dichotomous
+Normal rank