Image de couverture de livre

TwinArray Sort: An Ultrarapid Conditional Non-Comparison Based Sorting Algorithm

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Amini, Amin
Format:	Preprint
Publié:	2024
Sujets:	Data Structures and Algorithms Computational Complexity
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

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

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

Sorting by Strip Swaps is NP-Hard
par: Roy, Swapnoneel, et autres
Publié: (2025)

Improved Bounds for Twin-Width Parameter Variants with Algorithmic Applications to Counting Graph Colorings
par: Baril, Ambroise, et autres
Publié: (2025)

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

Self-referential instances of the dominating set problem are irreducible
par: Zhou, Guangyan
Publié: (2026)

Going Beyond Twin-width? CSPs with Unbounded Domain and Few Variables
par: Jonsson, Peter, et autres
Publié: (2025)

An $\widetilde{O} (n^{3/7})$ Round Parallel Algorithm for Matroid Bases
par: Khanna, Sanjeev, et autres
Publié: (2026)

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

Efficient Catalytic Graph Algorithms
par: Cook, James, et autres
Publié: (2025)

Improved Algorithm for Permutation Testing
par: Zhang, Xiaojin
Publié: (2020)

Sensitivity Lower Bounds for Approximaiton Algorithms
par: Fleming, Noah, et autres
Publié: (2024)

Algorithms and Hardness for Estimating Statistical Similarity
par: Bhattacharyya, Arnab, et autres
Publié: (2025)

Pseudodeterministic Algorithms for Minimum Cut Problems
par: Agarwala, Aryan, et autres
Publié: (2025)

Parameterized Algorithms for Editing to Uniform Cluster Graph
par: Gaikwad, Ajinkya, et autres
Publié: (2024)

Semi-Streaming Algorithms for Graph Property Certification
par: Das, Avinandan, et autres
Publié: (2025)

Exact Algorithms for Distance to Unique Vertex Cover
par: Fioravantes, Foivos, et autres
Publié: (2025)

Hardness and Algorithmic Results for Roman \{3\}-Domination
par: Reddy, Sangam Balchandar
Publié: (2025)

Capacitated Fair-Range Clustering: Hardness and Approximation Algorithms
par: Gadekar, Ameet, et autres
Publié: (2025)

From Amortized to Worst Case Delay in Enumeration Algorithms
par: Capelli, Florent, et autres
Publié: (2021)

Algorithms for the Diverse-k-SAT problem: the geometry of satisfying assignments
par: Austrin, Per, et autres
Publié: (2024)

A Faster Randomized Algorithm for Vertex Cover: An Automated Approach
par: Clinch, Katie, et autres
Publié: (2025)

Frontier Space-Time Algorithms Using Only Full Memory
par: Chmel, Petr, et autres
Publié: (2026)

Conditional lower bounds for sparse parameterized 2-CSP: A streamlined proof
par: S., Karthik C., et autres
Publié: (2023)

Quantum Algorithms on Edge Lists: Hiding, Shuffling, and Cycle Finding
par: Gilani, Amin Shiraz, et autres
Publié: (2024)

Towards Deterministic Algorithms for Constant-Depth Factors of Constant-Depth Circuits
par: Kumar, Mrinal, et autres
Publié: (2024)

A Simpler Exponential-Time Approximation Algorithm for MAX-k-SAT
par: Buhrman, Harry, et autres
Publié: (2025)

Reconstructing Sets of Strings from Their k-way Projections: Algorithms & Complexity
par: Tate, Elise, et autres
Publié: (2025)

The Art of Staying Ahead of Deadlines: Improved Algorithms for the Minimum Tardy Processing Time
par: Stoian, Mihail
Publié: (2024)

Inclusive and Exclusive Vertex Splitting into Specific Graph Classes: NP Hardness and Algorithms
par: Gaikwad, Ajinkya, et autres
Publié: (2025)

Near Optimal Algorithms for Noisy $k$-XOR under Low-Degree Heuristic
par: Mao, Songtao
Publié: (2026)

Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search
par: Esmer, Barış Can, et autres
Publié: (2022)

End Cover for Initial Value Problem: Complete Validated Algorithms with Complexity Analysis
par: Zhang, Bingwei, et autres
Publié: (2026)

Characterizing Streaming Decidability of CSPs via Non-Redundancy
par: Sharma, Amatya, et autres
Publié: (2026)

Non-Redundancy of Low-Arity Symmetric Boolean CSPs
par: Sharma, Amatya, et autres
Publié: (2026)

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

Turnstile Streaming Algorithms Might (Still) as Well Be Linear Sketches, for Polynomial-Length Streams
par: Jiang, Cheng, et autres
Publié: (2026)

Covering a Polyomino-Shaped Stain with Non-Overlapping Identical Stickers
par: Oka, Keigo, et autres
Publié: (2026)

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

Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part I: Algorithmic Results
par: Focke, Jacob, et autres
Publié: (2022)