activity
20092025
most citedProbabilistic Automata of Bounded Ambiguity

16 citations · 48 across the 14 of their papers we have counts for

collaborators
Showing 2020Show all

6 papers · 1 filter

cs.CC2020

Expressive power of linear algebra query languages

Floris Geerts, Thomas Muñoz, Cristian Riveros +1

Linear algebra algorithms often require some sort of iteration or recursion as is illustrated by standard algorithms for Gaussian elimination, matrix inversion, and transitive clos…

cs.FL2020

Ranked enumeration of MSO logic on words

Pierre Bourhis, Alejandro Grez, Louis Jachiet +1

In the last years, enumeration algorithms with bounded delay have attracted a lot of attention for several data management tasks. Given a query and the data, the task is to preproc…

cs.DB2020

Streaming enumeration on nested documents

Martín Muñoz, Cristian Riveros

Some of the most relevant document schemas used online, such as XML and JSON, have a nested format. In the last decade, the task of extracting data from nested documents over strea…

cs.DS2020

When is Approximate Counting for Conjunctive Queries Tractable?

Marcelo Arenas, Luis Alberto Croquevielle, Rajesh Jayaram +1

Conjunctive queries are one of the most common class of queries used in database systems, and the best studied in the literature. A seminal result of Grohe, Schwentick, and Segoufi…

cs.FL2020

The monitoring problem for timed automata

Alejandro Grez, Filip Mazowiecki, Michał Pilipczuk +2

We study a variant of the classical membership problem in automata theory, which consists of deciding whether a given input word is accepted by a given automaton. We do so under a…

cs.LO2020★ 4 cited

Pumping lemmas for weighted automata

Agnishom Chattopadhyay, Filip Mazowiecki, Anca Muscholl +1

We present pumping lemmas for five classes of functions definable by fragments of weighted automata over the min-plus semiring, the max-plus semiring and the semiring of natural nu…