Henning Schnoor

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