Summary: On the longest increasing subsequence of a
circular list
M. H. Albert
M. D. Atkinson
Doron Nussbaum
J¨org-R¨udiger Sack
Nicola Santoro
Abstract
The longest increasing circular subsequence (LICS) of a list is consid-
ered. 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
= 1.
Numerical experiments with the algorithm suggest that |µ(n) - 2

Source: Atkinson, Mike - Department of Computer Science, University of Otago

Collections: Computer Technologies and Information Sciences