Dr. Henning Schnoor

Dr. Henning Schnoor

Funktion function Wissenschaftlicher Mitarbeiter
Telefon phone +49 (0)431 880 7508
Fax +49 (0)431 880 7614
E-Mail schnoor@ti.informatik.uni-kiel.de
PGP/GPG Key 680A 19B9 7836 4BF3 C642 B2F4 B20D 9322 1554 E4E2
Dienstzimmer office CAP4, 1015
Sprechzeiten office hours by appointment

Research Interests

  • Cryptographic Protocols
  • Logics for Multi-Agent Systems
  • Modal Logic
  • Complexity Theory
  • Complexity of Satisfiability Problems
  • Computational Social Choice

Teaching

Publications

You can also find a list of publications at DBLP.

2010

[FaliszewskiHemaspaandraSchnoor-COPELAND-MANIPULATION-AAMAS-TOAPPEAR-2010 | .bib]

P. Faliszewski, E. Hemaspaandra, and H. Schnoor, "Manipulation of Copeland Elections," in AAMAS, 2010.

@inproceedings{FaliszewskiHemaspaandraSchnoor-COPELAND-MANIPULATION-AAMAS-TOAPPEAR-2010,
  author = {Piotr Faliszewski and Edith Hemaspaandra and Henning Schnoor },
  title = {Manipulation of Copeland Elections},
  booktitle = {AAMAS},
  year = {2010},
  note = \emph{to appear}
}

[KuertzSchnoorWilke-2AMEX-ASIACCS-2010 | .bib]

K. O. Kürtz, H. Schnoor, and T. Wilke, "Computationally secure two-round authenticated message exchange," in Proceedings of ASIACCS 2009, 2010, pp. 214-225.

