Fast, Robust, and Learned Distribution-Based Sorting
Despite a long history of research and achievements in designing sorting routines, new hardware features and application requirements pose advanced challenges that computer scientists are recently tackling through novel data-aware (learned) algorithms. This paper aims to better understand the streng...
Saved in:
| Main Authors: | Paolo Ferragina, Mattia Odorisio |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2025-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/10918649/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Cluster Sort: A Novel Hybrid Approach to Efficient In-Place Sorting Using Data Clustering
by: Mohit Subramaniam, et al.
Published: (2025-01-01) -
CYCLICAL METHODS OF SORTING THE INDEX ELEMENTS DATASETS
by: I. P. Kadiev, et al.
Published: (2016-07-01) -
A Systematic Review of the Comparison of Different Types of Card Sorting
by: Elinda Tchivi, et al.
Published: (2025-01-01) -
Parallel Sort Implementation and Evaluation in a Dataflow-Based Polymorphic Computing Architecture
by: David Hentrich, et al.
Published: (2025-05-01) -
An Automatic Sorting Control System Applied to Logistics Industry
by: YANG Yu, et al.
Published: (2019-08-01)