Finding median in read-only memory on integer input (Q2342680): Difference between revisions

@@ Property / cites work @@
+Fusion trees can be implemented with \(AC^0\) instructions only
+Normal rank
@@ Property / cites work @@
+A general Sequential Time-Space Tradeoff for Finding Unique Elements
+Normal rank
@@ Property / cites work @@
+Time bounds for selection
@@ Property / cites work: Time bounds for selection / rank @@
+Normal rank
@@ Property / cites work @@
+A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation
+Normal rank
@@ Property / cites work @@
+Q4003525
@@ Property / cites work: Q4003525 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3579381
@@ Property / cites work: Q3579381 / rank @@
+Normal rank
@@ Property / cites work @@
+Comparison-based time-space lower bounds for selection
+Normal rank
@@ Property / cites work @@
+Q4028873
@@ Property / cites work: Q4028873 / rank @@
+Normal rank
@@ Property / cites work @@
+Selection from Read-Only Memory with Limited Workspace
+Normal rank
@@ Property / cites work @@
+Upper bounds for time-space trade-offs in sorting and selection
+Normal rank
@@ Property / cites work @@
+Surpassing the information theoretic bound with fusion trees
+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 @@
+Selection from read-only memory and sorting with minimum data movement
+Normal rank
@@ Property / cites work @@
+Q4719333
@@ Property / cites work: Q4719333 / rank @@
+Normal rank