Issue

Dagstuhl Reports, Volume 1, Issue 2



Thumbnail PDF

Publication Details


Access Numbers

Documents

No documents found matching your filter selection.
Document
Complete Issue
Dagstuhl Reports, Volume 1, Issue 2, February 2011, Complete Issue

Abstract
Dagstuhl Reports, Volume 1, Issue 2, February 2011, Complete Issue

Cite as

Dagstuhl Reports, Volume 1, Issue 2, February 2011, Complete Issue. In Dagstuhl Reports, Volume 1, Issue 2, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2011)


Copy BibTex To Clipboard

@Article{DagRep.1.2,
  title =	{{Dagstuhl Reports, Volume 1, Issue 2, February 2011, Complete Issue}},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2011},
  volume =	{1},
  number =	{2},
  editor =	{},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.1.2},
  URN =		{urn:nbn:de:0030-drops-32091},
  doi =		{10.4230/DagRep.1.2},
  annote =	{Keywords: Dagstuhl Reports, Volume 1, Issue 2, February 2011, Complete Issue}
}
Document
Front Matter
Dagstuhl Reports, Table of Contents, Volume 1, Issue 2, 2011

Abstract
Table of Contents, Frontmatter

Cite as

Dagstuhl Reports, Table of Contents, Volume 1, Issue 2, 2011. In Dagstuhl Reports, Volume 1, Issue 2, pp. i-ii, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2011)


Copy BibTex To Clipboard

@Article{DagRep.1.2.i,
  title =	{{Dagstuhl Reports, Table of Contents, Volume 1, Issue 2, 2011}},
  pages =	{i--ii},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2011},
  volume =	{1},
  number =	{2},
  editor =	{},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.1.2.i},
  URN =		{urn:nbn:de:0030-drops-31922},
  doi =		{10.4230/DagRep.1.2.i},
  annote =	{Keywords: Table of Contents, Frontmatter}
}
Document
Online Privacy: Towards Informational Self-Determination on the Internet (Dagstuhl Perspectives Workshop 11061)

Authors: Simone Fischer-Hübner, Chris Hoofnagle, Kai Rannenberg, Michael Waidner, Ioannis Krontiris, and Michael Marhöfer


Abstract
The Dagstuhl Perspectives Workshop "Online Privacy: Towards Informational Self-Determination on the Internet" (11061) has been held in February 6-11, 2011 at Schloss Dagstuhl. 30 participants from academia, public sector, and industry have identified the current status-of-the-art of and challenges for online privacy as well as derived recommendations for improving online privacy. Whereas the Dagstuhl Manifesto of this workshop concludes the results of the working groups and panel discussions, this article presents the talks of this workshop by their abstracts.

Cite as

Simone Fischer-Hübner, Chris Hoofnagle, Kai Rannenberg, Michael Waidner, Ioannis Krontiris, and Michael Marhöfer. Online Privacy: Towards Informational Self-Determination on the Internet (Dagstuhl Perspectives Workshop 11061). In Dagstuhl Reports, Volume 1, Issue 2, pp. 1-15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2011)


Copy BibTex To Clipboard

@Article{fischerhubner_et_al:DagRep.1.2.1,
  author =	{Fischer-H\"{u}bner, Simone and Hoofnagle, Chris and Rannenberg, Kai and Waidner, Michael and Krontiris, Ioannis and Marh\"{o}fer, Michael},
  title =	{{Online Privacy: Towards Informational Self-Determination on the Internet (Dagstuhl Perspectives Workshop 11061)}},
  pages =	{1--15},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2011},
  volume =	{1},
  number =	{2},
  editor =	{Fischer-H\"{u}bner, Simone and Hoofnagle, Chris and Rannenberg, Kai and Waidner, Michael and Krontiris, Ioannis and Marh\"{o}fer, Michael},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.1.2.1},
  URN =		{urn:nbn:de:0030-drops-31515},
  doi =		{10.4230/DagRep.1.2.1},
  annote =	{Keywords: Online privacy, Data protection, Data security, Data loss prevention, Informational self-determination, Web 2.0, (mobile) Internet}
}
Document
Self-Repairing Programs (Dagstuhl Seminar 11062)

Authors: Mauro Pezzè, Martin C. Rinard, Westley Weimer, and Andreas Zeller


Abstract
Dagstuhl seminar 11062 ``Self-Repairing Programs'' included 23 participants and organizers from research and industrial communities. Self-Repairing Programs are a new and emerging area, and many participants reported that they initially felt their first research home to be in another area, such as testing, program synthesis, debugging, self-healing systems, or security. Over the course of the seminar, the participants found common ground in discussions of concerns, challenges, and the state of the art.

Cite as

Mauro Pezzè, Martin C. Rinard, Westley Weimer, and Andreas Zeller. Self-Repairing Programs (Dagstuhl Seminar 11062). In Dagstuhl Reports, Volume 1, Issue 2, pp. 16-29, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2011)


Copy BibTex To Clipboard

