The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Henning Schnoor" ( http://dblp.L3S.de/Authors/Henning_Schnoor )

URL (Homepage):  https://www.se.informatik.uni-kiel.de/en/team/henning-schnoor  Author page on DBLP  Author page in RDF  Community of Henning Schnoor in ASPL-2

Publication years (Num. hits)
2004-2008 (21) 2009-2010 (16) 2011-2013 (17) 2014-2017 (15) 2018 (1)
Publication types (Num. hits)
article(35) inproceedings(35)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 15 occurrences of 12 keywords

Results
Found 71 publication records. Showing 70 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Henning Schnoor, Wilhelm Hasselbring Toward measuring software coupling via weighted dynamic metrics. Search on Bibsonomy ICSE (Companion Volume) The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Juha Kontinen, Julian-Steffen Müller, Henning Schnoor, Heribert Vollmer Modal independence logic. Search on Bibsonomy J. Log. Comput. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Edith Hemaspaandra, Henning Schnoor Complexity Dichotomies for Unweighted Scoring Rules. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Edith Hemaspaandra, Henning Schnoor Dichotomy for Pure Scoring Rules Under Manipulative Electoral Actions. Search on Bibsonomy ECAI The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Rudolf Berghammer, Henning Schnoor Control of Condorcet voting: Complexity and a Relation-Algebraic approach. Search on Bibsonomy European Journal of Operational Research The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Henning Schnoor, Oliver Woizekowski Active Linking Attacks. Search on Bibsonomy MFCS (2) The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Juha Kontinen, Julian-Steffen Müller, Henning Schnoor, Heribert Vollmer A Van Benthem Theorem for Modal Team Semantics. Search on Bibsonomy CSL The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Wojciech Jamroga, Matthijs Melissen, Henning Schnoor On Defendability of Security Properties. Search on Bibsonomy SR The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Edith Hemaspaandra, Lane A. Hemaspaandra, Henning Schnoor A Control Dichotomy for Pure Scoring Rules. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Juha Kontinen, Julian-Steffen Müller, Henning Schnoor, Heribert Vollmer Modal Independence Logic. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Henning Schnoor The Relative Succinctness and Expressiveness of Modal Logics Can Be Arbitrarily Complex. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Juha Kontinen, Julian-Steffen Müller, Henning Schnoor, Heribert Vollmer A Van Benthem Theorem for Modal Team Semantics. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Edith Hemaspaandra, Lane A. Hemaspaandra, Henning Schnoor A Control Dichotomy for Pure Scoring Rules. Search on Bibsonomy AAAI The full citation details ... 2014 DBLP  BibTeX  RDF
1Rudolf Berghammer, Nikita Danilenko, Henning Schnoor Relation Algebra and RelView Applied to Approval Voting. Search on Bibsonomy RAMICS The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Rudolf Berghammer, Henning Schnoor Control of condorcet voting: complexity and a relation-algebraic approach. Search on Bibsonomy AAMAS The full citation details ... 2014 DBLP  BibTeX  RDF
1Juha Kontinen, Julian-Steffen Müller, Henning Schnoor, Heribert Vollmer Modal Independence Logic. Search on Bibsonomy Advances in Modal Logic The full citation details ... 2014 DBLP  BibTeX  RDF
1Sebastian Eggert, Ron van der Meyden, Henning Schnoor, Thomas Wilke Complexity and Unwinding for Intransitive Noninterference. Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Rudolf Berghammer, Henning Schnoor Relation-algebraic and Tool-supported Control of Condorcet Voting Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Henning Schnoor, Oliver Woizekowski Active Linkability Attacks. Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Wojciech Jamroga, Matthijs Melissen, Henning Schnoor Defendable Security in Interaction Protocols. Search on Bibsonomy PRIMA The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Henning Schnoor Quantified Epistemic and Probabilistic ATL. Search on Bibsonomy ICAART (2) The full citation details ... 2013 DBLP  BibTeX  RDF
1Henning Schnoor Epistemic and Probabilistic ATL with Quantification and Explicit Strategies. Search on Bibsonomy ICAART (Revised Selected Papers) The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Sebastian Eggert, Henning Schnoor, Thomas Wilke Noninterference with Local Policies. Search on Bibsonomy MFCS The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Henning Schnoor Deciding Epistemic and Strategic Properties of Cryptographic Protocols. Search on Bibsonomy IACR Cryptology ePrint Archive The full citation details ... 2012 DBLP  BibTeX  RDF
1Sebastian Eggert, Henning Schnoor, Thomas Wilke Dynamic Noninterference: Consistent Policies, Characterizations and Verification Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Henning Schnoor Deciding Epistemic and Strategic Properties of Cryptographic Protocols. Search on Bibsonomy ESORICS The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor Weighted Manipulation for Four-Candidate Llull Is Easy. Search on Bibsonomy ECAI The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Edith Hemaspaandra, Henning Schnoor A Simplest Undecidable Modal Logic Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Edith Hemaspaandra, Henning Schnoor Minimization for Generalized Boolean Formulas Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Michael Bauland, Martin Mundhenk, Thomas Schneider 0002, Henning Schnoor, Ilka Schnoor, Heribert Vollmer The tractability of model checking for LTL: The good, the bad, and the ugly fragments. Search on Bibsonomy ACM Trans. Comput. Log. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Sebastian Eggert, Ron van der Meyden, Henning Schnoor, Thomas Wilke The Complexity of Intransitive Noninterference. Search on Bibsonomy IEEE Symposium on Security and Privacy The full citation details ... 2011 DBLP  DOI  BibTeX  RDF verification, information flow, noninterference
1Edith Hemaspaandra, Henning Schnoor A Universally Defined Undecidable Unimodal Logic. Search on Bibsonomy MFCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Edith Hemaspaandra, Henning Schnoor Minimization for Generalized Boolean Formulas. Search on Bibsonomy IJCAI The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor, Heribert Vollmer The Complexity of Problems for Quantified Constraints. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor Generalized modal satisfiability. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Elmar 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 Search on Bibsonomy Logical Methods in Computer Science The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Nadia Creignou, Henning Schnoor, Ilka Schnoor Nonuniform Boolean constraint satisfaction problems with cardinality constraint. Search on Bibsonomy ACM Trans. Comput. Log. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Henning Schnoor The Complexity of Model Checking for Boolean Formulas. Search on Bibsonomy Int. J. Found. Comput. Sci. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Klaas Ole Kürtz, Henning Schnoor, Thomas Wilke Computationally secure two-round authenticated message exchange. Search on Bibsonomy AsiaCCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF authenticated message exchange, cryptographic protocols, timestamps
1Ralf Küsters, Henning Schnoor, Tomasz Truderung A Formal Definition of Online Abuse-Freeness. Search on Bibsonomy SecureComm The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Henning Schnoor Strategic planning for probabilistic games with incomplete information. Search on Bibsonomy AAMAS The full citation details ... 2010 DBLP  BibTeX  RDF
1Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor Manipulation of copeland elections. Search on Bibsonomy AAMAS The full citation details ... 2010 DBLP  BibTeX  RDF
1Michael Bauland, Martin Mundhenk, Thomas Schneider 0002, Henning Schnoor, Ilka Schnoor, Heribert Vollmer The Tractability of Model-checking for LTL: The Good, the Bad, and the Ugly Fragments. Search on Bibsonomy Electr. Notes Theor. Comput. Sci. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Klaas Ole Kürtz, Henning Schnoor, Thomas Wilke Computationally Secure Two-Round Authenticated Message Exchange. Search on Bibsonomy IACR Cryptology ePrint Archive The full citation details ... 2009 DBLP  BibTeX  RDF
1Klaas Ole Kürtz, Henning Schnoor, Thomas Wilke A Simulation-Based Treatment of Authenticated Message Exchange. Search on Bibsonomy IACR Cryptology ePrint Archive The full citation details ... 2009 DBLP  BibTeX  RDF
1Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer The complexity of satisfiability problems: Refining Schaefer's theorem. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Michael Bauland, Thomas Schneider 0002, Henning Schnoor, Ilka Schnoor, Heribert Vollmer The Complexity of Generalized Satisfiability for Linear Temporal Logic Search on Bibsonomy Logical Methods in Computer Science The full citation details ... 2009 DBLP  BibTeX  RDF
1Mihhail Aizatulin, Henning Schnoor, Thomas Wilke Computationally Sound Analysis of a Probabilistic Contract Signing Protocol. Search on Bibsonomy ESORICS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Klaas Ole Kürtz, Henning Schnoor, Thomas Wilke A Simulation-Based Treatment of Authenticated Message Exchange. Search on Bibsonomy ASIAN The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Michael Bauland, Martin Mundhenk, Thomas Schneider 0002, Henning Schnoor, Ilka Schnoor, Heribert Vollmer The Tractability of Model-Checking for LTL: The Good, the Bad, and the Ugly Fragments. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2008 DBLP  BibTeX  RDF
1Michael Bauland, Martin Mundhenk, Thomas Schneider 0002, Henning Schnoor, Ilka Schnoor, Heribert Vollmer The Tractability of Model-Checking for LTL: The Good, the Bad, and the Ugly Fragments Search on Bibsonomy CoRR The full citation details ... 2008 DBLP  BibTeX  RDF
1Edith Hemaspaandra, Henning Schnoor On the Complexity of Elementary Modal Logics Search on Bibsonomy CoRR The full citation details ... 2008 DBLP  BibTeX  RDF
1Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor Generalized Modal Satisfiability Search on Bibsonomy CoRR The full citation details ... 2008 DBLP  BibTeX  RDF
1Henning Schnoor, Ilka Schnoor Partial Polymorphisms and Constraint Satisfaction Problems. Search on Bibsonomy Complexity of Constraints The full citation details ... 2008 DBLP  DOI  BibTeX  RDF partial polymorphisms, computational complexity, constraint satisfaction problems, clones
1Edith Hemaspaandra, Henning Schnoor On the Complexity of Elementary Modal Logics. Search on Bibsonomy STACS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Eric Brelsford, Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor Approximability of Manipulating Elections. Search on Bibsonomy AAAI The full citation details ... 2008 DBLP  BibTeX  RDF
1Nadia Creignou, Henning Schnoor, Ilka Schnoor Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint. Search on Bibsonomy CSL The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor Copeland voting: ties matter. Search on Bibsonomy AAMAS (2) The full citation details ... 2008 DBLP  BibTeX  RDF
1Heribert Vollmer, Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor The Complexity of Problems for Quantified Constraints. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2007 DBLP  BibTeX  RDF
1Elmar Böhler, Henning Schnoor The Complexity of the Descriptiveness of Boolean Circuits over Different Sets of Gates. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Michael Bauland, Thomas Schneider 0002, Henning Schnoor, Ilka Schnoor, Heribert Vollmer The Complexity of Generalized Satisfiability for Linear Temporal Logic. Search on Bibsonomy FoSSaCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF computational complexity, linear temporal logic
1Henning Schnoor, Ilka Schnoor Enumerating All Solutions for Constraint Satisfaction Problems. Search on Bibsonomy STACS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF computational complexity, constraints, enumeration
1Michael Bauland, Thomas Schneider 0002, Henning Schnoor, Ilka Schnoor, Heribert Vollmer The Complexity of Generalized Satisfiability for Linear Temporal Logic. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2006 DBLP  BibTeX  RDF
1Henning Schnoor, Ilka Schnoor New Algebraic Tools for Constraint Satisfaction. Search on Bibsonomy Complexity of Constraints The full citation details ... 2006 DBLP  BibTeX  RDF
1Henning Schnoor, Ilka Schnoor Enumerating all Solutions for Constraint Satisfaction Problems. Search on Bibsonomy Complexity of Constraints The full citation details ... 2006 DBLP  BibTeX  RDF
1Michael Bauland, Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor Generalized Modal Satisfiability. Search on Bibsonomy STACS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF computational complexity, modal logic
1Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor, Heribert Vollmer Quantified Constraints: The Complexity of Decision and Counting for Bounded Alternation Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2005 DBLP  BibTeX  RDF
1Elmar Böhler, Steffen Reith, Henning Schnoor, Heribert Vollmer Bases for Boolean co-clones. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer The Complexity of Satisfiability Problems: Refining Schaefer's Theorem. Search on Bibsonomy MFCS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer The Complexity of Satisfiability Problems: Refining Schaefer's Theorem Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2004 DBLP  BibTeX  RDF
Displaying result #1 - #70 of 70 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license