| Knowledge Compilation Meets Communication Complexity S Bova, F Capelli, S Mengel, F Slivovsky IJCAI, 1008-1014, 2016 | 53 | 2016 |
| Model counting for CNF formulas of bounded modular treewidth D Paulusma, F Slivovsky, S Szeider Algorithmica 76, 168-194, 2016 | 45 | 2016 |
| Soundness of Q-resolution with dependency schemes F Slivovsky, S Szeider Theoretical Computer Science 612, 83-101, 2016 | 41 | 2016 |
| Dependency learning for QBF T Peitl, F Slivovsky, S Szeider Theory and Applications of Satisfiability Testing–SAT 2017: 20th …, 2017 | 38 | 2017 |
| Long-distance Q-resolution with dependency schemes T Peitl, F Slivovsky, S Szeider Journal of Automated Reasoning 63, 127-155, 2019 | 36 | 2019 |
| Dependency learning for QBF T Peitl, F Slivovsky, S Szeider Journal of Artificial Intelligence Research 65, 181-208, 2019 | 34 | 2019 |
| Model counting for formulas of bounded clique-width F Slivovsky, S Szeider International Symposium on Algorithms and Computation, 677-687, 2013 | 33 | 2013 |
| Engineering an efficient boolean functional synthesis engine P Golia, F Slivovsky, S Roy, KS Meel 2021 IEEE/ACM International Conference On Computer Aided Design (ICCAD), 1-9, 2021 | 27 | 2021 |
| On compiling CNFs into structured deterministic DNNFs S Bova, F Capelli, S Mengel, F Slivovsky Theory and Applications of Satisfiability Testing--SAT 2015: 18th …, 2015 | 25 | 2015 |
| Variable dependencies and Q-resolution F Slivovsky, S Szeider International Conference on Theory and Applications of Satisfiability …, 2014 | 24 | 2014 |
| Computing Resolution-Path Dependencies in Linear Time F Slivovsky, S Szeider SAT 2012, 58-71, 2012 | 23 | 2012 |
| Portfolio-based algorithm selection for circuit qbfs HH Hoos, T Peitl, F Slivovsky, S Szeider Principles and Practice of Constraint Programming: 24th International …, 2018 | 21 | 2018 |
| Interpolation-based semantic gate extraction and its applications to QBF preprocessing F Slivovsky International Conference on Computer Aided Verification, 508-528, 2020 | 19 | 2020 |
| Meta-kernelization with structural parameters R Ganian, F Slivovsky, S Szeider Journal of Computer and System Sciences 82 (2), 333-346, 2016 | 19 | 2016 |
| Expander CNFs have exponential DNNF size S Bova, F Capelli, S Mengel, F Slivovsky CoRR, abs/1411.1995, 2014 | 17 | 2014 |
| Quantifier reordering for QBF F Slivovsky, S Szeider Journal of Automated Reasoning 56, 459-477, 2016 | 16 | 2016 |
| Circuit minimization with QBF-based exact synthesis FX Reichl, F Slivovsky, S Szeider Proceedings of the AAAI Conference on Artificial Intelligence 37 (4), 4087-4094, 2023 | 13 | 2023 |
| Towards uniform certification in QBF L Chew, F Slivovsky Logical Methods in Computer Science 20, 2024 | 12 | 2024 |
| A faster algorithm for propositional model counting parameterized by incidence treewidth F Slivovsky, S Szeider International Conference on Theory and Applications of Satisfiability …, 2020 | 11 | 2020 |
| Polynomial-time validation of QCDCL certificates T Peitl, F Slivovsky, S Szeider International Conference on Theory and Applications of Satisfiability …, 2018 | 9 | 2018 |
Stefan SzeiderProfessor, Head of Algorithms and Complexity Group, TU Wien, Vienna, Austriaยืนยันอีเมลแล้วที่ szeider.net