External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

A Parallel Algorithm for Finding All Minimal Maximum Subsequences via Random Walk

H. K. Dai, Z. Wang. A Parallel Algorithm for Finding All Minimal Maximum Subsequences via Random Walk. In Adrian Horia Dediu, Enrico Formenti, Carlos Martín-Vide, Bianca Truthe, editors, Language and Automata Theory and Applications - 9th International Conference, LATA 2015, Nice, France, March 2-6, 2015, Proceedings. Volume 8977 of Lecture Notes in Computer Science, pages 133-144, Springer, 2015. [doi]

Authors

H. K. Dai

This author has not been identified. Look up 'H. K. Dai' in Google

Z. Wang

This author has not been identified. Look up 'Z. Wang' in Google
runs on