Arseny M. Shur

108 papers A 3B 10C 14Misc 7Journal 68Unranked 6
YearRankTypeTitle / Venue / Authors
2026 J jnl
Distance labeling for families of cycles.
Acta Informatica
Arseny M. Shur, Mikhail Rubinchik
2025 — conf
Expected Density of Random Minimizers.
SOFSEM (1)
Shay Golan, Arseny M. Shur
2025 J jnl
GreedyMini: generating low-density DNA minimizers.
Bioinform.
Shay Golan, Ido Tziony, Matan Kraus, Yaron Orenstein, Arseny M. Shur
2025 J jnl
On Minimizers of Minimum Density.
CoRR
Arseny M. Shur
2024 B conf
Distance Labeling for Families of Cycles.
SOFSEM
Arseny M. Shur, Mikhail Rubinchik
2024 J jnl
Non-Constructive Upper Bounds for Repetition Thresholds.
Theory Comput. Syst.
Arseny M. Shur
2024 J jnl
Power-free complementary binary morphisms.
J. Comb. Theory, Ser. A
Jeffrey O. Shallit, Arseny M. Shur, Stefan Zorcic
2024 B conf
Searching 2D-Strings for Matching Frames.
CPM
Itai Boneh, Dvir Fried, Shay Golan, Matan Kraus, Adrian Miclaus, Arseny M. Shur
2024 A conf
String 2-Covers with No Length Restrictions.
ESA
Itai Boneh, Shay Golan, Arseny M. Shur
2024 J jnl
String 2-Covers with No Length Restrictions.
CoRR
Itai Boneh, Shay Golan, Arseny M. Shur
2023 C conf
Approaching Repetition Thresholds via Local Resampling and Entropy Compression.
DLT
Arseny M. Shur
2023 J jnl
Distance Labeling for Families of Cycles.
CoRR
Arseny M. Shur, Mikhail Rubinchik
2023 J jnl
New constructions for 3-free and 3
CoRR
Jeffrey O. Shallit, Arseny M. Shur, Stefan Zorcic
2023 J jnl
Searching 2D-Strings for Matching Frames.
CoRR
Itai Boneh, Dvir Fried, Shay Golan, Matan Kraus, Adrian Miclaus, Arseny M. Shur
2022 Misc conf
Abelian Repetition Threshold Revisited.
CSR
Elena A. Petrova, Arseny M. Shur
2022 J jnl
Computing The Maximum Exponent in a Stream.
Algorithmica
Oleg Merkurev, Arseny M. Shur
2022 J jnl
On minimal critical exponent of balanced sequences.
Theor. Comput. Sci.
L'ubomíra Dvoráková, Edita Pelantová, Daniela Opocenská, Arseny M. Shur
2021 J jnl
Abelian Repetition Threshold Revisited.
CoRR
Elena A. Petrova, Arseny M. Shur
2021 J jnl
Branching Densities of Cube-Free and Square-Free Words.
Algorithms
Elena A. Petrova, Arseny M. Shur
2021 C conf
Branching Frequency and Markov Entropy of Repetition-Free Languages.
DLT
Elena A. Petrova, Arseny M. Shur
2021 J jnl
Branching Frequency and Markov Entropy of Repetition-Free Languages.
CoRR
Elena A. Petrova, Arseny M. Shur
2021 J jnl
Transition Property for Cube-Free Words.
Theory Comput. Syst.
Elena A. Petrova, Arseny M. Shur
2021 J jnl
Words Separation and Positive Identities in Symmetric Groups.
J. Autom. Lang. Comb.
Olga Karpova, Arseny M. Shur
2020 B conf
Palindromic k-Factorization in Pure Linear Time.
MFCS
Mikhail Rubinchik, Arseny M. Shur
2020 J jnl
Palindromic k-Factorization in Pure Linear Time.
CoRR
Mikhail Rubinchik, Arseny M. Shur
2020 J jnl
String periods in the order-preserving model.
Inf. Comput.
Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Arseny M. Shur, Tomasz Walen
2019 J jnl
Comparison of LZ77-type parsings.
Inf. Process. Lett.
Dmitry Kosolobov, Arseny M. Shur
2019 B conf
Searching Long Repeats in Streams.
CPM
Oleg Merkurev, Arseny M. Shur
2019 C conf
Searching Runs in Streams.
SPIRE
Oleg Merkurev, Arseny M. Shur
2019 J jnl
Subword complexity and power avoidance.
Theor. Comput. Sci.
Jeffrey O. Shallit, Arseny M. Shur
2019 J jnl
Tight Tradeoffs for Real-Time Approximation of Longest Palindromes in Streams.
Algorithmica
Pawel Gawrychowski, Oleg Merkurev, Arseny M. Shur, Przemyslaw Uznanski
2019 Misc conf
Transition Property for Cube-Free Words.
CSR
Elena A. Petrova, Arseny M. Shur
2018 J jnl
EERTREE: An efficient data structure for processing palindromes in strings.
Eur. J. Comb.
Mikhail Rubinchik, Arseny M. Shur
2018 J jnl
Square-Free Partial Words with Many Wildcards.
Int. J. Found. Comput. Sci.
Daniil Gasnikov, Arseny M. Shur
2018 A conf
String Periods in the Order-Preserving Model.
STACS
Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Arseny M. Shur, Tomasz Walen
2018 J jnl
String Periods in the Order-Preserving Model.
CoRR
Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Arseny M. Shur, Tomasz Walen
2018 J jnl
Subword complexity and power avoidance.
CoRR
Jeffrey O. Shallit, Arseny M. Shur
2018 J jnl
Transition Property For Cube-Free Words.
CoRR
Elena A. Petrova, Arseny M. Shur
2017 J jnl
Comparison of LZ77-type Parsings.
CoRR
Dmitry Kosolobov, Arseny M. Shur
2017 C conf
Counting Palindromes in Substrings.
SPIRE
Mikhail Rubinchik, Arseny M. Shur
2017 J jnl
Lower Bounds on Words Separation: Are There Short Identities in Transformation Semigroups?
Electron. J. Comb.
Andrei A. Bulatov, Olga Karpova, Arseny M. Shur, Konstantin Startsev
2017 A conf
On the Size of Lempel-Ziv and Lyndon Factorizations.
STACS
Juha Kärkkäinen, Dominik Kempa, Yuto Nakashima, Simon J. Puglisi, Arseny M. Shur
2017 C conf
On the Tree of Binary Cube-Free Words.
DLT
Elena A. Petrova, Arseny M. Shur
2017 B conf
Palindromic Length in Linear Time.
CPM
Kirill Borozdin, Dmitry Kosolobov, Mikhail Rubinchik, Arseny M. Shur
2016 J jnl
Lower Bounds on Words Separation: Are There Short Identities in Transformation Semigroups?
CoRR
Andrei A. Bulatov, Olga Karpova, Arseny M. Shur, Konstantin Startsev
2016 J jnl
More on quantum, stochastic, and pseudo stochastic languages with few states.
Nat. Comput.
Arseny M. Shur, Abuzer Yakaryilmaz
2016 J jnl
On the Size of Lempel-Ziv and Lyndon Factorizations.
CoRR
Juha Kärkkäinen, Dominik Kempa, Yuto Nakashima, Simon J. Puglisi, Arseny M. Shur
2016 J jnl
Palindromic rich words and run-length encodings.
Inf. Process. Lett.
Chuan Guo, Jeffrey O. Shallit, Arseny M. Shur
2016 J jnl
Preface.
Int. J. Found. Comput. Sci.
Arseny M. Shur
2016 C conf
Ternary Square-Free Partial Words with Many Wildcards.
DLT
Daniil Gasnikov, Arseny M. Shur
2016 J jnl
The Number of Distinct Subpalindromes in Random Words.
Fundam. Informaticae
Mikhail Rubinchik, Arseny M. Shur
2016 B conf
Tight Tradeoffs for Real-Time Approximation of Longest Palindromes in Streams.
CPM
Pawel Gawrychowski, Oleg Merkurev, Arseny M. Shur, Przemyslaw Uznanski
2016 J jnl
Tight Tradeoffs for Real-Time Approximation of Longest Palindromes in Streams.
CoRR
Pawel Gawrychowski, Oleg Merkurev, Arseny M. Shur, Przemyslaw Uznanski
2015 C conf
EERTREE: An Efficient Data Structure for Processing Palindromes in Strings.
IWOCA
Mikhail Rubinchik, Arseny M. Shur
2015 J jnl
Eertree: An Efficient Data Structure for Processing Palindromes in Strings.
CoRR
Mikhail Rubinchik, Arseny M. Shur
2015 J jnl
Generating square-free words efficiently.
Theor. Comput. Sci.
Arseny M. Shur
2015 J jnl
On the Combinatorics of Palindromes and Antipalindromes.
CoRR
Chuan Guo, Jeffrey O. Shallit, Arseny M. Shur
2015 — conf
On the Tree of Ternary Square-Free Words.
WORDS
Elena A. Petrova, Arseny M. Shur
2015 J jnl
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.
Chen Fei Du, Jeffrey O. Shallit, Arseny M. Shur
2015 B conf
Pal k is Linear Recognizable Online.
SOFSEM
Dmitry Kosolobov, Mikhail Rubinchik, Arseny M. Shur
2015 J jnl
Searching for Zimin patterns.
Theor. Comput. Sci.
Wojciech Rytter, Arseny M. Shur
2015 J jnl
The Number of Distinct Subpalindromes in Random Words.
CoRR
Mikhail Rubinchik, Arseny M. Shur
2014 J jnl
$\mathrm{Pal}^k$ Is Linear Recognizable Online.
CoRR
Dmitry Kosolobov, Mikhail Rubinchik, Arseny M. Shur
2014 J jnl
Binary patterns in binary cube-free words: Avoidability and growth.
RAIRO Theor. Informatics Appl.
Robert Mercas, Pascal Ochem, Alexey V. Samsonov, Arseny M. Shur
2014 C ed.
Developments in Language Theory - 18th International Conference, DLT 2014, Ekaterinburg, Russia, August 26-29, 2014. Proceedings
Developments in Language Theory
Arseny M. Shur, Mikhail V. Volkov
2014 J jnl
Growth of Power-Free Languages over Large Alphabets.
Theory Comput. Syst.
Arseny M. Shur
2014 J jnl
Languages with a Finite antidictionary: some growth Questions.
Int. J. Found. Comput. Sci.
Arseny M. Shur
2014 J jnl
On Searching Zimin Patterns.
CoRR
Wojciech Rytter, Arseny M. Shur
2014 J jnl
Periodic Partial Words and Random Bipartite Graphs.
Fundam. Informaticae
Lidia A. Idiatulina, Arseny M. Shur
2014 — conf
Quantum, Stochastic, and Pseudo Stochastic Languages with Few States.
UCNC
Arseny M. Shur, Abuzer Yakaryilmaz
2014 J jnl
Quantum, Stochastic, and Pseudo Stochastic Languages with Few States.
CoRR
Arseny M. Shur, Abuzer Yakaryilmaz
2013 J jnl
Binary Patterns in Binary Cube-Free Words: Avoidability and Growth
CoRR
Robert Mercas, Pascal Ochem, Alexey V. Samsonov, Arseny M. Shur
2013 Misc ed.
Computer Science - Theory and Applications - 8th International Computer Science Symposium in Russia, CSR 2013, Ekaterinburg, Russia, June 25-29, 2013. Proceedings
CSR
Andrei A. Bulatov, Arseny M. Shur
2013 J jnl
Finding Distinct Subpalindromes Online
CoRR
Dmitry Kosolobov, Mikhail Rubinchik, Arseny M. Shur
2013 Misc conf
Finding Distinct Subpalindromes Online.
PSC
Dmitry Kosolobov, Mikhail Rubinchik, Arseny M. Shur
2013 C conf
Languages with a Finite Antidictionary: Growth-Preserving Transformations and Available Orders of Growth.
Developments in Language Theory
Arseny M. Shur
2012 J jnl
Constructing Premaximal Binary Cube-Free Words of any Level.
Int. J. Found. Comput. Sci.
Elena A. Petrova, Arseny M. Shur
2012 B conf
Constructing Premaximal Ternary Square-Free Words of Any Level.
MFCS
Elena A. Petrova, Arseny M. Shur
2012 J jnl
Growth properties of power-free languages.
Comput. Sci. Rev.
Arseny M. Shur
2012 J jnl
On Abelian repetition threshold.
RAIRO Theor. Informatics Appl.
Alexey V. Samsonov, Arseny M. Shur
2012 J jnl
On Pansiot Words Avoiding 3-Repetitions.
Int. J. Found. Comput. Sci.
Irina A. Gorbunova, Arseny M. Shur
2012 B conf
On Two Stronger Versions of Dejean's Conjecture.
MFCS
Igor N. Tunev, Arseny M. Shur
2011 J jnl
Almost Overlap-Free Words and the Word Problem for the Free Burnside Semigroup Satisfying X
Int. J. Algebra Comput.
Andrey N. Plyushchenko, Arseny M. Shur
2011 J jnl
Almost overlap-free words and the word problem for the free Burnside semigroup satisfying x
CoRR
Andrew N. Plyushchenko, Arseny M. Shur
2011 — conf
Constructing Premaximal Binary Cube-free Words of Any Level
WORDS
Elena A. Petrova, Arseny M. Shur
2011 — conf
Fife's Theorem for (7/3)-Powers
WORDS
Narad Rampersad, Jeffrey O. Shallit, Arseny M. Shur
2011 C conf
Growth Properties of Power-Free Languages.
Developments in Language Theory
Arseny M. Shur
2011 C conf
On Brzozowski's Conjecture for the Free Burnside Semigroup Satisfying
Developments in Language Theory
Andrey N. Plyushchenko, Arseny M. Shur
2011 — conf
On Pansiot Words Avoiding 3-Repetitions
WORDS
Irina A. Gorbunova, Arseny M. Shur
2011 J jnl
On the existence of Minimal β-powers.
Int. J. Found. Comput. Sci.
Arseny M. Shur
2011 Misc conf
Two Combinatorial Criteria for BWT Images.
CSR
Konstantin M. Likhomanov, Arseny M. Shur
2010 J jnl
Combinatorial Characterization of Formal Languages
CoRR
Arseny M. Shur
2010 Misc conf
Growth of Power-Free Languages over Large Alphabets.
CSR
Arseny M. Shur
2010 J jnl
Growth rates of complexity of power-free languages.
Theor. Comput. Sci.
Arseny M. Shur
2010 J jnl
Numerical values of the growth rates of power-free languages
CoRR
Arseny M. Shur
2010 J jnl
On Ternary Square-free Circular Words.
Electron. J. Comb.
Arseny M. Shur
2010 J jnl
On ternary square-free circular words
CoRR
Arseny M. Shur
2010 C conf
On the Existence of Minimal
Developments in Language Theory
Arseny M. Shur
2010 J jnl
On the growth rates of complexity of threshold languages.
RAIRO Theor. Informatics Appl.
Arseny M. Shur, Irina A. Gorbunova
2009 J jnl
On intermediate factorial languages.
Discret. Appl. Math.
Arseny M. Shur
2009 J jnl
Polynomial languages with finite antidictionaries.
RAIRO Theor. Informatics Appl.
Arseny M. Shur
2009 C conf
Two-Sided Bounds for the Growth Rates of Power-Free Languages.
Developments in Language Theory
Arseny M. Shur
2008 Misc conf
Combinatorial Complexity of Regular Languages.
CSR
Arseny M. Shur
2008 J jnl
Comparing Complexity Functions of a Language and Its Extendable Part.
RAIRO Theor. Informatics Appl.
Arseny M. Shur
2007 J jnl
Rational Approximations of Polynomial Factorial Languages.
Int. J. Found. Comput. Sci.
Arseny M. Shur
2006 C conf
Factorial Languages of Low Combinatorial Complexity.
Developments in Language Theory
Arseny M. Shur
2001 B conf
On the Periods of Partial Words.
MFCS
Arseny M. Shur, Yulia V. Konovalova
1996 J jnl
Overlap-Free Words and Thue-Morse Sequences.
Int. J. Algebra Comput.
Arseny M. Shur