Obserwuj
Arseny Shur
Arseny Shur
Senior Researcher in Computer Science, Bar Ilan University
Zweryfikowany adres z datalab.cs.biu.ac.il
Tytuł
Cytowane przez
Cytowane przez
Rok
EERTREE: An efficient data structure for processing palindromes in strings
M Rubinchik, AM Shur
European Journal of Combinatorics 68, 249-265, 2018
722018
Partial words and the interaction property of periods
AM Shur, YV Gamzova
Izvestiya: Mathematics 68 (2), 405, 2004
43*2004
On the periods of partial words
A Shur, Y Konovalova
Mathematical Foundations of Computer Science 2001, 657-665, 2001
402001
On Abelian repetition threshold
AV Samsonov, AM Shur
RAIRO-Theoretical Informatics and Applications 46 (1), 147-163, 2012
372012
Combinatorial complexity of regular languages
AM Shur
International Computer Science Symposium in Russia, 289-301, 2008
372008
The structure of the set of cube-free -words in a two-letter alphabet
AM Shur
Izvestiya: Mathematics 64 (4), 847, 2000
372000
Palindromic length in linear time
K Borozdin, D Kosolobov, M Rubinchik, AM Shur
28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017), 2017
35*2017
Growth rates of complexity of power-free languages
AM Shur
Theoretical Computer Science 411 (34), 3209-3223, 2010
342010
Growth properties of power-free languages
AM Shur
Computer Science Review 6 (5-6), 187-208, 2012
322012
Two-sided bounds for the growth rates of power-free languages
AM Shur
Developments in Language Theory: 13th International Conference, DLT 2009 …, 2009
312009
On ternary square-free circular words
AM Shur
the electronic journal of combinatorics 17 (1), R140, 2010
282010
On the growth rates of complexity of threshold languages
AM Shur, IA Gorbunova
RAIRO-Theoretical Informatics and Applications 44 (1), 175-192, 2010
282010
Combinatorial complexity of rational languages
AM Shur
Diskretnyi Analiz i Issledovanie Operatsii 12 (2), 78-99, 2005
262005
Pal k is Linear Recognizable Online
D Kosolobov, M Rubinchik, AM Shur
SOFSEM 2015: Theory and Practice of Computer Science, 289-301, 2015
242015
Palindromic rich words and run-length encodings
C Guo, J Shallit, AM Shur
Information Processing Letters 116 (12), 735-738, 2016
222016
Tight Tradeoffs for Real-Time Approximation of Longest Palindromes in Streams
P Gawrychowski, O Merkurev, A Shur, P Uznanski
LIPIcs-Leibniz International Proceedings in Informatics 54, 2016
222016
Finding Distinct Subpalindromes Online
D Kosolobov, M Rubinchik, AM Shur
Prague Stringology Conference 2013, 63-69, 2013
212013
On the Size of Lempel-Ziv and Lyndon Factorizations
J Kärkkäinen, D Kempa, Y Nakashima, SJ Puglisi, AM Shur
STACS 2017, LIPIcs 45, 45:1-45:13, 2017
202017
Comparing complexity functions of a language and its extendable part
AM Shur
RAIRO-Theoretical Informatics and Applications 42 (3), 647-655, 2008
202008
Subword complexity and power avoidance
J Shallit, A Shur
Theoretical Computer Science 792, 96-116, 2019
182019
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20