| 2022 | CADE | Binary Codes that Do Not Preserve Primitivity. | Stepan Holub, Martin Raska, Stepn Starosta |
| 2021 | DLT | Lyndon Words Formalized in Isabelle/HOL. | Stepan Holub, Stepn Starosta |
| 2021 | ITP | Formalization of Basic Combinatorics on Words. | Stepan Holub, Stepn Starosta |
| 2017 | CiE | Formalizing a Fragment of Combinatorics on Words. | Stepan Holub, Robert Veroff |
| 2016 | STACS | Periods and Borders of Random Words. | Stepan Holub, Jeffrey O. Shallit |
| 2015 | LATA | Equation x^iy^jx^k=u^iv^ju^k in Words. | Jana Hadravov, Stepan Holub |
| 2015 | SPIRE | Beyond the Runs Theorem. | Johannes Fischer, Stepan Holub, Tomohiro I, Moshe Lewenstein |
| 2014 | MFCS | Universal Lyndon Words. | Arturo Carpi, Gabriele Fici, Stepan Holub, Jakub Oprsal, Marinella Sciortino |
| 2014 | MFCS | On Upper and Lower Bounds on the Length of Alternating Towers. | Stepan Holub, Galina Jirskov, Toms Masopust |
| 2009 | ICALP | The Ehrenfeucht-Silberger Problem. | Stepan Holub, Dirk Nowotka |
| 2008 | DLT | Large Simple Binary Equality Words. | Jana Hadravov, Stepan Holub |
| 2008 | DLT | On the Relation between Periodicity and Unbordered Factors of Finite Words. | Stepan Holub, Dirk Nowotka |
| 2002 | DLT | A Unique Structure of Two-Generated Binary Equality Sets. | Stepan Holub |