Arseny M. Shur

Publication Activity (10 Years)

Years Active: 1996-2024
Publications (10 Years): 55

Top Topics

Binary Patterns

Top Venues

Int. J. Found. Comput. Sci.

Publications

Itai Boneh, Shay Golan, Arseny M. Shur
String 2-Covers with No Length Restrictions. CoRR (2024)
Itai Boneh, Dvir Fried, Shay Golan, Matan Kraus, Adrian Miclaus, Arseny M. Shur
Searching 2D-Strings for Matching Frames. CPM (2024)
Jeffrey O. Shallit, Arseny M. Shur, Stefan Zorcic
Power-free complementary binary morphisms. J. Comb. Theory, Ser. A 207 (2024)
Arseny M. Shur, Mikhail Rubinchik
Distance Labeling for Families of Cycles. SOFSEM (2024)
Jeffrey O. Shallit, Arseny M. Shur, Stefan Zorcic
-free binary morphisms. CoRR (2023)
Arseny M. Shur
Approaching Repetition Thresholds via Local Resampling and Entropy Compression. DLT (2023)
Arseny M. Shur, Mikhail Rubinchik
Distance Labeling for Families of Cycles. CoRR (2023)
Oleg Merkurev, Arseny M. Shur
Computing The Maximum Exponent in a Stream. Algorithmica 84 (3) (2022)
Elena A. Petrova, Arseny M. Shur
Abelian Repetition Threshold Revisited. CSR (2022)
L'ubomíra Dvoráková, Edita Pelantová, Daniela Opocenská, Arseny M. Shur
On minimal critical exponent of balanced sequences. Theor. Comput. Sci. 922 (2022)
Elena A. Petrova, Arseny M. Shur
Branching Frequency and Markov Entropy of Repetition-Free Languages. DLT (2021)
Elena A. Petrova, Arseny M. Shur
Transition Property for Cube-Free Words. Theory Comput. Syst. 65 (3) (2021)
Elena A. Petrova, Arseny M. Shur
Branching Densities of Cube-Free and Square-Free Words. Algorithms 14 (4) (2021)
Elena A. Petrova, Arseny M. Shur
Branching Frequency and Markov Entropy of Repetition-Free Languages. CoRR (2021)
Olga Karpova, Arseny M. Shur
Words Separation and Positive Identities in Symmetric Groups. J. Autom. Lang. Comb. 26 (1-2) (2021)
Elena A. Petrova, Arseny M. Shur
Abelian Repetition Threshold Revisited. CoRR (2021)
Mikhail Rubinchik, Arseny M. Shur
Palindromic k-Factorization in Pure Linear Time. MFCS (2020)
Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Arseny M. Shur, Tomasz Walen
String periods in the order-preserving model. Inf. Comput. 270 (2020)
Mikhail Rubinchik, Arseny M. Shur
Palindromic k-Factorization in Pure Linear Time. CoRR (2020)
Oleg Merkurev, Arseny M. Shur
Searching Runs in Streams. SPIRE (2019)
Jeffrey O. Shallit, Arseny M. Shur
Subword complexity and power avoidance. Theor. Comput. Sci. 792 (2019)
Elena A. Petrova, Arseny M. Shur
Transition Property for Cube-Free Words. CSR (2019)
Pawel Gawrychowski, Oleg Merkurev, Arseny M. Shur, Przemyslaw Uznanski
Tight Tradeoffs for Real-Time Approximation of Longest Palindromes in Streams. Algorithmica 81 (9) (2019)
Dmitry Kosolobov, Arseny M. Shur
Comparison of LZ77-type parsings. Inf. Process. Lett. 141 (2019)
Oleg Merkurev, Arseny M. Shur
Searching Long Repeats in Streams. CPM (2019)
Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Arseny M. Shur, Tomasz Walen
String Periods in the Order-Preserving Model. CoRR (2018)
Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Arseny M. Shur, Tomasz Walen
String Periods in the Order-Preserving Model. STACS (2018)
Mikhail Rubinchik, Arseny M. Shur
EERTREE: An efficient data structure for processing palindromes in strings. Eur. J. Comb. 68 (2018)
Elena A. Petrova, Arseny M. Shur
Transition Property For Cube-Free Words. CoRR (2018)
Jeffrey O. Shallit, Arseny M. Shur
Subword complexity and power avoidance. CoRR (2018)
Daniil Gasnikov, Arseny M. Shur
Square-Free Partial Words with Many Wildcards. Int. J. Found. Comput. Sci. 29 (5) (2018)
Juha Kärkkäinen, Dominik Kempa, Yuto Nakashima, Simon J. Puglisi, Arseny M. Shur
On the Size of Lempel-Ziv and Lyndon Factorizations. STACS (2017)
Dmitry Kosolobov, Arseny M. Shur
Comparison of LZ77-type Parsings. CoRR (2017)
Elena A. Petrova, Arseny M. Shur
On the Tree of Binary Cube-Free Words. DLT (2017)
Andrei A. Bulatov, Olga Karpova, Arseny M. Shur, Konstantin Startsev
Lower Bounds on Words Separation: Are There Short Identities in Transformation Semigroups? Electron. J. Comb. 24 (3) (2017)
Mikhail Rubinchik, Arseny M. Shur
Counting Palindromes in Substrings. SPIRE (2017)
Kirill Borozdin, Dmitry Kosolobov, Mikhail Rubinchik, Arseny M. Shur
Palindromic Length in Linear Time. CPM (2017)
Mikhail Rubinchik, Arseny M. Shur
The Number of Distinct Subpalindromes in Random Words. Fundam. Informaticae 145 (3) (2016)
Andrei A. Bulatov, Olga Karpova, Arseny M. Shur, Konstantin Startsev
Lower Bounds on Words Separation: Are There Short Identities in Transformation Semigroups? CoRR (2016)
Pawel Gawrychowski, Oleg Merkurev, Arseny M. Shur, Przemyslaw Uznanski
Tight Tradeoffs for Real-Time Approximation of Longest Palindromes in Streams. CoRR (2016)
Daniil Gasnikov, Arseny M. Shur
Ternary Square-Free Partial Words with Many Wildcards. DLT (2016)
Pawel Gawrychowski, Oleg Merkurev, Arseny M. Shur, Przemyslaw Uznanski
Tight Tradeoffs for Real-Time Approximation of Longest Palindromes in Streams. CPM (2016)
Juha Kärkkäinen, Dominik Kempa, Yuto Nakashima, Simon J. Puglisi, Arseny M. Shur
On the Size of Lempel-Ziv and Lyndon Factorizations. CoRR (2016)
Arseny M. Shur
Preface. Int. J. Found. Comput. Sci. 27 (2) (2016)
Chuan Guo, Jeffrey O. Shallit, Arseny M. Shur
Palindromic rich words and run-length encodings. Inf. Process. Lett. 116 (12) (2016)
Arseny M. Shur, Abuzer Yakaryilmaz
More on quantum, stochastic, and pseudo stochastic languages with few states. Nat. Comput. 15 (1) (2016)
Mikhail Rubinchik, Arseny M. Shur
The Number of Distinct Subpalindromes in Random Words. CoRR (2015)
Wojciech Rytter, Arseny M. Shur
Searching for Zimin patterns. Theor. Comput. Sci. 571 (2015)
Elena A. Petrova, Arseny M. Shur
On the Tree of Ternary Square-Free Words. WORDS (2015)
Dmitry Kosolobov, Mikhail Rubinchik, Arseny M. Shur
Pal k is Linear Recognizable Online. SOFSEM (2015)
Mikhail Rubinchik, Arseny M. Shur
EERTREE: An Efficient Data Structure for Processing Palindromes in Strings. IWOCA (2015)
Mikhail Rubinchik, Arseny M. Shur
Eertree: An Efficient Data Structure for Processing Palindromes in Strings. CoRR (2015)
Arseny M. Shur
Generating square-free words efficiently. Theor. Comput. Sci. 601 (2015)
Chen Fei Du, Jeffrey O. Shallit, Arseny M. Shur
Optimal Bounds for the Similarity Density of the Thue-Morse Word with Overlap-Free and 73-Power-Free Infinite Binary Words. Int. J. Found. Comput. Sci. 26 (8) (2015)
Chuan Guo, Jeffrey O. Shallit, Arseny M. Shur
On the Combinatorics of Palindromes and Antipalindromes. CoRR (2015)
Arseny M. Shur
Growth of Power-Free Languages over Large Alphabets. Theory Comput. Syst. 54 (2) (2014)
Arseny M. Shur, Abuzer Yakaryilmaz
Quantum, Stochastic, and Pseudo Stochastic Languages with Few States. CoRR (2014)
Dmitry Kosolobov, Mikhail Rubinchik, Arseny M. Shur
$\mathrm{Pal}^k$ Is Linear Recognizable Online. CoRR (2014)
Wojciech Rytter, Arseny M. Shur
On Searching Zimin Patterns. CoRR (2014)
Robert Mercas, Pascal Ochem, Alexey V. Samsonov, Arseny M. Shur
Binary patterns in binary cube-free words: Avoidability and growth. RAIRO Theor. Informatics Appl. 48 (4) (2014)
Lidia A. Idiatulina, Arseny M. Shur
Periodic Partial Words and Random Bipartite Graphs. Fundam. Informaticae 132 (1) (2014)
Arseny M. Shur
Languages with a Finite antidictionary: some growth Questions. Int. J. Found. Comput. Sci. 25 (8) (2014)
Arseny M. Shur, Abuzer Yakaryilmaz
Quantum, Stochastic, and Pseudo Stochastic Languages with Few States. UCNC (2014)
Dmitry Kosolobov, Mikhail Rubinchik, Arseny M. Shur
Finding Distinct Subpalindromes Online. Stringology (2013)
Robert Mercas, Pascal Ochem, Alexey V. Samsonov, Arseny M. Shur
Binary Patterns in Binary Cube-Free Words: Avoidability and Growth CoRR (2013)
Arseny M. Shur
Languages with a Finite Antidictionary: Growth-Preserving Transformations and Available Orders of Growth. Developments in Language Theory (2013)
Dmitry Kosolobov, Mikhail Rubinchik, Arseny M. Shur
Finding Distinct Subpalindromes Online CoRR (2013)
Igor N. Tunev, Arseny M. Shur
On Two Stronger Versions of Dejean's Conjecture. MFCS (2012)
Elena A. Petrova, Arseny M. Shur
Constructing Premaximal Binary Cube-Free Words of any Level. Int. J. Found. Comput. Sci. 23 (8) (2012)
Irina A. Gorbunova, Arseny M. Shur
On Pansiot Words Avoiding 3-Repetitions. Int. J. Found. Comput. Sci. 23 (8) (2012)
Arseny M. Shur
Growth properties of power-free languages. Comput. Sci. Rev. 6 (5-6) (2012)
Elena A. Petrova, Arseny M. Shur
Constructing Premaximal Ternary Square-Free Words of Any Level. MFCS (2012)
Alexey V. Samsonov, Arseny M. Shur
On Abelian repetition threshold. RAIRO Theor. Informatics Appl. 46 (1) (2012)
Arseny M. Shur
Growth Properties of Power-Free Languages. Developments in Language Theory (2011)
Elena A. Petrova, Arseny M. Shur
Constructing Premaximal Binary Cube-free Words of Any Level WORDS (2011)
Andrey N. Plyushchenko, Arseny M. Shur
. Int. J. Algebra Comput. 21 (6) (2011)
Narad Rampersad, Jeffrey O. Shallit, Arseny M. Shur
Fife's Theorem for (7/3)-Powers WORDS (2011)
Konstantin M. Likhomanov, Arseny M. Shur
Two Combinatorial Criteria for BWT Images. CSR (2011)
Andrew N. Plyushchenko, Arseny M. Shur
CoRR (2011)
Irina A. Gorbunova, Arseny M. Shur
On Pansiot Words Avoiding 3-Repetitions WORDS (2011)
Arseny M. Shur
On the existence of Minimal β-powers. Int. J. Found. Comput. Sci. 22 (7) (2011)
Andrey N. Plyushchenko, Arseny M. Shur
. Developments in Language Theory (2011)
Arseny M. Shur
Numerical values of the growth rates of power-free languages CoRR (2010)
Arseny M. Shur, Irina A. Gorbunova
On the growth rates of complexity of threshold languages. RAIRO Theor. Informatics Appl. 44 (1) (2010)
Arseny M. Shur
On ternary square-free circular words CoRR (2010)
Arseny M. Shur
On Ternary Square-free Circular Words. Electron. J. Comb. 17 (1) (2010)
Arseny M. Shur
Combinatorial Characterization of Formal Languages CoRR (2010)
Arseny M. Shur
Growth rates of complexity of power-free languages. Theor. Comput. Sci. 411 (34-36) (2010)
Arseny M. Shur
-Powers. Developments in Language Theory (2010)
Arseny M. Shur
Growth of Power-Free Languages over Large Alphabets. CSR (2010)
Arseny M. Shur
Two-Sided Bounds for the Growth Rates of Power-Free Languages. Developments in Language Theory (2009)
Arseny M. Shur
On intermediate factorial languages. Discret. Appl. Math. 157 (7) (2009)
Arseny M. Shur
Polynomial languages with finite antidictionaries. RAIRO Theor. Informatics Appl. 43 (2) (2009)
Arseny M. Shur
Combinatorial Complexity of Regular Languages. CSR (2008)
Arseny M. Shur
Comparing Complexity Functions of a Language and Its Extendable Part. RAIRO Theor. Informatics Appl. 42 (3) (2008)
Arseny M. Shur
Rational Approximations of Polynomial Factorial Languages. Int. J. Found. Comput. Sci. 18 (3) (2007)
Arseny M. Shur
Factorial Languages of Low Combinatorial Complexity. Developments in Language Theory (2006)
Arseny M. Shur, Yulia V. Konovalova
On the Periods of Partial Words. MFCS (2001)
Arseny M. Shur
Overlap-Free Words and Thue-Morse Sequences. Int. J. Algebra Comput. 6 (3) (1996)