Dagstuhl Reports, Volume 8, Issue 1



Thumbnail PDF

Publication Details


Access Numbers

Documents

No documents found matching your filter selection.
Document
Complete Issue
Dagstuhl Reports, Volume 8, Issue 1, January 2018, Complete Issue

Abstract
Dagstuhl Reports, Volume 8, Issue 1, January 2018, Complete Issue

Cite as

Dagstuhl Reports, Volume 8, Issue 1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)


Copy BibTex To Clipboard

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

Abstract
Table of Contents, Frontmatter

Cite as

Dagstuhl Reports, Volume 8, Issue 1, pp. i-ii, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)


Copy BibTex To Clipboard

@Article{DagRep.8.1.i,
  title =	{{Dagstuhl Reports, Table of Contents, Volume 8, Issue 1, 2018}},
  pages =	{i--ii},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2018},
  volume =	{8},
  number =	{1},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.8.1.i},
  URN =		{urn:nbn:de:0030-drops-97345},
  doi =		{10.4230/DagRep.8.1.i},
  annote =	{Keywords: Dagstuhl Reports, Table of Contents, Volume 8, Issue 1, 2018}
}
Document
Symmetric Cryptography (Dagstuhl Seminar 18021)

Authors: Joan Daemen, Tetsu Iwata, Nils Gregor Leander, and Kaisa Nyberg


Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 18021 "Symmetric Cryptography", which was held on January 7-12, 2018 in Schloss Dagstuhl - Leibniz Center for Informatics. The seminar was the sixth in a series of Dagstuhl seminars on "Symmetric Cryptography", previously held in 2007, 2009, 2012, 2014, and 2016. During the seminar, many of the participants presented their current research in the design, analysis, and application of symmetric cryptographic algorithms, including ongoing work and open problems. This report documents the abstracts or extended abstracts of the talks presented during the seminar, as well as summaries of the discussion sessions.

Cite as

Joan Daemen, Tetsu Iwata, Nils Gregor Leander, and Kaisa Nyberg. Symmetric Cryptography (Dagstuhl Seminar 18021). In Dagstuhl Reports, Volume 8, Issue 1, pp. 1-32, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)


Copy BibTex To Clipboard

@Article{daemen_et_al:DagRep.8.1.1,
  author =	{Daemen, Joan and Iwata, Tetsu and Leander, Nils Gregor and Nyberg, Kaisa},
  title =	{{Symmetric Cryptography (Dagstuhl Seminar 18021)}},
  pages =	{1--32},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2018},
  volume =	{8},
  number =	{1},
  editor =	{Daemen, Joan and Iwata, Tetsu and Leander, Nils Gregor and Nyberg, Kaisa},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.8.1.1},
  URN =		{urn:nbn:de:0030-drops-92832},
  doi =		{10.4230/DagRep.8.1.1},
  annote =	{Keywords: symmetric cryptography, cryptanalysis, authenticated encryption, cryptography for IoT, mass surveillance}
}
Document
Personalized Multiobjective Optimization: An Analytics Perspective (Dagstuhl Seminar 18031)

Authors: Kathrin Klamroth, Joshua D. Knowles, Günter Rudolph, and Margaret M. Wiecek


Abstract
The Dagstuhl Seminar 18031 Personalization in Multiobjective Optimization: An Analytics Perspective carried on a series of five previous Dagstuhl Seminars (04461, 06501, 09041, 12041 and 15031) that were focused on Multiobjective Optimization. The continuing goal of this series is to strengthen the links between the Evolutionary Multiobjective Optimization (EMO) and the Multiple Criteria Decision Making (MCDM) communities, two of the largest communities concerned with multiobjective optimization today. Personalization in Multiobjective Optimization, the topic of this seminar, was motivated by the scientific challenges generated by personalization, mass customization, and mass data, and thus crosslinks application challenges with research domains integrating all aspects of EMO and MCDM. The outcome of the seminar was a new perspective on the opportunities as well as the research requirements for multiobjective optimization in the thriving fields of data analytics and personalization. Several multi-disciplinary research projects and new collaborations were initiated during the seminar, further interlacing the two communities of EMO and MCDM.

Cite as

Kathrin Klamroth, Joshua D. Knowles, Günter Rudolph, and Margaret M. Wiecek. Personalized Multiobjective Optimization: An Analytics Perspective (Dagstuhl Seminar 18031). In Dagstuhl Reports, Volume 8, Issue 1, pp. 33-99, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)


Copy BibTex To Clipboard

@Article{klamroth_et_al:DagRep.8.1.33,
  author =	{Klamroth, Kathrin and Knowles, Joshua D. and Rudolph, G\"{u}nter and Wiecek, Margaret M.},
  title =	{{Personalized Multiobjective Optimization: An Analytics Perspective (Dagstuhl Seminar 18031)}},
  pages =	{33--99},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2018},
  volume =	{8},
  number =	{1},
  editor =	{Klamroth, Kathrin and Knowles, Joshua D. and Rudolph, G\"{u}nter and Wiecek, Margaret M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.8.1.33},
  URN =		{urn:nbn:de:0030-drops-92846},
  doi =		{10.4230/DagRep.8.1.33},
  annote =	{Keywords: multiple criteria decision making, evolutionary multiobjective optimization}
}
Document
Foundations of Data Visualization (Dagstuhl Seminar 18041)

Authors: Helwig Hauser, Penny Rheingans, and Gerik Scheuermann


Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 18041 "Foundations of Data Visualization". It includes a discussion of the motivation and overall organization, an abstract from each of the participants, and a report about each of the working groups.

Cite as

Helwig Hauser, Penny Rheingans, and Gerik Scheuermann. Foundations of Data Visualization (Dagstuhl Seminar 18041). In Dagstuhl Reports, Volume 8, Issue 1, pp. 100-123, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)


