On the longest increasing subsequence of a circular list

DOI10.1016/j.ipl.2006.08.003zbMath1185.68840DBLPjournals/ipl/AlbertANSS07OpenAlexW2042983118WikidataQ62037472 ScholiaQ62037472MaRDI QIDQ845894

N. E. Zubov

Publication date: 29 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2006.08.003

zbMATH Keywords

combinatorial problemsrandomized algorithms

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Randomized algorithms (68W20)

Related Items (6)

Universality for random permutations and some other groups ⋮ Erdős-Szekeres theorem for cyclic permutations ⋮ Improvised divide and conquer approach for the LIS problem ⋮ An algorithm for solving the longest increasing circular subsequence problem ⋮ The longest almost-increasing subsequence ⋮ Fast distance multiplication of unit-Monge matrices

Uses Software

• MUMMER

Cites Work

• On computing the length of longest increasing subsequences
• Longest increasing subsequences in sliding windows
• Longest Increasing and Decreasing Subsequences
• On the distribution of the length of the longest increasing subsequence of random permutations
• Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the longest increasing subsequence of a circular list