Author of the publication

On the Hardness of Counting the Solutions of SPARQL Queries.

, and . AMW, volume 1189 of CEUR Workshop Proceedings, CEUR-WS.org, (2014)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

The Complexity of XPath Query Evaluation and XML Typing, , , and . Journal of the ACM, 52 (2): 284-335 (March 2005)Algorithmic Aspects of Model Representations.. WLP, volume 1843-06-02 of INFSYS Research Report, page 12-20. Technische Universität Wien, Austria, (2006)Algorithmic Aspects of Herbrand Models Represented by Ground Atoms with Ground Equations., and . CADE, volume 2392 of Lecture Notes in Computer Science, page 241-259. Springer, (2002)On the Complexity of Hard Enumeration Problems, , , , and . (2016)cite arxiv:1610.05493.The complexity of evaluating tuple generating dependencies., and . ICDT, page 244-255. ACM, (2011)Efficient Evaluation and Approximation of Well-designed Pattern Trees., , and . PODS, page 131-144. ACM, (2015)Complexity of Counting the Optimal Solutions., and . COCOON, volume 5092 of Lecture Notes in Computer Science, page 149-159. Springer, (2008)Loop Elimination for Database Updates., , and . BNCOD, volume 7968 of Lecture Notes in Computer Science, page 48-61. Springer, (2013)Algorithms on Atomic Representations of Herbrand Models.. JELIA, volume 1489 of Lecture Notes in Computer Science, page 199-215. Springer, (1998)Exploiting Bounded Treewidth with Datalog (A Survey).. Datalog, volume 6702 of Lecture Notes in Computer Science, page 88-105. Springer, (2010)