Author of the publication

Dynamic Data Structures for Timed Automata Acceptance.

, , , , and . IPEC, volume 214 of LIPIcs, page 20:1-20:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)

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

Bounded repairability for regular tree languages., , and . ICDT, page 155-168. ACM, (2012)How to choose the root: centrality measures over tree structures, , and . (2021)cite arxiv:2112.13736Comment: submitted to PODS2022.Efficient Enumeration for Annotated Grammars., , , and . PODS, page 291-300. ACM, (2022)Streaming Enumeration on Nested Documents., and . ICDT, volume 220 of LIPIcs, page 19:1-19:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)When is approximate counting for conjunctive queries tractable?, , , and . STOC, page 1015-1027. ACM, (2021)Constant-delay enumeration for SLP-compressed documents., and . CoRR, (2022)Towards Streaming Evaluation of Queries with Correlation in Complex Event Processing., and . ICDT, volume 155 of LIPIcs, page 14:1-14:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)The monitoring problem for timed automata., , , , and . CoRR, (2020)Probabilistic Automata of Bounded Ambiguity., , and . CONCUR, volume 85 of LIPIcs, page 19:1-19:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Copyless Cost-Register Automata: Structure, Expressiveness, and Closure Properties., and . STACS, volume 47 of LIPIcs, page 53:1-53:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)