default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHenning Schnoor
Person information
- affiliation: University of Kiel, Department of Computer Science, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j16]Reiner Jung, Henning Schnoor, Sven Gundlach, Wilhelm Hasselbring:
Architecture Recovery from Fortran Code with Kieker. Softwaretechnik-Trends 43(1): 38-40 (2023)- 2022
- [j15]Martin Claus
, Sven Gundlach, Wilhelm Hasselbring, Reiner Jung, Willi Rath, Henning Schnoor:
Modularizing Earth system models for interactive simulation. Inform. Spektrum 45(5): 300-303 (2022) - 2020
- [j14]Henning Schnoor, Wilhelm Hasselbring:
Comparing Static and Dynamic Weighted Software Coupling Metrics. Comput. 9(2): 24 (2020) - [j13]Rudolf Berghammer, Henning Schnoor, Michael Winter:
Efficient Computation of the Large Inductive Dimension Using Order- and Graph-theoretic Means. Fundam. Informaticae 177(2): 95-113 (2020) - 2017
- [j12]Juha Kontinen, Julian-Steffen Müller, Henning Schnoor, Heribert Vollmer:
Modal independence logic. J. Log. Comput. 27(5): 1333-1352 (2017) - 2015
- [j11]Rudolf Berghammer, Henning Schnoor:
Control of Condorcet voting: Complexity and a Relation-Algebraic approach. Eur. J. Oper. Res. 246(2): 505-516 (2015) - 2011
- [j10]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:1-13:28 (2011) - 2010
- [j9]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. Log. Methods Comput. Sci. 8(3) (2010) - [j8]Henning Schnoor:
The Complexity of Model Checking for Boolean Formulas. Int. J. Found. Comput. Sci. 21(3): 289-309 (2010) - [j7]Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor:
Generalized modal satisfiability. J. Comput. Syst. Sci. 76(7): 561-578 (2010) - [j6]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) - [j5]Nadia Creignou, Henning Schnoor, Ilka Schnoor:
Nonuniform Boolean constraint satisfaction problems with cardinality constraint. ACM Trans. Comput. Log. 11(4): 24:1-24:32 (2010) - 2009
- [j4]Michael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer:
The Complexity of Generalized Satisfiability for Linear Temporal Logic. Log. Methods Comput. Sci. 5(1) (2009) - [j3]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) - 2007
- [j2]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) - 2005
- [j1]Elmar Böhler, Steffen Reith, Henning Schnoor, Heribert Vollmer:
Bases for Boolean co-clones. Inf. Process. Lett. 96(2): 59-66 (2005)
Conference and Workshop Papers
- 2019
- [c36]Walisa Romsaiyud, Henning Schnoor, Wilhelm Hasselbring:
Improving k-Nearest Neighbor Pattern Recognition Models for Privacy-Preserving Data Analysis. IEEE BigData 2019: 5804-5813 - [c35]Henning Schnoor, Wilhelm Hasselbring:
Comparing Static and Dynamic Weighted Software Coupling Metrics. ICIST 2019: 285-298 - 2018
- [c34]Henning Schnoor, Wilhelm Hasselbring:
Toward measuring software coupling via weighted dynamic metrics. ICSE (Companion Volume) 2018: 342-343 - 2016
- [c33]Edith Hemaspaandra, Henning Schnoor:
Dichotomy for Pure Scoring Rules Under Manipulative Electoral Actions. ECAI 2016: 1071-1079 - 2015
- [c32]Juha Kontinen, Julian-Steffen Müller, Henning Schnoor, Heribert Vollmer:
A Van Benthem Theorem for Modal Team Semantics. CSL 2015: 277-291 - [c31]Henning Schnoor, Oliver Woizekowski:
Active Linking Attacks. MFCS (2) 2015: 555-566 - 2014
- [c30]Rudolf Berghammer, Nikita Danilenko, Henning Schnoor:
Relation Algebra and RelView Applied to Approval Voting. RAMiCS 2014: 309-326 - [c29]Edith Hemaspaandra, Lane A. Hemaspaandra, Henning Schnoor:
A Control Dichotomy for Pure Scoring Rules. AAAI 2014: 712-720 - [c28]Juha Kontinen, Julian-Steffen Müller, Henning Schnoor, Heribert Vollmer:
Modal Independence Logic. Advances in Modal Logic 2014: 353-372 - [c27]Rudolf Berghammer, Henning Schnoor:
Control of condorcet voting: complexity and a relation-algebraic approach. AAMAS 2014: 1365-1366 - [c26]Wojciech Jamroga, Matthijs Melissen, Henning Schnoor:
On Defendability of Security Properties. SR 2014: 17-25 - 2013
- [c25]Henning Schnoor:
Quantified Epistemic and Probabilistic ATL. ICAART (2) 2013: 14-23 - [c24]Henning Schnoor:
Epistemic and Probabilistic ATL with Quantification and Explicit Strategies. ICAART (Revised Selected Papers) 2013: 131-148 - [c23]Sebastian Eggert, Henning Schnoor, Thomas Wilke:
Noninterference with Local Policies. MFCS 2013: 337-348 - [c22]Wojciech Jamroga, Matthijs Melissen, Henning Schnoor:
Defendable Security in Interaction Protocols. PRIMA 2013: 132-148 - 2012
- [c21]Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor:
Weighted Manipulation for Four-Candidate Llull Is Easy. ECAI 2012: 318-323 - [c20]Henning Schnoor:
Deciding Epistemic and Strategic Properties of Cryptographic Protocols. ESORICS 2012: 91-108 - 2011
- [c19]Edith Hemaspaandra, Henning Schnoor:
Minimization for Generalized Boolean Formulas. IJCAI 2011: 566-571 - [c18]Edith Hemaspaandra, Henning Schnoor:
A Universally Defined Undecidable Unimodal Logic. MFCS 2011: 364-375 - [c17]Sebastian Eggert, Ron van der Meyden, Henning Schnoor, Thomas Wilke:
The Complexity of Intransitive Noninterference. IEEE Symposium on Security and Privacy 2011: 196-211 - 2010
- [c16]Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor:
Manipulation of copeland elections. AAMAS 2010: 367-374 - [c15]Henning Schnoor:
Strategic planning for probabilistic games with incomplete information. AAMAS 2010: 1057-1064 - [c14]Klaas Ole Kürtz, Henning Schnoor, Thomas Wilke:
Computationally secure two-round authenticated message exchange. AsiaCCS 2010: 214-225 - [c13]Ralf Küsters, Henning Schnoor, Tomasz Truderung:
A Formal Definition of Online Abuse-Freeness. SecureComm 2010: 484-497 - 2009
- [c12]Klaas Ole Kürtz, Henning Schnoor, Thomas Wilke:
A Simulation-Based Treatment of Authenticated Message Exchange. ASIAN 2009: 109-123 - [c11]Mihhail Aizatulin, Henning Schnoor, Thomas Wilke:
Computationally Sound Analysis of a Probabilistic Contract Signing Protocol. ESORICS 2009: 571-586 - 2008
- [c10]Eric Brelsford, Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor:
Approximability of Manipulating Elections. AAAI 2008: 44-49 - [c9]Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor:
Copeland voting: ties matter. AAMAS (2) 2008: 983-990 - [c8]Nadia Creignou, Henning Schnoor, Ilka Schnoor:
Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint. CSL 2008: 109-123 - [c7]Henning Schnoor, Ilka Schnoor:
Partial Polymorphisms and Constraint Satisfaction Problems. Complexity of Constraints 2008: 229-254 - [c6]Edith Hemaspaandra, Henning Schnoor:
On the Complexity of Elementary Modal Logics. STACS 2008: 349-360 - 2007
- [c5]Michael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer:
The Complexity of Generalized Satisfiability for Linear Temporal Logic. FoSSaCS 2007: 48-62 - [c4]Henning Schnoor, Ilka Schnoor:
Enumerating All Solutions for Constraint Satisfaction Problems. STACS 2007: 694-705 - [c3]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. M4M 2007: 277-292 - 2006
- [c2]Michael Bauland, Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor:
Generalized Modal Satisfiability. STACS 2006: 500-511 - 2005
- [c1]Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer:
The Complexity of Satisfiability Problems: Refining Schaefer's Theorem. MFCS 2005: 71-82
Data and Artifacts
- 2024
- [d8]Reiner Jung, Henning Schnoor, Wilhelm Hasselbring:
cau-se/esm-architecture-analysis-replication-package: OceanDSL recovery - zenodo. Zenodo, 2024
- [d7]Henning Schnoor, Wilhelm Hasselbring, Reiner Jung:
Replication Package for: Software Architecture Evaluation and Restructuring of Earth System Models (Restructuring Part). Zenodo, 2024 - 2021
- [d6]Reiner Jung, Henning Schnoor, Sven Gundlach, Wilhelm Hasselbring:
Replication Package for: Software Architecture Evaluation of Earth System Models. Zenodo, 2021 - [d5]Reiner Jung, Henning Schnoor, Sven Gundlach, Wilhelm Hasselbring:
Data package for: Software Architecture Evaluation of Earth System Models. Zenodo, 2021 - 2020
- [d4]Henning Schnoor, Wilhelm Hasselbring:
Jira Monitoring Data February 2017. Zenodo, 2020 - [d3]Henning Schnoor, Wilhelm Hasselbring:
Jira Monitoring Data September 2017. Zenodo, 2020 - [d2]Henning Schnoor, Wilhelm Hasselbring:
Jira Monitoring Data February 2018. Zenodo, 2020 - [d1]Henning Schnoor, Wilhelm Hasselbring:
Jira Monitoring Data September 2018. Zenodo, 2020
Informal and Other Publications
- 2019
- [i25]Henning Schnoor, Wilhelm Hasselbring:
Comparing Static and Dynamic Weighted Software Coupling Metrics. CoRR abs/1909.12521 (2019) - 2016
- [i24]Edith Hemaspaandra, Henning Schnoor:
Complexity Dichotomies for Unweighted Scoring Rules. CoRR abs/1604.05264 (2016) - 2014
- [i23]Juha Kontinen, Julian-Steffen Müller, Henning Schnoor, Heribert Vollmer:
Modal Independence Logic. CoRR abs/1404.0144 (2014) - [i22]Edith Hemaspaandra, Lane A. Hemaspaandra, Henning Schnoor:
A Control Dichotomy for Pure Scoring Rules. CoRR abs/1404.4560 (2014) - [i21]Henning Schnoor:
The Relative Succinctness and Expressiveness of Modal Logics Can Be Arbitrarily Complex. CoRR abs/1410.5993 (2014) - [i20]Juha Kontinen, Julian-Steffen Müller, Henning Schnoor, Heribert Vollmer:
A Van Benthem Theorem for Modal Team Semantics. CoRR abs/1410.6648 (2014) - 2013
- [i19]Rudolf Berghammer, Henning Schnoor:
Relation-algebraic and Tool-supported Control of Condorcet Voting. CoRR abs/1304.7244 (2013) - [i18]Sebastian Eggert, Ron van der Meyden, Henning Schnoor, Thomas Wilke:
Complexity and Unwinding for Intransitive Noninterference. CoRR abs/1308.1204 (2013) - [i17]Henning Schnoor, Oliver Woizekowski:
Active Linkability Attacks. CoRR abs/1311.7236 (2013) - 2012
- [i16]Sebastian Eggert, Henning Schnoor, Thomas Wilke:
Dynamic Noninterference: Consistent Policies, Characterizations and Verification. CoRR abs/1208.5580 (2012) - [i15]Henning Schnoor:
Deciding Epistemic and Strategic Properties of Cryptographic Protocols. IACR Cryptol. ePrint Arch. 2012: 340 (2012) - 2011
- [i14]Edith Hemaspaandra, Henning Schnoor:
Minimization for Generalized Boolean Formulas. CoRR abs/1104.2312 (2011) - [i13]Edith Hemaspaandra, Henning Schnoor:
A Simplest Undecidable Modal Logic. CoRR abs/1105.0845 (2011) - 2009
- [i12]Klaas Ole Kürtz, Henning Schnoor, Thomas Wilke:
Computationally Secure Two-Round Authenticated Message Exchange. IACR Cryptol. ePrint Arch. 2009: 262 (2009) - [i11]Klaas Ole Kürtz, Henning Schnoor, Thomas Wilke:
A Simulation-Based Treatment of Authenticated Message Exchange. IACR Cryptol. ePrint Arch. 2009: 368 (2009) - 2008
- [i10]Edith Hemaspaandra, Henning Schnoor:
On the Complexity of Elementary Modal Logics. CoRR abs/0802.1884 (2008) - [i9]Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor:
Generalized Modal Satisfiability. CoRR abs/0804.2729 (2008) - [i8]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) - [i7]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. Electron. Colloquium Comput. Complex. TR08 (2008) - 2007
- [i6]Heribert Vollmer, Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor:
The Complexity of Problems for Quantified Constraints. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [i5]Henning Schnoor, Ilka Schnoor:
Enumerating all Solutions for Constraint Satisfaction Problems. Complexity of Constraints 2006 - [i4]Henning Schnoor, Ilka Schnoor:
New Algebraic Tools for Constraint Satisfaction. Complexity of Constraints 2006 - [i3]Michael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer:
The Complexity of Generalized Satisfiability for Linear Temporal Logic. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [i2]Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor, Heribert Vollmer:
Quantified Constraints: The Complexity of Decision and Counting for Bounded Alternation. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [i1]Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer:
The Complexity of Satisfiability Problems: Refining Schaefer's Theorem. Electron. Colloquium Comput. Complex. TR04 (2004)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
