"A Cover-Merging-Based Algorithm for the Longest Increasing Subsequence in ..."

Sebastian Deorowicz (2012)

> Home

Details and statistics

DOI: —

access: open

type: Journal Article

metadata version: 2022-02-14

- view
  - electronic edition @ cai.sk (open access)
- export record
  dblp key:
  - journals/cai/Deorowicz12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cai/Deorowicz12
Sebastian Deorowicz:
A Cover-Merging-Based Algorithm for the Longest Increasing Subsequence in a Sliding Window Problem. Comput. Informatics 31(6): 1217-1233 (2012)

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.