Imagen de Portada

Improved Online Sorting

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Nirjhor, Jubayer, Wein, Nicole
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

Improved Hardness-of-Approximation for Token Swapping
por: Hiken, Sam, et al.
Publicado: (2024)

Closing the Gap Between Directed Hopsets and Shortcut Sets
por: Bernstein, Aaron, et al.
Publicado: (2022)

Settling Weighted Token Swapping up to Algorithmic Barriers
por: Wein, Nicole, et al.
Publicado: (2025)

A Polynomial-Time Algorithm for the Next-to-Shortest Path Problem on Positively Weighted Directed Graphs
por: Chen, Kuowen, et al.
Publicado: (2025)

Covering Approximate Shortest Paths with DAGs
por: Assadi, Sepehr, et al.
Publicado: (2025)

Edge-Minimum Walk of Modular Length in Polynomial Time
por: Amarilli, Antoine, et al.
Publicado: (2024)

Are there graphs whose shortest path structure requires large edge weights?
por: Bernstein, Aaron, et al.
Publicado: (2023)

Improving the Threshold for Finding Rank-1 Matrices in a Subspace
por: Dastidar, Jeshu, et al.
Publicado: (2025)

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)

Beyond 2-approximation for k-Center in Graphs
por: Jin, Ce, et al.
Publicado: (2025)

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

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

Low Sensitivity Hopsets
por: Ashvinkumar, Vikrant, et al.
Publicado: (2024)

Additive Spanner Lower Bounds with Optimal Inner Graph Structure
por: Bodwin, Greg, et al.
Publicado: (2024)

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

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

Detecting Disjoint Shortest Paths in Linear Time and More
por: Akmal, Shyan, et al.
Publicado: (2024)

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

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

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

Sorting as Gradient Flow on the Permutohedron
por: Landers, Jonathan
Publicado: (2025)

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)

DAG Covers: The Steiner Point Effect
por: Bhore, Sujoy, et al.
Publicado: (2026)

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

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)

Improved Online Reachability Preservers
por: Bodwin, Greg, 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 Predictive Framework for Base-n Radix Sort Optimization
por: Pandey, Atharv, 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)

Improved Online Load Balancing in the Two-Norm
por: Borst, Sander, et al.
Publicado: (2025)