| No. |
Title |
Author |
Year |
| 1 |
Constant-Delay Enumeration for SLP-Compressed Documents |
Muñoz, Martín et al. |
2023 |
| 2 |
How Do Centrality Measures Choose the Root of Trees? |
Riveros, Cristian et al. |
2023 |
| 3 |
Streaming Enumeration on Nested Documents |
Muñoz, Martín et al. |
2022 |
| 4 |
Dynamic Data Structures for Timed Automata Acceptance |
Grez, Alejandro et al. |
2021 |
| 5 |
Ranked Enumeration of MSO Logic on Words |
Bourhis, Pierre et al. |
2021 |
| 6 |
A Family of Centrality Measures for Graph Data Based on Subgraphs |
Riveros, Cristian et al. |
2020 |
| 7 |
On the Expressiveness of Languages for Complex Event Recognition |
Grez, Alejandro et al. |
2020 |
| 8 |
Towards Streaming Evaluation of Queries with Correlation in Complex Event Processing |
Grez, Alejandro et al. |
2020 |
| 9 |
A Formal Framework for Complex Event Processing |
Grez, Alejandro et al. |
2019 |
| 10 |
Pumping Lemmas for Weighted Automata |
Mazowiecki, Filip et al. |
2018 |
| 11 |
Probabilistic Automata of Bounded Ambiguity |
Fijalkow, Nathanaël et al. |
2017 |
| 12 |
Copyless Cost-Register Automata: Structure, Expressiveness, and Closure Properties |
Mazowiecki, Filip et al. |
2016 |
| 13 |
Maximal Partition Logic: Towards a Logical Characterization of Copyless Cost Register Automata |
Mazowiecki, Filip et al. |
2015 |
