"A Parallel Algorithm for Finding All Minimal Maximum Subsequences via ..."

H. K. Dai, Zhu Wang (2015)

> Home

Details and statistics

DOI: 10.1007/978-3-319-15579-1_10

access: closed

type: Conference or Workshop Paper

metadata version: 2022-11-15

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/lata/DaiW15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/lata/DaiW15
H. K. Dai, Zhu Wang:
A Parallel Algorithm for Finding All Minimal Maximum Subsequences via Random Walk. LATA 2015: 133-144

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.