• 112 Citations
  • 5 h-Index
20122019
If you made any changes in Pure these will be visible here soon.

Research Output 2012 2019

Filter
Conference contribution
2018

String periods in the order-preserving model

Gourdel, G., Kociumaka, T., Radoszewski, J., Rytter, W., Shur, A. & Walen, T., 2 Feb 2018, 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Vol. 96. 38

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

2017
2 Citations (Scopus)

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 proceedingConference contributionResearchpeer-review

Palindrome
Counting
Strings
Data structures
Query
2 Citations (Scopus)

On the size of Lempel-Ziv and Lyndon factorizations

Kärkkäinen, J., Kempa, D., Nakashima, Y., Puglisi, S. J. & Shur, A. M., 1 Mar 2017, 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Vol. 66. 45

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

Factorization

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, Vol. 10396 LNCS. p. 296-307 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10396 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

Regular hexahedron
Binary
Path
Prefix
Branching
5 Citations (Scopus)

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 proceedingConference contributionResearchpeer-review

2016
13 Citations (Scopus)

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 proceedingConference contributionResearchpeer-review

Palindrome
Data structures
Data Structures
Strings
Suffix Tree
2 Citations (Scopus)

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, Vol. 9840. p. 177-189 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9840).

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

Partial Words
Square free
Ternary
Flexibility
3 Citations (Scopus)

Tight tradeoffs for real-time approximation of longest palindromes in streams

Gawrychowski, P., Merkurev, O., Shur, A. M. & Uznański, P., 1 Jun 2016, 27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Vol. 54. p. 18.1-18.13

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

Approximation algorithms
Data storage equipment
Processing
2015
4 Citations (Scopus)

On the Tree of Ternary Square-Free Words

Petrova, E. A. & Shur, A. M., 2015, COMBINATORICS ON WORDS, WORDS 2015. Manea, F. & Nowotka, D. (eds.). Springer Verlag, Vol. 9304. p. 223-236 14 p. (Lecture Notes in Computer Science; vol. 9304).

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

Square free
Ternary
Path
Prefix
Set of points
13 Citations (Scopus)

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 proceedingConference contributionResearchpeer-review

2013
7 Citations (Scopus)

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 proceedingConference contributionResearchpeer-review

Palindrome
Distinct
Unordered
Online Algorithms
Optimality

Languages with a finite antidictionary: Growth-preserving transformations and available orders of growth

Shur, A. M., 2013, Developments in Language Theory - 17th International Conference, DLT 2013, Proceedings. Vol. 7907 LNCS. p. 445-457 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7907 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

Order of Growth
Automata
Formal languages
Structural properties
Condensation
2012
5 Citations (Scopus)

Constructing premaximal ternary square-free words of any level

Petrova, E. A. & Shur, A. M., 2012, Mathematical Foundations of Computer Science 2012 - 37th International Symposium, MFCS 2012, Proceedings. Vol. 7464 LNCS. p. 752-763 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7464 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

Square free
Ternary
Extendability
Open Problems
Resolve
3 Citations (Scopus)

On two stronger versions of Dejean's conjecture

Tunev, I. N. & Shur, A. M., 2012, Mathematical Foundations of Computer Science 2012 - 37th International Symposium, MFCS 2012, Proceedings. Vol. 7464 LNCS. p. 800-812 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7464 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

Odd
Repetition