Marc Roth
Marc Roth
PhD student in Computer Science, Saarland University and Cluster of Excellence (MMCI)
Verified email at mmci.uni-saarland.de - Homepage
TitleCited byYear
Counting Restricted Homomorphisms via Möbius Inversion over Matroid Lattices
M Roth
arXiv preprint arXiv:1706.08414, 2017
82017
Fine-grained dichotomies for the tutte plane and boolean# CSP
C Brand, H Dell, M Roth
Algorithmica, 1-16, 2016
62016
Counting edge-injective homomorphisms and matchings on restricted graph classes
R Curticapean, H Dell, M Roth
Theory of Computing Systems, 1-40, 2017
42017
Counting Answers to Existential Questions
H Dell, M Roth, P Wellnitz
arXiv preprint arXiv:1902.04960, 2019
32019
Counting Induced Subgraphs: A Topological Approach to# W [1]-hardness
M Roth, J Schmitt
arXiv preprint arXiv:1807.01920, 2018
32018
Parameterized counting of trees, forests and matroid bases
C Brand, M Roth
International Computer Science Symposium in Russia, 85-98, 2017
32017
The strong invariance thesis for a λ-calculus
Y Forster, F Kunze, M Roth
Workshop on Syntax and Semantics of Low-Level Languages (LOLA), 2017
32017
The Weak Call-By-Value {\lambda}-Calculus is Reasonable for Both Time and Space
Y Forster, F Kunze, M Roth
arXiv preprint arXiv:1902.07515, 2019
2019
The system can't perform the operation now. Try again later.
Articles 1–8