Imagen de Portada

Sorting as Gradient Flow on the Permutohedron

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Landers, Jonathan
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

QR Sort: A Novel Non-Comparative Sorting Algorithm
por: Bushman, Randolph T., et al.
Publicado: (2024)

zSort: Stable Distribution Sort using Z-Score Partitioning
por: Jain, Hriday, et al.
Publicado: (2026)

Improved Online Sorting
por: Nirjhor, Jubayer, et al.
Publicado: (2025)

How to Sort in a Refrigerator: Simple Entropy-Sensitive Strictly In-Place Sorting Algorithms
por: Gila, Ofek, et al.
Publicado: (2026)

Scalable Distributed String Sorting
por: Kurpicz, Florian, et al.
Publicado: (2024)

Robust-Sorting and Applications to Ulam-Median
por: Jaiswal, Ragesh, et al.
Publicado: (2025)

Compressing Hypergraphs using Suffix Sorting
por: Adler, Enno, et al.
Publicado: (2025)

Sorting and Selection in Rounds with Adversarial Comparisons
por: Trevisan, Chris
Publicado: (2023)

Anytime Sorting Algorithms (Extended Version)
por: Caizergues, Emma, et al.
Publicado: (2024)

DialSort: Non-Comparative Integer Sorting via the Self-Indexing Principle: Architecture, Implementation, and Substrate-Aware Analysis
por: Narvaez, Alexander
Publicado: (2026)

Nearly Tight Bounds for the Online Sorting Problem
por: Azar, Yossi, et al.
Publicado: (2025)

Nearly Optimal Bounds for Stochastic Online Sorting
por: Hu, Yang
Publicado: (2025)

Sorting multibay block stacking storage systems
por: Pfrommer, Jakob, et al.
Publicado: (2024)

Sorted Range Reporting and Range Minima Queries
por: Akram, Waseem, et al.
Publicado: (2021)

An Optimal Algorithm for Sorting Pattern-Avoiding Sequences
por: Opler, Michal
Publicado: (2024)

Tight Bounds for Sorting Under Partial Information
por: van der Hoog, Ivor, et al.
Publicado: (2024)

An Optimal Sorting Algorithm for Persistent Random Comparison Faults
por: Geissmann, Barbara, et al.
Publicado: (2025)

SquareSort: a cache-oblivious sorting algorithm
por: Koucký, Michal, et al.
Publicado: (2024)

A Polylogarithmic Competitive Algorithm for Stochastic Online Sorting and TSP
por: Kalavas, Andreas, et al.
Publicado: (2025)

A Predictive Framework for Base-n Radix Sort Optimization
por: Pandey, Atharv, et al.
Publicado: (2025)

A Polylogarithmic Competitive Algorithm for Stochastic Online Sorting and TSP
por: Kalavas, Andreas, et al.
Publicado: (2025)

Simpler Optimal Sorting from a Directed Acyclic Graph
por: van der Hoog, Ivor, et al.
Publicado: (2024)

Deep Learning Service for Efficient Data Distribution Aware Sorting
por: Zhu, Xiaoke, et al.
Publicado: (2019)

Improving Merge Sort and Quick Sort Performance by Utilizing Alphadev's Sorting Networks as Base Cases
por: Aly, Anas Gamal, et al.
Publicado: (2025)

Online Scheduling via Gradient Descent for Weighted Flow Time Minimization
por: Chen, Qingyun, et al.
Publicado: (2024)

ExpoSort: Breaking the quasi-polynomial-time barrier for reluctant sorting
por: Abrahamsen, Mikkel
Publicado: (2024)

New Sorting Algorithm Wave Sort (W-Sort)
por: Wei, Jia Xu
Publicado: (2025)

Sorting with constraints
por: Manas, A.
Publicado: (2025)

Quick-Sort Style Approximation Algorithms for Generalizations of Feedback Vertex Set in Tournaments
por: Gupta, Sushmita, et al.
Publicado: (2024)

Multi-Way Co-Ranking: Index-Space Partitioning of Sorted Sequences Without Merge
por: Joshi, Amit
Publicado: (2025)

Sorting under Partial Information with Optimal Preprocessing Time via Unified Bound Heaps
por: Rutschmann, Daniel
Publicado: (2026)

Balanced Learned Sort: a new learned model for fast and balanced item bucketing
por: Ferragina, Paolo, et al.
Publicado: (2024)

TwinArray Sort: An Ultrarapid Conditional Non-Comparison Based Sorting Algorithm
por: Amini, Amin
Publicado: (2024)

Adaptive Hybrid Sort: Dynamic Strategy Selection for Optimal Sorting Across Diverse Data Distributions
por: Balasubramanian, Shrinivass Arunachalam
Publicado: (2025)

PCF Learned Sort: a Learning Augmented Sort Algorithm with $O(n \log\log n)$ Expected Complexity
por: Sato, Atsuki, et al.
Publicado: (2024)

Depth-13 Sorting Networks for 28 Channels
por: Wang, Chengu
Publicado: (2025)

Preprocessing Uncertain Data into Supersequences for Sorting and Gaps
por: Löffler, Maarten, et al.
Publicado: (2026)

Online Sorting and Translational Packing of Convex Polygons
por: Aamand, Anders, et al.
Publicado: (2021)

Data Structures for Range Sorted Consecutive Occurrence Queries
por: Akram, Waseem, et al.
Publicado: (2024)

FractalSortCPU: Bandwidth-Efficient Compressed Radix Sort on CPU
por: Dang'ana, Michael
Publicado: (2026)