On the longest increasing subsequence of a circular list

DOI10.1016/J.IPL.2006.08.003zbMATH Open1185.68840DBLPjournals/ipl/AlbertANSS07OpenAlexW2042983118WikidataQ62037472 ScholiaQ62037472MaRDI QIDQ845894FDOQ845894

Authors: 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

Recommendations

• On two variants of the longest increasing subsequence problem
• scientific article; zbMATH DE number 1515819
• Faster algorithms for computing longest common increasing subsequences
• scientific article; zbMATH DE number 3860389
• Longest increasing subsequences in sliding windows

zbMATH Keywords

randomized algorithmscombinatorial problems

Mathematics Subject Classification ID

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

Cites Work

• Longest Increasing and Decreasing Subsequences
• Title not available (Why is that?)
• On the distribution of the length of the longest increasing subsequence of random permutations
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On computing the length of longest increasing subsequences
• Longest increasing subsequences in sliding windows
• Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem
• Title not available (Why is that?)

Cited In (7)

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

Uses Software

• MUMMER

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845894)