BibTeX Export for Dagstuhl Reports, Volume 1, Issue 11

Copy to Clipboard Download

@Article{DagRep.1.11,
  title =	{{Dagstuhl Reports, Volume 1, Issue 11, November 2011, Complete Issue}},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2012},
  volume =	{1},
  number =	{11},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.1.11},
  URN =		{urn:nbn:de:0030-drops-34479},
  doi =		{10.4230/DagRep.1.11},
  annote =	{Keywords: Dagstuhl Reports, Volume 1, Issue 11, November 2011, Complete Issue}
}
@Article{DagRep.1.11.i,
  title =	{{Dagstuhl Reports, Table of Contents, Volume 1, Issue 11, 2011}},
  pages =	{i--ii},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2012},
  volume =	{1},
  number =	{11},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.1.11.i},
  URN =		{urn:nbn:de:0030-drops-34463},
  doi =		{10.4230/DagRep.1.11.i},
  annote =	{Keywords: Table of Contents, Frontmatter}
}
@Article{giese_et_al:DagRep.1.11.1,
  author =	{Giese, Holger and Rumpe, Bernhard and Sch\"{a}tz, Bernhard and Sztipanovits, Janos},
  title =	{{Science and Engineering of Cyber-Physical Systems (Dagstuhl Seminar 11441)}},
  pages =	{1--22},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2012},
  volume =	{1},
  number =	{11},
  editor =	{Giese, Holger and Rumpe, Bernhard and Sch\"{a}tz, Bernhard and Sztipanovits, Janos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.1.11.1},
  URN =		{urn:nbn:de:0030-drops-33752},
  doi =		{10.4230/DagRep.1.11.1},
  annote =	{Keywords: Embedded systems, real-time systems, control, composition, system integration, design automation, model-driven development, validation \& verification}
}
@Article{elden_et_al:DagRep.1.11.23,
  author =	{Elden, Lars and Frommer, Andreas},
  title =	{{Data Mining, Networks and Dynamics (Dagstuhl Seminar 11451)}},
  pages =	{23--38},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2012},
  volume =	{1},
  number =	{11},
  editor =	{Elden, Lars and Frommer, Andreas},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.1.11.23},
  URN =		{urn:nbn:de:0030-drops-33765},
  doi =		{10.4230/DagRep.1.11.23},
  annote =	{Keywords: dynamic networks, data mining, optimization on manifolds, iterative methods, graph algorithms, network models in applications}
}
@Article{latora_et_al:DagRep.1.11.39,
  author =	{Latora, Vito and Mascolo, Cecilia and Musolesi, Mirco},
  title =	{{Analysis of Dynamic Social and Technological Networks (Dagstuhl Seminar 11452)}},
  pages =	{39--49},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2012},
  volume =	{1},
  number =	{11},
  editor =	{Latora, Vito and Mascolo, Cecilia and Musolesi, Mirco},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.1.11.39},
  URN =		{urn:nbn:de:0030-drops-33744},
  doi =		{10.4230/DagRep.1.11.39},
  annote =	{Keywords: complex networks, network analysis, network data mining}
}
@Article{rosenthal_et_al:DagRep.1.11.50,
  author =	{Rosenthal, Joachim and Shokrollahi, M. Amin and Walker, Judy L.},
  title =	{{Coding Theory (Dagstuhl Seminar 11461)}},
  pages =	{50--65},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2012},
  volume =	{1},
  number =	{11},
  editor =	{Rosenthal, Joachim and Shokrollahi, M. Amin and Walker, Judy L.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.1.11.50},
  URN =		{urn:nbn:de:0030-drops-33770},
  doi =		{10.4230/DagRep.1.11.50},
  annote =	{Keywords: Algebraic coding theory, complexity theory, cryptography, graph theory, graph based codes, information theory, randomized algorithms, networking}
}
@Article{bruhn_et_al:DagRep.1.11.66,
  author =	{Bruhn, Andr\'{e}s and Pock, Thomas and Tai, Xue-Cheng},
  title =	{{Efficient Algorithms for Global Optimisation Methods in Computer Vision (Dagstuhl Seminar 11471)}},
  pages =	{66--90},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2012},
  volume =	{1},
  number =	{11},
  editor =	{Bruhn, Andr\'{e}s and Pock, Thomas and Tai, Xue-Cheng},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.1.11.66},
  URN =		{urn:nbn:de:0030-drops-33789},
  doi =		{10.4230/DagRep.1.11.66},
  annote =	{Keywords: Computer Vision, Modelling, Mathematical Foundations, Data Structures, Efficient Algorithms, Parallel Computing}
}
@Article{amann_et_al:DagRep.1.11.91,
  author =	{A{\ss}mann, Uwe and Bencomo, Nelly and Cheng, Betty H. C. and France, Robert B.},
  title =	{{Models@run.time (Dagstuhl Seminar 11481)}},
  pages =	{91--123},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2012},
  volume =	{1},
  number =	{11},
  editor =	{A{\ss}mann, Uwe and Bencomo, Nelly and Cheng, Betty H. C. and France, Robert B.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.1.11.91},
  URN =		{urn:nbn:de:0030-drops-33794},
  doi =		{10.4230/DagRep.1.11.91},
  annote =	{Keywords: Self-adaptive Systems, Feedback Loop, Assurance, Uncertainty, Requirements, Optimization, Adaptation}
}

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