Arseny Shur

Cited by

	All	Since 2020
Citations	1083	414
h-index	20	10
i10-index	38	12

100

20042005200620072008200920102011201220132014201520162017201820192020202120222023202420258 8 11 21 23 22 71 48 76 24 51 33 69 40 59 69 66 96 95 70 86 1

Public access

View all

4 articles

available

not available

Based on funding mandates

Co-authors

Jeffrey ShallitProfessor Emeritus of Computer Science, University of WaterlooVerified email at cs.uwaterloo.ca
Dmitry KosolobovUral Federal University, Ekaterinburg, RussiaVerified email at urfu.ru
Oleg MerkurevUral Federal University, department of algebra and fundamental informaticsVerified email at urfu.ru
Abuzer YakaryilmazUniversity of LatviaVerified email at lu.lv
Wojciech RytterWarsaw UniversityVerified email at mimuw.edu.pl
Andrei BulatovSimon Fraser UniversityVerified email at sfu.ca
Przemysław UznańskiPathwayVerified email at pathway.com
Paweł GawrychowskiUniversity of WrocławVerified email at cs.uni.wroc.pl
Simon J. PuglisiProfessor, Department of Computer Science, University of HelsinkiVerified email at cs.helsinki.fi
Juha KärkkäinenDepartment of Computer scienceVerified email at cs.helsinki.fi
Dominik KempaAssistant Professor, Stony Brook UniversityVerified email at cs.stonybrook.edu
Yuto NakashimaKyushu UniversityVerified email at inf.kyushu-u.ac.jp
Shay GolanPostdoc, EECS, University of California, BerkeleyVerified email at berkeley.edu
Tomasz KociumakaINSAITVerified email at insait.ai
Tomasz WalenUniversity of WarsawVerified email at mimuw.edu.pl
Jakub RadoszewskiUniversity of WarsawVerified email at mimuw.edu.pl
Garance GourdelIRISA - Inria Rennes - ENSVerified email at ens-paris-saclay.fr
Daniela OpočenskáCzech Technical UniversityVerified email at cvut.cz
Narad RampersadUniversity of WinnipegVerified email at uwinnipeg.ca
Robert MercasLoughborough UniversityVerified email at lboro.ac.uk

Arseny Shur

Senior Researcher in Computer Science, Bar Ilan University

Verified email at datalab.cs.biu.ac.il

Combinatorics on Words Stringology Formal Languages Automata Theory


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
EERTREE: An efficient data structure for processing palindromes in strings M Rubinchik, AM Shur European Journal of Combinatorics 68, 249-265, 2018	72	2018
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	40	2001
Combinatorial complexity of regular languages AM Shur International Computer Science Symposium in Russia, 289-301, 2008	37	2008
The structure of the set of cube-free -words in a two-letter alphabet AM Shur Izvestiya: Mathematics 64 (4), 847, 2000	37	2000
On Abelian repetition threshold AV Samsonov, AM Shur RAIRO-Theoretical Informatics and Applications 46 (1), 147-163, 2012	36	2012
Palindromic length in linear time K Borozdin, D Kosolobov, M Rubinchik, AM Shur 28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017), 2017	34	2017
Growth rates of complexity of power-free languages AM Shur Theoretical Computer Science 411 (34), 3209-3223, 2010	34	2010
Growth properties of power-free languages AM Shur Computer Science Review 6 (5-6), 187-208, 2012	32	2012
Two-sided bounds for the growth rates of power-free languages AM Shur Developments in Language Theory: 13th International Conference, DLT 2009 …, 2009	30	2009
On ternary square-free circular words AM Shur the electronic journal of combinatorics 17 (1), R140, 2010	28	2010
On the growth rates of complexity of threshold languages AM Shur, IA Gorbunova RAIRO-Theoretical Informatics and Applications 44 (1), 175-192, 2010	28	2010
Combinatorial complexity of rational languages AM Shur Diskretnyi Analiz i Issledovanie Operatsii 12 (2), 78-99, 2005	26	2005
Pal k is Linear Recognizable Online D Kosolobov, M Rubinchik, AM Shur SOFSEM 2015: Theory and Practice of Computer Science, 289-301, 2015	25	2015
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	23	2016
Palindromic rich words and run-length encodings C Guo, J Shallit, AM Shur Information Processing Letters 116 (12), 735-738, 2016	21	2016
Finding Distinct Subpalindromes Online D Kosolobov, M Rubinchik, AM Shur Prague Stringology Conference 2013, 63-69, 2013	21	2013
Counting palindromes in substrings M Rubinchik, AM Shur International Symposium on String Processing and Information Retrieval, 290-303, 2017	20	2017
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	20	2017
Comparing complexity functions of a language and its extendable part AM Shur RAIRO-Theoretical Informatics and Applications 42 (3), 647-655, 2008	20	2008

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors