Imagen de Portada

Towards universally optimal sorting algorithms

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Sen, Sandeep
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms Computational Complexity F.2.2
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

SARRIGUREN: a polynomial-time complete algorithm for random $k$-SAT with relatively dense clauses
por: Sarriguren, Alfredo Goñi
Publicado: (2024)

Approximate all-pairs Hamming distances and 0-1 matrix multiplication
por: Kowaluk, Miroslaw, et al.
Publicado: (2025)

Identity Testing for Circuits with Exponentiation Gates
por: Li, Jiatu, et al.
Publicado: (2025)

Parameterized Complexity of Biclique Contraction and Balanced Biclique Contraction
por: Krithika, R., et al.
Publicado: (2023)

Spanning Trees Minimizing Branching Costs
por: Gargano, Luisa, et al.
Publicado: (2024)

An Algorithm for a Variation of the Shortest Common Superstring Problem
por: Gilfanov, Arthur
Publicado: (2024)

Graph Threading with Turn Costs
por: Demaine, Erik D., et al.
Publicado: (2024)

Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices
por: Dvořák, Pavel, et al.
Publicado: (2017)

Realizing temporal graphs from fastest travel times
por: Klobas, Nina, et al.
Publicado: (2023)

A Piecewise Approach for the Analysis of Exact Algorithms
por: Clinch, Katie, et al.
Publicado: (2024)

Certificate-Sensitive Subset Sum: Realizing Instance Complexity
por: Salas, Jesus
Publicado: (2025)

Fine-Grained Optimality of Partially Dynamic Shortest Paths and More
por: Saha, Barna, et al.
Publicado: (2024)

A Decomposition Approach to the Weighted $k$-server Problem
por: Ayyadevara, Nikhil, et al.
Publicado: (2024)

On Solving Problems of Substantially Super-linear Complexity in $N^{o(1)}$ Rounds in the MPC Model
por: Lingas, Andrzej
Publicado: (2026)

NP-Completeness of the Combinatorial Distance Matrix Realisation Problem
por: Fairbairn, David L., et al.
Publicado: (2024)

When Votes Change and Committees Should (Not)
por: Bredereck, Robert, et al.
Publicado: (2020)

A faster algorithm for the construction of optimal factoring automata
por: Erlebach, Thomas, et al.
Publicado: (2024)

Exact and Approximate High-Multiplicity Scheduling on Identical Machines
por: Jansen, Klaus, et al.
Publicado: (2024)

Large cliques and large independent sets: can they coexist?
por: Feige, Uriel, et al.
Publicado: (2025)

Kernelization dichotomies for hitting minors under structural parameterizations
por: Bougeret, Marin, et al.
Publicado: (2025)

Kernelization Dichotomies for Hitting Subgraphs under Structural Parameterizations
por: Bougeret, Marin, et al.
Publicado: (2024)

An Efficient Algorithm for Unbalanced 1D Transportation
por: Gouvine, Gabriel
Publicado: (2023)

Balanced Substructures in Bicolored Graphs
por: Ardra, P. S., et al.
Publicado: (2024)

Eliminating Illusion in Directed Networks
por: Jana, Sougata, et al.
Publicado: (2026)

Approximation algorithms for scheduling with rejection in green manufacturing
por: Gong, Mingyang, et al.
Publicado: (2025)

Approximation algorithms for Job Scheduling with reconfigurable resources
por: Bergé, Pierre, et al.
Publicado: (2023)

The cost of cyclic permutations and remainder sums in the Euclidean algorithm
por: Blomer, Valentin, et al.
Publicado: (2026)

An improved local search based algorithm for $k^-$-star partition
por: Gong, Mingyang, et al.
Publicado: (2025)

Simple in-place yet comparison-optimal Mergesort
por: Siebert, Christian
Publicado: (2025)

Almost Tight Approximation Hardness for Single-Source Directed k-Edge-Connectivity
por: Liao, Chao, et al.
Publicado: (2022)

The Simultaneous Triple Product Property and Group-theoretic Results for the Exponent of Matrix Multiplication
por: Murthy, Sandeep
Publicado: (2007)

Tree Containment Parameterized by Scanwidth
por: van Iersel, Leo, et al.
Publicado: (2026)

Parallel Complexity of Depth-First-Search and Maximal path in restricted graph classes
por: Chauhan, Archit, et al.
Publicado: (2025)

Complexity of Finding and Enumerating Interconnection Trees
por: Demange, Noé, et al.
Publicado: (2026)

Faster shortest-path algorithms using the acyclic-connected tree
por: Stefansson, Elis, et al.
Publicado: (2025)

Towards a Unified Theory of Light Spanners I: Fast (Yet Optimal) Constructions
por: Le, Hung, et al.
Publicado: (2021)

The Voronoi Diagram of Weakly Smooth Planar Point Sets in $O(\log n)$ Deterministic Rounds on the Congested Clique
por: Jansson, Jesper, et al.
Publicado: (2024)

Mim-Width is paraNP-complete
por: Bergougnoux, Benjamin, et al.
Publicado: (2025)

Answering Related Questions
por: Bonnet, Édouard
Publicado: (2025)

Coloring Hardness on Low Twin-Width Graphs
por: Bonnet, Édouard
Publicado: (2025)