Henning Schnoor

According to our database, Henning Schnoor authored at least 54 papers between 2005 and 2022.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2022

Modularizing Earth system models for interactive simulation.

Martin Claus, Sven Gundlach, Wilhelm Hasselbring, Reiner Jung, Willi Rath, Henning Schnoor

Inform. Spektrum, 2022

2020

Efficient Computation of the Large Inductive Dimension Using Order- and Graph-theoretic Means.

Rudolf Berghammer, Henning Schnoor, Michael Winter

Fundam. Informaticae, 2020

Comparing Static and Dynamic Weighted Software Coupling Metrics.

Henning Schnoor, Wilhelm Hasselbring

Comput., 2020

2019

Improving k-Nearest Neighbor Pattern Recognition Models for Privacy-Preserving Data Analysis.

Walisa Romsaiyud, Henning Schnoor, Wilhelm Hasselbring

Proceedings of the 2019 IEEE International Conference on Big Data (IEEE BigData), 2019

2018

Toward measuring software coupling via weighted dynamic metrics.

Henning Schnoor, Wilhelm Hasselbring

Proceedings of the 40th International Conference on Software Engineering: Companion Proceeedings, 2018

2017

Modal independence logic.

Juha Kontinen, Julian-Steffen Müller, Henning Schnoor, Heribert Vollmer

J. Log. Comput., 2017

2016

Complexity Dichotomies for Unweighted Scoring Rules.

Edith Hemaspaandra, Henning Schnoor

CoRR, 2016

Dichotomy for Pure Scoring Rules Under Manipulative Electoral Actions.

Edith Hemaspaandra, Henning Schnoor

Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

2015

Control of Condorcet voting: Complexity and a Relation-Algebraic approach.

Rudolf Berghammer, Henning Schnoor

Eur. J. Oper. Res., 2015

Active Linking Attacks.

Henning Schnoor, Oliver Woizekowski

Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

A Van Benthem Theorem for Modal Team Semantics.

Juha Kontinen, Julian-Steffen Müller, Henning Schnoor, Heribert Vollmer

Proceedings of the 24th EACSL Annual Conference on Computer Science Logic, 2015

2014

The Relative Succinctness and Expressiveness of Modal Logics Can Be Arbitrarily Complex.

Henning Schnoor

CoRR, 2014

On Defendability of Security Properties.

Wojciech Jamroga, Matthijs Melissen, Henning Schnoor

Proceedings of the Proceedings 2nd International Workshop on Strategic Reasoning, 2014

A Control Dichotomy for Pure Scoring Rules.

Edith Hemaspaandra, Lane A. Hemaspaandra, Henning Schnoor

Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

Relation Algebra and RelView Applied to Approval Voting.

Rudolf Berghammer, Nikita Danilenko, Henning Schnoor

Proceedings of the Relational and Algebraic Methods in Computer Science, 2014

2013

Relation-algebraic and Tool-supported Control of Condorcet Voting

Rudolf Berghammer, Henning Schnoor

CoRR, 2013

Active Linkability Attacks.

Henning Schnoor, Oliver Woizekowski

CoRR, 2013

Complexity and Unwinding for Intransitive Noninterference.

Sebastian Eggert, Ron van der Meyden, Henning Schnoor, Thomas Wilke

CoRR, 2013

Defendable Security in Interaction Protocols.

Wojciech Jamroga, Matthijs Melissen, Henning Schnoor

Proceedings of the PRIMA 2013: Principles and Practice of Multi-Agent Systems, 2013

Noninterference with Local Policies.

Sebastian Eggert, Henning Schnoor, Thomas Wilke

Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

Epistemic and Probabilistic ATL with Quantification and Explicit Strategies.

Henning Schnoor

Proceedings of the Agents and Artificial Intelligence - 5th International Conference, 2013

Quantified Epistemic and Probabilistic ATL.

Henning Schnoor

Proceedings of the ICAART 2013, 2013

2012

Deciding Epistemic and Strategic Properties of Cryptographic Protocols.

Henning Schnoor

IACR Cryptol. ePrint Arch., 2012

Dynamic Noninterference: Consistent Policies, Characterizations and Verification

Sebastian Eggert, Henning Schnoor, Thomas Wilke

CoRR, 2012

Weighted Manipulation for Four-Candidate Llull Is Easy.

Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor

Proceedings of the ECAI 2012, 2012

2011

A Simplest Undecidable Modal Logic

Edith Hemaspaandra, Henning Schnoor

