default search action

combined dblp search
author search
venue search
publication search

ask others

"Hardness of Longest Common Subsequence for Sequences with Bounded Run-Lengths."

Guillaume Blin et al. (2012)

> Home

Details and statistics

DOI: 10.1007/978-3-642-31265-6_11

access: closed

type: Conference or Workshop Paper

metadata version: 2021-07-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/cpm/BlinBJTV12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cpm/BlinBJTV12
Guillaume Blin, Laurent Bulteau, Minghui Jiang, Pedro J. Tejada, Stéphane Vialette:
Hardness of Longest Common Subsequence for Sequences with Bounded Run-Lengths. CPM 2012: 138-148

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.