On minimal critical exponent of balanced sequences
Dvořáková, L., Pelantová, E., Opočenská, D. & Shur, A. M., 24 июн. 2022, в: Theoretical Computer Science. 922, стр. 158-169 12 стр.Computing The Maximum Exponent in a Stream
Merkurev, O. & Shur, A. M., мар. 2022, в: Algorithmica. 84, 3, стр. 742-756 15 стр.Abelian Repetition Threshold Revisited
Petrova, E. A. & Shur, A. M., 2022, Computer Science – Theory and Applications - 17th International Computer Science Symposium in Russia, CSR 2022, Proceedings. Kulikov, A. S. & Raskhodnikova, S. (ред.). Springer, стр. 302-319 18 стр. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); том 13296 LNCS).Branching densities of cube-free and square-free words
Petrova, E. A. & Shur, A. M., апр. 2021, в: Algorithms. 14, 4, 19 стр., 126.Transition Property for Cube-Free Words
Petrova, E. A. & Shur, A. M., апр. 2021, в: Theory of Computing Systems. 65, 3, стр. 479-496 18 стр.Branching Frequency and Markov Entropy of Repetition-Free Languages
Petrova, E. A. & Shur, A. M., 2021, Developments in Language Theory - 25th International Conference, DLT 2021, Proceedings. Moreira, N. & Reis, R. (ред.). Springer, стр. 328-341 14 стр. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); том 12811 LNCS).WORDS SEPARATION AND POSITIVE IDENTITIES IN SYMMETRIC GROUPS
Karpova, O. & Shur, A. M., 2021, в: Journal of Automata, Languages and Combinatorics. 26, 1-2, стр. 67-89 23 стр.Palindromic k-factorization in pure linear time
Rubinchik, M. & Shur, A. M., 1 авг. 2020, 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020. Esparza, J. & Kral, D. (ред.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, MFCS-2020-81. (Leibniz International Proceedings in Informatics, LIPIcs; том 170).String periods in the order-preserving model
Gourdel, G., Kociumaka, T., Radoszewski, J., Rytter, W., Shur, A. & Waleń, T., февр. 2020, в: Information and Computation. 270, 22 стр., 104463.Subword complexity and power avoidance
Shallit, J. & Shur, A., 5 нояб. 2019, в: Theoretical Computer Science. 792, стр. 96-116 21 стр.Tight Tradeoffs for Real-Time Approximation of Longest Palindromes in Streams
Gawrychowski, P., Merkurev, O., Shur, A. M. & Uznański, P., сент. 2019, в: Algorithmica. 81, 9, стр. 3630-3654 25 стр.Searching long repeats in streams
Shur, A. M. & Merkurev, O., 1 июн. 2019, 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019. Pisanti, N. & Pissis, S. P. (ред.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 31. (Leibniz International Proceedings in Informatics, LIPIcs; том 128).Comparison of LZ77-type parsings
Kosolobov, D. & Shur, A. M., 1 янв. 2019, в: Information Processing Letters. 141, стр. 25-29 5 стр.Searching Runs in Streams
Merkurev, O. & Shur, A. M., 1 янв. 2019, String Processing and Information Retrieval - 26th International Symposium, SPIRE 2019, Proceedings. Brisaboa, N. R. & Puglisi, S. J. (ред.). Springer Verlag, стр. 203-220 18 стр. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); том 11811 LNCS).Transition property for cube-free words
Petrova, E. A. & Shur, A. M., 1 янв. 2019, Computer Science – Theory and Applications - 14th International Computer Science Symposium in Russia, CSR 2019, Proceedings. Kucherov, G. & van Bevern, R. (ред.). Springer Verlag, Том 11532. стр. 311-324 14 стр. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); том 11532 LNCS).Square-Free Partial Words with Many Wildcards
Gasnikov, D. & Shur, A. M., 1 авг. 2018, в: International Journal of Foundations of Computer Science. 29, 5, стр. 845-860 16 стр.String periods in the order-preserving model
Gourdel, G., Kociumaka, T., Radoszewski, J., Rytter, W., Shur, A. & Walen, T., 2 февр. 2018, 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018. Niedermeier, R. & Vallee, B. (ред.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Том 96. 16 стр. 38. (Leibniz International Proceedings in Informatics; том 96).EERTREE: An efficient data structure for processing palindromes in strings
Rubinchik, M. & Shur, A. M., 1 февр. 2018, в: European Journal of Combinatorics. 68, стр. 249-265 17 стр.Математика, механика и компьютерные науки : Подготовка к вступительным экзаменам в магистратуру : задачник: учебное пособие
Ананичев, Д. С., Арестов, В. В., Асанов, М. О., Гальперин, А. Л., Глазырина, П. Ю., Гурьянова, К. Н., Иванов, А. О., Коврижных, А. Ю., Коврижных, О. О., Меленцова, Ю. А., Охезин, С. П., Рекант, М. А., Стихина, Т. К., Шнейдер, А. Е., Шур, А. М. & Коврижных, А. Ю. (ред.), 2018, Екатеринбург: Издательство Уральского университета. 140 стр.Lower bounds on words separation: Are there short identities in transformation semigroups?
Bulatov, A., Karpova, O., Shur, A. M. & Startsev, K., 25 авг. 2017, в: Electronic Journal of Combinatorics. 24, 3, P3.35.Palindromic length in linear time
Borozdin, K., Kosolobov, D., Rubinchik, M. & Shur, A. M., 1 июл. 2017, 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Том 78. 23On the size of Lempel-Ziv and Lyndon factorizations
Kärkkäinen, J., Kempa, D., Nakashima, Y., Puglisi, S. J. & Shur, A. M., 1 мар. 2017, 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Том 66. 45Counting palindromes in substrings
Rubinchik, M. & Shur, A. M., 2017, String Processing and Information Retrieval - 24th International Symposium, SPIRE 2017, Proceedings. Springer Verlag, Том 10508 LNCS. стр. 290-303 14 стр. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); том 10508 LNCS).On the tree of binary cube-free words
Petrova, E. A. & Shur, A. M., 2017, Developments in Language Theory - 21st International Conference, DLT 2017, Proceedings. Springer Verlag, Том 10396 LNCS. стр. 296-307 12 стр. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); том 10396 LNCS).Palindromic rich words and run-length encodings
Guo, C., Shallit, J. & Shur, A. M., 1 дек. 2016, в: Information Processing Letters. 116, 12, стр. 735-738 4 стр.Tight tradeoffs for real-time approximation of longest palindromes in streams
Gawrychowski, P., Merkurev, O., Shur, A. M. & Uznański, P., 1 июн. 2016, 27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Том 54. стр. 18.1-18.13 More on quantum, stochastic, and pseudo stochastic languages with few states
Shur, A. M. & Yakaryılmaz, A., 1 мар. 2016, в: Natural Computing. 15, 1, стр. 129-141 13 стр.Special Issue Developments in Language Theory (DLT 2014) Preface
Shur, A., февр. 2016, в: International Journal of Foundations of Computer Science. 27, 2, стр. 101-102 2 стр.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, Том 9538. стр. 321-333 13 стр. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); том 9538).Ternary square-free partial words with many wildcards
Gasnikov, D. & Shur, A. M., 2016, Developments in Language Theory - 20th International Conference, DLT 2016, Proceedings. Springer Verlag, Том 9840. стр. 177-189 13 стр. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); том 9840).The Number of Distinct Subpalindromes in Random Words
Rubinchik, M. & Shur, A. M., 2016, в: Fundamenta Informaticae. 145, 3, стр. 371-384 14 стр.Optimal Bounds for the Similarity Density of the Thue-Morse Word with Overlap-Free and 7/3 -Power-Free Infinite Binary Words
Du, C. F., Shallit, J. & Shur, A. M., 1 дек. 2015, в: International Journal of Foundations of Computer Science. 26, 8, стр. 1147-1165 19 стр.Searching for Zimin patterns
Rytter, W. & Shur, A. M., 16 мар. 2015, в: Theoretical Computer Science. 571, C, стр. 50-57 8 стр.Generating square-free words efficiently
Shur, A. M., 1 янв. 2015, в: Theoretical Computer Science. 601, стр. 67-72 6 стр.On the Tree of Ternary Square-Free Words
Petrova, E. A. & Shur, A. M., 2015, COMBINATORICS ON WORDS, WORDS 2015. Manea, F. & Nowotka, D. (ред.). Springer Verlag, Том 9304. стр. 223-236 14 стр. (Lecture Notes in Computer Science; том 9304).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. (ред.). Springer Verlag, Том 8939. стр. 289-301 13 стр. (Lecture Notes in Computer Science; том 8939).