Image de couverture de livre

An Optimal Algorithm for Sorting Pattern-Avoiding Sequences

Fuente: arXiv

Enregistré dans:

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

Documents similaires

Inapproximability of Counting Permutation Patterns
par: Opler, Michal
Publié: (2026)

Compact representations of pattern-avoiding permutations
par: Kozma, László, et autres
Publié: (2025)

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

Optimization with pattern-avoiding input
par: Berendsohn, Benjamin Aram, et autres
Publié: (2023)

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

Pathfinding in Self-Deleting Graphs
par: Dvořák, Michal, et autres
Publié: (2025)

Fast and simple multiplication of bounded twin-width matrices
par: Kozma, László, et autres
Publié: (2026)

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

Precoloring extension with demands on paths
par: Das, Arun Kumar, et autres
Publié: (2025)

SquareSort: a cache-oblivious sorting algorithm
par: Koucký, Michal, et autres
Publié: (2024)

Anytime Sorting Algorithms (Extended Version)
par: Caizergues, Emma, et autres
Publié: (2024)

How to Sort in a Refrigerator: Simple Entropy-Sensitive Strictly In-Place Sorting Algorithms
par: Gila, Ofek, et autres
Publié: (2026)

Nearly Optimal Bounds for Stochastic Online Sorting
par: Hu, Yang
Publié: (2025)

Simpler Optimal Sorting from a Directed Acyclic Graph
par: van der Hoog, Ivor, et autres
Publié: (2024)

A Polylogarithmic Competitive Algorithm for Stochastic Online Sorting and TSP
par: Kalavas, Andreas, et autres
Publié: (2025)

A Polylogarithmic Competitive Algorithm for Stochastic Online Sorting and TSP
par: Kalavas, Andreas, et autres
Publié: (2025)

Multi-Way Co-Ranking: Index-Space Partitioning of Sorted Sequences Without Merge
par: Joshi, Amit
Publié: (2025)

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

Quick-Sort Style Approximation Algorithms for Generalizations of Feedback Vertex Set in Tournaments
par: Gupta, Sushmita, et autres
Publié: (2024)

Sorting under Partial Information with Optimal Preprocessing Time via Unified Bound Heaps
par: Rutschmann, Daniel
Publié: (2026)

zSort: Stable Distribution Sort using Z-Score Partitioning
par: Jain, Hriday, et autres
Publié: (2026)

TwinArray Sort: An Ultrarapid Conditional Non-Comparison Based Sorting Algorithm
par: Amini, Amin
Publié: (2024)

On Instance-Optimal Algorithms for a Generalization of Nuts and Bolts and Generalized Sorting
par: Goswami, Mayank, et autres
Publié: (2022)

Improved Online Sorting
par: Nirjhor, Jubayer, et autres
Publié: (2025)

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

Scalable Distributed String Sorting
par: Kurpicz, Florian, et autres
Publié: (2024)

Sorting as Gradient Flow on the Permutohedron
par: Landers, Jonathan
Publié: (2025)

A Polynomial Time Algorithm for Steiner Tree when Terminals Avoid a $K_4$-Minor
par: Groenland, Carla, et autres
Publié: (2024)

Robust-Sorting and Applications to Ulam-Median
par: Jaiswal, Ragesh, et autres
Publié: (2025)

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

Compressing Hypergraphs using Suffix Sorting
par: Adler, Enno, et autres
Publié: (2025)

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

Quickly Avoiding a Random Catastrophe
par: Ashur, Stav, et autres
Publié: (2025)

Near-Optimal Property Testers for Pattern Matching
par: Jin, Ce, et autres
Publié: (2025)

Sorting multibay block stacking storage systems
par: Pfrommer, Jakob, et autres
Publié: (2024)

Tight Bounds for Sorting Under Partial Information
par: van der Hoog, Ivor, et autres
Publié: (2024)

Nearly Tight Bounds for the Online Sorting Problem
par: Azar, Yossi, et autres
Publié: (2025)

Sorted Range Reporting and Range Minima Queries
par: Akram, Waseem, et autres
Publié: (2021)

Faster Algorithms for Text-to-Pattern Hamming Distances
par: Chan, Timothy M., et autres
Publié: (2023)

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