|
| | Preview | Authors / Editors | Title | Type | Issue Date |
| 1 | | Csar, Theresa ; Lackner, Martin ; Pichler, Reinhard ; Sallinger, Emanuel | Winner Determination in Huge Elections with MapReduce. AAAI 2017: 451-458 | Konferenzbeitrag Inproceedings | 2017 |
| 2 | | Csar, Theresa ; Lackner, Martin ; Pichler, Reinhard ; Sallinger, Emanuel ; Endres, Markus ; Mattei, Nicholas ; Pfandler, Andreas | Winner Determination in Huge Elections with MapReduce | Konferenzbeitrag Inproceedings  | 2016 |
| 3 | | Fichte, Johannes ; Hecher, Markus ; Woltran, Stefan ; Zisser, Markus | Weighted Model Counting on the GPU by Exploiting Small Treewidth | Konferenzbeitrag Inproceedings | 2018 |
| 4 | | Woltran, Stefan ; Goncalves, Ricardo ; Janhunen, Tomi ; Knorr, Matthias ; Leite, Joao | Variable Elimination for DLP-Functions | Konferenzbeitrag Inproceedings | 2018 |
| 5 | | Csar, Theresa ; Pichler, Reinhard ; Sallinger, Emanuel ; Savenkov, Vadim ; Cali, Andrea ; Vidal, Maria-Esther | Using Statistics for Computing Joins with MapReduce | Konferenzbeitrag Inproceedings | 2015 |
| 6 | | Bichler, Manuel ; Bliem, Bernhard ; Moldovan, Marius ; Morak, Michael ; Woltran, Stefan | Treewidth-Preserving Modeling in ASP | Bericht Report | 2016 |
| 7 | | Hecher, Markus | Treewidth-Aware Reductions of normal ASP to SAT - Is normal ASP harder than SAT after all? | Präsentation Presentation | 2020 |
| 8 | | Hecher, Markus | Treewidth-aware Reductions of Normal ASP to SAT - Is Normal ASP Harder than SAT after All? | Konferenzbeitrag Inproceedings | 2020 |
| 9 | | Fichte, Johannes K. ; Hecher, Markus ; Kieler, Maximilian F. I. | Treewidth-Aware Quantifier Elimination and Expansion for QCSP | Konferenzbeitrag Inproceedings | 2020 |
| 10 | | Eiter, Thomas ; Hecher, Markus ; Kiesel, Rafael | Treewidth-Aware Cycle Breaking for Algebraic Answer Set Counting | Konferenzbeitrag Inproceedings | 2021 |
| 11 | | Eiter, Thomas ; Hecher, Markus ; Kiesel, Rafael | Treewidth-Aware Cycle Breaking for Algebraic Answer Set Counting | Konferenzbeitrag Inproceedings | 2021 |
| 12 | | Fandinno, Jorge ; Hecher, Markus | Treewidth-Aware Complexity in {ASP:} Not all Positive Cycles are Equally Hard | Konferenzbeitrag Inproceedings | 2021 |
| 13 | | Fandinno, Jorge ; Hecher, Markus | Treewidth-Aware Complexity in ASP:Not all Positive Cycles are Equally Hard | Konferenzbeitrag Inproceedings | 2020 |
| 14 | | Fichte, Johannes ; Hecher, Markus ; Balduccini, Marcello ; Lierler, Yuliya ; Woltran, Stefan | Treewidth and Counting Projected Answer Sets | Konferenzbeitrag Inproceedings | 2019 |
| 15 | | Moldovan, Marius ; Bliem, Bernhard ; Morak, Michael ; Woltran, Stefan ; Bliem, Bernhard | The Impact of Treewidth on {ASP} Grounding and Solving | Konferenzbeitrag Inproceedings | 2017 |
| 16 | | Bliem, Bernhard ; Morak, Michael ; Moldovan, Marius ; Woltran, Stefan | The Impact of Treewidth on Grounding and Solving of Answer Set Programs | Artikel Article | 2020 |
| 17 | | Bliem, Bernhard ; Moldovan, Marius ; Morak, Michael ; Woltran, Stefan | The Impact of Treewidth on ASP Grounding and Solving | Konferenzbeitrag Inproceedings | 2017 |
| 18 | | Gottlob, Georg ; Pieris, Andreas ; Šimkus, Mantas ; Ortiz de la Fuente, M.Magdalena ; Schlobach, Stefan | The Impact of Active Domain Predicates on Guarded Existential Rules | Konferenzbeitrag Inproceedings | 2016 |
| 19 | | Abseher, Michael ; Bliem, Bernhard ; Charwat, Günther ; Dusberger, Frederico ; Hecher, Markus ; Woltran, Stefan ; Fermé, Eduardo ; Leite, Joao | The D-FLAT System for Dynamic Programming on Tree Decompositions | Konferenzbeitrag Inproceedings | 2014 |
| 20 | | Hecher, Markus ; Thier, Patrick ; Woltran, Stefan | Taming High Treewidth with Abstraction, Nested Dynamic Programming, and Database Technology | Präsentation Presentation | 2020 |
