Efficient Logspace Classes for Enumeration, Counting, and Uniform Generation
Summary: Two logspace classes via NL transducers: unambiguous class gives constant‑delay enumeration plus polytime exact counting and uniform generation. Unrestricted class gives poly‑delay enumeration, an FPRAS for counting and polytime Las Vegas uniform generation by proving #NFA (thus all SpanL) admits an FPRAS. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Marcelo Arenas (IMFD Chile; Pontifical Catholic University of Chile)
- 2. Luis Alberto Croquevielle (IMFD Chile; Pontifical Catholic University of Chile)
- 3. Rajesh Jayaram (Carnegie Mellon University)
- 4. Cristian Riveros (IMFD Chile; Pontifical Catholic University of Chile)
BibTeX Citation
@inproceedings{arenas_pods19,
address = {New York, NY, USA},
series = {{PODS} '19},
title = {{Efficient Logspace Classes for Enumeration, Counting, and Uniform Generation}},
url = {https://dl.acm.org/doi/10.1145/3294052.3319704},
doi = {10.1145/3294052.3319704},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Arenas, Marcelo and Croquevielle, Luis Alberto and Jayaram, Rajesh and Riveros, Cristian},
year = {2019}
}
Incoming Citations (Sorted by Pagerank)
Showing 6 of 6 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,453 | Querying in the Age of Graph Databases and Knowledge Graphs | 2021 | SIGMOD | 6.2137771e-05 |
| 8,673 | Fine-Grained Complexity Analysis of Queries: From Decision to Counting and Enumeration | 2020 | PODS | 5.3872753e-05 |
| 8,699 | Counting Problems over Incomplete Databases | 2020 | PODS | 5.3829678e-05 |
| 9,921 | Combined Approximations for Uniform Operational Consistent Query Answering | 2024 | PODS | 5.1955087e-05 |
| 10,655 | Towards Practical FPRAS for #NFA: Exploiting the Power of Dependence | 2025 | PODS | 5.093636e-05 |
| 11,139 | A faster FPRAS for #NFA | 2024 | PODS | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 3 of 3 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,528 | Joining Extractions of Regular Expressions | 2018 | PODS | 0.00010486718 |
| 2,348 | Document Spanners for Extracting Incomplete Information: Expressiveness and Complexity | 2018 | PODS | 8.7135317e-05 |
| 2,619 | Constant Delay Algorithms for Regular Document Spanners | 2018 | PODS | 8.336529e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 12,229 | The Fine Classification of Conjunctive Queries and Parameterized Logarithmic Space Complexity | 2013 | PODS |
| 2 | 10,636 | A Lower Bound on Unambiguous Context Free Grammars via Communication Complexity | 2025 | PODS |
| 3 | 5,041 | Enumeration of First-Order Queries on Classes of Structures With Bounded Expansion | 2013 | PODS |
| 4 | 9,921 | Combined Approximations for Uniform Operational Consistent Query Answering | 2024 | PODS |
| 5 | 2,777 | Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration | 2020 | PODS |
| 6 | 2,619 | Constant Delay Algorithms for Regular Document Spanners | 2018 | PODS |
| 7 | 8,924 | Efficient Enumeration for Annotated Grammars | 2022 | PODS |
| 8 | 10,655 | Towards Practical FPRAS for #NFA: Exploiting the Power of Dependence | 2025 | PODS |
| 9 | 11,139 | A faster FPRAS for #NFA | 2024 | PODS |
| 10 | 5,579 | Enumeration on Trees with Tractable Combined Complexity and Efficient Updates | 2019 | PODS |