1. E Bach,J Shallit (1996). Algorithmic number theory, I: Efficient algorithms. Algorithmic number theory, I: Efficient algorithms
2. I Borosh,L Treybig (1976). Bounds on positive integral solutions of linear Diophantine equations. Proceedings of the American Mathematical Society, 55(2), 299-304.
3. D Bundala,J Ouaknine (2017). On parametric timed automata and one-counter machines. Information and Computation, 253, 272-303.
4. L Van Den Dries,A Wilkie (2003). The laws of integer divisibility, and solution sets of linear divisibility conditions. Journal of Symbolic Logic, 68(2), 503-526.
5. Michael Fellows,Daniel Lokshtanov,Neeldhara Misra,Frances Rosamond,Saket Saurabh (2008). Graph Layout Problems Parameterized by Vertex Cover. Lecture Notes in Computer Science, 294-305.
6. M Garey,D Johnson (1979). Computers and Intractability: A guide to the theory of NPcompleteness. Computers and Intractability: A guide to the theory of NPcompleteness
7. Christoph Haase (2014). Subclasses of presburger arithmetic and the weak EXP hierarchy. Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-10.
8. N Kosovskii,T Kosovskaya,N Kosovskii (2016). NP-completeness conditions for verifying the consistency of several kinds of systems of linear diophantine discongruences. Vestnik SPbSU. Mathematics. Mechanics. Astronomy, 49(1), 18-22.
9. N Kosovskii,T Kosovskaya,N Kosovskii (2016). NP-completeness conditions for verifying the consistency of several kinds of systems of linear diophantine dis-equations. Vestnik SPbSU. Mathematics. Mechanics. Astronomy, 49(3), 243-247.
10. N Kosovskii,T Kosovskaya,N Kosovskii,M Starchak (2017). NP-complete problems for systems of divisibilities of values of linear polynomials. Vestnik SPbSU. Mathematics. Mechanics. Astronomy, 4(62), 236-246.
11. Antonia Lechner (2015). Synthesis Problems for One-Counter Automata. Lecture Notes in Computer Science, 89-100.
12. Antonia Lechner,Joel Ouaknine,James Worrell (2015). On the Complexity of Linear Arithmetic with Divisibility. 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 667-676.
13. H Lenstra (1983). Integer Programming with a Fixed Number of Variables. Mathematics of Operations Research, 8(4), 538-548.
14. L Lipshitz (1981). Some remarks on the diophantine problem for addition and divisibility. Bulletin de la Société mathématique de Belgique. Série B, 33(1), 41-52.
15. M Presburger (1929). Über die Vollständigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt. Comptes rendus du 1er Congrès des Mathématiciens des Pays Slaves, 92-101.
16. D Richard (2001). What are weak arithmetics?. Theoretical Computer Science, 257, 17-29.
17. A Woods (1981). Some problems in logic and number theory, and their connections. Some problems in logic and number theory, and their connections