@Article{pezze_et_al:DagRep.1.2.16,
  author =	{Pezz\`{e}, Mauro and Rinard, Martin C. and Weimer, Westley and Zeller, Andreas},
  title =	{{Self-Repairing Programs (Dagstuhl Seminar 11062)}},
  pages =	{16--29},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2011},
  volume =	{1},
  number =	{2},
  editor =	{Pezz\`{e}, Mauro and Rinard, Martin C. and Weimer, Westley and Zeller, Andreas},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.1.2.16},
  URN =		{urn:nbn:de:0030-drops-31525},
  doi =		{10.4230/DagRep.1.2.16},
  annote =	{Keywords: Automated program repair, contract, debugging, fault, patch, self-healing}
}
Document
Theory and Applications of Graph Searching Problems (GRASTA 2011) (Dagstuhl Seminar 11071)

Authors: Fedor V. Fomin, Pierre Fraigniaud, Stephan Kreutzer, and Dimitrios M. Thilikos


Abstract
From February 14, 2012 to February 18, 2012, the Dagstuhl Seminar 11071 ``Theory and Applications of Graph Searching Problems (GRASTA 2011)'' was held in Schloss Dagstuhl~--~Leibniz Center for Informatics. During the seminar, participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and open problems are put together in this paper. The first section describes the seminar topics and goals in general. The second section contains the abstracts of the talks and the third section includes the open problems presented during the seminar.

Cite as

Fedor V. Fomin, Pierre Fraigniaud, Stephan Kreutzer, and Dimitrios M. Thilikos. Theory and Applications of Graph Searching Problems (GRASTA 2011) (Dagstuhl Seminar 11071). In Dagstuhl Reports, Volume 1, Issue 2, pp. 30-46, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2011)


Copy BibTex To Clipboard

@Article{fomin_et_al:DagRep.1.2.30,
  author =	{Fomin, Fedor V. and Fraigniaud, Pierre and Kreutzer, Stephan and Thilikos, Dimitrios M.},
  title =	{{Theory and Applications of Graph Searching Problems  (GRASTA 2011) (Dagstuhl Seminar 11071)}},
  pages =	{30--46},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2011},
  volume =	{1},
  number =	{2},
  editor =	{Fomin, Fedor V. and Fraigniaud, Pierre and Kreutzer, Stephan and Thilikos, Dimitrios M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.1.2.30},
  URN =		{urn:nbn:de:0030-drops-31534},
  doi =		{10.4230/DagRep.1.2.30},
  annote =	{Keywords: Graph Searching, Pursuit Evasion Games, Cop and Robers Games, Fugitive Search Games}
}
Document
Combinatorial and Algorithmic Aspects of Sequence Processing (Dagstuhl Seminar 11081)

Authors: Maxime Crochemore, Lila Kari, Mehryar Mohri, and Dirk Nowotka


Abstract
Sequences form the most basic and natural data structure. They occur whenever information is electronically transmitted (as bit streams), when natural language text is spoken or written down (as words over, for example, the latin alphabet), in the process of heredity transmission in living cells (as DNA sequence) or the protein synthesis (as sequence of amino acids), and in many more different contexts. Given this universal form of representing information, the need to process strings is apparent and actually a core purpose of computer use. Algorithms to efficiently search through, analyze, (de-)compress, match, learn, and encode/decode strings are therefore of chief interest. Combinatorial problems about strings lie at the core of such algorithmic questions. Many such combinatorial problems are common in the string processing efforts in the different fields of application. Scientists working in the fields of Combinatorics on Words, Computational Biology, Stringology, Natural Computing, and Machine Learning were invited to consider the seminar's topic from a~wide range of perspectives. This report documents the program and the outcomes of Dagstuhl Seminar 11081 ``Combinatorial and Algorithmic Aspects of Sequence Processing''.

Cite as

Maxime Crochemore, Lila Kari, Mehryar Mohri, and Dirk Nowotka. Combinatorial and Algorithmic Aspects of Sequence Processing (Dagstuhl Seminar 11081). In Dagstuhl Reports, Volume 1, Issue 2, pp. 47-66, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2011)


Copy BibTex To Clipboard

@Article{crochemore_et_al:DagRep.1.2.47,
  author =	{Crochemore, Maxime and Kari, Lila and Mohri, Mehryar and Nowotka, Dirk},
  title =	{{Combinatorial and Algorithmic Aspects of Sequence Processing (Dagstuhl Seminar 11081)}},
  pages =	{47--66},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2011},
  volume =	{1},
  number =	{2},
  editor =	{Crochemore, Maxime and Kari, Lila and Mohri, Mehryar and Nowotka, Dirk},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.1.2.47},
  URN =		{urn:nbn:de:0030-drops-31554},
  doi =		{10.4230/DagRep.1.2.47},
  annote =	{Keywords: Combinatorics on words, computational biology, stringology, natural computing, machine learning}
}
Document
Packing and Scheduling Algorithms for Information and Communication Services (Dagstuhl Seminar 11091)

Authors: Klaus Jansen, Claire Matieu, Hadas Shachnai, and Neal E. Young


Abstract
From 27.02.2011 to 4.03.2011, the Dagstuhl Seminar 11091 ``Packing and Scheduling Algorithms for Information and Communication Services'' was held in Schloss Dagstuhl Leibniz Center for Informatics. During the seminar, several participants presented their current research, and on-going work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.

Cite as

Klaus Jansen, Claire Matieu, Hadas Shachnai, and Neal E. Young. Packing and Scheduling Algorithms for Information and Communication Services (Dagstuhl Seminar 11091). In Dagstuhl Reports, Volume 1, Issue 2, pp. 67-93, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2011)


Copy BibTex To Clipboard

@Article{jansen_et_al:DagRep.1.2.67,
  author =	{Jansen, Klaus and Matieu, Claire and Shachnai, Hadas and Young, Neal E.},
  title =	{{Packing and Scheduling Algorithms for Information and Communication Services (Dagstuhl Seminar 11091)}},
  pages =	{67--93},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2011},
  volume =	{1},
  number =	{2},
  editor =	{Jansen, Klaus and Matieu, Claire and Shachnai, Hadas and Young, Neal E.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.1.2.67},
  URN =		{urn:nbn:de:0030-drops-31579},
  doi =		{10.4230/DagRep.1.2.67},
  annote =	{Keywords: Packing, scheduling, information and communication services, combinatorial optimization, mathematical programming, parameterized complexity}
}

Filters


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