default search action
Luis Alberto Croquevielle
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j4]Liang Liang
, Guang Yang
SWIX: A Memory-efficient Sliding Window Learned Index. Proc. ACM Manag. Data 2(1): 41:1-41:26 (2024) - [c4]Gabriel della Maggiora, Luis Alberto Croquevielle, Nikita Deshpande, Harry Horsley, Thomas Heinis, Artur Yakimovich:
Conditional Variational Diffusion Models. ICLR 2024 - [i6]Luis Alberto Croquevielle, Guang Yang, Liang Liang, Ali Hadian, Thomas Heinis:
Upper Bounds for Complexity of Asymptotically Optimal Learned Indexes. CoRR abs/2405.03851 (2024) - [i5]Roman Sokolovskii, Parv Agarwal, Luis Alberto Croquevielle, Zijian Zhou, Thomas Heinis:
Coding Over Coupon Collector Channels for Combinatorial Motif-Based DNA Storage. CoRR abs/2406.04141 (2024) - [i4]Gabriel della Maggiora, Luis Alberto Croquevielle, Harry Horsley, Thomas Heinis, Artur Yakimovich:
Single Exposure Quantitative Phase Imaging with a Conventional Microscope using Diffusion Models. CoRR abs/2406.04388 (2024) - 2023
- [i3]Gabriel della Maggiora
Conditional Variational Diffusion Models. CoRR abs/2312.02246 (2023) - 2022
- [j3]Marcelo Arenas, Luis Alberto Croquevielle, Rajesh Jayaram, Cristian Riveros:
Counting the Answers to a Query. SIGMOD Rec. 51(3): 6-17 (2022) - 2021
- [j2]Marcelo Arenas, Luis Alberto Croquevielle, Rajesh Jayaram, Cristian Riveros
#NFA Admits an FPRAS: Efficient Enumeration, Counting, and Uniform Generation for Logspace Classes. J. ACM 68(6): 48:1-48:40 (2021) - [c3]Marcelo Arenas, Luis Alberto Croquevielle, Rajesh Jayaram, Cristian Riveros
A polynomial-time approximation algorithm for counting words accepted by an NFA (invited paper). STOC 2021: 4 - [c2]Marcelo Arenas, Luis Alberto Croquevielle, Rajesh Jayaram, Cristian Riveros
When is approximate counting for conjunctive queries tractable? STOC 2021: 1015-1027 - 2020
- [j1]Marcelo Arenas, Luis Alberto Croquevielle, Rajesh Jayaram, Cristian Riveros
Efficient Logspace Classes for Enumeration, Counting, and Uniform Generation. SIGMOD Rec. 49(1): 52-59 (2020) - [i2]Marcelo Arenas, Luis Alberto Croquevielle, Rajesh Jayaram, Cristian Riveros:
An FPRAS and Polynomial-Time Uniform Sampler for Tree Automata. CoRR abs/2005.10029 (2020)
2010 – 2019
- 2019
- [c1]Marcelo Arenas, Luis Alberto Croquevielle, Rajesh Jayaram, Cristian Riveros
Efficient Logspace Classes for Enumeration, Counting, and Uniform Generation. PODS 2019: 59-73 - [i1]Marcelo Arenas, Luis Alberto Croquevielle, Rajesh Jayaram, Cristian Riveros:
Efficient Logspace Classes for Enumeration, Counting, and Uniform Generation. CoRR abs/1906.09226 (2019)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 00:56 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: