Cristian Riveros

Stijn Vansummeren

Proceedings of the 27th International Conference on Database Theory, 2024

2023

REmatch: a novel regex engine for finding all matches.

[BibT_eX]

[DOI]

Nicolás Van Sint Jan

Domagoj Vrgoc

Proc. VLDB Endow., 2023

MillenniumDB: An Open-Source Graph Database System.

[BibT_eX]

[DOI]

Data Intell., 2023

How Do Centrality Measures Choose the Root of Trees?

[BibT_eX]

[DOI]

Jorge Salas

Oskar Skibski

Proceedings of the 26th International Conference on Database Theory, 2023

Constant-Delay Enumeration for SLP-Compressed Documents.

[BibT_eX]

[DOI]

Proceedings of the 26th International Conference on Database Theory, 2023

2022

Counting the Answers to a Query.

[BibT_eX]

[DOI]

SIGMOD Rec., 2022

CORE: a COmplex event Recognition Engine.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2022

Probabilistic automata of bounded ambiguity.

[BibT_eX]

[DOI]

Nathanaël Fijalkow

James Worrell

Inf. Comput., 2022

Efficient enumeration algorithms for annotated grammars.

[BibT_eX]

[DOI]

CoRR, 2022

Dynamic Data Structures for Timed Automata Acceptance.

[BibT_eX]

[DOI]

Algorithmica, 2022

Efficient Enumeration for Annotated Grammars.

[BibT_eX]

[DOI]

Proceedings of the PODS '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

Streaming Enumeration on Nested Documents.

[BibT_eX]

[DOI]

Proceedings of the 25th International Conference on Database Theory, 2022

2021

A Formal Framework for Complex Event Recognition.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., 2021

Matrix Query Languages.

[BibT_eX]

[DOI]

SIGMOD Rec., 2021

Pumping lemmas for weighted automata.

[BibT_eX]

[DOI]

Agnishom Chattopadhyay

Anca Muscholl

Log. Methods Comput. Sci., 2021

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

[BibT_eX]

[DOI]

J. ACM, 2021

How to choose the root: centrality measures over tree structures.

[BibT_eX]

[DOI]

Jorge Salas

Oskar Skibski

CoRR, 2021

MillenniumDB: A Persistent, Open-Source, Graph Database.

[BibT_eX]

[DOI]

CoRR, 2021

When is approximate counting for conjunctive queries tractable?

[BibT_eX]

[DOI]

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

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

[BibT_eX]

[DOI]

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Expressive Power of Linear Algebra Query Languages.

[BibT_eX]

[DOI]

Proceedings of the PODS'21: Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2021

Ranked Enumeration of MSO Logic on Words.

[BibT_eX]

[DOI]

Proceedings of the 24th International Conference on Database Theory, 2021

2020

Efficient Enumeration Algorithms for Regular Document Spanners.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., 2020

Efficient Logspace Classes for Enumeration, Counting, and Uniform Generation.

[BibT_eX]

[DOI]

SIGMOD Rec., 2020

Descriptive Complexity for Counting Complexity Classes.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2020

Constant-delay enumeration algorithms for document spanners over nested documents.

[BibT_eX]

[DOI]

CoRR, 2020

An FPRAS and Polynomial-Time Uniform Sampler for Tree Automata.

[BibT_eX]

[DOI]

CoRR, 2020

The monitoring problem for timed automata.

[BibT_eX]

[DOI]

CoRR, 2020

A Family of Centrality Measures for Graph Data Based on Subgraphs.

[BibT_eX]

[DOI]

Jorge Salas

Proceedings of the 23rd International Conference on Database Theory, 2020

On the Expressiveness of Languages for Complex Event Recognition.

[BibT_eX]

[DOI]

Proceedings of the 23rd International Conference on Database Theory, 2020

Towards Streaming Evaluation of Queries with Correlation in Complex Event Processing.

[BibT_eX]

[DOI]

Alejandro Grez

Proceedings of the 23rd International Conference on Database Theory, 2020

2019

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

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2019

A Worst-Case Optimal Join Algorithm for SPARQL.

[BibT_eX]

[DOI]

Proceedings of the Semantic Web - ISWC 2019, 2019

A Formal Framework for Complex Event Processing.

[BibT_eX]

[DOI]

Alejandro Grez

Martín Ugarte

Proceedings of the 22nd International Conference on Database Theory, 2019

2018

Pumping Lemmas for Weighted Automata.

[BibT_eX]

[DOI]

Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

Document Spanners for Extracting Incomplete Information: Expressiveness and Complexity.

[BibT_eX]

[DOI]

Francisco Maturana

Domagoj Vrgoc

Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2018

Constant Delay Algorithms for Regular Document Spanners.

[BibT_eX]

[DOI]

Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2018

2017

A Second-Order Approach to Complex Event Recognition.

[BibT_eX]

[DOI]

CoRR, 2017

Foundations of Complex Event Processing.

[BibT_eX]

[DOI]

Alejandro Grez

Martín Ugarte

CoRR, 2017

2016

Bounded Repairability for Regular Tree Languages.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., 2016

A framework for annotating CSV-like data.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2016

Querying Wikidata: Comparing SPARQL, Relational and Graph Databases.

[BibT_eX]

[DOI]

Proceedings of the Semantic Web - ISWC 2016, 2016

2015

Which XML Schemas are Streaming Bounded Repairable?

[BibT_eX]

[DOI]

Pierre Bourhis

Theory Comput. Syst., 2015

On the expressibility of copyless cost register automata.

[BibT_eX]

[DOI]

CoRR, 2015

Maximal Partition Logic: Towards a Logical Characterization of Copyless Cost Register Automata.

[BibT_eX]

[DOI]

Proceedings of the 24th EACSL Annual Conference on Computer Science Logic, 2015

2014

The per-character cost of repairing word languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

2013

Bounded repairability of word languages.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2013

The language of plain SO-tgds: Composition, inversion and structural properties.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2013

Quantitative Monadic Second-Order Logic.

[BibT_eX]

[DOI]

Stephan Kreutzer

Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

Which DTDs are streaming bounded repairable?

[BibT_eX]

[DOI]

Pierre Bourhis

Proceedings of the Joint 2013 EDBT/ICDT Conferences, 2013

2012

Query language-based inverses of schema mappings: semantics, computation, and closure properties.

[BibT_eX]

[DOI]

VLDB J., 2012

Bounded repairability for regular tree languages.

[BibT_eX]

[DOI]

Slawek Staworko

Proceedings of the 15th International Conference on Database Theory, 2012

2011

Regular Repair of Specifications.

[BibT_eX]

[DOI]

Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, 2011

The Cost of Traveling between Languages.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

2010

Foundations of schema mapping management.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2010

2009

The recovery of a schema mapping: Bringing exchanged data back.

[BibT_eX]

[DOI]

Jorge Pérez