1 - 19 out of 19Page size: 20
  1. 2022

  2. Internal shortest absent word queries in constant time and linear space

    Badkobeh, G., Charalampopoulos, P., Kosolobov, D. & Pissis, S. P., 24 Jun 2022, In: Theoretical Computer Science. 922, p. 271-282 12 p.

    Research output: Contribution to journal › Article › peer-review

  3. 2021

  4. Lempel-Ziv parsing for sequences of blocks

    Kosolobov, D. & Valenzuela, D., Dec 2021, In: Algorithms. 14, 12, 359.

    Research output: Contribution to journal › Article › peer-review

  5. Weighted ancestors in suffix trees revisited

    Belazzougui, D., Kosolobov, D., Puglisi, S. J. & Raman, R., 1 Jul 2021, 32nd Annual Symposium on Combinatorial Pattern Matching, CPM 2021. Gawrychowski, P. & Starikovskaya, T. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 8. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 191).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  6. 2020

  7. Lempel–Ziv-Like Parsing in Small Space

    Kosolobov, D., Valenzuela, D., Navarro, G. & Puglisi, S. J., 1 Nov 2020, In: Algorithmica. 82, 11, p. 3195-3215 21 p.

    Research output: Contribution to journal › Article › peer-review

  8. Optimal skeleton huffman trees revisited

    Kosolobov, D. & Merkurev, O., 1 Jan 2020, Computer Science – Theory and Applications - 15th International Computer Science Symposium in Russia, CSR 2020, Proceedings. Fernau, H. (ed.). Springer Verlag, p. 276-288 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12159 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  9. Ordered Strip Packing

    Buchin, K., Kosolobov, D., Sonke, W., Speckmann, B. & Verbeek, K., 2020, LATIN 2020: Theoretical Informatics - 14th Latin American Symposium 2021, Proceedings. Kohayakawa, Y. & Miyazawa, F. K. (eds.). Springer, p. 258-270 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12118 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  10. 2019

  11. Compressed multiple pattern matching

    Kosolobov, D. & Sivukhin, N., 1 Jun 2019, 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019. Pisanti, N. & Pissis, S. P. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 13. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 128).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  12. Linear time minimum segmentation enables scalable founder reconstruction

    Norri, T., Cazaux, B., Kosolobov, D. & Mäkinen, V., 17 May 2019, In: Algorithms for Molecular Biology. 14, 1, 15 p., 12.

    Research output: Contribution to journal › Article › peer-review

  13. Comparison of LZ77-type parsings

    Kosolobov, D. & Shur, A. M., 1 Jan 2019, In: Information Processing Letters. 141, p. 25-29 5 p.

    Research output: Contribution to journal › Article › peer-review

  14. Linear Time Maximum Segmentation Problems in Column Stream Model

    Cazaux, B., Kosolobov, D., Mäkinen, V. & Norri, T., 1 Jan 2019, String Processing and Information Retrieval - 26th International Symposium, SPIRE 2019, Proceedings. Brisaboa, N. R. & Puglisi, S. J. (eds.). Springer Verlag, p. 322-336 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11811 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  15. 2017

  16. Palindromic length in linear time

    Borozdin, K., Kosolobov, D., Rubinchik, M. & Shur, A. M., 1 Jul 2017, 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Vol. 78. 23

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  17. Detecting one-variable patterns

    Kosolobov, D., Manea, F. & Nowotka, D., 2017, String Processing and Information Retrieval - 24th International Symposium, SPIRE 2017, Proceedings. Springer Verlag, Vol. 10508 LNCS. p. 254-270 17 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10508 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  18. 2016

  19. Finding the leftmost critical factorization on unordered alphabet

    Kosolobov, D., 11 Jul 2016, In: Theoretical Computer Science. 636, p. 56-65 10 p.

    Research output: Contribution to journal › Article › peer-review

  20. Computing runs on a general alphabet

    Kosolobov, D., 1 Mar 2016, In: Information Processing Letters. 116, 3, p. 241-244 4 p.

    Research output: Contribution to journal › Article › peer-review

  21. 2015

  22. Lempel-Ziv factorization may be harder than computing all runs

    Kosolobov, D., 1 Jan 2015, In: Leibniz International Proceedings in Informatics, LIPIcs. 30, p. 582-593 12 p.

    Research output: Contribution to journal › Article › peer-review

  23. Faster lightweight Lempel-Ziv parsing

    Kosolobov, D., 2015, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Verlag, Vol. 9235. p. 432-444 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9235).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  24. Online detection of repetitions with backtracking

    Kosolobov, D., 2015, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Verlag, Vol. 9133. p. 295-306 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9133).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  25. Pal(k) is Linear Recognizable Online

    Kosolobov, D., Rubinchik, M. & Shur, A. M., 2015, SOFSEM 2015: THEORY AND PRACTICE OF COMPUTER SCIENCE. Italiano, GF., MargariaSteffen, T., Pokorny, J., Quisquater, JJ. & Wattenhofer, R. (eds.). Springer Verlag, Vol. 8939. p. 289-301 13 p. (Lecture Notes in Computer Science; vol. 8939).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  26. 2013

  27. Finding distinct subpalindromes online

    Kosolobov, D., Rubinchik, M. & Shur, A. M., 2013, Proceedings of the Prague Stringology Conference 2013, PSC 2013. p. 63-69 7 p.

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

ID: 117549