All Stories

  1. The ACM PODS Alberto O. Mendelzon Test-of-Time Award 2023
  2. #NFA Admits an FPRAS: Efficient Enumeration, Counting, and Uniform Generation for Logspace Classes
  3. The Complexity of Counting Problems Over Incomplete Databases
  4. A polynomial-time approximation algorithm for counting words accepted by an NFA (invited paper)
  5. When is approximate counting for conjunctive queries tractable?
  6. Efficient Logspace Classes for Enumeration, Counting, and Uniform Generation
  7. Counting Problems over Incomplete Databases
  8. Efficient Logspace Classes for Enumeration, Counting, and Uniform Generation
  9. Expressive Languages for Querying the Semantic Web
  10. G-CORE
  11. A survey of modern languages for querying graphs databases
  12. The Exact Complexity of the First-Order Logic Definability Problem
  13. 2016 ACM PODS Alberto O. Mendelzon Test-of-Time Award
  14. Designing a Query Language for RDF
  15. Reverse Engineering SPARQL Queries
  16. Expressive languages for querying the semantic web
  17. Towards semantic faceted search
  18. SemFacet
  19. Data exchange beyond complete data
  20. On directly mapping relational databases to RDF and OWL
  21. Counting beyond a Yottabyte, or how SPARQL 1.1 property paths will prevent adoption of the standard
  22. Data exchange beyond complete data
  23. Querying semantic web data with SPARQL