"Fast computation of a longest increasing subsequence and application."

Maxime Crochemore, Ely Porat (2010)

> Home

Details and statistics

DOI: 10.1016/J.IC.2010.04.003

access: open

type: Journal Article

metadata version: 2021-02-12

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/iandc/CrochemoreP10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iandc/CrochemoreP10
Maxime Crochemore, Ely Porat:
Fast computation of a longest increasing subsequence and application. Inf. Comput. 208(9): 1054-1059 (2010)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.