Author of the publication

Reachability in Dynamical Systems with Rounding.

, , , , , , , , and . FSTTCS, volume 182 of LIPIcs, page 36:1-36:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)

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.

 

Other publications of authors with the same name

SIGLOG Monthly 230.. ACM SIGLOG News, 9 (4): 44-49 (October 2022)On the Skolem Problem and the Skolem Conjecture., , , , , and . LICS, page 5:1-5:9. ACM, (2022)Determinisation and Unambiguisation of Polynomially-Ambiguous Rational Weighted Automata., , and . LICS, page 46:1-46:13. ACM, (2024)The Power of Counting Steps in Quantitative Games., , , , and . CONCUR, volume 311 of LIPIcs, page 13:1-13:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Model Checking Linear Dynamical Systems under Floating-point Rounding., , , and . TACAS (1), volume 13993 of Lecture Notes in Computer Science, page 47-65. Springer, (2023)SIGLOG Monthly 245: January 2024., and . ACM SIGLOG News, 11 (1): 13-20 (January 2024)The Big-O Problem for Max-Plus Automata is Decidable (PSPACE-Complete)., and . LICS, page 1-13. IEEE, (2023)Asymmetric Distances for Approximate Differential Privacy., , and . CONCUR, volume 140 of LIPIcs, page 10:1-10:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)SIGLOG monthly 212.. ACM SIGLOG News, 8 (2): 30-45 (2021)Twitter Usage Across Industry: A Spatiotemporal Analysis., , , , and . BigDataService, page 64-71. IEEE Computer Society, (2018)