%0 Conference Paper %1 conf/cpm/MienoIBT17 %A Mieno, Takuya %A Inenaga, Shunsuke %A Bannai, Hideo %A Takeda, Masayuki %B CPM %D 2017 %E Kärkkäinen, Juha %E Radoszewski, Jakub %E Rytter, Wojciech %I Schloss Dagstuhl - Leibniz-Zentrum für Informatik %K dblp %P 24:1-24:11 %T Tight Bounds on the Maximum Number of Shortest Unique Substrings. %U http://dblp.uni-trier.de/db/conf/cpm/cpm2017.html#MienoIBT17 %V 78 %@ 978-3-95977-039-2

@inproceedings{conf/cpm/MienoIBT17, added-at = {2018-08-23T00:00:00.000+0200}, author = {Mieno, Takuya and Inenaga, Shunsuke and Bannai, Hideo and Takeda, Masayuki}, biburl = {https://www.bibsonomy.org/bibtex/2924d49a63058e76e6421cee5d37398d8/dblp}, booktitle = {CPM}, crossref = {conf/cpm/2017}, editor = {Kärkkäinen, Juha and Radoszewski, Jakub and Rytter, Wojciech}, ee = {https://doi.org/10.4230/LIPIcs.CPM.2017.24}, interhash = {49158e8bee488ba5d3ecea846dbb16e7}, intrahash = {924d49a63058e76e6421cee5d37398d8}, isbn = {978-3-95977-039-2}, keywords = {dblp}, pages = {24:1-24:11}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, series = {LIPIcs}, timestamp = {2020-02-12T11:44:38.000+0100}, title = {Tight Bounds on the Maximum Number of Shortest Unique Substrings.}, url = {http://dblp.uni-trier.de/db/conf/cpm/cpm2017.html#MienoIBT17}, volume = 78, year = 2017 }