( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Separability of Reachability Sets of Vector Addition Systems.

, , , и . CoRR, (2016)

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.

Bogdan Lasota

Joanna Lasota

Katarzyna Lasota

Slawomir Olszewski

Slawomir Plesz

 

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

Coalgebra morphisms subsume open maps.. Theor. Comput. Sci., 280 (1-2): 123-135 (2002)Improved Ackermannian lower bound for the VASS reachability problem.. CoRR, (2021)Partially-Commutative Context-Free Processes., , и . CONCUR, том 5710 из Lecture Notes in Computer Science, стр. 259-273. Springer, (2009)Reachability Problem for Weak Multi-Pushdown Automata., , и . CONCUR, том 7454 из Lecture Notes in Computer Science, стр. 53-68. Springer, (2012)Turing machines with atoms, constraint satisfaction problems, and descriptive complexity., , , и . CSL-LICS, стр. 58:1-58:10. ACM, (2014)Fraenkel-Mostowski Sets with Non-homogeneous Atoms., и . RP, том 7550 из Lecture Notes in Computer Science, стр. 1-5. Springer, (2012)Open maps as a bridge between algebraic observational equivalence and bisimilarity.. WADT, том 1376 из Lecture Notes in Computer Science, стр. 285-299. Springer, (1997)Homomorphism Problems for First-Order Definable Structures., , , и . FSTTCS, том 65 из LIPIcs, стр. 14:1-14:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Causality Versus True-Concurrency., и . EXPRESS, том 154 из Electronic Notes in Theoretical Computer Science, стр. 3-18. Elsevier, (2005)On the Semantics of Multistage Interconnection Networks., и . SOFSEM, том 1175 из Lecture Notes in Computer Science, стр. 359-368. Springer, (1996)