@inproceedings{KuertzSchnoorWilke-2AMEX-ASIACCS-2010,
  author = {Klaas Ole K{\"u}rtz and Henning Schnoor and Thomas Wilke},
  title = {Computationally secure two-round authenticated message exchange},
  booktitle = {Proceedings of ASIACCS 2009},
  year = {2010},
  pages = {214-225},
  ee = {http://doi.acm.org/10.1145/1755688.1755715}
}

[BaulandBoehlerCreignouReithSchnoorVollmer-QCSP-TOCS-2010 | .bib]

M. Bauland, E. Böhler, N. Creignou, S. Reith, H. Schnoor, and H. Vollmer, "The Complexity of Problems for Quantified Constraints," Theory Comput. Syst., vol. 47, iss. 2, pp. 454-490, 2010.

@article{BaulandBoehlerCreignouReithSchnoorVollmer-QCSP-TOCS-2010,
  author = {Michael Bauland and Elmar B{\"o}hler and Nadia Creignou and Steffen Reith and Henning Schnoor and Heribert Vollmer},
  title = {The Complexity of Problems for Quantified Constraints},
  journal = {Theory Comput. Syst.},
  volume = {47},
  number = {2},
  year = {2010},
  pages = {454-490},
  ee = {http://springerlink.metapress.com/content/727w711566856102/},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

[Schnoor-ATL-INCOMPLETE-AAMAS-TOAPPEAR-2010 | .bib]

H. Schnoor, "Strategic Planning for Probabilistic Games with Incomplete Information," in AAMAS, 2010.

@inproceedings{Schnoor-ATL-INCOMPLETE-AAMAS-TOAPPEAR-2010,
  author = {Henning Schnoor},
  title = {Strategic Planning for Probabilistic Games with Incomplete Information},
  booktitle = {AAMAS},
  year = {2010},
  note = \emph{to appear}
}

2009

[KuertzSchnoorWilke-AMX-Simulation-ASIAN-2009 | .bib]

K. O. Kürtz, H. Schnoor, and T. Wilke, "A Simulation-Based Treatment of Authenticated Message Exchange," in Proceedings of ASIAN 2009, 2009, pp. 109-123.

@InProceedings{KuertzSchnoorWilke-AMX-Simulation-ASIAN-2009,
  author = {Klaas Ole K\"urtz and Henning Schnoor and Thomas Wilke},
  title = {A Simulation-Based Treatment of Authenticated Message Exchange},
  booktitle = {Proceedings of ASIAN 2009},
  year = {2009},
  pages = {109-123},
  }

[HemaspaandraSchnoorSchnoor-GeneralizedModal-JCSS-2009 | .bib]

E. Hemaspaandra, H. Schnoor, and I. Schnoor, "Generalized Modal Satisfiability," Journal of Computer and System Sciences, 2009.

@Article{HemaspaandraSchnoorSchnoor-GeneralizedModal-JCSS-2009,
  author = {Edith Hemaspaandra and Henning Schnoor and Ilka Schnoor},
  title = {Generalized Modal Satisfiability},
  journal = {Journal of Computer and System Sciences},
  year = {2009},
  note = \emph{to appear}
}

[Schnoor-FormulaValue-IJFCS-2009-TOAPPEAR | .bib]

H. Schnoor, The Complexity of Model Checking for Boolean Formulas, 2009.

@Misc{Schnoor-FormulaValue-IJFCS-2009-TOAPPEAR,
  author = {Henning Schnoor},
  title = {The Complexity of Model Checking for Boolean Formulas},
  howpublished = {to appear in Journal of Foundations of Computer Science (IJFCS)},
  year= 2009 }

[AllenderBaulandImmermanSchnoorVollmer-CSP-JCSS-2009 | .bib]

E. Allender, M. Bauland, N. Immerman, H. Schnoor, and H. Vollmer, "The complexity of satisfiability problems: Refining Schaefer’s Theorem," Journal of Computer and System Sciences, vol. 75, iss. 4, pp. 245-254, 2009.

@article{AllenderBaulandImmermanSchnoorVollmer-CSP-JCSS-2009,
  author = {Eric Allender and Michael Bauland and Neil Immerman and Henning Schnoor and Heribert Vollmer},
  title = {The complexity of satisfiability problems: Refining {S}chaefer's {T}heorem},
  journal = {Journal of Computer and System Sciences},
  volume = {75},
  number = {4},
  year = {2009},
  pages = {245-254},
  ee = {http://dx.doi.org/10.1016/j.jcss.2008.11.001},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

[KuertzSchnoorWilke-2MUTAUT-CRYPTEPRINT-2009 | .bib]

K. O. Kuertz, H. Schnoor, and T. Wilke, "Computationally Secure Two-Round Authenticated Message Exchange", 2009.

@TechReport{KuertzSchnoorWilke-2MUTAUT-CRYPTEPRINT-2009,
  author = {Klaas Ole Kuertz and Henning Schnoor and Thomas Wilke},
  title = {Computationally Secure Two-Round Authenticated Message Exchange},
  howpublished = {Cryptology ePrint Archive, Report 2009/262},
  year = {2009}
}

[BaulandSchneiderSchnoorSchnoorVollmer-LTLSAT-LMCS-2009 | .bib]

M. Bauland, T. Schneider, H. Schnoor, I. Schnoor, and H. Vollmer, "The Complexity of Generalized Satisfiability for Linear Temporal Logic," Logical Methods in Computer Science, vol. 5, iss. 1, pp. 1-21, 2009.

@Article{BaulandSchneiderSchnoorSchnoorVollmer-LTLSAT-LMCS-2009,
  author = {Michael Bauland and Thomas Schneider and Henning Schnoor and Ilka Schnoor and Heribert Vollmer},
  title = {The Complexity of Generalized Satisfiability for Linear Temporal Logic},
  journal = {Logical Methods in Computer Science},
  year = {2009},
  volume = {5},
  number = {1},
  pages = {1-21}
}

[AizatulinSchnoorWilke-ProbCSP-ESORICS-2009 | .bib]

M. Aizatulin, H. Schnoor, and T. Wilke, "Computationally Sound Analysis of a Probabilistic Contract Signing Protocol," in Proceedings of ESORICS 2009, 2009, pp. 571-586.

@inproceedings{AizatulinSchnoorWilke-ProbCSP-ESORICS-2009,
  author = {Mihhail Aizatulin and Henning Schnoor and Thomas Wilke},
  title = {Computationally Sound Analysis of a Probabilistic Contract Signing Protocol},
  booktitle = {Proceedings of ESORICS 2009},
  year = {2009},
  pages = {571-586},
  ee = {http://dx.doi.org/10.1007/978-3-642-04444-1_35}
}

[AizatulinSchnoorWilke-ProbCSP-TR-CAU-2009 | .pdf | .bib]

M. Aizatulin, H. Schnoor, and T. Wilke, "Computationally Sound Analysis of a Probabilistic Contract Signing Protocol", Institut für Informatik, Christian-Albrechts-Universität zu Kiel, 0911, 2009.

@TechReport{AizatulinSchnoorWilke-ProbCSP-TR-CAU-2009,
  author = {Mihhail Aizatulin and Henning Schnoor and Thomas Wilke},
  title = {Computationally Sound Analysis of a Probabilistic Contract Signing Protocol},
  institution = {Institut f{\"u}r Informatik, Christian-Albrechts-Universit{\"a}t zu Kiel},
  year = {2009},
  number = {0911},
  url = {http://www.informatik.uni-kiel.de/uploads/tx_publication/tr_0911.pdf}
}

[BaulandMundhenkSchneiderSchnoorSchnoorVollmer-LTLMC-ENTCS-2009 | .bib]

M. Bauland, M. Mundhenk, T. Schneider, H. Schnoor, I. Schnoor, and H. Vollmer, "The Tractability of Model-checking for LTL: The Good, the Bad, and the Ugly Fragments," Electronic Notes in Theoretical Computer Science, vol. 231, pp. 277-292, 2009.

@article{BaulandMundhenkSchneiderSchnoorSchnoorVollmer-LTLMC-ENTCS-2009,
  author = {Michael Bauland and Martin Mundhenk and Thomas Schneider and Henning Schnoor and Ilka Schnoor and Heribert Vollmer},
  title = {The Tractability of Model-checking for {LTL}: The Good, the Bad, and the Ugly Fragments},
  journal = {Electronic Notes in Theoretical Computer Science},
  volume = {231},
  pages = {277--292},
  year = {2009},
  note = {Proceedings of the 5th Workshop on Methods for Modalities (M4M5 2007)},
  issn = {1571-0661},
  doi = {DOI: 10.1016/j.entcs.2009.02.041}
}

2008

[CreignouSchnoorSchnoor-BalCSP-CSL-2008 | .bib]

N. Creignou, H. Schnoor, and I. Schnoor, "Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint," in Proceedings of CSL 2008, 2008, pp. 109-123.

@inproceedings{CreignouSchnoorSchnoor-BalCSP-CSL-2008,
  author = {Nadia Creignou and Henning Schnoor and Ilka Schnoor},
  title = {Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint},
  booktitle = {Proceedings of CSL 2008},
  year = {2008},
  pages = {109--123},
  ee = {http://dx.doi.org/10.1007/978-3-540-87531-4_10}
}

[BrelsfordFaliszewskiHemaspaandraSchnoorSchnoor-Approx-AAAI-2008 | .bib]

E. Brelsford, P. Faliszewski, E. Hemaspaandra, H. Schnoor, and I. Schnoor, "Approximability of Manipulating Elections," in Proceedings of AAAI 2008, 2008, pp. 44-49.

@InProceedings{BrelsfordFaliszewskiHemaspaandraSchnoorSchnoor-Approx-AAAI-2008,
  author = {Eric Brelsford and Piotr Faliszewski and Edith Hemaspaandra and Henning Schnoor and Ilka Schnoor},
  title = {Approximability of Manipulating Elections},
  booktitle = {Proceedings of AAAI 2008},
  year = {2008},
  pages = {44--49}
}

[HemaspaandraSchnoor-Elementary-CORR-2008 | .bib]

E. Hemaspaandra and H. Schnoor, "On the Complexity of Elementary Modal Logics", Computing Research Repository, arXiv:0802.1884v1, 2008.

@TechReport{HemaspaandraSchnoor-Elementary-CORR-2008,
  author = {Edith Hemaspaandra and Henning Schnoor},
  title = {On the Complexity of Elementary Modal Logics},
  institution = Computing Research Repository, year = {2008},
  number = {arXiv:0802.1884v1}
}

[HemaspaandraSchnoor-Elementary-STACS-2008 | .bib]

E. Hemaspaandra and H. Schnoor, "On the Complexity of Elementary Modal Logics," in Proceedings of STACS 2008, 2008, pp. 349-360.

@inproceedings{HemaspaandraSchnoor-Elementary-STACS-2008,
  author = {Edith Hemaspaandra and Henning Schnoor},
  title = {On the Complexity of Elementary Modal Logics},
  booktitle = {Proceedings of STACS 2008},
  year = {2008},
  pages = {349--360},
  ee = {http://drops.dagstuhl.de/opus/volltexte/2008/1356}
}

[BaulandBoehlerCreignouReithSchnoorVollmer-QCSP-TOCS-2008-TOAPPEAR | .bib]

M. Bauland, E. Böhler, N. Creignou, S. Reith, H. Schnoor, and H. Vollmer, "The Complexity of Problems for Quantified Constraints," Theory of Computing Systems, 2008.

@Article{BaulandBoehlerCreignouReithSchnoorVollmer-QCSP-TOCS-2008-TOAPPEAR,
  author = {Michael Bauland and Elmar B\"ohler and Nadia Creignou and Steffen Reith and Henning Schnoor and Heribert Vollmer},
  title = {The Complexity of Problems for Quantified Constraints},
  journal = {Theory of Computing Systems},
  year = {2008},
  note = \emph{to appear}
}

[FaliszewskiHemaspaandraSchnoor-TiesMatter-AAMAS-2008 | .bib]

P. Faliszewski, E. Hemaspaandra, and H. Schnoor, "Copeland voting: Ties Matter," in Proceedings of AAMAS 2008, 2008, pp. 983-990.

@inproceedings{FaliszewskiHemaspaandraSchnoor-TiesMatter-AAMAS-2008,
  author = {Piotr Faliszewski and Edith Hemaspaandra and Henning Schnoor},
  title = {Copeland voting: Ties Matter},
  booktitle = {Proceedings of AAMAS 2008},
  year = {2008},
  pages = {983-990},
  ee = {http://doi.acm.org/10.1145/1402298.1402359},
  }

[Schnoor-SYMBBRT-TR-CAU-2008 | .pdf | .bib]

H. Schnoor, "Symbolic Verification of Computational Security for Branching-Time Properties", Institut für Informatik, Christian-Albrechts-Universität zu Kiel, 0809, 2008.

@TechReport{Schnoor-SYMBBRT-TR-CAU-2008,
  author = {Henning Schnoor},
  title = {Symbolic Verification of Computational Security for Branching-Time Properties},
  institution = {Institut f{\"u}r Informatik, Christian-Albrechts-Universit{\"a}t zu Kiel},
  year = {2008},
  number = {0809},
  url = {http://www.informatik.uni-kiel.de/uploads/tx_publication/tr8009.pdf}
}

[KuertzSchnoorWilke-2MUTAUT-TR-CAU-2008 | .pdf | .bib]

K. O. Kürtz, H. Schnoor, and T. Wilke, "Computationally Secure Two-Round Authenticated Message Exchange", Institut für Informatik, Christian-Albrechts-Universität zu Kiel, 0809, 2008.

@TechReport{KuertzSchnoorWilke-2MUTAUT-TR-CAU-2008,
  author = {Klaas Ole K\"urtz and Henning Schnoor and Thomas Wilke},
  title = {Computationally Secure Two-Round Authenticated Message Exchange},
  institution = {Institut f{\"u}r Informatik, Christian-Albrechts-Universit{\"a}t zu Kiel},
  year = {2008},
  number = {0809},
  url = {http://www.informatik.uni-kiel.de/uploads/tx_publication/tr0810.pdf}
}

[SchnoorSchnoor-Partial-Polymorphisms-LNCS-2008 | .bib]

H. Schnoor and I. Schnoor, "Partial Polymorphisms and Constraint Satisfaction Problems," in Complexity of Constraints, 2008, pp. 229-254.

@inproceedings{SchnoorSchnoor-Partial-Polymorphisms-LNCS-2008,
  author = {Henning Schnoor and Ilka Schnoor},
  title = {Partial Polymorphisms and Constraint Satisfaction Problems},
  booktitle = {Complexity of Constraints},
  year = {2008},
  pages = {229-254},
  ee = {http://dx.doi.org/10.1007/978-3-540-92800-3_9},
  publisher = {Springer}
}

2007

[BoehlerSchnoor-Descriptiveness-TOCS-2007 | .bib]

E. Böhler and H. Schnoor, "The Complexity of the Descriptiveness of Boolean Circuits over Different Sets of Gates," Theory of Computing Systems, vol. 41, iss. 4, pp. 753-777, 2007.

@article{BoehlerSchnoor-Descriptiveness-TOCS-2007,
  author = {Elmar B\"ohler and Henning Schnoor},
  title = {The Complexity of the Descriptiveness of Boolean Circuits over Different Sets of Gates},
  journal = {Theory of Computing Systems},
  volume = {41},
  number = {4},
  year = {2007},
  issn = {1432-4350},
  pages = {753--777},
  doi = {http://dx.doi.org/10.1007/s00224-006-1301-3},
  publisher = {Springer-Verlag New York, Inc.},
  address = {Secaucus, NJ, USA},
  }

[SchnoorSchnoor-Enumerate-STACS-2007 | .bib]

H. Schnoor and I. Schnoor, "Enumerating All Solutions for Constraint Satisfaction Problems," in Proceedings of STACS 2007, 2007, pp. 694-705.

@inproceedings{SchnoorSchnoor-Enumerate-STACS-2007,
  author = {Henning Schnoor and Ilka Schnoor},
  title = {Enumerating All Solutions for Constraint Satisfaction Problems},
  booktitle = {Proceedings of STACS 2007},
  year = {2007},
  pages = {694-705},
  ee = {http://dx.doi.org/10.1007/978-3-540-70918-3_59}
}

[Schnoor-PhdThesis-2007 | .pdf | .bib]

H. Schnoor, "Algebraic Techniques for Satisfiability Problems", PhD Thesis, 2007.

@PhdThesis{Schnoor-PhdThesis-2007,
  author = {Henning Schnoor},
  title = {Algebraic Techniques for Satisfiability Problems},
  school = {Leibniz University of Hannover},
  year = {2007},
  url = {http://www.thi.uni-hannover.de/file\-ad\-min/for\-schung/ar\-bei\-ten/hschnoor-diss.pdf}
}

[FaliszewskiHemaspaandraSchnoor-TiesMatter-TR-2007 | .bib]

P. Faliszewski, E. Hemaspaandra, and H. Schnoor, "Copeland Voting: Ties Matter", Department for Computer Science, University of Rochester, 926, 2007.

@TechReport{FaliszewskiHemaspaandraSchnoor-TiesMatter-TR-2007,
  author = {Piotr Faliszewski and Edith Hemaspaandra and Henning Schnoor},
  title = {Copeland Voting: Ties Matter},
  institution = {Department for Computer Science, University of Rochester},
  year = {2007},
  number = {926}
}

[BaulandSchneiderSchnoorSchnoorVollmer-LTLSAT-FOSSACS-2007 | .bib]

M. Bauland, T. Schneider, H. Schnoor, I. Schnoor, and H. Vollmer, "The Complexity of Generalized Satisfiability for Linear Temporal Logic," in Proceedings of Foundations of Software Science and Computational Structures, 2007, pp. 48-62.

@inproceedings{BaulandSchneiderSchnoorSchnoorVollmer-LTLSAT-FOSSACS-2007,
  author = {Michael Bauland and Thomas Schneider and Henning Schnoor and Ilka Schnoor and Heribert Vollmer},
  title = {The Complexity of Generalized Satisfiability for Linear Temporal Logic},
  booktitle = {Proceedings of Foundations of Software Science and Computational Structures},
  year = {2007},
  pages = {48--62},
  series = "Lecture Notes in Computer Science", publisher = {Springer},
  volume = 4423 }

2006

[BaulandHemaspaandraSchnoorSchnoor-GeneralizedModal-STACS-2006 | .bib]

M. Bauland, E. Hemaspaandra, H. Schnoor, and I. Schnoor, "Generalized Modal Satisfiability," in Proceedings of STACS 2006, 2006, pp. 500-511.

@inproceedings{BaulandHemaspaandraSchnoorSchnoor-GeneralizedModal-STACS-2006,
  author = {Michael Bauland and Edith Hemaspaandra and Henning Schnoor and Ilka Schnoor},
  title = {Generalized Modal Satisfiability},
  booktitle = {Proceedings of STACS 2006},
  year = {2006},
  pages = {500-511},
  ee = {http://dx.doi.org/10.1007/11672142_41}
}

2005

[BoehlerReithSchnoorVollmer-Bases-IPL-2005 | .bib]

E. Böhler, S. Reith, H. Schnoor, and H. Vollmer, "Bases for Boolean Co-Clones," Information Processing Letters, vol. 96, pp. 59-66, 2005.

@Article{BoehlerReithSchnoorVollmer-Bases-IPL-2005,
  author = {Elmar B\"ohler and Steffen Reith and Henning Schnoor and Heribert Vollmer},
  title = {Bases for {B}oolean Co-Clones},
  journal = {Information Processing Letters},
  year = 2005, volume= {96},
  issue = {2},
  pages = {59--66}
}

[AllenderBaulandImmermanSchnoorVollmer-CSP-MFCS-2005 | .bib]

E. Allender, M. Bauland, N. Immerman, H. Schnoor, and H. Vollmer, "The Complexity of Satisfiability Problems: Refining Schaefer’s Theorem.," in Proceedings of the 30th International Symposium on Mathematical Foundations of Computer Science, 2005, pp. 71-82.

@inproceedings{AllenderBaulandImmermanSchnoorVollmer-CSP-MFCS-2005,
  author = {Eric Allender and Michael Bauland and Neil Immerman and Henning Schnoor and Heribert Vollmer},
  editor = {Joanna Jedrzejowicz and Andrzej Szepietowski},
  title = {The Complexity of Satisfiability Problems: Refining {Schaefer's} Theorem.},
  booktitle = {Proceedings of the 30th International Symposium on Mathematical Foundations of Computer Science},
  series = "Lecture Notes in Computer Science", publisher = "Springer", volume = 3618, year = {2005},
  pages = {71--82},
  ee = {http://dx.doi.org/10.1007/11549345_8},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}