scientific article; zbMATH DE number 7559139

DOI10.4230/LIPIcs.STACS.2019.30MaRDI QIDQ5090479

Florin Manea, Paweł Gawrychowski, Radosław Serafin

Publication date: 18 July 2022

Full work available at URL: https://arxiv.org/abs/1810.07422

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

sequencesalternating runspatterns in permutations

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Computing longest Lyndon subsequences and longest common Lyndon subsequences

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Enumerating longest increasing subsequences and patience sorting
• Patterns in permutations and words.
• Applications of generalized matrix searching to geometric algorithms
• Geometric applications of a matrix-searching algorithm
• On computing the length of longest increasing subsequences
• Fast computation of a longest increasing subsequence and application
• Fast distance multiplication of unit-Monge matrices
• The Surprising Mathematics of Longest Increasing Subsequences
• Longest Increasing and Decreasing Subsequences
• A fast algorithm for computing longest common subsequences
• Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem
• Improved Bounds for Drawing Trees on Fixed Points with L-Shaped Edges
• A Functional Approach to Data Structures and Its Use in Multidimensional Searching
• Rollercoasters and Caterpillars

This page was built for publication: