Cristián Riveros
email cristian.riveros@uc.cl
Keywords from publications:
Graph Databases Knowledge Graphs Worst-case Optimal Joins Domain Graphs Query Evaluation Enumeration Algorithms Ver más...Profile
I am an Associate Professor at the Department of Computer Science, PUC Chile. I received a D.Phil from the University of Oxford in 2013. I was previously studying at Pontificia Universidad Católica de Chile as an undergraduate student where I received a B.A. in Mathematics in 2006, a Professional Degree in Computer Engineering in 2008 and an M.Sc in 2008.
My research interests are mostly in databases, specifically, in data streams management systems, information extraction, and graph data management. Also, I do research in automata theory, logics and computational complexity.
Network
Keywords from publications
| Title | Year | Doi |
|---|---|---|
| MillenniumDB: An Open-Source Graph Database System | 2023 | https://doi.org/10.1162/dint_a_00229 |
| REmatch: a novel regex engine for finding all matches | 2023 | https://doi.org/10.14778/3611479.3611488 |
| Constant-delay enumeration for SLP-compressed documents | 2023 | https://doi.org/arXiv:2209.12301 |
| Pumping lemmas for weighted automata | 2021 | https://doi.org/arXiv:2001.06272 |
| Dynamic Data Structures for Timed Automata Acceptance | 2022 | https://doi.org/10.1007/s00453-022-01025-8 |
| Counting the Answers to a Query | 2022 | |
| Probabilistic automata of bounded ambiguity | 2022 | https://doi.org/10.1016/j.ic.2020.104648 |
| Efficient Enumeration for Annotated Grammars | 2022 | https://doi.org/10.1145/3517804.3526232 |
| A Formal Framework for Complex Event Recognition | 2021 | https://doi.org/10.1145/3485463 |
| PUMPING LEMMAS FOR WEIGHTED AUTOMATA | 2021 | https://doi.org/10.46298/LMCS-17(3:7)2021 |
| Expressive Power of Linear Algebra Query Languages | 2021 | https://doi.org/10.1145/3452021.3458314 |
| When Is Approximate Counting for Conjunctive Queries Tractable? | 2021 | https://doi.org/10.1145/3406325.3451014 |
| A Polynomial-Time Approximation Algorithm for Counting Words Accepted by an NFA (Invited Paper) | 2021 | https://doi.org/10.1145/3406325.3465353 |
| CORE: a Complex Event Recognition Engine | 2022 | https://doi.org/10.14778/3538598.3538615 |
| #NFA Admits an FPRAS: Efficient Enumeration, Counting, and Uniform Generation for Logspace Classes | 2021 | https://doi.org/10.1145/3477045 |
| Matrix Query Languages | 2021 | |
| Efficient Enumeration Algorithms for Regular Document Spanners | 2020 | https://doi.org/10.1145/3351451 |
| DESCRIPTIVE COMPLEXITY FOR COUNTING COMPLEXITY CLASSES | 2020 | https://doi.org/10.23638/LMCS-16(1:9)2020 |
| A Worst-Case Optimal Join Algorithm for SPARQL | 2019 | https://doi.org/10.1007/978-3-030-30793-6_15 |
| Efficient Logspace Classes for Enumeration, Counting, and Uniform Generation | 2019 | https://doi.org/10.1145/3294052.3319704 |
| Copyless cost-register automata: Structure, expressiveness, and closure properties | 2019 | https://doi.org/10.1016/j.jcss.2018.07.002 |
| Enumeration and updates for conjunctive linear algebra queries through expressibility | 2023 | https://doi.org/arXiv:2310.04118 |
| Demonstrating REmatch: A Novel RegEx Engine for Finding all Matches | 2024 | https://doi.org/10.1145/3626246.3654746 |
| Towards Tractability of the Diversity of Query Answers: Ultrametrics to the Rescue | 2024 | https://doi.org/arXiv:2408.01657 |
| Complex event recognition meets hierarchical conjunctive queries | 2024 | https://doi.org/arXiv:2408.01652 |
| Efficient Enumeration Algorithms for Annotated Grammars | 2022 | https://doi.org/arXiv:2201.00549 |
| Streaming Enumeration on Nested Documents | 2024 | https://doi.org/10.1145/3701557 |
School Co-Authors
* Authors who are no longer vigent are not clickable.
External Co-Authors
-
Domagoj Vrgoc2 publications
-
Martin Munoz1 publication
-
Carlos Rojas1 publication
-
Gonzalo Navarro1 publication
-
Renzo Angles1 publication
-
Juan Romero1 publication
-
Carlos Buil-Aranda1 publication
-
Nicolas Van Sint Jan1 publication
-
Aidan Hogan1 publication