Dmitry Kosolobov. Lempel-Ziv Factorization May Be Harder Than Computing All Runs. In Ernst W. Mayr, Nicolas Ollinger, editors, 32nd International Symposium on Theoretical Aspects of Computer Science, STACS 2015, March 4-7, 2015, Garching, Germany. Volume 30 of LIPIcs, pages 582-593, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2015. [doi]
@inproceedings{Kosolobov15, title = {Lempel-Ziv Factorization May Be Harder Than Computing All Runs}, author = {Dmitry Kosolobov}, year = {2015}, doi = {10.4230/LIPIcs.STACS.2015.582}, url = {http://dx.doi.org/10.4230/LIPIcs.STACS.2015.582}, researchr = {https://researchr.org/publication/Kosolobov15}, cites = {0}, citedby = {0}, pages = {582-593}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science, STACS 2015, March 4-7, 2015, Garching, Germany}, editor = {Ernst W. Mayr and Nicolas Ollinger}, volume = {30}, series = {LIPIcs}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik}, isbn = {978-3-939897-78-1}, }