Copertina

XiSort: Deterministic Sorting via IEEE-754 Total Ordering and Entropy Minimization

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autore principale:	Alpay, Faruk
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Data Structures and Algorithms Information Theory Numerical Analysis 68P10, 68Q25, 94A17, 65Y20 F.2.2; G.4; E.1; G.3
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

A Simple and Efficient Algorithm for Sorting Signed Permutations by Reversals
di: Swenson, Krister M.
Pubblicazione: (2024)

Residual-Entropy Accounting for Routed Atom-Budgeted Learned Indexes
di: Alpay, Faruk, et al.
Pubblicazione: (2026)

On (In)approximability of MaxMin Independent Set Reconfiguration
di: Hoang, Hung P., et al.
Pubblicazione: (2026)

Competitive Query Minimization for Stable Matching with One-Sided Uncertainty
di: Bampis, Evripidis, et al.
Pubblicazione: (2024)

Naively Sorting Evolving Data is Optimal and Robust
di: Giakkoupis, George, et al.
Pubblicazione: (2024)

Hybrid hierarchical matrices with adaptive mixed precision storage
di: Khan, Ritesh, et al.
Pubblicazione: (2026)

An Explicit and Efficient $O(n^2)$-Time Algorithm for Sorting Sumsets
di: Mundhra, S.
Pubblicazione: (2025)

When can forward stable algorithms be composed stably?
di: Beltrán, Carlos, et al.
Pubblicazione: (2021)

The complexity of accurate floating point computation
di: Demmel, James
Pubblicazione: (2003)

On Solving Reachability in Grid Digraphs using a Psuedoseparator
di: Jain, Rahul, et al.
Pubblicazione: (2019)

Spectral Shadows: When Communication Complexity Meets Linear Invariance Testing
di: Datta, Swarnalipa, et al.
Pubblicazione: (2026)

Stochastic Indexing Primitives for Non-Deterministic Molecular Archives
di: Alpay, Faruk, et al.
Pubblicazione: (2026)

Classification via Two-Way Comparisons
di: Chrobak, Marek, et al.
Pubblicazione: (2023)

The Quasi-probability Method and Applications for Trace Reconstruction
di: Rubinstein, Ittai
Pubblicazione: (2024)

A Randomized Algorithm for Preconditioner Selection
di: DiPaolo, Conner, et al.
Pubblicazione: (2019)

On the twin-width of near-regular graphs
di: Heinrich, Irene, et al.
Pubblicazione: (2025)

Reducing the Space Used by the Sieve of Eratosthenes When Factoring
di: Hartman, Samuel, et al.
Pubblicazione: (2024)

Pliability and Approximating Max-CSPs
di: Romero, Miguel, et al.
Pubblicazione: (2019)

Simple Combinatorial Construction of the $k^{o(1)}$-Lower Bound for Approximating the Parameterized $k$-Clique
di: Chen, Yijia, et al.
Pubblicazione: (2023)

Extending Exact Integrality Gap Computations for the Metric TSP
di: Cook, William, et al.
Pubblicazione: (2026)

On the PLS-Completeness of $k$-Opt Local Search for the Traveling Salesman Problem
di: Heimann, Sophia, et al.
Pubblicazione: (2026)

On Identifying Critical Network Edges via Analyzing Changes in Shapes (Curvatures)
di: DasGupta, Bhaskar, et al.
Pubblicazione: (2026)

Explicit Construction of Approximate Kolmogorov Superpositions with C2 Smoothness
di: Song, Lunji, et al.
Pubblicazione: (2025)

A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem
di: Heimann, Sophia, et al.
Pubblicazione: (2025)

Coordinatewise Balanced Covering for Linear Gain Graphs, with an Application to Coset-List Min-2-Lin over Powers of Two
di: Alpay, Faruk, et al.
Pubblicazione: (2026)

Fast Evaluation of Truncated Neumann Series by Low-Product Radix Kernels
di: Sao, Piyush
Pubblicazione: (2026)

Fast sampling of satisfying assignments from random $k$-SAT with applications to connectivity
di: Chen, Zongchen, et al.
Pubblicazione: (2022)

Interval Graphs are Reconstructible
di: Heinrich, Irene, et al.
Pubblicazione: (2025)

Space-Time Trade-off in Integer Linear Scaling Rounded to the Nearest Integer through Multiplicative and Additive Decomposition
di: Kim, Kyeong Soo
Pubblicazione: (2026)

The $k$-Opt algorithm for the Traveling Salesman Problem has exponential running time for $k \ge 5$
di: Heimann, Sophia, et al.
Pubblicazione: (2024)

The Bottom-Left Algorithm for the Strip Packing Problem
di: Hougardy, Stefan, et al.
Pubblicazione: (2024)

Beating Posits at Their Own Game: Takum Arithmetic
di: Hunhold, Laslo
Pubblicazione: (2024)

A Polynomial-time Algorithm to Solve the Airplane Refueling Problem: the Sequential Search Algorithm
di: Cui, Jinchuan, et al.
Pubblicazione: (2022)

Low-Memory Numerical Certification
di: Breiding, Paul, et al.
Pubblicazione: (2026)

Safety-Certified CRT Sparse FFT: $Ω(k^2)$ Lower Bound and $O(N \log N)$ Worst-Case
di: Flouro, Aaron R., et al.
Pubblicazione: (2026)

Error Analysis of the Deep Mixed Residual Method for High-order Elliptic Equations
di: Bai, Mengjia, et al.
Pubblicazione: (2024)

Hamiltonicity Parameterized by Mim-Width is (Indeed) Para-NP-Hard
di: Bergougnoux, Benjamin, et al.
Pubblicazione: (2025)

What is a POLYNOMIAL-TIME Computable L2-Function?
di: Bacho, Aras, et al.
Pubblicazione: (2026)

On the Average-Case Performance of Greedy for Maximum Coverage
di: Balkanski, Eric, et al.
Pubblicazione: (2026)

How quickly can you pack short paths? Engineering a search-tree algorithm for disjoint s-t paths of bounded length
di: Huber, Michael Kiran
Pubblicazione: (2024)