zSort is a stable distribution sort using z-score partitioning that achieves up to 4.5x speedup over comparison-based stable sorts while matching unstable algorithms like Skasort on many inputs.
Introduction to algorithms
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
Multipartite GNN learns MILP formulations of network interdiction to outperform baselines on bi-level combinatorial tasks.
citing papers explorer
-
zSort: Stable Distribution Sort using Z-Score Partitioning
zSort is a stable distribution sort using z-score partitioning that achieves up to 4.5x speedup over comparison-based stable sorts while matching unstable algorithms like Skasort on many inputs.
-
Network Interdiction Goes Neural
Multipartite GNN learns MILP formulations of network interdiction to outperform baselines on bi-level combinatorial tasks.