BibTeX Export for Dagstuhl Reports, Volume 6, Issue 11

Copy to Clipboard Download

@Article{DagRep.6.11,
  title =	{{Dagstuhl Reports, Volume 6, Issue 11, November 2016, Complete Issue}},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2017},
  volume =	{6},
  number =	{11},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.6.11},
  URN =		{urn:nbn:de:0030-drops-71132},
  doi =		{10.4230/DagRep.6.11},
  annote =	{Keywords: Dagstuhl Reports, Volume 6, Issue 11, November 2016, Complete Issue}
}
@Article{DagRep.6.11.i,
  title =	{{Dagstuhl Reports, Table of Contents, Volume 6, Issue 11, 2016}},
  pages =	{i--ii},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2017},
  volume =	{6},
  number =	{11},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.6.11.i},
  URN =		{urn:nbn:de:0030-drops-71122},
  doi =		{10.4230/DagRep.6.11.i},
  annote =	{Keywords: Dagstuhl Reports, Table of Contents, Volume 6, Issue 11, 2016}
}
@Article{lewenstein_et_al:DagRep.6.11.1,
  author =	{Lewenstein, Moshe and Pettie, Seth and Vassilevska Williams, Virginia},
  title =	{{Structure and Hardness in P (Dagstuhl Seminar 16451)}},
  pages =	{1--34},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2017},
  volume =	{6},
  number =	{11},
  editor =	{Lewenstein, Moshe and Pettie, Seth and Vassilevska Williams, Virginia},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.6.11.1},
  URN =		{urn:nbn:de:0030-drops-70373},
  doi =		{10.4230/DagRep.6.11.1},
  annote =	{Keywords: Algorithmic equivalences, Classifying P, Hardness assumptions, Lower bounds}
}
@Article{hong_et_al:DagRep.6.11.35,
  author =	{Hong, Sok-Hee and Kaufmann, Michael and Kobourov, Stephen G. and Pach, J\'{a}nos},
  title =	{{Beyond-Planar Graphs: Algorithmics and Combinatorics (Dagstuhl Seminar 16452)}},
  pages =	{35--62},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2017},
  volume =	{6},
  number =	{11},
  editor =	{Hong, Sok-Hee and Kaufmann, Michael and Kobourov, Stephen G. and Pach, J\'{a}nos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.6.11.35},
  URN =		{urn:nbn:de:0030-drops-70385},
  doi =		{10.4230/DagRep.6.11.35},
  annote =	{Keywords: graph drawing, graph algorithms, graph theory, geometric algorithms, combinatorial geometry, visualization}
}
@Article{moore_et_al:DagRep.6.11.63,
  author =	{Moore, Tyler W. and Probst, Christian W. and Rannenberg, Kai and van Eeten, Michel},
  title =	{{Assessing ICT Security Risks in Socio-Technical Systems (Dagstuhl Seminar 16461)}},
  pages =	{63--89},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2017},
  volume =	{6},
  number =	{11},
  editor =	{Moore, Tyler W. and Probst, Christian W. and Rannenberg, Kai and van Eeten, Michel},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.6.11.63},
  URN =		{urn:nbn:de:0030-drops-70390},
  doi =		{10.4230/DagRep.6.11.63},
  annote =	{Keywords: economics of risk assessment, human factor, return on security investment, security risk management, socio-technical security}
}
@Article{guillemot_et_al:DagRep.6.11.90,
  author =	{Guillemot, Christine and Plonka-Hoch, Gerlind and Pock, Thomas and Weickert, Joachim},
  title =	{{Inpainting-Based Image Compression (Dagstuhl Seminar 16462)}},
  pages =	{90--107},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2017},
  volume =	{6},
  number =	{11},
  editor =	{Guillemot, Christine and Plonka-Hoch, Gerlind and Pock, Thomas and Weickert, Joachim},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.6.11.90},
  URN =		{urn:nbn:de:0030-drops-70406},
  doi =		{10.4230/DagRep.6.11.90},
  annote =	{Keywords: approximation, inpainting, interpolation, lossy image compression, optimisation, partial differential equations (PDEs), sparsity}
}
@Article{alglave_et_al:DagRep.6.11.108,
  author =	{Alglave, Jade and Cousot, Patrick and Urban, Caterina},
  title =	{{Concurrency with Weak Memory Models (Dagstuhl Seminar 16471)}},
  pages =	{108--128},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2017},
  volume =	{6},
  number =	{11},
  editor =	{Alglave, Jade and Cousot, Patrick and Urban, Caterina},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.6.11.108},
  URN =		{urn:nbn:de:0030-drops-70415},
  doi =		{10.4230/DagRep.6.11.108},
  annote =	{Keywords: Compilation, Computer Memory, Concurrency, Memory Barrier, Memory Ordering, Micro-Architecture, Multiprocessor, Out-of-Order Execution, Parallelism, Program Synthesis, Programming Language, Semantics, Static Analysis, Verification, Weak Memory Model}
}
@Article{fiedler_et_al:DagRep.6.11.129,
  author =	{Fiedler, Markus and M\"{o}ller, Sebastian and Reichl, Peter and Xie, Min},
  title =	{{QoE Vadis? (Dagstuhl Perspectives Workshop 16472)}},
  pages =	{129--141},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2017},
  volume =	{6},
  number =	{11},
  editor =	{Fiedler, Markus and M\"{o}ller, Sebastian and Reichl, Peter and Xie, Min},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.6.11.129},
  URN =		{urn:nbn:de:0030-drops-71056},
  doi =		{10.4230/DagRep.6.11.129},
  annote =	{Keywords: multimedia, network and application management, network quality monitoring and measurement, quality of experience, socio-economic and business aspects user experience}
}
@Article{gretton_et_al:DagRep.6.11.142,
  author =	{Gretton, Arthur and Hennig, Philipp and Rasmussen, Carl Edward and Sch\"{o}lkopf, Bernhard},
  title =	{{New Directions for Learning with Kernels and Gaussian Processes (Dagstuhl Seminar 16481)}},
  pages =	{142--167},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2017},
  volume =	{6},
  number =	{11},
  editor =	{Gretton, Arthur and Hennig, Philipp and Rasmussen, Carl Edward and Sch\"{o}lkopf, Bernhard},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.6.11.142},
  URN =		{urn:nbn:de:0030-drops-71064},
  doi =		{10.4230/DagRep.6.11.142},
  annote =	{Keywords: gaussian processes, kernel methods, machine learning, probabilistic numerics, probabilistic programming}
}
@Article{gaubert_et_al:DagRep.6.11.168,
  author =	{Gaubert, St\'{e}phane and Grigoriev, Dima and Joswig, Michael and Theobald, Thorsten},
  title =	{{Algorithms and Effectivity in Tropical Mathematics and Beyond (Dagstuhl Seminar 16482)}},
  pages =	{168--184},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2017},
  volume =	{6},
  number =	{11},
  editor =	{Gaubert, St\'{e}phane and Grigoriev, Dima and Joswig, Michael and Theobald, Thorsten},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.6.11.168},
  URN =		{urn:nbn:de:0030-drops-71073},
  doi =		{10.4230/DagRep.6.11.168},
  annote =	{Keywords: Algorithms in tropical mathematics, complexity, effective bounds, optimization, zero-sum games}
}

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

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail