|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 15 occurrences of 12 keywords
|
|
|
|
|
Results
Found 43 publication records. Showing 43 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Edith Hemaspaandra, Henning Schnoor |
A Simplest Undecidable Modal Logic  |
CoRR  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Henning Schnoor |
Minimization for Generalized Boolean Formulas |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Michael 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. |
ACM Trans. Comput. Log. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sebastian Eggert, Ron van der Meyden, Henning Schnoor, Thomas Wilke |
The Complexity of Intransitive Noninterference. |
IEEE Symposium on Security and Privacy |
2011 |
DBLP DOI BibTeX RDF |
verification, information flow, noninterference |
| 1 | Edith Hemaspaandra, Henning Schnoor |
Minimization for Generalized Boolean Formulas. |
IJCAI |
2011 |
DBLP BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Henning Schnoor |
A Universally Defined Undecidable Unimodal Logic. |
MFCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Schnoor |
The Complexity of Model Checking for Boolean Formulas. |
Int. J. Found. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor, Heribert Vollmer |
The Complexity of Problems for Quantified Constraints. |
Theory Comput. Syst. |
2010 |
DBLP BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor |
Generalized modal satisfiability. |
J. Comput. Syst. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Nadia Creignou, Henning Schnoor, Ilka Schnoor |
Nonuniform Boolean constraint satisfaction problems with cardinality constraint. |
ACM Trans. Comput. Log. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ralf Küsters, Henning Schnoor, Tomasz Truderung |
A Formal Definition of Online Abuse-Freeness. |
SecureComm |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Schnoor |
Strategic planning for probabilistic games with incomplete information. |
AAMAS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor |
Manipulation of copeland elections. |
AAMAS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaas Ole Kürtz, Henning Schnoor, Thomas Wilke |
Computationally secure two-round authenticated message exchange. |
ASIACCS |
2010 |
DBLP DOI BibTeX RDF |
authenticated message exchange, cryptographic protocols, timestamps |
| 1 | Klaas Ole Kürtz, Henning Schnoor, Thomas Wilke |
A Simulation-Based Treatment of Authenticated Message Exchange. |
IACR Cryptology ePrint Archive |
2009 |
DBLP BibTeX RDF |
|
| 1 | Klaas Ole Kürtz, Henning Schnoor, Thomas Wilke |
Computationally Secure Two-Round Authenticated Message Exchange. |
IACR Cryptology ePrint Archive |
2009 |
DBLP BibTeX RDF |
|
| 1 | Michael 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. |
Electr. Notes Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Bauland, Thomas Schneider 0002, Henning Schnoor, Ilka Schnoor, Heribert Vollmer |
The Complexity of Generalized Satisfiability for Linear Temporal Logic |
Logical Methods in Computer Science |
2009 |
DBLP BibTeX RDF |
|
| 1 | Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer |
The complexity of satisfiability problems: Refining Schaefer's theorem. |
J. Comput. Syst. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaas Ole Kürtz, Henning Schnoor, Thomas Wilke |
A Simulation-Based Treatment of Authenticated Message Exchange. |
ASIAN |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Mihhail Aizatulin, Henning Schnoor, Thomas Wilke |
Computationally Sound Analysis of a Probabilistic Contract Signing Protocol. |
ESORICS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael 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. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Michael 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 |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Henning Schnoor |
On the Complexity of Elementary Modal Logics |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor |
Generalized Modal Satisfiability |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Henning Schnoor |
On the Complexity of Elementary Modal Logics. |
STACS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Schnoor, Ilka Schnoor |
Partial Polymorphisms and Constraint Satisfaction Problems. |
Complexity of Constraints |
2008 |
DBLP DOI BibTeX RDF |
partial polymorphisms, computational complexity, constraint satisfaction problems, clones |
| 1 | Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor |
Copeland voting: ties matter. |
AAMAS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Nadia Creignou, Henning Schnoor, Ilka Schnoor |
Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint. |
CSL |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Brelsford, Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor |
Approximability of Manipulating Elections. |
AAAI |
2008 |
DBLP BibTeX RDF |
|
| 1 | 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) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Elmar Böhler, Henning Schnoor |
The Complexity of the Descriptiveness of Boolean Circuits over Different Sets of Gates. |
Theory Comput. Syst. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Schnoor, Ilka Schnoor |
Enumerating All Solutions for Constraint Satisfaction Problems. |
STACS |
2007 |
DBLP DOI BibTeX RDF |
computational complexity, constraints, enumeration |
| 1 | Michael Bauland, Thomas Schneider 0002, Henning Schnoor, Ilka Schnoor, Heribert Vollmer |
The Complexity of Generalized Satisfiability for Linear Temporal Logic. |
FoSSaCS |
2007 |
DBLP DOI BibTeX RDF |
computational complexity, linear temporal logic |
| 1 | Michael Bauland, Thomas Schneider 0002, Henning Schnoor, Ilka Schnoor, Heribert Vollmer |
The Complexity of Generalized Satisfiability for Linear Temporal Logic. |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Michael Bauland, Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor |
Generalized Modal Satisfiability. |
STACS |
2006 |
DBLP DOI BibTeX RDF |
computational complexity, modal logic |
| 1 | Henning Schnoor, Ilka Schnoor |
Enumerating all Solutions for Constraint Satisfaction Problems. |
Complexity of Constraints |
2006 |
DBLP BibTeX RDF |
|
| 1 | Henning Schnoor, Ilka Schnoor |
New Algebraic Tools for Constraint Satisfaction. |
Complexity of Constraints |
2006 |
DBLP BibTeX RDF |
|
| 1 | Elmar Böhler, Steffen Reith, Henning Schnoor, Heribert Vollmer |
Bases for Boolean co-clones. |
Inf. Process. Lett. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | 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) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer |
The Complexity of Satisfiability Problems: Refining Schaefer's Theorem. |
MFCS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | 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) |
2004 |
DBLP BibTeX RDF |
|
Displaying result #1 - #43 of 43 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")