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]

Abstract

Abstract is missing.