Henning Schnoor

Available identifiers

zbMath Open schnoor.henningMaRDI QIDQ319802

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q4994887	2021-06-22	Paper
Efficient Computation of the Large Inductive Dimension Using Order- and Graph-theoretic Means	2021-05-20	Paper
Dichotomy for Pure Scoring Rules Under Manipulative Electoral Actions	2018-07-12	Paper
https://portal.mardi4nfdi.de/entity/Q4636302	2018-04-23	Paper
Modal independence logic:	2018-02-13	Paper
A Van Benthem Theorem for Modal Team Semantics	2017-08-31	Paper
Control of Condorcet voting: complexity and a relation-algebraic approach	2016-10-06	Paper
https://portal.mardi4nfdi.de/entity/Q3457231	2015-12-11	Paper
Nonuniform Boolean constraint satisfaction problems with cardinality constraint	2015-09-17	Paper
The tractability of model checking for LTL	2015-09-17	Paper
Active Linking Attacks	2015-09-16	Paper
The Tractability of Model-checking for LTL: The Good, the Bad, and the Ugly Fragments	2015-03-23	Paper
Relation Algebra and RelView Applied to Approval Voting	2014-04-16	Paper
Noninterference with Local Policies	2013-09-20	Paper
https://portal.mardi4nfdi.de/entity/Q4910732	2013-03-19	Paper
Complexity classifications for different equivalence and audit problems for Boolean circuits	2012-10-22	Paper
A Universally Defined Undecidable Unimodal Logic	2011-08-17	Paper
The complexity of problems for quantified constraints	2010-10-06	Paper
Generalized modal satisfiability	2010-08-18	Paper
THE COMPLEXITY OF MODEL CHECKING FOR BOOLEAN FORMULAS	2010-06-18	Paper
Bases for Boolean co-clones	2009-12-18	Paper
Computationally Sound Analysis of a Probabilistic Contract Signing Protocol	2009-10-16	Paper
The complexity of satisfiability problems: Refining Schaefer's theorem	2009-04-30	Paper
The Complexity of Generalized Satisfiability for Linear Temporal Logic	2009-04-29	Paper
Partial Polymorphisms and Constraint Satisfaction Problems	2009-01-22	Paper
Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint	2008-11-20	Paper
Generalized Modal Satisfiability	2008-03-19	Paper
The complexity of the descriptiveness of Boolean circuits over different sets of gates	2007-12-19	Paper
The Complexity of Generalized Satisfiability for Linear Temporal Logic	2007-09-07	Paper
Enumerating All Solutions for Constraint Satisfaction Problems	2007-09-03	Paper
Mathematical Foundations of Computer Science 2005	2006-10-20	Paper

Research outcomes over time

This page was built for person: Henning Schnoor