( en | de | ru )

 

Disambiguation of "Lazic, Ranko"

Author of the publication

copydeleteadd this publication to your clipboard
Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete.

, , and . 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. You can also use the button next to the name to display some publications already assigned to the person.

Vladan Rankovic

Modulation of Ca_1hn2_1hn+ dependent inactivation of Ca_1hn2_1hn+ channels by intracellular signalling. Uni Magdeburg, (2009)

Ranko Pavlovi

Boja Lazic

Ranko Sredojevic

Ranko Stiglmayer

 

Other publications of authors with the same name

Verification Column.. ACM SIGLOG News, 10 (1): 23 (January 2023)Safety alternating automata on data words.. ACM Trans. Comput. Log., 12 (2): 10:1-10:24 (2011)The ideal view on Rackoff's coverability technique., and . Inf. Comput., (2021)The covering and boundedness problems for branching vector addition systems., , , and . J. Comput. Syst. Sci., 79 (1): 23-38 (2013)A pseudo-quasi-polynomial algorithm for solving mean-payoff parity games., , and . CoRR, (2018)Model Checking Freeze LTL over One-Counter Automata., , and . FoSSaCS, volume 4962 of Lecture Notes in Computer Science, page 490-504. Springer, (2008)Contextual Approximation and Higher-Order Procedures., and . FoSSaCS, volume 9634 of Lecture Notes in Computer Science, page 162-179. Springer, (2016)When is Containment Decidable for Probabilistic Automata?., , , , , and . ICALP, volume 107 of LIPIcs, page 121:1-121:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)The Reachability Problem for Two-Dimensional Vector Addition Systems with States., , , , , , , and . J. ACM, 68 (5): 34:1-34:43 (2021)Safety alternating automata on data words. CoRR, (2008)