| Publication | Date of Publication | Type |
|---|
Enumeration and updates for conjunctive linear algebra queries through expressibility
Logical Methods in Computer Science | 2026-02-13 | Paper |
| Constant-delay enumeration for SLP-compressed documents | 2024-10-08 | Paper |
| How do centrality measures choose the root of trees? | 2024-10-08 | Paper |
| Streaming enumeration on nested documents | 2024-04-25 | Paper |
| Streaming enumeration on nested documents | 2024-04-23 | Paper |
| Dynamic data structures for timed automata acceptance | 2024-02-12 | Paper |
A polynomial-time approximation algorithm for counting words accepted by an NFA (invited paper)
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
When is approximate counting for conjunctive queries tractable?
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
| scientific article; zbMATH DE number 7651001 (Why is no real title available?) | 2023-02-07 | Paper |
| On the Expressiveness of Languages for Complex Event Recognition | 2023-02-07 | Paper |
| Towards Streaming Evaluation of Queries with Correlation in Complex Event Processing | 2023-02-07 | Paper |
#NFA Admits an FPRAS: Efficient Enumeration, Counting, and Uniform Generation for Logspace Classes
Journal of the ACM | 2022-12-08 | Paper |
Dynamic data structures for timed automata acceptance
Algorithmica | 2022-10-27 | Paper |
| A Formal Framework for Complex Event Processing | 2022-07-21 | Paper |
Probabilistic automata of bounded ambiguity
Information and Computation | 2022-01-06 | Paper |
Bounded repairability for regular tree languages
ACM Transactions on Database Systems | 2021-11-25 | Paper |
scientific article; zbMATH DE number 7407779 (Why is no real title available?)
(available as arXiv preprint) | 2021-10-08 | Paper |
| scientific article; zbMATH DE number 7407779 (Why is no real title available?) | 2021-10-08 | Paper |
| Descriptive complexity for counting complexity classes | 2021-01-19 | Paper |
| Pumping lemmas for weighted automata | 2020-08-05 | Paper |
| Probabilistic automata of bounded ambiguity | 2020-05-27 | Paper |
Descriptive complexity for counting complexity classes
(available as arXiv preprint) | 2020-02-17 | Paper |
Copyless cost-register automata: structure, expressiveness, and closure properties
Journal of Computer and System Sciences | 2019-05-02 | Paper |
Copyless cost-register automata: structure, expressiveness, and closure properties
(available as arXiv preprint) | 2018-01-24 | Paper |
| Maximal partition logic: towards a logical characterization of copyless cost register automata | 2017-08-31 | Paper |
Quantitative Monadic Second-Order Logic
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science | 2017-07-03 | Paper |
Which XML schemas are streaming bounded repairable?
Theory of Computing Systems | 2016-04-18 | Paper |
The per-character cost of repairing word languages
Theoretical Computer Science | 2014-06-06 | Paper |
Bounded repairability of word languages
Journal of Computer and System Sciences | 2014-01-27 | Paper |
The language of plain SO-tgds: composition, inversion and structural properties
Journal of Computer and System Sciences | 2014-01-20 | Paper |
The Cost of Traveling between Languages
Automata, Languages and Programming | 2011-07-07 | Paper |
