BibTeX Export for Dagstuhl Reports, Volume 1, Issue 10

Copy to Clipboard Download

@Article{DagRep.1.10,
  title =	{{Dagstuhl Reports, Volume 1, Issue 10, October 2011, Complete Issue}},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2012},
  volume =	{1},
  number =	{10},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.1.10},
  URN =		{urn:nbn:de:0030-drops-33826},
  doi =		{10.4230/DagRep.1.10},
  annote =	{Keywords: Dagstuhl Reports, Volume 1, Issue 10, October 2011, Complete Issue}
}
@Article{DagRep.1.10.i,
  title =	{{Dagstuhl Reports, Table of Contents, Volume 1, Issue 10, 2011}},
  pages =	{i--ii},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2012},
  volume =	{1},
  number =	{10},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.1.10.i},
  URN =		{urn:nbn:de:0030-drops-33812},
  doi =		{10.4230/DagRep.1.10.i},
  annote =	{Keywords: Table of Contents, Frontmatter}
}
@Article{freiling_et_al:DagRep.1.10.1,
  author =	{Freiling, Felix C. and Heckmann, Dirk and Polc\'{a}k, Radim and Posegga, Joachim},
  title =	{{Forensic Computing (Dagstuhl Seminar 11401)}},
  pages =	{1--13},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2012},
  volume =	{1},
  number =	{10},
  editor =	{Freiling, Felix C. and Heckmann, Dirk and Polc\'{a}k, Radim and Posegga, Joachim},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.1.10.1},
  URN =		{urn:nbn:de:0030-drops-33691},
  doi =		{10.4230/DagRep.1.10.1},
  annote =	{Keywords: forensic teaching; practical experience in forensics and law; selective imaging; mobile phone forensics; cryptographic hash functions}
}
@Article{berger_et_al:DagRep.1.10.14,
  author =	{Berger, Ulrich and Brattka, Vasco and Selivanov, Victor and Spreen, Dieter and Tsuiki, Hideki},
  title =	{{Computing with Infinite Data: Topological and Logical Foundations (Dagstuhl Seminar 11411)}},
  pages =	{14--36},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2012},
  volume =	{1},
  number =	{10},
  editor =	{Berger, Ulrich and Brattka, Vasco and Selivanov, Victor and Spreen, Dieter and Tsuiki, Hideki},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.1.10.14},
  URN =		{urn:nbn:de:0030-drops-33721},
  doi =		{10.4230/DagRep.1.10.14},
  annote =	{Keywords: Exact real number computation, Stream computation, Infinite computations, Computability in analysis, Hierarchies, Reducibility, Topological complexity}
}
@Article{abiteboul_et_al:DagRep.1.10.37,
  author =	{Abiteboul, Serge and Deutsch, Alin and Schwentick, Thomas and Segoufin, Luc},
  title =	{{Foundations of distributed data management (Dagstuhl Seminar 11421)}},
  pages =	{37--57},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2012},
  volume =	{1},
  number =	{10},
  editor =	{Abiteboul, Serge and Deutsch, Alin and Schwentick, Thomas and Segoufin, Luc},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.1.10.37},
  URN =		{urn:nbn:de:0030-drops-33737},
  doi =		{10.4230/DagRep.1.10.37},
  annote =	{Keywords: XML Query language, Distribution, Incompleteness}
}

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