| 2026 | WABI | 10-Minimizers: A Promising Class of Constant-Space Minimizers. | Arseny M. Shur, Ido Tziony, Yaron Orenstein |
| 2025 | SOFSEM | Expected Density of Random Minimizers. | Shay Golan, Arseny M. Shur |
| 2024 | CPM | Searching 2D-Strings for Matching Frames. | Itai Boneh, Dvir Fried, Shay Golan, Matan Kraus, Adrian Miclaus, Arseny M. Shur |
| 2024 | ESA | String 2-Covers with No Length Restrictions. | Itai Boneh, Shay Golan, Arseny M. Shur |
| 2024 | SOFSEM | Distance Labeling for Families of Cycles. | Arseny M. Shur, Mikhail Rubinchik |
| 2023 | DLT | Approaching Repetition Thresholds via Local Resampling and Entropy Compression. | Arseny M. Shur |
| 2022 | CSR | Abelian Repetition Threshold Revisited. | Elena A. Petrova, Arseny M. Shur |
| 2021 | DLT | Branching Frequency and Markov Entropy of Repetition-Free Languages. | Elena A. Petrova, Arseny M. Shur |
| 2020 | MFCS | Palindromic k-Factorization in Pure Linear Time. | Mikhail Rubinchik, Arseny M. Shur |
| 2019 | CPM | Searching Long Repeats in Streams. | Oleg Merkurev, Arseny M. Shur |
| 2019 | CSR | Transition Property for Cube-Free Words. | Elena A. Petrova, Arseny M. Shur |
| 2019 | SPIRE | Searching Runs in Streams. | Oleg Merkurev, Arseny M. Shur |
| 2018 | STACS | String Periods in the Order-Preserving Model. | Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Arseny M. Shur, Tomasz Walen |
| 2017 | CPM | Palindromic Length in Linear Time. | Kirill Borozdin, Dmitry Kosolobov, Mikhail Rubinchik, Arseny M. Shur |
| 2017 | DLT | On the Tree of Binary Cube-Free Words. | Elena A. Petrova, Arseny M. Shur |
| 2017 | STACS | On the Size of Lempel-Ziv and Lyndon Factorizations. | Juha Krkkinen, Dominik Kempa, Yuto Nakashima, Simon J. Puglisi, Arseny M. Shur |
| 2017 | SPIRE | Counting Palindromes in Substrings. | Mikhail Rubinchik, Arseny M. Shur |
| 2016 | CPM | Tight Tradeoffs for Real-Time Approximation of Longest Palindromes in Streams. | Pawel Gawrychowski, Oleg Merkurev, Arseny M. Shur, Przemyslaw Uznanski |
| 2016 | DLT | Ternary Square-Free Partial Words with Many Wildcards. | Daniil Gasnikov, Arseny M. Shur |
| 2015 | IWOCA | EERTREE: An Efficient Data Structure for Processing Palindromes in Strings. | Mikhail Rubinchik, Arseny M. Shur |
| 2015 | SOFSEM | Pal k is Linear Recognizable Online. | Dmitry Kosolobov, Mikhail Rubinchik, Arseny M. Shur |
| 2014 | UC | Quantum, Stochastic, and Pseudo Stochastic Languages with Few States. | Arseny M. Shur, Abuzer Yakaryilmaz |
| 2013 | DLT | Languages with a Finite Antidictionary: Growth-Preserving Transformations and Available Orders of Growth. | Arseny M. Shur |
| 2012 | MFCS | Constructing Premaximal Ternary Square-Free Words of Any Level. | Elena A. Petrova, Arseny M. Shur |
| 2012 | MFCS | On Two Stronger Versions of Dejean's Conjecture. | Igor N. Tunev, Arseny M. Shur |
| 2011 | CSR | Two Combinatorial Criteria for BWT Images. | Konstantin M. Likhomanov, Arseny M. Shur |
| 2011 | DLT | On Brzozowski's Conjecture for the Free Burnside Semigroup Satisfying | Andrey N. Plyushchenko, Arseny M. Shur |
| 2011 | DLT | Growth Properties of Power-Free Languages. | Arseny M. Shur |
| 2010 | CSR | Growth of Power-Free Languages over Large Alphabets. | Arseny M. Shur |
| 2010 | DLT | On the Existence of Minimal | Arseny M. Shur |
| 2009 | DLT | Two-Sided Bounds for the Growth Rates of Power-Free Languages. | Arseny M. Shur |
| 2008 | CSR | Combinatorial Complexity of Regular Languages. | Arseny M. Shur |
| 2006 | DLT | Factorial Languages of Low Combinatorial Complexity. | Arseny M. Shur |
| 2001 | MFCS | On the Periods of Partial Words. | Arseny M. Shur, Yulia V. Konovalova |