Henning Schnoor
Henning Schnoor
Researcher of Computer Science, Dept. of Computer Science, Kiel University
Verified email at ti.informatik.uni-kiel.de - Homepage
Title
Cited by
Cited by
Year
Copeland voting: Ties matter
P Faliszewski, E Hemaspaandra, H Schnoor
Proceedings of the 7th international joint conference on Autonomous agents …, 2008
1262008
Approximability of manipulating elections
E Brelsford, P Faliszewski, E Hemaspaandra, H Schnoor, I Schnoor
Proceedings of the 23rd AAAI Conference on Artificial Intelligence, 44-49, 2008
552008
Bases for Boolean co-clones
E Böhler, S Reith, H Schnoor, H Vollmer
Information Processing Letters 96 (2), 59-66, 2005
542005
Simple bases for Boolean co-clones
E Bohler, S Reith, H Schnoor, H Vollmer
Information Processing Letters, 2005
54*2005
The complexity of satisfiability problems: Refining Schaefer's theorem
E Allender, M Bauland, N Immerman, H Schnoor, H Vollmer
Journal of Computer and System Sciences 75 (4), 245-254, 2009
502009
Partial polymorphisms and constraint satisfaction problems
H Schnoor, I Schnoor
Complexity of Constraints, 229-254, 2008
482008
Manipulation of Copeland elections
P Faliszewski, E Hemaspaandra, H Schnoor
Proceedings of the 9th International Conference on Autonomous Agents and …, 2010
452010
The complexity of satisfiability problems: Refining Schaefer’s theorem
E Allender, M Bauland, N Immerman, H Schnoor, H Vollmer
Mathematical Foundations of Computer Science 2005, 71-82, 2005
412005
The complexity of generalized satisfiability for linear temporal logic
M Bauland, T Schneider, H Schnoor, I Schnoor, H Vollmer
Arxiv preprint arXiv:0812.4848, 2008
372008
Modal Independence Logic
J Kontinen, JS Müller, H Schnoor, H Vollmer
arXiv preprint arXiv:1404.0144, 2014
352014
A Van Benthem Theorem for Modal Team Semantics
J Kontinen, JS Müller, H Schnoor, H Vollmer
arXiv preprint arXiv:1410.6648, 2014
342014
Generalized modal satisfiability
E Hemaspaandra, H Schnoor, I Schnoor
Journal of Computer and System Sciences 76 (7), 561-578, 2010
312010
Generalized modal satisfiability
M Bauland, E Hemaspaandra, H Schnoor, I Schnoor
STACS 2006, 500-511, 2006
292006
The tractability of model-checking for LTL: The good, the bad, and the ugly fragments
M Bauland, M Mundhenk, T Schneider, H Schnoor, I Schnoor, H Vollmer
Electronic Notes in Theoretical Computer Science 231, 277-292, 2009
272009
Minimization for generalized Boolean formulas
E Hemaspaandra, H Schnoor
Proceedings of the Twenty-Second international joint conference on …, 2011
262011
A Control Dichotomy for Pure Scoring Rules
E Hemaspaandra, LA Hemaspaandra, H Schnoor
arXiv preprint arXiv:1404.4560, 2014
242014
Enumerating all solutions for constraint satisfaction problems
H Schnoor, I Schnoor
STACS 2007, 694-705, 2007
242007
The tractability of model checking for LTL: The good, the bad, and the ugly fragments
M Bauland, M Mundhenk, T Schneider, H Schnoor, I Schnoor, H Vollmer
ACM Transactions on Computational Logic (TOCL) 12 (2), 13, 2011
212011
On the complexity of elementary modal logics
E Hemaspaandra, H Schnoor
Arxiv preprint arXiv:0802.1884, 2008
212008
The Complexity of Intransitive Noninterference
S Eggert, R van der Meyden, H Schnoor, T Wilke
Security and Privacy (SP), 2011 IEEE Symposium on, 196-211, 2011
192011
The system can't perform the operation now. Try again later.
Articles 1–20