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

DOI10.1007/978-3-319-15579-1_10zbMath1423.68576OpenAlexW43637107MaRDI QIDQ2799168

Z. Wang, H. K. Dai

Publication date: 8 April 2016

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-15579-1_10

zbMATH Keywords

random walkparallel random access machinemessage-passing interfacemaximum subsequences

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Parallel algorithms in computer science (68W10) Algorithms on strings (68W32)

Related Items (1)

Two parallel algorithms for finding all minimal maximum subsequences

This page was built for publication: A Parallel Algorithm for Finding All Minimal Maximum Subsequences via Random Walk