Friedrich Slivovsky

Author Info

Name	Affiliation	Papers
FRIEDRICH SLIVOVSKY	Vienna Univ Technol, Inst Informat Syst, A-1040 Vienna, Austria	20
Collaborators	Citations	PageRank
10	62	7.96
Referers	Referees	References
71	211	241

Search Limit

100211

Publications (20 rows)

Collaborators (10 rows)

Referers (71 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Sum-of-Products with Default Values: Algorithms and Complexity Results	0	0.34	2022
Short Q-Resolution Proofs with Homomorphisms.	0	0.34	2020
A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth.	0	0.34	2020
Fixed-Parameter Tractability of Dependency QBF with Structural Parameters.	0	0.34	2020
Combining Resolution-Path Dependencies with Dependency Learning.	0	0.34	2019
Proof Complexity of Fragments of Long-Distance Q-Resolution.	0	0.34	2019
Long-Distance Q-Resolution with Dependency Schemes	0	0.34	2019
Sum-Of-Products With Default Values: Algorithms And Complexity Results	0	0.34	2018
Polynomial-Time Validation of QCDCL Certificates.	0	0.34	2018
Dependency learning for QBF	3	0.39	2017
Quantifier Reordering for QBF.	3	0.41	2016
Knowledge Compilation Meets Communication Complexity.	7	0.53	2016
Soundness of Q-resolution with dependency schemes.	12	0.50	2016
Long Distance Q-Resolution with Dependency Schemes.	3	0.37	2016
On Compiling CNFs into Structured Deterministic DNNFs	5	0.47	2015
Variable Dependencies and Q-Resolution.	9	0.53	2014
Meta-Kernelization with Structural Parameters	0	0.34	2013
Model Counting for CNF Formulas of Bounded Modular Treewidth.	4	0.42	2013
Model Counting for Formulas of Bounded Clique-Width.	6	0.46	2013
Computing resolution-path dependencies in linear time ,	10	0.51	2012