Copy BibTex To Clipboard

@Article{hauser_et_al:DagRep.8.1.100,
  author =	{Hauser, Helwig and Rheingans, Penny and Scheuermann, Gerik},
  title =	{{Foundations of Data Visualization (Dagstuhl Seminar 18041)}},
  pages =	{100--123},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2018},
  volume =	{8},
  number =	{1},
  editor =	{Hauser, Helwig and Rheingans, Penny and Scheuermann, Gerik},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.8.1.100},
  URN =		{urn:nbn:de:0030-drops-92853},
  doi =		{10.4230/DagRep.8.1.100},
  annote =	{Keywords: Foundations, Interdisciplinary Cooperation, Theory, Visualization}
}
Document
Proof Complexity (Dagstuhl Seminar 18051)

Authors: Albert Atserias, Jakob Nordström, Pavel Pudlák, and Rahul Santhanam


Abstract
The study of proof complexity was initiated in [Cook and Reckhow 1979] as a way to attack the P vs.NP problem, and in the ensuing decades many powerful techniques have been discovered for analyzing different proof systems. Proof complexity also gives a way of studying subsystems of Peano Arithmetic where the power of mathematical reasoning is restricted, and to quantify how complex different mathematical theorems are measured in terms of the strength of the methods of reasoning required to establish their validity. Moreover, it allows to analyse the power and limitations of satisfiability algorithms (SAT solvers) used in industrial applications with formulas containing up to millions of variables. During the last 10--15 years the area of proof complexity has seen a revival with many exciting results, and new connections have also been revealed with other areas such as, e.g., cryptography, algebraic complexity theory, communication complexity, and combinatorial optimization. While many longstanding open problems from the 1980s and 1990s still remain unsolved, recent progress gives hope that the area may be ripe for decisive breakthroughs. This workshop, gathering researchers from different strands of the proof complexity community, gave opportunities to take stock of where we stand and discuss the way ahead.

Cite as

Albert Atserias, Jakob Nordström, Pavel Pudlák, and Rahul Santhanam. Proof Complexity (Dagstuhl Seminar 18051). In Dagstuhl Reports, Volume 8, Issue 1, pp. 124-157, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)


Copy BibTex To Clipboard

@Article{atserias_et_al:DagRep.8.1.124,
  author =	{Atserias, Albert and Nordstr\"{o}m, Jakob and Pudl\'{a}k, Pavel and Santhanam, Rahul},
  title =	{{Proof Complexity (Dagstuhl Seminar 18051)}},
  pages =	{124--157},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2018},
  volume =	{8},
  number =	{1},
  editor =	{Atserias, Albert and Nordstr\"{o}m, Jakob and Pudl\'{a}k, Pavel and Santhanam, Rahul},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.8.1.124},
  URN =		{urn:nbn:de:0030-drops-92864},
  doi =		{10.4230/DagRep.8.1.124},
  annote =	{Keywords: bounded arithmetic, computational complexity, logic, proof complexity, satisfiability algorithms}
}
Document
Genetic Improvement of Software (Dagstuhl Seminar 18052)

Authors: Justyna Petke, Claire Le Goues, Stephanie Forrest, and William B. Langdon


Abstract
We document the program and the immediate outcomes of Dagstuhl Seminar 18052 "Genetic Improvement of Software". The seminar brought together researchers in Genetic Improvement (GI) and related areas of software engineering to investigate what is achievable with current technology and the current impediments to progress and how GI can affect the software development process. Several talks covered the state-of-the-art and work in progress. Seven emergent topics have been identified ranging from the nature of the GI search space through benchmarking and practical applications. The seminar has already resulted in multiple research paper publications. Four by participants of the seminar will be presented at the GI workshop co-located with the top conference in software engineering - ICSE. Several researchers started new collaborations, results of which we hope to see in the near future.

Cite as

Justyna Petke, Claire Le Goues, Stephanie Forrest, and William B. Langdon. Genetic Improvement of Software (Dagstuhl Seminar 18052). In Dagstuhl Reports, Volume 8, Issue 1, pp. 158-182, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)


Copy BibTex To Clipboard

@Article{petke_et_al:DagRep.8.1.158,
  author =	{Petke, Justyna and Le Goues, Claire and Forrest, Stephanie and Langdon, William B.},
  title =	{{Genetic Improvement of Software (Dagstuhl Seminar 18052)}},
  pages =	{158--182},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2018},
  volume =	{8},
  number =	{1},
  editor =	{Petke, Justyna and Le Goues, Claire and Forrest, Stephanie and Langdon, William B.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.8.1.158},
  URN =		{urn:nbn:de:0030-drops-92878},
  doi =		{10.4230/DagRep.8.1.158},
  annote =	{Keywords: genetic improvement GI, search-based software engineering SBSE, software optimisation, evolutionary improvement, automated software improvement, automated program repair, evolutionary computation, genetic programming, GP}
}

Filters