"Computing a Longest Increasing Subsequence of Length k in Time O(n log log k)."

Maxime Crochemore, Ely Porat (2008)

> Home

Details and statistics

DOI: —

access: closed

type: Conference or Workshop Paper

metadata version: 2009-09-21

- view
  - electronic edition @ bcs.org
- export record
  dblp key:
  - conf/bcs/CrochemoreP08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/bcs/CrochemoreP08
Maxime Crochemore, Ely Porat:
Computing a Longest Increasing Subsequence of Length k in Time O(n log log k). BCS Int. Acad. Conf. 2008: 69-74

a service of

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.