| A proof of Bel’tyukov–Lipshitz theorem by quasi-quantifier elimination. I. Definitions and GCD-lemma MR Starchak Vestnik St. Petersburg University, Mathematics 54 (3), 264-272, 2021 | 7 | 2021 |
| Positive Existential Definability with Unit, Addition and Coprimeness MR Starchak Proceedings of the 2021 on International Symposium on Symbolic and Algebraic …, 2021 | 5 | 2021 |
| A Proof of Bel’tyukov–Lipshitz Theorem by Quasi-Quantifier Elimination. II. The Main Reduction MR Starchak Vestnik St. Petersburg University, Mathematics 54 (4), 372-380, 2021 | 4 | 2021 |
| On the Existential Arithmetics with Addition and Bitwise Minimum MR Starchak Foundations of Software Science and Computation Structures: 26th …, 2023 | 2 | 2023 |
| Integer Linear-Exponential Programming in NP by Quantifier Elimination D Chistikov, A Mansutti, MR Starchak 51st International Colloquium on Automata, Languages, and Programming (ICALP …, 2024 | 1 | 2024 |
| Existential Definability of Unary Predicates in Büchi Arithmetic MR Starchak Conference on Computability in Europe, 218-232, 2024 | | 2024 |
| Quasi-Quantifier Elimination Algorithms and Definability Problems in Arithmetics with Divisibility MR Starchak St. Petersburg University, 2022 | | 2022 |
| Quantifier Elimination Approach to Existential Linear Arithmetic with GCD MR Starchak | | 2021 |
