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
Incoming Citations (Sorted by Pagerank)
Showing 6 of 6 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,420 | Querying in the Age of Graph Databases and Knowledge Graphs | 2021 | SIGMOD | 6.2956901e-05 |
| 8,350 | Counting Problems over Incomplete Databases | 2020 | PODS | 5.5024415e-05 |
| 8,555 | Fine-Grained Complexity Analysis of Queries: From Decision to Counting and Enumeration | 2020 | PODS | 5.4726085e-05 |
| 9,735 | Combined Approximations for Uniform Operational Consistent Query Answering | 2024 | PODS | 5.2802856e-05 |
| 10,374 | Towards Practical FPRAS for #NFA: Exploiting the Power of Dependence | 2025 | PODS | 5.1725247e-05 |
| 10,922 | A faster FPRAS for #NFA | 2024 | PODS | 5.1725247e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 0 of 0 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next