BibTeX Export for Dagstuhl Reports, Volume 8, Issue 3

Copy to Clipboard Download

@Article{DagRep.8.3,
  title =	{{Dagstuhl Reports, Volume 8, Issue 3, March 2018, Complete Issue}},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2018},
  volume =	{8},
  number =	{3},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.8.3},
  URN =		{urn:nbn:de:0030-drops-97399},
  doi =		{10.4230/DagRep.8.3},
  annote =	{Keywords: Dagstuhl Reports, Volume 8, Issue 3, March 2018, Complete Issue}
}
@Article{DagRep.8.3.i,
  title =	{{Dagstuhl Reports, Table of Contents, Volume 8, Issue 3, 2018}},
  pages =	{i--ii},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2018},
  volume =	{8},
  number =	{3},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.8.3.i},
  URN =		{urn:nbn:de:0030-drops-97386},
  doi =		{10.4230/DagRep.8.3.i},
  annote =	{Keywords: Dagstuhl Reports, Table of Contents, Volume 8, Issue 3, 2018}
}
@Article{halldorson_et_al:DagRep.8.3.1,
  author =	{Halld\'{o}rson, Magn\'{u}s M. and Megow, Nicole and Stein, Clifford},
  title =	{{Scheduling (Dagstuhl Seminar 18101)}},
  pages =	{1--20},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2018},
  volume =	{8},
  number =	{3},
  editor =	{Halld\'{o}rson, Magn\'{u}s M. and Megow, Nicole and Stein, Clifford},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.8.3.1},
  URN =		{urn:nbn:de:0030-drops-92942},
  doi =		{10.4230/DagRep.8.3.1},
  annote =	{Keywords: scheduling, optimization, approximation algorithms}
}
@Article{cominetti_et_al:DagRep.8.3.21,
  author =	{Cominetti, Roberto and Harks, Tobias and Osorio, Carolina and Peis, Britta},
  title =	{{Dynamic Traffic Models in Transportation Science (Dagstuhl Seminar 18102)}},
  pages =	{21--38},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2018},
  volume =	{8},
  number =	{3},
  editor =	{Cominetti, Roberto and Harks, Tobias and Osorio, Carolina and Peis, Britta},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.8.3.21},
  URN =		{urn:nbn:de:0030-drops-92954},
  doi =		{10.4230/DagRep.8.3.21},
  annote =	{Keywords: Algorithm and complexity of traffic equilibrium computation, dynamic traffic assignment models, Simulation and network optimization}
}
@Article{hack_et_al:DagRep.8.3.39,
  author =	{Hack, Sebastian and Kelly, Paul H. J. and Lengauer, Christian},
  title =	{{Loop Optimization (Dagstuhl Seminar 18111)}},
  pages =	{39--59},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2018},
  volume =	{8},
  number =	{3},
  editor =	{Hack, Sebastian and Kelly, Paul H. J. and Lengauer, Christian},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.8.3.39},
  URN =		{urn:nbn:de:0030-drops-92960},
  doi =		{10.4230/DagRep.8.3.39},
  annote =	{Keywords: Autotuning, dependence analysis, just-in-time (JIT), loop parallelization, parallel programming, polyhedron model}
}
@Article{loh_et_al:DagRep.8.3.60,
  author =	{Loh, Po-Ling and Mazumdar, Arya and Papailiopoulos, Dimitris and Urbanke, R\"{u}diger},
  title =	{{Coding Theory for Inference, Learning and Optimization (Dagstuhl Seminar 18112)}},
  pages =	{60--73},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2018},
  volume =	{8},
  number =	{3},
  editor =	{Loh, Po-Ling and Mazumdar, Arya and Papailiopoulos, Dimitris and Urbanke, R\"{u}diger},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.8.3.60},
  URN =		{urn:nbn:de:0030-drops-92977},
  doi =		{10.4230/DagRep.8.3.60},
  annote =	{Keywords: Coding theory, Distributed optimization, Machine learning, Threshold phenomena}
}
@Article{jansen_et_al:DagRep.8.3.74,
  author =	{Jansen, Nils and Katoen, Joost-Pieter and Kohli, Pusmeet and Kretinsky, Jan},
  title =	{{Machine Learning and Model Checking Join Forces (Dagstuhl Seminar 18121)}},
  pages =	{74--93},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2018},
  volume =	{8},
  number =	{3},
  editor =	{Jansen, Nils and Katoen, Joost-Pieter and Kohli, Pusmeet and Kretinsky, Jan},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.8.3.74},
  URN =		{urn:nbn:de:0030-drops-92988},
  doi =		{10.4230/DagRep.8.3.74},
  annote =	{Keywords: artificial intelligence, cyber-physical systems, formal methods, formal verification, logics, machine learning, model checking, quantitative verification, safety-critical systems}
}
@Article{adams_et_al:DagRep.8.3.94,
  author =	{Adams, Bram and Baudry, Benoit and Eldh, Sigrid and Zaidman, Andy},
  title =	{{Automatic Quality Assurance and Release (Dagstuhl Seminar 18122)}},
  pages =	{94--127},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2018},
  volume =	{8},
  number =	{3},
  editor =	{Adams, Bram and Baudry, Benoit and Eldh, Sigrid and Zaidman, Andy},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.8.3.94},
  URN =		{urn:nbn:de:0030-drops-92994},
  doi =		{10.4230/DagRep.8.3.94},
  annote =	{Keywords: DevOps, automated quality assurance, Continuous Integration, Continuous Deployment, software testing}
}

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