Heapable Sequences and Subseqeuences
From MaRDI portal
Publication:5194689
DOI10.1137/1.9781611973013.4zbMath1429.68159arXiv1007.2365OpenAlexW1665791312MaRDI QIDQ5194689
No author found.
Publication date: 16 September 2019
Published in: 2011 Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1007.2365
Combinatorics in computer science (68R05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05) Algorithms on strings (68W32)
Related Items (6)
Partition into Heapable Sequences, Heap Tableaux and a Multiset Extension of Hammersley’s Process ⋮ Efficient methods of calculating the number of heapable permutations ⋮ The Maximum Binary Tree Problem. ⋮ Almost-sure asymptotics for the number of heaps inside a random sequence ⋮ Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree ⋮ The maximum binary tree problem
This page was built for publication: Heapable Sequences and Subseqeuences
