Fast computation of a longest increasing subsequence and application

Maxime Crochemore; Ely Porat

doi:10.1016/j.ic.2010.04.003

Journal articles

Fast computation of a longest increasing subsequence and application

Maxime Crochemore ^{1, 2} Ely Porat ³

1 Informatics

2 LIGM - Laboratoire d'Informatique Gaspard-Monge

3 DCS - Department of Computer Science

Document type :

Journal articles

Domain :

Computer Science [cs] / Data Structures and Algorithms [cs.DS]

Complete list of metadata

https://hal-upec-upem.archives-ouvertes.fr/hal-00742044
Contributor : Maxime Crochemore Connect in order to contact the contributor
Submitted on : Monday, October 15, 2012 - 4:54:17 PM
Last modification on : Saturday, June 25, 2022 - 11:09:02 AM

Fast computation of a longest increasing subsequence and application

Links full text

Identifiers

Collections

Citation

Export

Metrics

36

Fast computation of a longest increasing subsequence and application

Links full text

Identifiers

Collections

Citation

Export

Share

Metrics

36