Henning Schnoor

Rudolf Berghammer, Henning Schnoor: Relation-algebraic and Tool-supported Control of Condorcet Voting. CoRR abs/1304.7244 (2013)

Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor: Weighted Manipulation for Four-Candidate Llull Is Easy. ECAI 2012: 318-323

Henning Schnoor: Deciding Epistemic and Strategic Properties of Cryptographic Protocols. ESORICS 2012: 91-108

Sebastian Eggert, Henning Schnoor, Thomas Wilke: Dynamic Noninterference: Consistent Policies, Characterizations and Verification. CoRR abs/1208.5580 (2012)

Henning Schnoor: Deciding Epistemic and Strategic Properties of Cryptographic Protocols. IACR Cryptology ePrint Archive 2012: 340 (2012)

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): 13 (2011)

Edith Hemaspaandra, Henning Schnoor: Minimization for Generalized Boolean Formulas. IJCAI 2011: 566-571

Edith Hemaspaandra, Henning Schnoor: A Universally Defined Undecidable Unimodal Logic. MFCS 2011: 364-375

Sebastian Eggert, Ron van der Meyden, Henning Schnoor, Thomas Wilke: The Complexity of Intransitive Noninterference. IEEE Symposium on Security and Privacy 2011: 196-211

Edith Hemaspaandra, Henning Schnoor: Minimization for Generalized Boolean Formulas. CoRR abs/1104.2312 (2011)

Edith Hemaspaandra, Henning Schnoor: A Simplest Undecidable Modal Logic. CoRR abs/1105.0845 (2011)

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. Logical Methods in Computer Science 8(3) (2010)

Henning Schnoor: The Complexity of Model Checking for Boolean Formulas. Int. J. Found. Comput. Sci. 21(3): 289-309 (2010)

Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor: Generalized modal satisfiability. J. Comput. Syst. Sci. 76(7): 561-578 (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): 454-490 (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: 367-374

Henning Schnoor: Strategic planning for probabilistic games with incomplete information. AAMAS 2010: 1057-1064

Klaas Ole Kürtz, Henning Schnoor, Thomas Wilke: Computationally secure two-round authenticated message exchange. ASIACCS 2010: 214-225

Ralf Küsters, Henning Schnoor, Tomasz Truderung: A Formal Definition of Online Abuse-Freeness. SecureComm 2010: 484-497

Michael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer: The Complexity of Generalized Satisfiability for Linear Temporal Logic. Logical Methods in Computer Science 5(1) (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. Electr. Notes Theor. Comput. Sci. 231: 277-292 (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): 245-254 (2009)

Klaas Ole Kürtz, Henning Schnoor, Thomas Wilke: A Simulation-Based Treatment of Authenticated Message Exchange. ASIAN 2009: 109-123

Mihhail Aizatulin, Henning Schnoor, Thomas Wilke: Computationally Sound Analysis of a Probabilistic Contract Signing Protocol. ESORICS 2009: 571-586

Klaas Ole Kürtz, Henning Schnoor, Thomas Wilke: Computationally Secure Two-Round Authenticated Message Exchange. IACR Cryptology ePrint Archive 2009: 262 (2009)

Klaas Ole Kürtz, Henning Schnoor, Thomas Wilke: A Simulation-Based Treatment of Authenticated Message Exchange. IACR Cryptology ePrint Archive 2009: 368 (2009)

Eric Brelsford, Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor: Approximability of Manipulating Elections. AAAI 2008: 44-49

Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor: Copeland voting: ties matter. AAMAS (2) 2008: 983-990

Nadia Creignou, Henning Schnoor, Ilka Schnoor: Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint. CSL 2008: 109-123

Henning Schnoor, Ilka Schnoor: Partial Polymorphisms and Constraint Satisfaction Problems. Complexity of Constraints 2008: 229-254

Edith Hemaspaandra, Henning Schnoor: On the Complexity of Elementary Modal Logics. STACS 2008: 349-360

Edith Hemaspaandra, Henning Schnoor: On the Complexity of Elementary Modal Logics. CoRR abs/0802.1884 (2008)

Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor: Generalized Modal Satisfiability. CoRR abs/0804.2729 (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 abs/0805.0498 (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. Electronic Colloquium on Computational Complexity (ECCC) 15(028) (2008)

Elmar Böhler, Henning Schnoor: The Complexity of the Descriptiveness of Boolean Circuits over Different Sets of Gates. Theory Comput. Syst. 41(4): 753-777 (2007)

Michael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer: The Complexity of Generalized Satisfiability for Linear Temporal Logic. FoSSaCS 2007: 48-62

Henning Schnoor, Ilka Schnoor: Enumerating All Solutions for Constraint Satisfaction Problems. STACS 2007: 694-705

Heribert Vollmer, Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor: The Complexity of Problems for Quantified Constraints. Electronic Colloquium on Computational Complexity (ECCC) 14(023) (2007)

Henning Schnoor, Ilka Schnoor: Enumerating all Solutions for Constraint Satisfaction Problems. Complexity of Constraints 2006

Henning Schnoor, Ilka Schnoor: New Algebraic Tools for Constraint Satisfaction. Complexity of Constraints 2006

Michael Bauland, Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor: Generalized Modal Satisfiability. STACS 2006: 500-511

Michael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer: The Complexity of Generalized Satisfiability for Linear Temporal Logic. Electronic Colloquium on Computational Complexity (ECCC) 13(153) (2006)

Elmar Böhler, Steffen Reith, Henning Schnoor, Heribert Vollmer: Bases for Boolean co-clones. Inf. Process. Lett. 96(2): 59-66 (2005)

Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer: The Complexity of Satisfiability Problems: Refining Schaefer's Theorem. MFCS 2005: 71-82

Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor, Heribert Vollmer: Quantified Constraints: The Complexity of Decision and Counting for Bounded Alternation. Electronic Colloquium on Computational Complexity (ECCC)(024) (2005)

Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer: The Complexity of Satisfiability Problems: Refining Schaefer's Theorem. Electronic Colloquium on Computational Complexity (ECCC)(100) (2004)