| 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 | 32 | 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 | 27 | 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 | 17 | 2021 |
| Coding over coupon collector channels for combinatorial motif-based DNA storage R Sokolovskii, P Agarwal, LA Croquevielle, Z Zhou, T Heinis IEEE Transactions on Communications, 2024 | 7 | 2024 |
| Conditional variational diffusion models G Della Maggiora, LA Croquevielle, N Deshpande, H Horsley, T Heinis, ... The Twelfth International Conference on Learning Representations, 2023 | 4 | 2023 |
| Counting the Answers to a Query M Arenas, LA Croquevielle, R Jayaram, C Riveros ACM SIGMOD Record 51 (3), 6-17, 2022 | 3 | 2022 |
| Single exposure quantitative phase imaging with a conventional microscope using diffusion models G della Maggiora, LA Croquevielle, H Horsley, T Heinis, A Yakimovich arXiv preprint arXiv:2406.04388, 2024 | 2 | 2024 |
| 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 | 2 | 2024 |
| Querying in Constant Expected Time with Learned Indexes L Croquevielle, G Yang, L Liang, A Hadian, T Heinis arXiv preprint arXiv:2405.03851, 2024 | 1 | 2024 |
| Beyond Logarithmic Bounds: Querying in Constant Expected Time with Learned Indexes LA Croquevielle, G Yang, L Liang, A Hadian, T Heinis 28th International Conference on Database Theory (ICDT 2025), 19: 1-19: 21, 2025 | | 2025 |
| Upper Bounds for Complexity of Asymptotically Optimal Learned Indexes L Croquevielle, G Yang, L Lian, A Hadian, T Heinis arXiv e-prints, arXiv: 2405.03851, 2024 | | 2024 |
| 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 ResearchVerified email at google.com
