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.
Parallel algorithms for geometric graph problems
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 2
citation-polarity summary
years
2026 2verdicts
UNVERDICTED 2roles
background 2polarities
background 2representative citing papers
Algorithms sample maximum-entropy distributions over citizen assembly panels, yielding better intersectional diversity and higher probability of satisfying unseen representation constraints than standard methods.
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.
-
Maximally Random Sortition
Algorithms sample maximum-entropy distributions over citizen assembly panels, yielding better intersectional diversity and higher probability of satisfying unseen representation constraints than standard methods.