%0 Journal Article %1 journals/jcss/DaiW19 %A Dai, H. K. %A Wang, Zhu %D 2019 %J J. Comput. Syst. Sci. %K dblp %P 216-243 %T Two parallel algorithms for finding all minimal maximum subsequences. %U http://dblp.uni-trier.de/db/journals/jcss/jcss104.html#DaiW19 %V 104

@article{journals/jcss/DaiW19, added-at = {2022-11-15T00:00:00.000+0100}, author = {Dai, H. K. and Wang, Zhu}, biburl = {https://www.bibsonomy.org/bibtex/28e25056ccddfb50e6dcba7b9e740542e/dblp}, ee = {https://doi.org/10.1016/j.jcss.2018.11.001}, interhash = {a91d9b0c95b714ef7f777c539530fe1c}, intrahash = {8e25056ccddfb50e6dcba7b9e740542e}, journal = {J. Comput. Syst. Sci.}, keywords = {dblp}, pages = {216-243}, timestamp = {2024-04-08T19:14:02.000+0200}, title = {Two parallel algorithms for finding all minimal maximum subsequences.}, url = {http://dblp.uni-trier.de/db/journals/jcss/jcss104.html#DaiW19}, volume = 104, year = 2019 }