DialSort is a non-comparative integer sorting algorithm that eliminates the prefix-sum pass via self-indexing and uses a Conflict Resolution Network for parallel operation, with reported O(n+U) sequential and O(n/k + log k + U) parallel bounds plus empirical speedups up to 39.77x over std::sort.
Sorting networks and their ap- plications,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
DialSort: Non-Comparative Integer Sorting via the Self-Indexing Principle: Architecture, Implementation, and Substrate-Aware Analysis
DialSort is a non-comparative integer sorting algorithm that eliminates the prefix-sum pass via self-indexing and uses a Conflict Resolution Network for parallel operation, with reported O(n+U) sequential and O(n/k + log k + U) parallel bounds plus empirical speedups up to 39.77x over std::sort.