default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArseny M. Shur
Шур Арсений Михайлович
Person information
- affiliation: Ural Federal University, Ekaterinburg, Russia
- unicode name: Шур Арсений Михайлович
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j38]Jeffrey O. Shallit, Arseny M. Shur, Stefan Zorcic:
Power-free complementary binary morphisms. J. Comb. Theory, Ser. A 207: 105910 (2024)- [c37]Itai Boneh, Dvir Fried, Shay Golan, Matan Kraus, Adrian Miclaus, Arseny M. Shur:
Searching 2D-Strings for Matching Frames. CPM 2024: 10:1-10:19 - [c36]Itai Boneh, Shay Golan, Arseny M. Shur:
String 2-Covers with No Length Restrictions. ESA 2024: 31:1-31:18 - [c35]Arseny M. Shur, Mikhail Rubinchik:
Distance Labeling for Families of Cycles. SOFSEM 2024: 471-484 - [i26]Itai Boneh, Shay Golan, Arseny M. Shur:
String 2-Covers with No Length Restrictions. CoRR abs/2405.11475 (2024) - 2023
- [c34]Arseny M. Shur:
Approaching Repetition Thresholds via Local Resampling and Entropy Compression. DLT 2023: 219-232 - [i25]Arseny M. Shur, Mikhail Rubinchik:
Distance Labeling for Families of Cycles. CoRR abs/2308.15242 (2023) - [i24]Itai Boneh, Dvir Fried, Shay Golan, Matan Kraus, Adrian Miclaus, Arseny M. Shur:
Searching 2D-Strings for Matching Frames. CoRR abs/2310.02670 (2023) - [i23]Jeffrey O. Shallit, Arseny M. Shur, Stefan Zorcic:
New constructions for 3-free and 3+-free binary morphisms. CoRR abs/2310.15064 (2023) - 2022
- [j37]Oleg Merkurev, Arseny M. Shur:
Computing The Maximum Exponent in a Stream. Algorithmica 84(3): 742-756 (2022) - [j36]L'ubomíra Dvoráková
, Edita Pelantová, Daniela Opocenská, Arseny M. Shur:
On minimal critical exponent of balanced sequences. Theor. Comput. Sci. 922: 158-169 (2022) - [c33]Elena A. Petrova, Arseny M. Shur:
Abelian Repetition Threshold Revisited. CSR 2022: 302-319 - 2021
- [j35]Elena A. Petrova, Arseny M. Shur:
Branching Densities of Cube-Free and Square-Free Words. Algorithms 14(4): 126 (2021) - [j34]Olga Karpova, Arseny M. Shur:
Words Separation and Positive Identities in Symmetric Groups. J. Autom. Lang. Comb. 26(1-2): 67-89 (2021) - [j33]Elena A. Petrova, Arseny M. Shur:
Transition Property for Cube-Free Words. Theory Comput. Syst. 65(3): 479-496 (2021) - [c32]Elena A. Petrova, Arseny M. Shur:
Branching Frequency and Markov Entropy of Repetition-Free Languages. DLT 2021: 328-341 - [i22]Elena A. Petrova, Arseny M. Shur:
Branching Frequency and Markov Entropy of Repetition-Free Languages. CoRR abs/2105.02750 (2021) - [i21]Elena A. Petrova, Arseny M. Shur:
Abelian Repetition Threshold Revisited. CoRR abs/2109.09306 (2021) - 2020
- [j32]Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Arseny M. Shur, Tomasz Walen:
String periods in the order-preserving model. Inf. Comput. 270 (2020) - [c31]Mikhail Rubinchik, Arseny M. Shur:
Palindromic k-Factorization in Pure Linear Time. MFCS 2020: 81:1-81:14 - [i20]Mikhail Rubinchik, Arseny M. Shur:
Palindromic k-Factorization in Pure Linear Time. CoRR abs/2002.03965 (2020)
2010 – 2019
- 2019
- [j31]Pawel Gawrychowski, Oleg Merkurev, Arseny M. Shur, Przemyslaw Uznanski:
Tight Tradeoffs for Real-Time Approximation of Longest Palindromes in Streams. Algorithmica 81(9): 3630-3654 (2019) - [j30]Dmitry Kosolobov, Arseny M. Shur:
Comparison of LZ77-type parsings. Inf. Process. Lett. 141: 25-29 (2019) - [j29]Jeffrey O. Shallit, Arseny M. Shur:
Subword complexity and power avoidance. Theor. Comput. Sci. 792: 96-116 (2019) - [c30]Oleg Merkurev, Arseny M. Shur:
Searching Long Repeats in Streams. CPM 2019: 31:1-31:14 - [c29]Elena A. Petrova, Arseny M. Shur:
Transition Property for Cube-Free Words. CSR 2019: 311-324 - [c28]Oleg Merkurev, Arseny M. Shur:
Searching Runs in Streams. SPIRE 2019: 203-220 - 2018
- [j28]Mikhail Rubinchik, Arseny M. Shur:
EERTREE: An efficient data structure for processing palindromes in strings. Eur. J. Comb. 68: 249-265 (2018) - [j27]Daniil Gasnikov, Arseny M. Shur:
Square-Free Partial Words with Many Wildcards. Int. J. Found. Comput. Sci. 29(5): 845-860 (2018) - [c27]Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Arseny M. Shur, Tomasz Walen:
String Periods in the Order-Preserving Model. STACS 2018: 38:1-38:16 - [i19]Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Arseny M. Shur, Tomasz Walen:
String Periods in the Order-Preserving Model. CoRR abs/1801.01404 (2018) - [i18]Jeffrey O. Shallit, Arseny M. Shur:
Subword complexity and power avoidance. CoRR abs/1801.05376 (2018) - [i17]Elena A. Petrova, Arseny M. Shur:
Transition Property For Cube-Free Words. CoRR abs/1812.11119 (2018) - 2017
- [j26]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): 3 (2017) - [c26]Kirill Borozdin, Dmitry Kosolobov, Mikhail Rubinchik, Arseny M. Shur:
Palindromic Length in Linear Time. CPM 2017: 23:1-23:12 - [c25]Elena A. Petrova, Arseny M. Shur:
On the Tree of Binary Cube-Free Words. DLT 2017: 296-307 - [c24]Mikhail Rubinchik, Arseny M. Shur:
Counting Palindromes in Substrings. SPIRE 2017: 290-303 - [c23]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: 45:1-45:13 - [i16]Dmitry Kosolobov, Arseny M. Shur:
Comparison of LZ77-type Parsings. CoRR abs/1708.03558 (2017) - 2016
- [j25]Mikhail Rubinchik, Arseny M. Shur:
The Number of Distinct Subpalindromes in Random Words. Fundam. Informaticae 145(3): 371-384 (2016) - [j24]Arseny M. Shur:
Preface. Int. J. Found. Comput. Sci. 27(2): 101-102 (2016) - [j23]Chuan Guo, Jeffrey O. Shallit, Arseny M. Shur:
Palindromic rich words and run-length encodings. Inf. Process. Lett. 116(12): 735-738 (2016) - [j22]Arseny M. Shur, Abuzer Yakaryilmaz:
More on quantum, stochastic, and pseudo stochastic languages with few states. Nat. Comput. 15(1): 129-141 (2016) - [c22]Pawel Gawrychowski, Oleg Merkurev, Arseny M. Shur, Przemyslaw Uznanski:
Tight Tradeoffs for Real-Time Approximation of Longest Palindromes in Streams. CPM 2016: 18:1-18:13 - [c21]Daniil Gasnikov, Arseny M. Shur:
Ternary Square-Free Partial Words with Many Wildcards. DLT 2016: 177-189 - [i15]Andrei A. Bulatov, Olga Karpova, Arseny M. Shur, Konstantin Startsev:
Lower Bounds on Words Separation: Are There Short Identities in Transformation Semigroups? CoRR abs/1609.03199 (2016) - [i14]Pawel Gawrychowski, Oleg Merkurev, Arseny M. Shur, Przemyslaw Uznanski:
Tight Tradeoffs for Real-Time Approximation of Longest Palindromes in Streams. CoRR abs/1610.03125 (2016) - [i13]Juha Kärkkäinen, Dominik Kempa, Yuto Nakashima, Simon J. Puglisi, Arseny M. Shur:
On the Size of Lempel-Ziv and Lyndon Factorizations. CoRR abs/1611.08898 (2016) - 2015
- [j21]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): 1147-1166 (2015) - [j20]Wojciech Rytter, Arseny M. Shur:
Searching for Zimin patterns. Theor. Comput. Sci. 571: 50-57 (2015) - [j19]Arseny M. Shur:
Generating square-free words efficiently. Theor. Comput. Sci. 601: 67-72 (2015) - [c20]Elena A. Petrova, Arseny M. Shur:
On the Tree of Ternary Square-Free Words. WORDS 2015: 223-236 - [c19]Mikhail Rubinchik, Arseny M. Shur:
EERTREE: An Efficient Data Structure for Processing Palindromes in Strings. IWOCA 2015: 321-333 - [c18]Dmitry Kosolobov, Mikhail Rubinchik, Arseny M. Shur:
Pal k is Linear Recognizable Online. SOFSEM 2015: 289-301 - [i12]Chuan Guo, Jeffrey O. Shallit, Arseny M. Shur:
On the Combinatorics of Palindromes and Antipalindromes. CoRR abs/1503.09112 (2015) - [i11]Mikhail Rubinchik, Arseny M. Shur:
The Number of Distinct Subpalindromes in Random Words. CoRR abs/1505.08043 (2015) - [i10]Mikhail Rubinchik, Arseny M. Shur:
Eertree: An Efficient Data Structure for Processing Palindromes in Strings. CoRR abs/1506.04862 (2015) - 2014
- [j18]Lidia A. Idiatulina, Arseny M. Shur:
Periodic Partial Words and Random Bipartite Graphs. Fundam. Informaticae 132(1): 15-31 (2014) - [j17]Arseny M. Shur:
Languages with a Finite antidictionary: some growth Questions. Int. J. Found. Comput. Sci. 25(8): 937-954 (2014) - [j16]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): 369-389 (2014) - [j15]Arseny M. Shur:
Growth of Power-Free Languages over Large Alphabets. Theory Comput. Syst. 54(2): 224-243 (2014) - [c17]Arseny M. Shur, Abuzer Yakaryilmaz:
Quantum, Stochastic, and Pseudo Stochastic Languages with Few States. UCNC 2014: 327-339 - [e2]Arseny M. Shur, Mikhail V. Volkov:
Developments in Language Theory - 18th International Conference, DLT 2014, Ekaterinburg, Russia, August 26-29, 2014. Proceedings. Lecture Notes in Computer Science 8633, Springer 2014, ISBN 978-3-319-09697-1 [contents] - [i9]Dmitry Kosolobov, Mikhail Rubinchik, Arseny M. Shur:
$\mathrm{Pal}^k$ Is Linear Recognizable Online. CoRR abs/1404.5244 (2014) - [i8]Arseny M. Shur, Abuzer Yakaryilmaz:
Quantum, Stochastic, and Pseudo Stochastic Languages with Few States. CoRR abs/1405.0055 (2014) - [i7]Wojciech Rytter, Arseny M. Shur:
On Searching Zimin Patterns. CoRR abs/1409.8235 (2014) - 2013
- [c16]Arseny M. Shur:
Languages with a Finite Antidictionary: Growth-Preserving Transformations and Available Orders of Growth. Developments in Language Theory 2013: 445-457 - [c15]Dmitry Kosolobov, Mikhail Rubinchik, Arseny M. Shur:
Finding Distinct Subpalindromes Online. Stringology 2013: 63-69 - [e1]Andrei A. Bulatov, Arseny M. Shur:
Computer Science - Theory and Applications - 8th International Computer Science Symposium in Russia, CSR 2013, Ekaterinburg, Russia, June 25-29, 2013. Proceedings. Lecture Notes in Computer Science 7913, Springer 2013, ISBN 978-3-642-38535-3 [contents] - [i6]Robert Mercas, Pascal Ochem, Alexey V. Samsonov, Arseny M. Shur:
Binary Patterns in Binary Cube-Free Words: Avoidability and Growth. CoRR abs/1301.4682 (2013) - [i5]Dmitry Kosolobov, Mikhail Rubinchik, Arseny M. Shur:
Finding Distinct Subpalindromes Online. CoRR abs/1305.2540 (2013) - 2012
- [j14]Arseny M. Shur:
Growth properties of power-free languages. Comput. Sci. Rev. 6(5-6): 187-208 (2012) - [j13]Irina A. Gorbunova, Arseny M. Shur:
On Pansiot Words Avoiding 3-Repetitions. Int. J. Found. Comput. Sci. 23(8): 1583-1594 (2012) - [j12]Elena A. Petrova, Arseny M. Shur:
Constructing Premaximal Binary Cube-Free Words of any Level. Int. J. Found. Comput. Sci. 23(8): 1595-1610 (2012) - [j11]Alexey V. Samsonov, Arseny M. Shur:
On Abelian repetition threshold. RAIRO Theor. Informatics Appl. 46(1): 147-163 (2012) - [c14]Elena A. Petrova, Arseny M. Shur:
Constructing Premaximal Ternary Square-Free Words of Any Level. MFCS 2012: 752-763 - [c13]Igor N. Tunev, Arseny M. Shur:
On Two Stronger Versions of Dejean's Conjecture. MFCS 2012: 800-812 - 2011
- [j10]Andrey N. Plyushchenko, Arseny M. Shur:
Almost Overlap-Free Words and the Word Problem for the Free Burnside Semigroup Satisfying X2 = X3. Int. J. Algebra Comput. 21(6): 973-1006 (2011) - [j9]Arseny M. Shur:
On the existence of Minimal β-powers. Int. J. Found. Comput. Sci. 22(7): 1683-1696 (2011) - [c12]Konstantin M. Likhomanov, Arseny M. Shur:
Two Combinatorial Criteria for BWT Images. CSR 2011: 385-396 - [c11]Arseny M. Shur:
Growth Properties of Power-Free Languages. Developments in Language Theory 2011: 28-43 - [c10]Andrey N. Plyushchenko, Arseny M. Shur:
On Brzozowski's Conjecture for the Free Burnside Semigroup Satisfying x2 = x3. Developments in Language Theory 2011: 362-373 - [c9]Irina A. Gorbunova, Arseny M. Shur:
On Pansiot Words Avoiding 3-Repetitions. WORDS 2011: 138-146 - [c8]Elena A. Petrova, Arseny M. Shur:
Constructing Premaximal Binary Cube-free Words of Any Level. WORDS 2011: 168-178 - [c7]Narad Rampersad, Jeffrey O. Shallit, Arseny M. Shur:
Fife's Theorem for (7/3)-Powers. WORDS 2011: 189-198 - [i4]Andrew N. Plyushchenko, Arseny M. Shur:
Almost overlap-free words and the word problem for the free Burnside semigroup satisfying x2=x3. CoRR abs/1102.4315 (2011) - 2010
- [j8]Arseny M. Shur:
On Ternary Square-free Circular Words. Electron. J. Comb. 17(1) (2010) - [j7]Arseny M. Shur, Irina A. Gorbunova:
On the growth rates of complexity of threshold languages. RAIRO Theor. Informatics Appl. 44(1): 175-192 (2010) - [j6]Arseny M. Shur:
Growth rates of complexity of power-free languages. Theor. Comput. Sci. 411(34-36): 3209-3223 (2010) - [c6]Arseny M. Shur:
Growth of Power-Free Languages over Large Alphabets. CSR 2010: 350-361 - [c5]Arseny M. Shur:
On the Existence of Minimal beta-Powers. Developments in Language Theory 2010: 411-422 - [i3]Arseny M. Shur:
Numerical values of the growth rates of power-free languages. CoRR abs/1009.4415 (2010) - [i2]Arseny M. Shur:
On ternary square-free circular words. CoRR abs/1009.5759 (2010) - [i1]Arseny M. Shur:
Combinatorial Characterization of Formal Languages. CoRR abs/1010.5456 (2010)
2000 – 2009
- 2009
- [j5]Arseny M. Shur:
On intermediate factorial languages. Discret. Appl. Math. 157(7): 1669-1675 (2009) - [j4]Arseny M. Shur:
Polynomial languages with finite antidictionaries. RAIRO Theor. Informatics Appl. 43(2): 269-279 (2009) - [c4]Arseny M. Shur:
Two-Sided Bounds for the Growth Rates of Power-Free Languages. Developments in Language Theory 2009: 466-477 - 2008
- [j3]Arseny M. Shur:
Comparing Complexity Functions of a Language and Its Extendable Part. RAIRO Theor. Informatics Appl. 42(3): 647-655 (2008) - [c3]Arseny M. Shur:
Combinatorial Complexity of Regular Languages. CSR 2008: 289-301 - 2007
- [j2]Arseny M. Shur:
Rational Approximations of Polynomial Factorial Languages. Int. J. Found. Comput. Sci. 18(3): 655-665 (2007) - 2006
- [c2]Arseny M. Shur:
Factorial Languages of Low Combinatorial Complexity. Developments in Language Theory 2006: 397-407 - 2001
- [c1]Arseny M. Shur, Yulia V. Konovalova:
On the Periods of Partial Words. MFCS 2001: 657-665
1990 – 1999
- 1996
- [j1]Arseny M. Shur:
Overlap-Free Words and Thue-Morse Sequences. Int. J. Algebra Comput. 6(3): 353-368 (1996)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-04 20:03 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
