From post

On Affine Reachability Problems

, и . MFCS, том 170 из LIPIcs, стр. 48:1--48:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Preprint: <a href="https://arxiv.org/abs/1905.05114">Link</a><br>#conference.
DOI: 10.4230/LIPIcs.MFCS.2020.48

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.

 

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

Runtime analysis of probabilistic programs with unbounded recursion., , , и . J. Comput. Syst. Sci., 81 (1): 288-310 (2015)Analyzing probabilistic pushdown automata., , , и . Formal Methods in System Design, 43 (2): 124-163 (2013)Efficient Analysis of Probabilistic Programs with an Unbounded Counter., , и . CAV, том 6806 из Lecture Notes in Computer Science, стр. 208-224. Springer, (2011)Tree Buffers., и . CAV (1), том 9206 из Lecture Notes in Computer Science, стр. 290-306. Springer, (2015)On Computing the Total Variation Distance of Hidden Markov Models.. ICALP, том 107 из LIPIcs, стр. 130:1-130:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)On the Memory Consumption of Probabilistic Pushdown Automata., , и . FSTTCS, том 4 из LIPIcs, стр. 49-60. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2009)An Extension of Newton's Method to omega -Continuous Semirings., , и . Developments in Language Theory, том 4588 из Lecture Notes in Computer Science, стр. 157-168. Springer, (2007)Responsibility and verification: Importance value in temporal logics., , , , и . LICS, стр. 1-14. IEEE, (2021)Solving Systems of Positive Polynomial Equations (Lösung positiver polynomieller Gleichungssysteme). Technical University of Munich, Germany, (2010)On Affine Reachability Problems., и . MFCS, том 170 из LIPIcs, стр. 48:1-48:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)