On the longest increasing subsequence of a circular list

The longest increasing circular subsequence (LICS) of a list is considered. A Monte-Carlo algorithm to compute it is given which has worst case execution time O(n3/2 log n) and storage requirement O(n). It is proved that the expected length µ(n) of the LICS satisfies limn→∞ µ(n) 2 √ n

• Type: Journal
• Year: 2007
• Where: IPL
• Authors: Michael H. Albert, Mike D. Atkinson, Doron Nussbaum, Jörg-Rüdiger Sack, Nicola Santoro
• Keywords: IPL 2007, LICS, Monte-Carlo Algorithm, Worst Case Execution Time