Friedrich Slivovsky

According to our database1, Friedrich Slivovsky
  • authored at least 20 papers between 2012 and 2017.
  • has a "Dijkstra number"2 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
On Compiling Structured CNFs to OBDDs.
Theory Comput. Syst., 2017

Dependency Learning for QBF.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28, 2017

2016
Soundness of Q-resolution with dependency schemes.
Theor. Comput. Sci., 2016

Meta-kernelization with structural parameters.
J. Comput. Syst. Sci., 2016

Quantifier Reordering for QBF.
J. Autom. Reasoning, 2016

Model Counting for CNF Formulas of Bounded Modular Treewidth.
Algorithmica, 2016

Long Distance Q-Resolution with Dependency Schemes.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2016, 2016

Knowledge Compilation Meets Communication Complexity.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

2015
On Compiling CNFs into Structured Deterministic DNNFs.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2015, 2015

On Compiling Structured CNFs to OBDDs.
Proceedings of the Computer Science - Theory and Applications, 2015

2014
Model Counting for Formulas of Bounded Clique-Width.
CoRR, 2014

On Compiling Structured CNFs to OBDDs.
CoRR, 2014

Expander CNFs have Exponential DNNF Size.
CoRR, 2014

Variable Dependencies and Q-Resolution.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2014, 2014

2013
Meta-Kernelization with Structural Parameters
CoRR, 2013

Model Counting for CNF Formulas of Bounded Modular Treewidth.
Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

Meta-kernelization with Structural Parameters.
Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

Model Counting for Formulas of Bounded Clique-Width.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

2012
Computing Resolution-Path Dependencies in Linear Time
CoRR, 2012

Computing Resolution-Path Dependencies in Linear Time , .
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2012, 2012


  Loading...