Author Info
Name
Affiliation
Papers
MARC THURLEY
Institut für Informatik, Humboldt-Universität zu Berlin
10
Collaborators
Citations 
PageRank 
74
99
6.02
Referers 
Referees 
References 
206
200
125
Search Limit
100206
Title
Citations
PageRank
Year
Non-deterministic policies in Markovian decision processes60.622014
Descriptive complexity of approximate counting CSPs.00.342013
An Approximation Algorithm for #k-SAT50.452012
Computing hypergraph width measures exactly30.442012
Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs301.072012
Counting Homomorphisms and Partition Functions30.412011
The Complexity of Partition Functions on Hermitian Matrices30.492010
Understanding the Complexity of Induced Subgraph Isomorphisms180.802008
Kernelizations for parameterized counting problems20.382007
sharpSAT: counting models with advanced component caching and implicit BCP291.022006