Henning Schnoor

Publication Activity (10 Years)

Years Active: 2004-2023
Publications (10 Years): 11

Top Topics

Arbitrarily Complex

Efficient Computation

Rank Aggregation

Top Venues

Fundam. Informaticae

Softwaretechnik-Trends

ICSE (Companion Volume)

Publications

Reiner Jung, Henning Schnoor, Sven Gundlach, Wilhelm Hasselbring
Architecture Recovery from Fortran Code with Kieker. Softwaretechnik-Trends 43 (1) (2023)
Martin Claus, Sven Gundlach, Wilhelm Hasselbring, Reiner Jung, Willi Rath, Henning Schnoor
Modularizing Earth system models for interactive simulation. Inform. Spektrum 45 (5) (2022)
Henning Schnoor, Wilhelm Hasselbring
Comparing Static and Dynamic Weighted Software Coupling Metrics. Comput. 9 (2) (2020)
Rudolf Berghammer, Henning Schnoor, Michael Winter
Efficient Computation of the Large Inductive Dimension Using Order- and Graph-theoretic Means. Fundam. Informaticae 177 (2) (2020)
Walisa Romsaiyud, Henning Schnoor, Wilhelm Hasselbring
Improving k-Nearest Neighbor Pattern Recognition Models for Privacy-Preserving Data Analysis. IEEE BigData (2019)
Henning Schnoor, Wilhelm Hasselbring
Comparing Static and Dynamic Weighted Software Coupling Metrics. CoRR (2019)
Henning Schnoor, Wilhelm Hasselbring
Comparing Static and Dynamic Weighted Software Coupling Metrics. ICIST (2019)
Henning Schnoor, Wilhelm Hasselbring
Toward measuring software coupling via weighted dynamic metrics. ICSE (Companion Volume) (2018)
Juha Kontinen, Julian-Steffen Müller, Henning Schnoor, Heribert Vollmer
Modal independence logic. J. Log. Comput. 27 (5) (2017)
Edith Hemaspaandra, Henning Schnoor
Complexity Dichotomies for Unweighted Scoring Rules. CoRR (2016)
Edith Hemaspaandra, Henning Schnoor
Dichotomy for Pure Scoring Rules Under Manipulative Electoral Actions. ECAI (2016)
Henning Schnoor, Oliver Woizekowski
Active Linking Attacks. MFCS (2) (2015)
Rudolf Berghammer, Henning Schnoor
Control of Condorcet voting: Complexity and a Relation-Algebraic approach. Eur. J. Oper. Res. 246 (2) (2015)
Juha Kontinen, Julian-Steffen Müller, Henning Schnoor, Heribert Vollmer
A Van Benthem Theorem for Modal Team Semantics. CSL (2015)
Edith Hemaspaandra, Lane A. Hemaspaandra, Henning Schnoor
A Control Dichotomy for Pure Scoring Rules. CoRR (2014)
Wojciech Jamroga, Matthijs Melissen, Henning Schnoor
On Defendability of Security Properties. SR (2014)
Rudolf Berghammer, Nikita Danilenko, Henning Schnoor
Relation Algebra and RelView Applied to Approval Voting. RAMiCS (2014)
Edith Hemaspaandra, Lane A. Hemaspaandra, Henning Schnoor
A Control Dichotomy for Pure Scoring Rules. AAAI (2014)
Juha Kontinen, Julian-Steffen Müller, Henning Schnoor, Heribert Vollmer
A Van Benthem Theorem for Modal Team Semantics. CoRR (2014)
Juha Kontinen, Julian-Steffen Müller, Henning Schnoor, Heribert Vollmer
Modal Independence Logic. CoRR (2014)
Henning Schnoor
The Relative Succinctness and Expressiveness of Modal Logics Can Be Arbitrarily Complex. CoRR (2014)
Rudolf Berghammer, Henning Schnoor
Control of condorcet voting: complexity and a relation-algebraic approach. AAMAS (2014)
Juha Kontinen, Julian-Steffen Müller, Henning Schnoor, Heribert Vollmer
Modal Independence Logic. Advances in Modal Logic (2014)
Sebastian Eggert, Ron van der Meyden, Henning Schnoor, Thomas Wilke
Complexity and Unwinding for Intransitive Noninterference. CoRR (2013)
Henning Schnoor
Quantified Epistemic and Probabilistic ATL. ICAART (2) (2013)
Sebastian Eggert, Henning Schnoor, Thomas Wilke
Noninterference with Local Policies. MFCS (2013)
Henning Schnoor, Oliver Woizekowski
Active Linkability Attacks. CoRR (2013)
Wojciech Jamroga, Matthijs Melissen, Henning Schnoor
Defendable Security in Interaction Protocols. PRIMA (2013)
Rudolf Berghammer, Henning Schnoor
Relation-algebraic and Tool-supported Control of Condorcet Voting CoRR (2013)
Henning Schnoor
Epistemic and Probabilistic ATL with Quantification and Explicit Strategies. ICAART (Revised Selected Papers) (2013)
Sebastian Eggert, Henning Schnoor, Thomas Wilke
Dynamic Noninterference: Consistent Policies, Characterizations and Verification CoRR (2012)
Henning Schnoor
Deciding Epistemic and Strategic Properties of Cryptographic Protocols. ESORICS (2012)
Henning Schnoor
Deciding Epistemic and Strategic Properties of Cryptographic Protocols. IACR Cryptol. ePrint Arch. 2012 (2012)
Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor
Weighted Manipulation for Four-Candidate Llull Is Easy. ECAI (2012)
Edith Hemaspaandra, Henning Schnoor
A Simplest Undecidable Modal Logic CoRR (2011)
Edith Hemaspaandra, Henning Schnoor
A Universally Defined Undecidable Unimodal Logic. MFCS (2011)
Edith Hemaspaandra, Henning Schnoor
Minimization for Generalized Boolean Formulas CoRR (2011)
Edith Hemaspaandra, Henning Schnoor
Minimization for Generalized Boolean Formulas. IJCAI (2011)
Michael Bauland, Martin Mundhenk, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer
The tractability of model checking for LTL: The good, the bad, and the ugly fragments. ACM Trans. Comput. Log. 12 (2) (2011)
Sebastian Eggert, Ron van der Meyden, Henning Schnoor, Thomas Wilke
The Complexity of Intransitive Noninterference. IEEE Symposium on Security and Privacy (2011)
Henning Schnoor
The Complexity of Model Checking for Boolean Formulas. Int. J. Found. Comput. Sci. 21 (3) (2010)
Henning Schnoor
Strategic planning for probabilistic games with incomplete information. AAMAS (2010)
Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor
Generalized modal satisfiability. J. Comput. Syst. Sci. 76 (7) (2010)
Klaas Ole Kürtz, Henning Schnoor, Thomas Wilke
Computationally secure two-round authenticated message exchange. AsiaCCS (2010)
Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor, Heribert Vollmer
The Complexity of Problems for Quantified Constraints. Theory Comput. Syst. 47 (2) (2010)
Nadia Creignou, Henning Schnoor, Ilka Schnoor
Nonuniform Boolean constraint satisfaction problems with cardinality constraint. ACM Trans. Comput. Log. 11 (4) (2010)
Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor
Manipulation of copeland elections. AAMAS (2010)
Ralf Küsters, Henning Schnoor, Tomasz Truderung
A Formal Definition of Online Abuse-Freeness. SecureComm (2010)
Elmar Böhler, Nadia Creignou, Matthias Galota, Steffen Reith, Henning Schnoor, Heribert Vollmer
Boolean Circuits as a Data Structure for Boolean Functions: Efficient Algorithms and Hard Problems Log. Methods Comput. Sci. 8 (3) (2010)
Klaas Ole Kürtz, Henning Schnoor, Thomas Wilke
A Simulation-Based Treatment of Authenticated Message Exchange. IACR Cryptol. ePrint Arch. 2009 (2009)
Klaas Ole Kürtz, Henning Schnoor, Thomas Wilke
Computationally Secure Two-Round Authenticated Message Exchange. IACR Cryptol. ePrint Arch. 2009 (2009)
Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer
The complexity of satisfiability problems: Refining Schaefer's theorem. J. Comput. Syst. Sci. 75 (4) (2009)
Mihhail Aizatulin, Henning Schnoor, Thomas Wilke
Computationally Sound Analysis of a Probabilistic Contract Signing Protocol. ESORICS (2009)
Michael Bauland, Martin Mundhenk, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer
The Tractability of Model-checking for LTL: The Good, the Bad, and the Ugly Fragments. Electron. Notes Theor. Comput. Sci. 231 (2009)
Klaas Ole Kürtz, Henning Schnoor, Thomas Wilke
A Simulation-Based Treatment of Authenticated Message Exchange. ASIAN (2009)
Michael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer
The Complexity of Generalized Satisfiability for Linear Temporal Logic Log. Methods Comput. Sci. 5 (1) (2009)
Edith Hemaspaandra, Henning Schnoor
On the Complexity of Elementary Modal Logics CoRR (2008)
Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor
Generalized Modal Satisfiability CoRR (2008)
Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor
Copeland voting: ties matter. AAMAS (2) (2008)
Michael Bauland, Martin Mundhenk, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer
The Tractability of Model-Checking for LTL: The Good, the Bad, and the Ugly Fragments CoRR (2008)
Henning Schnoor, Ilka Schnoor
Partial Polymorphisms and Constraint Satisfaction Problems. Complexity of Constraints (2008)
Nadia Creignou, Henning Schnoor, Ilka Schnoor
Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint. CSL (2008)
Michael Bauland, Martin Mundhenk, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer
The Tractability of Model-Checking for LTL: The Good, the Bad, and the Ugly Fragments. Electron. Colloquium Comput. Complex. 15 (028) (2008)
Edith Hemaspaandra, Henning Schnoor
On the Complexity of Elementary Modal Logics. STACS (2008)
Eric Brelsford, Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor
Approximability of Manipulating Elections. AAAI (2008)
Michael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer
The Complexity of Generalized Satisfiability for Linear Temporal Logic. FoSSaCS (2007)
Elmar Böhler, Henning Schnoor
The Complexity of the Descriptiveness of Boolean Circuits over Different Sets of Gates. Theory Comput. Syst. 41 (4) (2007)
Heribert Vollmer, Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor
The Complexity of Problems for Quantified Constraints. Electron. Colloquium Comput. Complex. 14 (023) (2007)
Henning Schnoor, Ilka Schnoor
Enumerating All Solutions for Constraint Satisfaction Problems. STACS (2007)
Michael Bauland, Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor
Generalized Modal Satisfiability. STACS (2006)
Henning Schnoor, Ilka Schnoor
New Algebraic Tools for Constraint Satisfaction. Complexity of Constraints (2006)
Michael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer
The Complexity of Generalized Satisfiability for Linear Temporal Logic. Electron. Colloquium Comput. Complex. 13 (153) (2006)
Henning Schnoor, Ilka Schnoor
Enumerating all Solutions for Constraint Satisfaction Problems. Complexity of Constraints (2006)
Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor, Heribert Vollmer
Quantified Constraints: The Complexity of Decision and Counting for Bounded Alternation Electron. Colloquium Comput. Complex. (024) (2005)
Elmar Böhler, Steffen Reith, Henning Schnoor, Heribert Vollmer
Bases for Boolean co-clones. Inf. Process. Lett. 96 (2) (2005)
Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer
The Complexity of Satisfiability Problems: Refining Schaefer's Theorem. MFCS (2005)
Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer
The Complexity of Satisfiability Problems: Refining Schaefer's Theorem Electron. Colloquium Comput. Complex. (100) (2004)