Fast Sorting and Pattern-Avoiding Permutations

DOI10.1137/1.9781611972979.1zbMath1429.68051OpenAlexW2397978869MaRDI QIDQ5194608

David Arthur

Publication date: 16 September 2019

Published in: 2007 Proceedings of the Fourth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611972979.1

Mathematics Subject Classification ID

Searching and sorting (68P10) Permutations, words, matrices (05A05)

Related Items (2)

Smooth Heaps and a Dual View of Self-Adjusting Data Structures ⋮ Finding and counting permutations via CSPs

This page was built for publication: Fast Sorting and Pattern-Avoiding Permutations