A bridging model for parallel computation
Communications of the ACM
Cilk: an efficient multithreaded runtime system
Journal of Parallel and Distributed Computing - Special issue on multithreading for multiprocessors
The implementation of the Cilk-5 multithreaded language
PLDI '98 Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation
The String-to-String Correction Problem
Journal of the ACM (JACM)
A fast algorithm for computing longest common subsequences
Communications of the ACM
A work-optimal CGM algorithm for the LIS problem
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices
SIAM Journal on Computing
Intel threading building blocks
Intel threading building blocks
Introduction to Algorithms, Third Edition
Introduction to Algorithms, Third Edition
A fast algorithm for computing a longest common increasing subsequence
Information Processing Letters
Fast computation of a longest increasing subsequence and application
Information and Computation
Parallel longest increasing subsequences in scalable time and memory
PPAM'09 Proceedings of the 8th international conference on Parallel processing and applied mathematics: Part I
A CGM algorithm solving the longest increasing subsequence problem
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part V
| Hi-index | 0.89 |
In this paper, we present a divide and conquer approach to solve the problem of computing a longest increasing subsequence. Our approach runs in O(nlogn) time and hence is optimal in the comparison model. In the sequel, we show how we can achieve a work-optimal parallel algorithm using our divide and conquer approach.