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) (2023)

Constant-Delay Enumeration for SLP-Compressed Documents

26th International Conference on Database Theory (ICDT 2023) 255 7:1--7:17

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) (2023)

How Do Centrality Measures Choose the Root of Trees?

26th International Conference on Database Theory (ICDT 2023) 255 12:1--12:17

Vrgoc D., Rojas C., Angles R., Arenas M., Arroyuelo D., Buil-Aranda C., Hogan A., Navarro G., Riveros C., Romero J. (2023)

MillenniumDB: An Open-Source Graph Database System

Data Intelligence 5 3 560-610

Riveros C., Jan N., Vrgoc D. (2023)

REmatch: a novel regex engine for finding all matches

Proceedings of the VLDB Endowment 16 11 2792-2804

Bucchi M., Grez A., Quintana A., Riveros C., Vansummeren S. (2022)

CORE: a complex event recognition engine

Proceedings of the VLDB Endowment 15 9 1951-1964

Arenas M., Croquevielle L., Jayaram R., Riveros C. (2022)

Counting the Answers to a Query

SIGMOD Record 51 3 6-17

Grez A., Mazowiecki F., Pilipczuk M., Puppis G., Riveros C. (2022)

Dynamic Data Structures for Timed Automata Acceptance

Algorithmica 84 11 3223-3245

Amarilli A., Jachiet L., Muñoz M., Riveros C. (2022)

Efficient Enumeration for Annotated Grammars

Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems 291–300

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) (2022)

Streaming Enumeration on Nested Documents

25th International Conference on Database Theory, ICDT 2022 220 19:1--19:18

Arenas M., Croquevielle L.A., Jayaram R., Riveros C. (2021)

#NFA Admits an FPRAS: Efficient Enumeration, Counting, and Uniform Generation for Logspace Classes

Journal of the ACM 68 6 1-40

Grez A., Riveros C., Ugarte M., Vansummeren S. (2021)

A Formal Framework for Complex Event Recognition

ACM Transactions on Database Systems 46 4 49

Arenas M., Croquevielle L.A., Jayaram R., Riveros C. (2021)

A polynomial-time approximation algorithm for counting words accepted by an NFA (invited paper)

CONFERENCIA A*: STOC (Symposium on Theory of Computing) 4

Geerts F., Muñoz T., Riveros C., Vrgo? D (2021)

Expressive Power of Linear Algebra Query Languages

Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems 342–354

(2021)

Expressive Power of Linear Algebra Query Languages

CONFERENCIA A*: PODS (Symposium on Principles of Database Systems) 13

Geerts F., Muñoz T., Riveros C., Van den Bussche J., Vrgo? D. (2021)

Matrix Query Languages

SIGMOD Record 50 3 14

(2021)

Ranked Enumeration of MSO Logic on Words

CONFERENCIA A: International Conference on Database Theory (ICDT) 186 20:1--20:19

(2021)

When is approximate counting for conjunctive queries tractable?

Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing 1015–1027

(2021)

When is approximate counting for conjunctive queries tractable?

CONFERENCIA A*: STOC (Symposium on Theory of Computing) 13

(2020)

A Family of Centrality Measures for Graph Data Based on Subgraphs

23nd International Conference on Database Theory (ICDT) 155

Arenas M., Muñoz M., Riveros C. (2020)

Descriptive Complexity for Counting Complexity Classes

Logical Methods in Computer Science 16 1 42

Florenzano F., Riveros C., Ugarte M., Vansummeren S., Vrgoc D. (2020)

Efficient Enumeration Algorithms for Regular Document Spanners

ACM Transactions on Database Systems 45 1 42

Arenas M., Croquevielle L.A., Jayaram R., Riveros C. (2020)

Efficient Logspace Classes for Enumeration, Counting, and Uniform Generation

SIGMOD Record 49 1 8

(2020)

On the Expressiveness of Languages for Complex Event Recognition

23nd International Conference on Database Theory (ICDT) 155

Fijalkow N., Riveros C., Worrell J. (2020)

Probabilistic automata of bounded ambiguity

Information and Computation 104648

(2020)

Towards Streaming Evaluation of Queries with Correlation in Complex Event Processing

23nd International Conference on Database Theory (ICDT) 155

Alejandro Grez, Cristian Riveros, Martín Ugarte: A Formal Framework for Complex Event Processing. ICDT 2019: 5:1-5:18. (2019)

A Formal Framework for Complex Event Processing

22nd International Conference on Database Theory (ICDT) 5:1--5:18

Aidan Hogan, Cristian Riveros, Carlos Rojas, Adrián Soto: A Worst-Case Optimal Join Algorithm for SPARQL. ISWC (1) 2019: 258-275 (2019)

A Worst-Case Optimal Join Algorithm for SPARQL

18th International Semantic Web Conference (ISWC) 59--73

Mazowiecki R., Riveros C. (2019)

Copyless cost-register automata: Structure, expressiveness, and closure properties

Journal of Computer and System Sciences 100 1-29

Marcelo Arenas, Luis Alberto Croquevielle, Rajesh Jayaram, Cristian Riveros: Efficient Logspace Classes for Enumeration, Counting, and Uniform Generation. PODS 2019: 59-73. (2019)

Efficient Logspace Classes for Enumeration, Counting, and Uniform Generation

38th ACM Symposium on Principles of Database Systems (PODS) 59--73

(2018)

Constant delay algorithms for regular document spanners

ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems

(2018)

Document spanners for extracting incomplete information: expressiveness and complexity

ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems

Arenas M., Maturana F., Riveros C. and Vrgoc D. (2016)

A framework for annotating CSV-like data

Proceedings of the VLDB Endowment 9 11 876 - 887

Bourhis P., Puppis G., Riveros C. and Staworko S. (2016)

Bounded Repairability for Regular Tree Languages

ACM Transactions on Database Systems 41 3 45pp

(2016)

Copyless Cost-Register Automata: Structure, Expressiveness, and Closure Properties.

33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016) 53:1--53:13

(2016)

Querying Wikidata: Comparing SPARQL, Relational and Graph Databases

International Semantic Web Conference 2 88-103

Filip Mazowiecki and Cristian Riveros, "Maximal partition logic: towards a logical characterization of copyless cost register automata", Computer Science Logic, Berlin (2015). (2015)

Maximal partition logic: towards a logical characterization of copyless cost register automata

Computer Science Logic (CSL 2015)

Bourhis P., Puppis G. and Riveros C. (2015)

Which XML Schemas are Streaming Bounded Repairable?

Theory of Computing Systems 57 4 1250-1321

Benedikt M., Puppis G. and Riveros C. (2014)

The per-character cost of repairing word languages

Theoretical Computer Science 539 38 - 67