:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Pandey, Atharv, Kuppusamy, Lakshmanan
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms
Accès en ligne:	https://arxiv.org/abs/2509.19021
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

FractalSortCPU: Bandwidth-Efficient Compressed Radix Sort on CPU
par: Dang'ana, Michael
Publié: (2026)

QR Sort: A Novel Non-Comparative Sorting Algorithm
par: Bushman, Randolph T., et autres
Publié: (2024)

PCF Learned Sort: a Learning Augmented Sort Algorithm with $O(n \log\log n)$ Expected Complexity
par: Sato, Atsuki, et autres
Publié: (2024)

zSort: Stable Distribution Sort using Z-Score Partitioning
par: Jain, Hriday, et autres
Publié: (2026)

Improving Merge Sort and Quick Sort Performance by Utilizing Alphadev's Sorting Networks as Base Cases
par: Aly, Anas Gamal, et autres
Publié: (2025)

Improved Online Sorting
par: Nirjhor, Jubayer, et autres
Publié: (2025)

How to Sort in a Refrigerator: Simple Entropy-Sensitive Strictly In-Place Sorting Algorithms
par: Gila, Ofek, et autres
Publié: (2026)

Sorting as Gradient Flow on the Permutohedron
par: Landers, Jonathan
Publié: (2025)

Scalable Distributed String Sorting
par: Kurpicz, Florian, et autres
Publié: (2024)

TwinArray Sort: An Ultrarapid Conditional Non-Comparison Based Sorting Algorithm
par: Amini, Amin
Publié: (2024)

Robust-Sorting and Applications to Ulam-Median
par: Jaiswal, Ragesh, et autres
Publié: (2025)

Compressing Hypergraphs using Suffix Sorting
par: Adler, Enno, et autres
Publié: (2025)

Sorting and Selection in Rounds with Adversarial Comparisons
par: Trevisan, Chris
Publié: (2023)

Anytime Sorting Algorithms (Extended Version)
par: Caizergues, Emma, et autres
Publié: (2024)

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

Nearly Tight Bounds for the Online Sorting Problem
par: Azar, Yossi, et autres
Publié: (2025)

Nearly Optimal Bounds for Stochastic Online Sorting
par: Hu, Yang
Publié: (2025)

Sorting multibay block stacking storage systems
par: Pfrommer, Jakob, et autres
Publié: (2024)

Sorted Range Reporting and Range Minima Queries
par: Akram, Waseem, et autres
Publié: (2021)

An Optimal Algorithm for Sorting Pattern-Avoiding Sequences
par: Opler, Michal
Publié: (2024)

Tight Bounds for Sorting Under Partial Information
par: van der Hoog, Ivor, et autres
Publié: (2024)

A Polylogarithmic Competitive Algorithm for Stochastic Online Sorting and TSP
par: Kalavas, Andreas, et autres
Publié: (2025)

A Polylogarithmic Competitive Algorithm for Stochastic Online Sorting and TSP
par: Kalavas, Andreas, et autres
Publié: (2025)

In-depth Analysis of Densest Subgraph Discovery in a Unified Framework
par: Zhou, Yingli, et autres
Publié: (2024)

New Sorting Algorithm Wave Sort (W-Sort)
par: Wei, Jia Xu
Publié: (2025)

An Optimal Sorting Algorithm for Persistent Random Comparison Faults
par: Geissmann, Barbara, et autres
Publié: (2025)

SquareSort: a cache-oblivious sorting algorithm
par: Koucký, Michal, et autres
Publié: (2024)

Sorting with constraints
par: Manas, A.
Publié: (2025)

Simpler Optimal Sorting from a Directed Acyclic Graph
par: van der Hoog, Ivor, et autres
Publié: (2024)

Deep Learning Service for Efficient Data Distribution Aware Sorting
par: Zhu, Xiaoke, et autres
Publié: (2019)

ExpoSort: Breaking the quasi-polynomial-time barrier for reluctant sorting
par: Abrahamsen, Mikkel
Publié: (2024)

Quick-Sort Style Approximation Algorithms for Generalizations of Feedback Vertex Set in Tournaments
par: Gupta, Sushmita, et autres
Publié: (2024)

Fast Maximum Common Subgraph Search: A Redundancy-Reduced Backtracking Approach
par: Yu, Kaiqiang, et autres
Publié: (2025)

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

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

Sorting under Partial Information with Optimal Preprocessing Time via Unified Bound Heaps
par: Rutschmann, Daniel
Publié: (2026)

Balanced Learned Sort: a new learned model for fast and balanced item bucketing
par: Ferragina, Paolo, et autres
Publié: (2024)

BYO: A Unified Framework for Benchmarking Large-Scale Graph Containers
par: Wheatman, Brian, et autres
Publié: (2024)

Depth-13 Sorting Networks for 28 Channels
par: Wang, Chengu
Publié: (2025)

Preprocessing Uncertain Data into Supersequences for Sorting and Gaps
par: Löffler, Maarten, et autres
Publié: (2026)