%0 Conference Paper %1 conf/fdse/Dai19 %A Dai, H. K. %B FDSE %D 2019 %E Dang, Tran Khanh %E Küng, Josef %E Takizawa, Makoto %E Bui, Son Ha %I Springer %K dblp %P 165-184 %T Finding All Minimal Maximum Subsequences in Parallel. %U http://dblp.uni-trier.de/db/conf/fdse/fdse2019.html#Dai19 %V 11814 %@ 978-3-030-35653-8

@inproceedings{conf/fdse/Dai19, added-at = {2019-11-28T00:00:00.000+0100}, author = {Dai, H. K.}, biburl = {https://www.bibsonomy.org/bibtex/2a2bc6666deec3fffc129ced6408b551f/dblp}, booktitle = {FDSE}, crossref = {conf/fdse/2019}, editor = {Dang, Tran Khanh and Küng, Josef and Takizawa, Makoto and Bui, Son Ha}, ee = {https://doi.org/10.1007/978-3-030-35653-8_12}, interhash = {452efc3238136ff5630870bf39b6b5fc}, intrahash = {a2bc6666deec3fffc129ced6408b551f}, isbn = {978-3-030-35653-8}, keywords = {dblp}, pages = {165-184}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-11-29T11:46:36.000+0100}, title = {Finding All Minimal Maximum Subsequences in Parallel.}, url = {http://dblp.uni-trier.de/db/conf/fdse/fdse2019.html#Dai19}, volume = 11814, year = 2019 }