Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Shur, Arseny M.
~ 100  Ergebnisse:
Personensuche X
?
1

Distance Labeling for Families of Cycles:

, In: Lecture Notes in Computer Science; SOFSEM 2024: Theory and Practice of Computer Science,
Shur, Arseny M. ; Rubinchik, Mikhail - p. 471-484 , 2024
Link: https://doi.org/10.1007/..
 
?
2

Approaching Repetition Thresholds via Local Resampling and ..:

, In: Developments in Language Theory; Lecture Notes in Computer Science,
Shur, Arseny M. - p. 219-232 , 2023
Link: https://doi.org/10.1007/..
 
?
3

Abelian Repetition Threshold Revisited:

, In: Computer Science – Theory and Applications; Lecture Notes in Computer Science,
Petrova, Elena A. ; Shur, Arseny M. - p. 302-319 , 2022
Link: https://doi.org/10.1007/..
 
?
4

On minimal critical exponent of balanced sequences:

Dvořáková, L'ubomíra ; Pelantová, Edita ; Opočenská, Daniela.
Theoretical Computer Science.  922 (2022)  - p. 158-169 , 2022
Link: https://doi.org/10.1016/..
 
?
5

Computing The Maximum Exponent in a Stream:

Merkurev, Oleg ; Shur, Arseny M.
Algorithmica.  84 (2021)  3 - p. 742-756 , 2021
Link: https://doi.org/10.1007/..
 
?
6

Branching Densities of Cube-Free and Square-Free Words:

Petrova, Elena A. ; Shur, Arseny M.
Algorithms.  14 (2021)  4 - p. 126 , 2021
Link: https://doi.org/10.3390/..
 
?
7

Branching Frequency and Markov Entropy of Repetition-Free L..:

, In: Developments in Language Theory; Lecture Notes in Computer Science,
Petrova, Elena A. ; Shur, Arseny M. - p. 328-341 , 2021
Link: https://doi.org/10.1007/..
 
?
8

Transition Property for Cube-Free Words:

Petrova, Elena A. ; Shur, Arseny M.
Theory of Computing Systems.  65 (2020)  3 - p. 479-496 , 2020
Link: https://doi.org/10.1007/..
 
?
9

Transition Property for Cube-Free Words:

, In: Computer Science – Theory and Applications; Lecture Notes in Computer Science,
Petrova, Elena A. ; Shur, Arseny M. - p. 311-324 , 2019
Link: https://doi.org/10.1007/..
 
?
10

Tight Tradeoffs for Real-Time Approximation of Longest Pali..:

Gawrychowski, Paweł ; Merkurev, Oleg ; Shur, Arseny M..
Algorithmica.  81 (2019)  9 - p. 3630-3654 , 2019
Link: https://doi.org/10.1007/..
 
?
11

Comparison of LZ77-type parsings:

Kosolobov, Dmitry ; Shur, Arseny M.
Information Processing Letters.  141 (2019)  - p. 25-29 , 2019
Link: https://doi.org/10.1016/..
 
?
12

Searching Runs in Streams:

, In: String Processing and Information Retrieval; Lecture Notes in Computer Science,
Merkurev, Oleg ; Shur, Arseny M. - p. 203-220 , 2019
Link: https://doi.org/10.1007/..
 
?
13

EERTREE: An efficient data structure for processing palindr..:

Rubinchik, Mikhail ; Shur, Arseny M.
European Journal of Combinatorics.  68 (2018)  - p. 249-265 , 2018
Link: https://doi.org/10.1016/..
 
?
14

Palindromic rich words and run-length encodings:

Guo, Chuan ; Shallit, Jeffrey ; Shur, Arseny M.
Information Processing Letters.  116 (2016)  12 - p. 735-738 , 2016
Link: https://doi.org/10.1016/..
 
?
15

Searching for Zimin patterns:

Rytter, Wojciech ; Shur, Arseny M.
Theoretical Computer Science.  571 (2015)  - p. 50-57 , 2015
Link: https://doi.org/10.1016/..
 
1-15