Selection from read-only memory and sorting with minimum data movement (Q671520): 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.1016/0304-3975(95)00225-1
+Normal rank
@@ Property / OpenAlex ID @@
+W1990160390
@@ Property / OpenAlex ID: W1990160390 / rank @@
+Normal rank
@@ Property / cites work @@
+Time bounds for selection
@@ Property / cites work: Time bounds for selection / rank @@
+Normal rank
@@ Property / cites work @@
+Q4886030
@@ Property / cites work: Q4886030 / rank @@
+Normal rank
@@ Property / cites work @@
+Expected time bounds for selection
@@ Property / cites work: Expected time bounds for selection / rank @@
+Normal rank
@@ Property / cites work @@
+Upper bounds for time-space trade-offs in sorting and selection
+Normal rank
@@ Property / cites work @@
+Q4122535
@@ Property / cites work: Q4122535 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4057549
@@ Property / cites work: Q4057549 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5671622
@@ Property / cites work: Q5671622 / rank @@
+Normal rank
@@ Property / cites work @@
+Selection and sorting with limited storage
@@ Property / cites work: Selection and sorting with limited storage / rank @@
+Normal rank
@@ Property / cites work @@
+Sorting with minimum data movement
@@ Property / cites work: Sorting with minimum data movement / rank @@
+Normal rank
@@ Property / cites work @@
+Fast stable in-place sorting with \(O(n)\) data moves
+Normal rank
@@ Property / cites work @@
+Finding the median
@@ Property / cites work: Finding the median / rank @@
+Normal rank