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.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
citation-role summary
citation-polarity summary
years
2026 3verdicts
UNVERDICTED 3roles
background 1polarities
background 1representative citing papers
A voxel-based geometry reconstruction combined with RL-prioritized search detects navmesh inconsistencies with reduced exploration effort while preserving defect coverage.
Covariance-based entropy control selectively regularizes high-covariance tokens in softmax policies and achieves asymptotic unbiasedness upon annealing, unlike traditional regularization which introduces dense bias and alters the stationary distribution.
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.
-
Validating Navmesh using Geometry: Voxel-Based Analysis with Prioritized Exploration
A voxel-based geometry reconstruction combined with RL-prioritized search detects navmesh inconsistencies with reduced exploration effort while preserving defect coverage.
-
A Comparative Theoretical Analysis of Entropy Control Methods in Reinforcement Learning
Covariance-based entropy control selectively regularizes high-covariance tokens in softmax policies and achieves asymptotic unbiasedness upon annealing, unlike traditional regularization which introduces dense bias and alters the stationary distribution.