Introduction to Algorithms: A Creative Approach
Introduction to Algorithms: A Creative Approach
The Science of Programming
Introduction to Algorithms
Longest increasing subsequences in sliding windows
Theoretical Computer Science
An algorithm for solving the longest increasing circular subsequence problem
Information Processing Letters
The longest almost-increasing subsequence
Information Processing Letters
Fast distance multiplication of unit-Monge matrices
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
The longest almost-increasing subsequence
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
A TDM slot allocation flow based on multipath routing in NoCs
Microprocessors & Microsystems
| Hi-index | 0.89 |
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(n^3^/^2logn) and storage requirement O(n). It is proved that the expected length @m(n) of the LICS satisfies lim"n"-"~@m(n)2n=1. Numerical experiments with the algorithm suggest that |@m(n)-2n|=O(n^1^/^6).