( en | de | ru )

 

Disambiguation of "Potapov, Igor"

Author of the publication

copydeleteadd this publication to your clipboard
Reachability Problems in Nondeterministic Polynomial Maps on the Integers.

, , and . DLT, volume 11088 of Lecture Notes in Computer Science, page 465-477. Springer, (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Evgenij Potapov

Sergej Potapov

Evgenij Potapov

Anatolij Potapov

Igor Barabash

Das Bildzitat im Internet. Uni München, (2009)
 

Other publications of authors with the same name

Mortality for 2×2 Matrices Is NP-Hard., , and . MFCS, volume 7464 of Lecture Notes in Computer Science, page 148-159. Springer, (2012)Reachability Problems in Quaternion Matrix and Rotation Semigroups., and . MFCS, volume 4708 of Lecture Notes in Computer Science, page 346-358. Springer, (2007)Computation in One-Dimensional Piecewise Maps., , and . HSCC, volume 4416 of Lecture Notes in Computer Science, page 706-709. Springer, (2007)Composition Problems for Braids.. FSTTCS, volume 24 of LIPIcs, page 175-187. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2013)Integer Weighted Automata on Infinite Words., , , and . DLT, volume 12811 of Lecture Notes in Computer Science, page 167-179. Springer, (2021)Temporal Logic with Predicate lambda-Abstraction., and . TIME, page 147-155. IEEE Computer Society, (2005)The k-Centre Problem for Classes of Cyclic Words., , , and . SOFSEM, volume 13878 of Lecture Notes in Computer Science, page 385-400. Springer, (2023)A Geometric Approach to Passive Localisation., , , and . FUSION, page 1-8. IEEE, (2022)Preface., , , and . Fundam. Informaticae, (2022)Decidability of the Membership Problem for 2×2 integer matrices., and . CoRR, (2016)