| 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 | 30 | 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 | 19 | 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 | 11 | 2021 |
| Counting the answers to a query M Arenas, LA Croquevielle, R Jayaram, C Riveros ACM SIGMOD Record 51 (3), 6-17, 2022 | 2 | 2022 |
| SWIX: A Memory-efficient Sliding Window Learned Index L Liang, G Yang, A Hadian, LA Croquevielle, T Heinis Proceedings of the ACM on Management of Data 2 (1), 1-26, 2024 | | 2024 |
| Conditional Variational Diffusion Models G Della Maggiora, LA Croquevielle, N Deshpande, H Horsley, T Heinis, ... The Twelfth International Conference on Learning Representations, 2023 | | 2023 |
| 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 |
Rajesh JayaramGoogle ResearchDirección de correo verificada de google.com
