default search action

combined dblp search
author search
venue search
publication search

ask others

Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID

"Efficient Representation and Parallel Computation of String-Substring ..."

Alexandre Tiskin (2005)

> Home

Details and statistics

DOI: —

access: unavailable

type: Conference or Workshop Paper

metadata version: 2006-11-20

- no documents available
- export record
  dblp key:
  - conf/parco/Tiskin05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/parco/Tiskin05
Alexandre Tiskin:
Efficient Representation and Parallel Computation of String-Substring Longest Common Subsequences. PARCO 2005: 827-834

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.