CoRR, 2011

The Complexity of Intransitive Noninterference.

Sebastian Eggert, Ron van der Meyden, Henning Schnoor, Thomas Wilke

Proceedings of the 32nd IEEE Symposium on Security and Privacy, 2011

A Universally Defined Undecidable Unimodal Logic.

Edith Hemaspaandra, Henning Schnoor

Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

Minimization for Generalized Boolean Formulas.

Edith Hemaspaandra, Henning Schnoor

Proceedings of the IJCAI 2011, 2011

2010

Nonuniform Boolean constraint satisfaction problems with cardinality constraint.

Nadia Creignou, Henning Schnoor, Ilka Schnoor

ACM Trans. Comput. Log., 2010

Generalized modal satisfiability.

Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor

J. Comput. Syst. Sci., 2010

The Complexity of Model Checking for Boolean Formulas.

Henning Schnoor

Int. J. Found. Comput. Sci., 2010

Boolean Circuits as a Data Structure for Boolean Functions: Efficient Algorithms and Hard Problems

Elmar Böhler, Nadia Creignou, Matthias Galota, Steffen Reith, Henning Schnoor, Heribert Vollmer

Log. Methods Comput. Sci., 2010

A Formal Definition of Online Abuse-Freeness.

Ralf Küsters, Henning Schnoor, Tomasz Truderung

Proceedings of the Security and Privacy in Communication Networks, 2010

Strategic planning for probabilistic games with incomplete information.

Henning Schnoor

Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2010), 2010

Manipulation of copeland elections.

Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor

Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2010), 2010

2009

The complexity of satisfiability problems: Refining Schaefer's theorem.

Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer

J. Comput. Syst. Sci., 2009

A Simulation-Based Treatment of Authenticated Message Exchange.

Klaas Ole Kürtz, Henning Schnoor, Thomas Wilke

IACR Cryptol. ePrint Arch., 2009

Computationally Secure Two-Round Authenticated Message Exchange.

Klaas Ole Kürtz, Henning Schnoor, Thomas Wilke

IACR Cryptol. ePrint Arch., 2009

Computationally Sound Analysis of a Probabilistic Contract Signing Protocol.

Mihhail Aizatulin, Henning Schnoor, Thomas Wilke

Proceedings of the Computer Security, 2009

2008

On the Complexity of Elementary Modal Logics.

Edith Hemaspaandra, Henning Schnoor

Proceedings of the STACS 2008, 2008

Partial Polymorphisms and Constraint Satisfaction Problems.

Henning Schnoor, Ilka Schnoor

Proceedings of the Complexity of Constraints, 2008

Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint.

Nadia Creignou, Henning Schnoor, Ilka Schnoor

Proceedings of the Computer Science Logic, 22nd International Workshop, 2008

Copeland voting: ties matter.

Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor

Proceedings of the 7th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2008), 2008

Approximability of Manipulating Elections.

Eric Brelsford, Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor

Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

2007

The Complexity of the Descriptiveness of Boolean Circuits over Different Sets of Gates.

Elmar Böhler, Henning Schnoor

Theory Comput. Syst., 2007

The Tractability of Model-checking for LTL: The Good, the Bad, and the Ugly Fragments.

Michael Bauland, Martin Mundhenk, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer

Proceedings of the 5th Workshop on Methods for Modalities, 2007

The Complexity of Problems for Quantified Constraints.

Heribert Vollmer, Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor

Electron. Colloquium Comput. Complex., 2007

2006

The Complexity of Generalized Satisfiability for Linear Temporal Logic.

Michael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer

Electron. Colloquium Comput. Complex., 2006

Generalized Modal Satisfiability.

Michael Bauland, Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor

Proceedings of the STACS 2006, 2006

New Algebraic Tools for Constraint Satisfaction.

Henning Schnoor, Ilka Schnoor

Proceedings of the Complexity of Constraints, 01.10. - 06.10.2006, 2006

Enumerating all Solutions for Constraint Satisfaction Problems.

Henning Schnoor, Ilka Schnoor

Proceedings of the Complexity of Constraints, 01.10. - 06.10.2006, 2006

2005

Bases for Boolean co-clones.

Elmar Böhler, Steffen Reith, Henning Schnoor, Heribert Vollmer

Inf. Process. Lett., 2005

Quantified Constraints: The Complexity of Decision and Counting for Bounded Alternation

Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor, Heribert Vollmer

Electron. Colloquium Comput. Complex., 2005