@Article{DagRep.2.11,
title = {{Dagstuhl Reports, Volume 2, Issue 11, November 2012, Complete Issue}},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2013},
volume = {2},
number = {11},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.2.11},
URN = {urn:nbn:de:0030-drops-39939},
doi = {10.4230/DagRep.2.11},
annote = {Keywords: Dagstuhl Reports, Volume 2, Issue 11, November 2012, Complete Issue}
}
@Article{DagRep.2.11.i,
title = {{Dagstuhl Reports, Table of Contents, Volume 2, Issue 11, 2012}},
pages = {i--ii},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2013},
volume = {2},
number = {11},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.2.11.i},
URN = {urn:nbn:de:0030-drops-39940},
doi = {10.4230/DagRep.2.11.i},
annote = {Keywords: Dagstuhl Reports, Table of Contents, Volume 2, Issue 11, 2012}
}
@Article{hastad_et_al:DagRep.2.11.1,
author = {Hastad, Johan and Krokhin, Andrei and Marx, D\'{a}niel},
title = {{The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 12451)}},
pages = {1--19},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2013},
volume = {2},
number = {11},
editor = {Hastad, Johan and Krokhin, Andrei and Marx, D\'{a}niel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.2.11.1},
URN = {urn:nbn:de:0030-drops-39764},
doi = {10.4230/DagRep.2.11.1},
annote = {Keywords: Constraint satisfaction problem (CSP); Computational complexity; CSP dichotomy conjecture; Hardness of approximation; Unique games conjceture; Fixed-parameter tractability; Descriptive complexity; niversal algebra; Logic; Decomposition methods}
}
@Article{mehlhorn_et_al:DagRep.2.11.20,
author = {Mehlhorn, Kurt and Vardi, Moshe Y. and Herbstritt, Marc},
title = {{Publication Culture in Computing Research (Dagstuhl Perspectives Workshop 12452)}},
pages = {20--44},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2013},
volume = {2},
number = {11},
editor = {Mehlhorn, Kurt and Vardi, Moshe Y. and Herbstritt, Marc},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.2.11.20},
URN = {urn:nbn:de:0030-drops-39778},
doi = {10.4230/DagRep.2.11.20},
annote = {Keywords: scholarly publishing, conference, journal, peer review, open archive, open access, indexing, research evaluation}
}
@Article{bjorner_et_al:DagRep.2.11.45,
author = {Bjorner, Nikolaj and Chatterjee, Krishnendu and Kovacs, Laura and Majumdar, Rupak M.},
title = {{Games and Decisions for Rigorous Systems Engineering (Dagstuhl Seminar 12461)}},
pages = {45--65},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2013},
volume = {2},
number = {11},
editor = {Bjorner, Nikolaj and Chatterjee, Krishnendu and Kovacs, Laura and Majumdar, Rupak M.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.2.11.45},
URN = {urn:nbn:de:0030-drops-39092},
doi = {10.4230/DagRep.2.11.45},
annote = {Keywords: Systems Engineering, Software Verification, Reactive Synthesis, Automated Deduction}
}
@Article{boulier_et_al:DagRep.2.11.66,
author = {Boulier, Francois and Shiu, Anne J. and Strum, Thomas and Weber, Andreas},
title = {{Symbolic Methods for Chemical Reaction Networks (Dagstuhl Seminar 12462)}},
pages = {66--86},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2013},
volume = {2},
number = {11},
editor = {Boulier, Francois and Shiu, Anne J. and Strum, Thomas and Weber, Andreas},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.2.11.66},
URN = {urn:nbn:de:0030-drops-39060},
doi = {10.4230/DagRep.2.11.66},
annote = {Keywords: chemical reaction network theory, differential algebra, Hopf bifurcation, mass-action kinetics, model inference, model reduction, molecular interaction network, multistationarity, parameter estimation, quantifier elimination, stoichiometric network analysis, symbolic computation}
}
@Article{creignou_et_al:DagRep.2.11.87,
author = {Creignou, Nadia and Galesi, Nicola and Kullmann, Oliver and Vollmer, Heribert},
title = {{SAT Interactions (Dagstuhl Seminar 12471)}},
pages = {87--101},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2013},
volume = {2},
number = {11},
editor = {Creignou, Nadia and Galesi, Nicola and Kullmann, Oliver and Vollmer, Heribert},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.2.11.87},
URN = {urn:nbn:de:0030-drops-39786},
doi = {10.4230/DagRep.2.11.87},
annote = {Keywords: satisfiability problem, computational complexity, P-NP question, proof complexity, combinatorics, SAT-solvers, quantified Boolean formulas}
}
@Article{elmroth_et_al:DagRep.2.11.102,
author = {Elmroth, Erik and Factor, Michael and Miller, Ethan and Seltzer, Margo},
title = {{Is the Future of Preservation Cloudy? (Dagstuhl Seminar 12472)}},
pages = {102--134},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2013},
volume = {2},
number = {11},
editor = {Elmroth, Erik and Factor, Michael and Miller, Ethan and Seltzer, Margo},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.2.11.102},
URN = {urn:nbn:de:0030-drops-39790},
doi = {10.4230/DagRep.2.11.102},
annote = {Keywords: long-term preservation, cloud storage, provenance, obsolescence, data access, storage systems}
}
@Article{kopf_et_al:DagRep.2.11.135,
author = {K\"{o}pf, Boris and Malacaria, Paquale and Palamidessi, Catuscia},
title = {{Quantitative Security Analysis (Dagstuhl Seminar 12481)}},
pages = {135--154},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2013},
volume = {2},
number = {11},
editor = {K\"{o}pf, Boris and Malacaria, Paquale and Palamidessi, Catuscia},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.2.11.135},
URN = {urn:nbn:de:0030-drops-39824},
doi = {10.4230/DagRep.2.11.135},
annote = {Keywords: Security, Privacy,Information theory, Programming languages, Formal methods}
}
@Article{bond_et_al:DagRep.2.11.155,
author = {Bond, Mike and Focardi, Riccardo and Fr\"{o}schle, Sibylle and Steel, Graham},
title = {{Analysis of Security APIs (Dagstuhl Seminar 12482)}},
pages = {155--168},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2013},
volume = {2},
number = {11},
editor = {Bond, Mike and Focardi, Riccardo and Fr\"{o}schle, Sibylle and Steel, Graham},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.2.11.155},
URN = {urn:nbn:de:0030-drops-39832},
doi = {10.4230/DagRep.2.11.155},
annote = {Keywords: Security APIs, cryptography, key management, formal methods, security protocols}
}
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing