Efficient logspace classes for enumeration, counting, and uniform generation M Arenas, LA Croquevielle, R Jayaram, C Riveros Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2019 | 27 | 2019 |

When is approximate counting for conjunctive queries tractable? M Arenas, LA Croquevielle, R Jayaram, C Riveros Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021 | 8 | 2021 |

# NFA Admits an FPRAS: Efficient Enumeration, Counting, and Uniform Generation for Logspace Classes M Arenas, LA Croquevielle, R Jayaram, C Riveros Journal of the ACM (JACM) 68 (6), 1-40, 2021 | 1 | 2021 |

A polynomial-time approximation algorithm for counting words accepted by an NFA M Arenas, LA Croquevielle, R Jayaram, C Riveros Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, 4-4, 2021 | | 2021 |

An FPRAS and Polynomial-Time Uniform Sampler for Tree Automata. M Arenas, LA Croquevielle, R Jayaram, C Riveros CoRR, 2020 | | 2020 |

$\text {# NFA} $ admits an FPRAS: Efficient Enumeration, Counting, and Uniform Generation for Logspace Classes M Arenas, LA Croquevielle, R Jayaram, C Riveros arXiv preprint arXiv:1906.09226, 2019 | | 2019 |