Published in: LIPIcs, Volume 290, 27th International Conference on Database Theory (ICDT 2024)
Thomas Muñoz Serrano, Cristian Riveros, and Stijn Vansummeren. Enumeration and Updates for Conjunctive Linear Algebra Queries Through Expressibility. In 27th International Conference on Database Theory (ICDT 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 290, pp. 12:1-12:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{munozserrano_et_al:LIPIcs.ICDT.2024.12, author = {Mu\~{n}oz Serrano, Thomas and Riveros, Cristian and Vansummeren, Stijn}, title = {{Enumeration and Updates for Conjunctive Linear Algebra Queries Through Expressibility}}, booktitle = {27th International Conference on Database Theory (ICDT 2024)}, pages = {12:1--12:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-312-6}, ISSN = {1868-8969}, year = {2024}, volume = {290}, editor = {Cormode, Graham and Shekelyan, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2024.12}, URN = {urn:nbn:de:0030-drops-197946}, doi = {10.4230/LIPIcs.ICDT.2024.12}, annote = {Keywords: Query evaluation, conjunctive queries, linear algebra, enumeration algorithms} }
Published in: LIPIcs, Volume 259, 34th Annual Symposium on Combinatorial Pattern Matching (CPM 2023)
Diego Arroyuelo and Juan Pablo Castillo. Trie-Compressed Adaptive Set Intersection. In 34th Annual Symposium on Combinatorial Pattern Matching (CPM 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 259, pp. 1:1-1:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{arroyuelo_et_al:LIPIcs.CPM.2023.1, author = {Arroyuelo, Diego and Castillo, Juan Pablo}, title = {{Trie-Compressed Adaptive Set Intersection}}, booktitle = {34th Annual Symposium on Combinatorial Pattern Matching (CPM 2023)}, pages = {1:1--1:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-276-1}, ISSN = {1868-8969}, year = {2023}, volume = {259}, editor = {Bulteau, Laurent and Lipt\'{a}k, Zsuzsanna}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2023.1}, URN = {urn:nbn:de:0030-drops-179552}, doi = {10.4230/LIPIcs.CPM.2023.1}, annote = {Keywords: Set intersection problem, Adaptive Algorithms, Compressed and compact data structures} }
Published in: LIPIcs, Volume 255, 26th International Conference on Database Theory (ICDT 2023)
Martín Muñoz and Cristian Riveros. Constant-Delay Enumeration for SLP-Compressed Documents. In 26th International Conference on Database Theory (ICDT 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 255, pp. 7:1-7:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{munoz_et_al:LIPIcs.ICDT.2023.7, author = {Mu\~{n}oz, Mart{\'\i}n and Riveros, Cristian}, title = {{Constant-Delay Enumeration for SLP-Compressed Documents}}, booktitle = {26th International Conference on Database Theory (ICDT 2023)}, pages = {7:1--7:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-270-9}, ISSN = {1868-8969}, year = {2023}, volume = {255}, editor = {Geerts, Floris and Vandevoort, Brecht}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2023.7}, URN = {urn:nbn:de:0030-drops-177495}, doi = {10.4230/LIPIcs.ICDT.2023.7}, annote = {Keywords: SLP compression, query evaluation, enumeration algorithms} }
Published in: LIPIcs, Volume 255, 26th International Conference on Database Theory (ICDT 2023)
Cristian Riveros, Jorge Salas, and Oskar Skibski. How Do Centrality Measures Choose the Root of Trees?. In 26th International Conference on Database Theory (ICDT 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 255, pp. 12:1-12:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{riveros_et_al:LIPIcs.ICDT.2023.12, author = {Riveros, Cristian and Salas, Jorge and Skibski, Oskar}, title = {{How Do Centrality Measures Choose the Root of Trees?}}, booktitle = {26th International Conference on Database Theory (ICDT 2023)}, pages = {12:1--12:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-270-9}, ISSN = {1868-8969}, year = {2023}, volume = {255}, editor = {Geerts, Floris and Vandevoort, Brecht}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2023.12}, URN = {urn:nbn:de:0030-drops-177545}, doi = {10.4230/LIPIcs.ICDT.2023.12}, annote = {Keywords: Databases, centrality measures, data centrality, graph theory, tree structures} }
Published in: LIPIcs, Volume 247, 29th International Symposium on Temporal Representation and Reasoning (TIME 2022)
Stijn Vansummeren. Getting to the CORE of Complex Event Recognition (Invited Talk). In 29th International Symposium on Temporal Representation and Reasoning (TIME 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 247, pp. 3:1-3:2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{vansummeren:LIPIcs.TIME.2022.3, author = {Vansummeren, Stijn}, title = {{Getting to the CORE of Complex Event Recognition}}, booktitle = {29th International Symposium on Temporal Representation and Reasoning (TIME 2022)}, pages = {3:1--3:2}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-262-4}, ISSN = {1868-8969}, year = {2022}, volume = {247}, editor = {Artikis, Alexander and Posenato, Roberto and Tonetta, Stefano}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.TIME.2022.3}, URN = {urn:nbn:de:0030-drops-172503}, doi = {10.4230/LIPIcs.TIME.2022.3}, annote = {Keywords: Complex Event Recognition, automata, enumeration-based query processing} }
Published in: LIPIcs, Volume 220, 25th International Conference on Database Theory (ICDT 2022)
Martín Muñoz and Cristian Riveros. Streaming Enumeration on Nested Documents. In 25th International Conference on Database Theory (ICDT 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 220, pp. 19:1-19:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{munoz_et_al:LIPIcs.ICDT.2022.19, author = {Mu\~{n}oz, Mart{\'\i}n and Riveros, Cristian}, title = {{Streaming Enumeration on Nested Documents}}, booktitle = {25th International Conference on Database Theory (ICDT 2022)}, pages = {19:1--19:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-223-5}, ISSN = {1868-8969}, year = {2022}, volume = {220}, editor = {Olteanu, Dan and Vortmeier, Nils}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2022.19}, URN = {urn:nbn:de:0030-drops-158935}, doi = {10.4230/LIPIcs.ICDT.2022.19}, annote = {Keywords: Streaming, nested documents, query evaluation, enumeration algorithms} }
Published in: LIPIcs, Volume 214, 16th International Symposium on Parameterized and Exact Computation (IPEC 2021)
Alejandro Grez, Filip Mazowiecki, Michał Pilipczuk, Gabriele Puppis, and Cristian Riveros. Dynamic Data Structures for Timed Automata Acceptance. In 16th International Symposium on Parameterized and Exact Computation (IPEC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 214, pp. 20:1-20:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{grez_et_al:LIPIcs.IPEC.2021.20, author = {Grez, Alejandro and Mazowiecki, Filip and Pilipczuk, Micha{\l} and Puppis, Gabriele and Riveros, Cristian}, title = {{Dynamic Data Structures for Timed Automata Acceptance}}, booktitle = {16th International Symposium on Parameterized and Exact Computation (IPEC 2021)}, pages = {20:1--20:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-216-7}, ISSN = {1868-8969}, year = {2021}, volume = {214}, editor = {Golovach, Petr A. and Zehavi, Meirav}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2021.20}, URN = {urn:nbn:de:0030-drops-154037}, doi = {10.4230/LIPIcs.IPEC.2021.20}, annote = {Keywords: timed automata, data stream, dynamic data structure} }
Published in: LIPIcs, Volume 186, 24th International Conference on Database Theory (ICDT 2021)
Pierre Bourhis, Alejandro Grez, Louis Jachiet, and Cristian Riveros. Ranked Enumeration of MSO Logic on Words. In 24th International Conference on Database Theory (ICDT 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 186, pp. 20:1-20:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{bourhis_et_al:LIPIcs.ICDT.2021.20, author = {Bourhis, Pierre and Grez, Alejandro and Jachiet, Louis and Riveros, Cristian}, title = {{Ranked Enumeration of MSO Logic on Words}}, booktitle = {24th International Conference on Database Theory (ICDT 2021)}, pages = {20:1--20:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-179-5}, ISSN = {1868-8969}, year = {2021}, volume = {186}, editor = {Yi, Ke and Wei, Zhewei}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2021.20}, URN = {urn:nbn:de:0030-drops-137286}, doi = {10.4230/LIPIcs.ICDT.2021.20}, annote = {Keywords: Persistent data structures, Query evaluation, Enumeration algorithms} }
Published in: LIPIcs, Volume 155, 23rd International Conference on Database Theory (ICDT 2020)
Alejandro Grez and Cristian Riveros. Towards Streaming Evaluation of Queries with Correlation in Complex Event Processing. In 23rd International Conference on Database Theory (ICDT 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 155, pp. 14:1-14:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{grez_et_al:LIPIcs.ICDT.2020.14, author = {Grez, Alejandro and Riveros, Cristian}, title = {{Towards Streaming Evaluation of Queries with Correlation in Complex Event Processing}}, booktitle = {23rd International Conference on Database Theory (ICDT 2020)}, pages = {14:1--14:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-139-9}, ISSN = {1868-8969}, year = {2020}, volume = {155}, editor = {Lutz, Carsten and Jung, Jean Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2020.14}, URN = {urn:nbn:de:0030-drops-119389}, doi = {10.4230/LIPIcs.ICDT.2020.14}, annote = {Keywords: Complex event processing, Query languages, Correlation, Constant delay enumeration.} }
Published in: LIPIcs, Volume 155, 23rd International Conference on Database Theory (ICDT 2020)
Alejandro Grez, Cristian Riveros, Martín Ugarte, and Stijn Vansummeren. On the Expressiveness of Languages for Complex Event Recognition. In 23rd International Conference on Database Theory (ICDT 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 155, pp. 15:1-15:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{grez_et_al:LIPIcs.ICDT.2020.15, author = {Grez, Alejandro and Riveros, Cristian and Ugarte, Mart{\'\i}n and Vansummeren, Stijn}, title = {{On the Expressiveness of Languages for Complex Event Recognition}}, booktitle = {23rd International Conference on Database Theory (ICDT 2020)}, pages = {15:1--15:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-139-9}, ISSN = {1868-8969}, year = {2020}, volume = {155}, editor = {Lutz, Carsten and Jung, Jean Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2020.15}, URN = {urn:nbn:de:0030-drops-119390}, doi = {10.4230/LIPIcs.ICDT.2020.15}, annote = {Keywords: Query languages, Complex Event Recognition, Logics, Automata theory} }
Published in: LIPIcs, Volume 155, 23rd International Conference on Database Theory (ICDT 2020)
Cristian Riveros and Jorge Salas. A Family of Centrality Measures for Graph Data Based on Subgraphs. In 23rd International Conference on Database Theory (ICDT 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 155, pp. 23:1-23:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{riveros_et_al:LIPIcs.ICDT.2020.23, author = {Riveros, Cristian and Salas, Jorge}, title = {{A Family of Centrality Measures for Graph Data Based on Subgraphs}}, booktitle = {23rd International Conference on Database Theory (ICDT 2020)}, pages = {23:1--23:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-139-9}, ISSN = {1868-8969}, year = {2020}, volume = {155}, editor = {Lutz, Carsten and Jung, Jean Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2020.23}, URN = {urn:nbn:de:0030-drops-119474}, doi = {10.4230/LIPIcs.ICDT.2020.23}, annote = {Keywords: Graph data, graph centrality, centrality measures} }
Published in: LIPIcs, Volume 127, 22nd International Conference on Database Theory (ICDT 2019)
Alejandro Grez, Cristian Riveros, and Martín Ugarte. A Formal Framework for Complex Event Processing. In 22nd International Conference on Database Theory (ICDT 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 127, pp. 5:1-5:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{grez_et_al:LIPIcs.ICDT.2019.5, author = {Grez, Alejandro and Riveros, Cristian and Ugarte, Mart{\'\i}n}, title = {{A Formal Framework for Complex Event Processing}}, booktitle = {22nd International Conference on Database Theory (ICDT 2019)}, pages = {5:1--5:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-101-6}, ISSN = {1868-8969}, year = {2019}, volume = {127}, editor = {Barcelo, Pablo and Calautti, Marco}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2019.5}, URN = {urn:nbn:de:0030-drops-103079}, doi = {10.4230/LIPIcs.ICDT.2019.5}, annote = {Keywords: Complex event processing, streaming evaluation, constant delay enumeration} }
Published in: LIPIcs, Volume 96, 35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)
Filip Mazowiecki and Cristian Riveros. Pumping Lemmas for Weighted Automata. In 35th Symposium on Theoretical Aspects of Computer Science (STACS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 96, pp. 50:1-50:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{mazowiecki_et_al:LIPIcs.STACS.2018.50, author = {Mazowiecki, Filip and Riveros, Cristian}, title = {{Pumping Lemmas for Weighted Automata}}, booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)}, pages = {50:1--50:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-062-0}, ISSN = {1868-8969}, year = {2018}, volume = {96}, editor = {Niedermeier, Rolf and Vall\'{e}e, Brigitte}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.50}, URN = {urn:nbn:de:0030-drops-84984}, doi = {10.4230/LIPIcs.STACS.2018.50}, annote = {Keywords: Weighted automata, regular functions over words, pumping lemmas} }
Published in: LIPIcs, Volume 85, 28th International Conference on Concurrency Theory (CONCUR 2017)
Nathanaël Fijalkow, Cristian Riveros, and James Worrell. Probabilistic Automata of Bounded Ambiguity. In 28th International Conference on Concurrency Theory (CONCUR 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 85, pp. 19:1-19:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{fijalkow_et_al:LIPIcs.CONCUR.2017.19, author = {Fijalkow, Nathana\"{e}l and Riveros, Cristian and Worrell, James}, title = {{Probabilistic Automata of Bounded Ambiguity}}, booktitle = {28th International Conference on Concurrency Theory (CONCUR 2017)}, pages = {19:1--19:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-048-4}, ISSN = {1868-8969}, year = {2017}, volume = {85}, editor = {Meyer, Roland and Nestmann, Uwe}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2017.19}, URN = {urn:nbn:de:0030-drops-77716}, doi = {10.4230/LIPIcs.CONCUR.2017.19}, annote = {Keywords: Probabilistic Automata, Emptiness Problem, Stochastic Path Problem, Multi-Objective Optimisation Problems} }
Published in: LIPIcs, Volume 47, 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)
Filip Mazowiecki and Cristian Riveros. Copyless Cost-Register Automata: Structure, Expressiveness, and Closure Properties. In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, pp. 53:1-53:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{mazowiecki_et_al:LIPIcs.STACS.2016.53, author = {Mazowiecki, Filip and Riveros, Cristian}, title = {{Copyless Cost-Register Automata: Structure, Expressiveness, and Closure Properties}}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, pages = {53:1--53:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-001-9}, ISSN = {1868-8969}, year = {2016}, volume = {47}, editor = {Ollinger, Nicolas and Vollmer, Heribert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.53}, URN = {urn:nbn:de:0030-drops-57547}, doi = {10.4230/LIPIcs.STACS.2016.53}, annote = {Keywords: Cost Register Automata, Weighted Automata, Semirings} }
Feedback for Dagstuhl Publishing