A structural reduction to local medians enables new constant-round MPC (2-α) and (2-ζ) approximation algorithms for 1-median rank aggregation under multiple distances, plus an improved 1.968-approximation for Ulam that extends to weighted cases.
Communication steps for parallel query processing.J
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
roles
background 1polarities
background 1representative citing papers
Presents constant-time CRCW PRAM algorithms for acyclic queries, semijoin algebra queries, and worst-case optimal joins that achieve work O(T^{1+ε}) for any ε>0 relative to optimal sequential time T.
citing papers explorer
-
A Scalable and Unified Framework to Weighted Rank Aggregation
A structural reduction to local medians enables new constant-round MPC (2-α) and (2-ζ) approximation algorithms for 1-median rank aggregation under multiple distances, plus an improved 1.968-approximation for Ulam that extends to weighted cases.
-
Work-Efficient Query Evaluation in Constant Time with PRAMs
Presents constant-time CRCW PRAM algorithms for acyclic queries, semijoin algebra queries, and worst-case optimal joins that achieve work O(T^{1+ε}) for any ε>0 relative to optimal sequential time T.