1 - 9 out of 9Page size: 10
  1. 2020

  2. Palindromic k-factorization in pure linear time

    Rubinchik, M. & Shur, A. M., 1 Aug 2020, 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020. Esparza, J. & Kral, D. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, MFCS-2020-81. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 170).

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

  3. 2018

  4. EERTREE: An efficient data structure for processing palindromes in strings

    Rubinchik, M. & Shur, A. M., 1 Feb 2018, In: European Journal of Combinatorics. 68, p. 249-265 17 p.

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

  5. 2017

  6. 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

  7. Counting palindromes in substrings

    Rubinchik, M. & Shur, A. M., 2017, String Processing and Information Retrieval - 24th International Symposium, SPIRE 2017, Proceedings. Springer Verlag, Vol. 10508 LNCS. p. 290-303 14 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

  8. 2016

  9. EERTREE: An efficient data structure for processing palindromes in strings

    Rubinchik, M. & Shur, A. M., 2016, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Verlag, Vol. 9538. p. 321-333 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9538).

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

  10. The Number of Distinct Subpalindromes in Random Words

    Rubinchik, M. & Shur, A. M., 2016, In: Fundamenta Informaticae. 145, 3, p. 371-384 14 p.

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

  11. 2015

  12. 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

  13. 2013

  14. 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

  15. ДВЕ ЗАДАЧИ О ВОССТАНОВЛЕНИИ ПОВРЕЖДЕННЫХ СТРОК

    Рубинчик, М. В. & Гамзова, Ю. В., 2013, In: Siberian Electronic Mathematical Reports. 10, p. 538-550 13 p.

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

ID: 116213