From post

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.

 

Другие публикации лиц с тем же именем

Geometric decision procedures and the VC dimension of linear arithmetic theories., , и . LICS, стр. 59:1-59:13. ACM, (2022)Loose Graph Simulations., , и . STAF Workshops, том 10748 из Lecture Notes in Computer Science, стр. 109-126. Springer, (2017)Succinctness of Cosafety Fragments of LTL via Combinatorial Proof Systems., , и . FoSSaCS (2), том 14575 из Lecture Notes in Computer Science, стр. 95-115. Springer, (2024)On Deciding Linear Arithmetic Constraints Over p-adic Integers for All Primes., и . MFCS, том 202 из LIPIcs, стр. 55:1-55:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Distributed execution of bigraphical reactive systems., , и . Electron. Commun. Eur. Assoc. Softw. Sci. Technol., (2014)A Framework for Reasoning about Dynamic Axioms in Description Logics., , и . IJCAI, стр. 1681-1687. ijcai.org, (2020)Scheduled for July 2020, Yokohama, Japan, postponed due to the Corona pandemic..Extending Propositional Separation Logic for Robustness Properties.. FSTTCS, том 122 из LIPIcs, стр. 42:1-42:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Integer Programming with GCD Constraints., , , и . SODA, стр. 3605-3658. SIAM, (2024)The Complexity of Presburger Arithmetic with Power or Powers., , и . ICALP, том 261 из LIPIcs, стр. 112:1-112:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Integer Linear-Exponential Programming in NP by Quantifier Elimination., , и . ICALP, том 297 из LIPIcs, стр. 132:1-132:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)