| Нет данных |
| Lecture Notes in Computer Science |
— |
EERTREE: AN EFFICIENT DATA STRUCTURE FOR PROCESSING PALINDROMES IN STRINGS / Rubinchik M.,Shur A.M. // Lecture Notes in Computer Science. - 2016. - V. 9538, l. . - P. 321-333. |
2016 |
1 |
| International Journal of Foundations of Computer Science |
— |
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE: PREFACE / Shur A. // International Journal of Foundations of Computer Science. - 2016. - V. 27, l. 2. - P. 101-102. |
2016 |
0 |
| Lecture Notes in Computer Science |
— |
TERNARY SQUARE-FREE PARTIAL WORDS WITH MANY WILDCARDS / Gasnikov D.,Shur A.M. // Lecture Notes in Computer Science. - 2016. - V. 9840, l. . - P. 177-189. |
2016 |
0 |
| Fundamenta Informaticae |
— |
THE NUMBER OF DISTINCT SUBPALINDROMES IN RANDOM WORDS / Rubinchik M.,Shur A.M. // Fundamenta Informaticae. - 2016. - V. 145, l. 3. - P. 371-384. |
2016 |
0 |
| Theoretical Computer Science |
— |
GENERATING SQUARE-FREE WORDS EFFICIENTLY / Shur A.M. // Theoretical Computer Science. - 2015. - V. 601, l. . - P. 67-72. |
2015 |
0 |
| Lecture Notes in Computer Science |
— |
ON THE TREE OF TERNARY SQUARE-FREE WORDS / Petrova E.A.,Shur A.M. // Lecture Notes in Computer Science. - 2015. - V. 9304, l. . - P. 223-236. |
2015 |
0 |
| International Journal of Foundations of Computer Science |
— |
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. // International Journal of Foundations of Computer Science. - 2015. - V. 26, l. 8. - P. 1147-1165. |
2015 |
0 |
| Lecture Notes in Computer Science |
— |
PALK IS LINEAR RECOGNIZABLE ONLINE / Kosolobov D.,Rubinchik M.,Shur A.M. // Lecture Notes in Computer Science. - 2015. - V. 8939, l. . - P. 289-301. |
2015 |
2 |
| Theoretical Computer Science |
— |
SEARCHING FOR ZIMIN PATTERNS / Rytter W.,Shur A.M. // Theoretical Computer Science. - 2015. - V. 571, l. C. - P. 50-57. |
2015 |
1 |
| RAIRO - Theoretical Informatics and Applications |
— |
BINARY PATTERNS IN BINARY CUBE-FREE WORDS: AVOIDABILITY AND GROWTH / Mercaş R.,Ochem P.,Samsonov A.V.,Shur A.M. // RAIRO - Theoretical Informatics and Applications. - 2014. - V. 48, l. 4. - P. 369-389. |
2014 |
2 |