1 - 10 out of 19Page size: 10
  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

Previous 1 2 Next

ID: 117549