Cover Image

How to Sort in a Refrigerator: Simple Entropy-Sensitive Strictly In-Place Sorting Algorithms

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Gila, Ofek, Goodrich, Michael T., Sridhar, Vinesh
Format:	Preprint
Published:	2026
Subjects:	Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Fast Geographic Routing in Fixed-Growth Graphs
by: Gila, Ofek, et al.
Published: (2025)

Zip-Tries: Simple Dynamic Data Structures for Strings
by: Eppstein, David, et al.
Published: (2025)

Highway Preferential Attachment Models for Geographic Routing
by: Gila, Ofek, et al.
Published: (2024)

Zip-zip Trees: Making Zip Trees More Balanced, Biased, Compact, or Persistent
by: Gila, Ofek, et al.
Published: (2023)

Dynamic Accountable Storage: An Efficient Protocol for Real-time Cloud Storage Auditing
by: Goodrich, Michael T., et al.
Published: (2024)

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

New Sorting Algorithm Wave Sort (W-Sort)
by: Wei, Jia Xu
Published: (2025)

Anytime Sorting Algorithms (Extended Version)
by: Caizergues, Emma, et al.
Published: (2024)

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

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

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

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

Improved Online Sorting
by: Nirjhor, Jubayer, et al.
Published: (2025)

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

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

Scalable Distributed String Sorting
by: Kurpicz, Florian, et al.
Published: (2024)

Sorting as Gradient Flow on the Permutohedron
by: Landers, Jonathan
Published: (2025)

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

Making Quickhull More Like Quicksort: A Simple Randomized Output-Sensitive Convex Hull Algorithm
by: Goodrich, Michael T., et al.
Published: (2024)

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

Sorting and Selection in Rounds with Adversarial Comparisons
by: Trevisan, Chris
Published: (2023)

Compressing Hypergraphs using Suffix Sorting
by: Adler, Enno, et al.
Published: (2025)

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

Sorting with constraints
by: Manas, A.
Published: (2025)

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

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

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

Nearly Optimal Bounds for Stochastic Online Sorting
by: Hu, Yang
Published: (2025)

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

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

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

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

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

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

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

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

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

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

Fast and Simple Sorting Using Partial Information
by: Haeupler, Bernhard, et al.
Published: (2024)

On Instance-Optimal Algorithms for a Generalization of Nuts and Bolts and Generalized Sorting
by: Goswami, Mayank, et al.
Published: (2022)