Issue

Dagstuhl Reports, Volume 8, Issue 6

Thumbnail PDF

Publication Details


Access Numbers

Documents

No documents found matching your filter selection.
Document
Complete Issue
DOI: 10.4230/DagRep.8.6
Dagstuhl Reports, Volume 8, Issue 6, June 2018, Complete Issue
Abstract
Dagstuhl Reports, Volume 8, Issue 6, June 2018, Complete Issue
Cite as

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

Copy BibTex To Clipboard

@Article{DagRep.8.6,
  title =	{{Dagstuhl Reports, Volume 8, Issue 6, June 2018, Complete Issue}},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2019},
  volume =	{8},
  number =	{6},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.8.6},
  URN =		{urn:nbn:de:0030-drops-101760},
  doi =		{10.4230/DagRep.8.6},
  annote =	{Keywords: Dagstuhl Reports, Volume 8, Issue 6, June 2018, Complete Issue}
}
Document
Front Matter
DOI: 10.4230/DagRep.8.6.i
Dagstuhl Reports, Table of Contents, Volume 8, Issue 6, 2018
Abstract
Table of Contents, Frontmatter
Cite as

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

Copy BibTex To Clipboard

@Article{DagRep.8.6.i,
  title =	{{Dagstuhl Reports, Table of Contents, Volume 8, Issue 6, 2018}},
  pages =	{i--ii},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2019},
  volume =	{8},
  number =	{6},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.8.6.i},
  URN =		{urn:nbn:de:0030-drops-101754},
  doi =		{10.4230/DagRep.8.6.i},
  annote =	{Keywords: Dagstuhl Reports, Table of Contents, Volume 8, Issue 6, 2018}
}
Document
DOI: 10.4230/DagRep.8.6.1
The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 18231)

Authors: Martin Grohe, Venkatesan Guruswami, and Stanislav Zivny

Abstract
Constraint satisfaction has always played a central role in computational complexity theory; appropriate versions of CSPs are classical complete problems for most standard complexity classes. CSPs constitute a very rich and yet sufficiently manageable class of problems to give a good perspective on general computational phenomena. For instance, they help to understand which mathematical properties make a computational problem tractable (in a wide sense, e.g., polynomial-time solvable, non-trivially approximable, fixed-parameter tractable, or definable in a weak logic). In the last decade, research activity in this area has significantly intensified and hugely impressive progress was made. The Dagstuhl Seminar 18231 "The Constraint Satisfaction Problem: Complexity and Approximability" was aimed at bringing together researchers using all the different techniques in the study of the CSP so that they can share their insights obtained during the past three years. This report documents the material presented during the course of the seminar.
Cite as

Martin Grohe, Venkatesan Guruswami, and Stanislav Zivny. The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 18231). In Dagstuhl Reports, Volume 8, Issue 6, pp. 1-18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)

Copy BibTex To Clipboard

@Article{grohe_et_al:DagRep.8.6.1,
  author =	{Grohe, Martin and Guruswami, Venkatesan and Zivny, Stanislav},
  title =	{{The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 18231)}},
  pages =	{1--18},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2018},
  volume =	{8},
  number =	{6},
  editor =	{Grohe, Martin and Guruswami, Venkatesan and Zivny, Stanislav},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.8.6.1},
  URN =		{urn:nbn:de:0030-drops-100251},
  doi =		{10.4230/DagRep.8.6.1},
  annote =	{Keywords: Constraint satisfaction problem (CSP); Computational complexity; CSP dichotomy conjecture; Hardness of approximation; Unique games conjecture; Parameterised complexity; Descriptive complexity; Universal algebra; Logic; Semidefinite programming}
}
Document
DOI: 10.4230/DagRep.8.6.19
High-Performance Graph Algorithms (Dagstuhl Seminar 18241)

Authors: Henning Meyerhenke, Richard Peng, and Ilya Safro

Abstract
This report documents the program and outcomes of Dagstuhl Seminar 18241 ``High-performance Graph Algorithms''. The seminar reflected the ongoing qualitative change how graph algorithms are used in practice due to (i) the complex structure of graphs in new and emerging applications, (ii) the size of typical inputs, and (iii) the computer systems with which graph problems are solved. This change is having a tremendous impact on the field of graph algorithms in terms of algorithm theory and implementation as well as hardware requirements and application areas. The seminar covered recent advances in all these aspects, trying to balance and mediate between theory and practice. The abstracts included in this report contain and survey recent state-of-the-art results, but also point to promising new directions for high-performance graph algorithms and their applications, both from a theoretical and a practical point of view.
Cite as

Henning Meyerhenke, Richard Peng, and Ilya Safro. High-Performance Graph Algorithms (Dagstuhl Seminar 18241). In Dagstuhl Reports, Volume 8, Issue 6, pp. 19-39, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)

Copy BibTex To Clipboard

@Article{meyerhenke_et_al:DagRep.8.6.19,
  author =	{Meyerhenke, Henning and Peng, Richard and Safro, Ilya},
  title =	{{High-Performance Graph Algorithms (Dagstuhl Seminar 18241)}},
  pages =	{19--39},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2018},
  volume =	{8},
  number =	{6},
  editor =	{Meyerhenke, Henning and Peng, Richard and Safro, Ilya},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.8.6.19},
  URN =		{urn:nbn:de:0030-drops-100475},
  doi =		{10.4230/DagRep.8.6.19},
  annote =	{Keywords: algorithm engineering, combinatorial scientific computing, graph algorithms, high-performance computing, theoretical computer science}
}
Document
DOI: 10.4230/DagRep.8.6.40
Secure Routing for the Internet (Dagstuhl Seminar 18242)

Authors: Philippa Gill, Adrian Perrig, and Matthias Wählisch

Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 18242 "Secure Routing for the Internet", which ran from Monday 11/6 (morning) to Wednesday 13/6 (noon), and employed 27 participants in total (including 3 network operators).
Cite as

Philippa Gill, Adrian Perrig, and Matthias Wählisch. Secure Routing for the Internet (Dagstuhl Seminar 18242). In Dagstuhl Reports, Volume 8, Issue 6, pp. 40-62, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)

Copy BibTex To Clipboard

@Article{gill_et_al:DagRep.8.6.40,
  author =	{Gill, Philippa and Perrig, Adrian and W\"{a}hlisch, Matthias},
  title =	{{Secure Routing for the Internet (Dagstuhl Seminar 18242)}},
  pages =	{40--62},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2019},
  volume =	{8},
  number =	{6},
  editor =	{Gill, Philippa and Perrig, Adrian and W\"{a}hlisch, Matthias},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.8.6.40},
  URN =		{urn:nbn:de:0030-drops-100927},
  doi =		{10.4230/DagRep.8.6.40},
  annote =	{Keywords: Anonymity, BGP, BGP Prefix Hijack, Denial of Service, Deployment Incentives, Detection, Monitoring, Network Operations, Privacy, Protocol, Public Key Infrastructure, Routing, Routing Policy, Routing Security, Testbed}
}
Document
DOI: 10.4230/DagRep.8.6.63
Database Architectures for Modern Hardware (Dagstuhl Seminar 18251)

Authors: Peter A. Boncz, Goetz Graefe, Binsheng He, and Kai-Uwe Sattler

Abstract
The requirements of emerging applications on the one hand and the trends in computing hardware and systems on the other hand demand a fundamental rethinking of current data management architectures. Based on the broad consensus that this rethinking requires expertise from different research disciplines, the goal of this seminar was to bring together researchers and practitioners from these areas representing both the software and hardware sides and to foster cross-cutting architectural discussions. The outcome of this seminar was not only an identification of promising hardware technologies and their exploitation in data management systems but also a set of use cases, studies, and experiments for new architectural concepts.
Cite as

Peter A. Boncz, Goetz Graefe, Binsheng He, and Kai-Uwe Sattler. Database Architectures for Modern Hardware (Dagstuhl Seminar 18251). In Dagstuhl Reports, Volume 8, Issue 6, pp. 63-76, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)

Copy BibTex To Clipboard

@Article{boncz_et_al:DagRep.8.6.63,
  author =	{Boncz, Peter A. and Graefe, Goetz and He, Binsheng and Sattler, Kai-Uwe},
  title =	{{Database Architectures for Modern Hardware (Dagstuhl Seminar 18251)}},
  pages =	{63--76},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2019},
  volume =	{8},
  number =	{6},
  editor =	{Boncz, Peter A. and Graefe, Goetz and He, Binsheng and Sattler, Kai-Uwe},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.8.6.63},
  URN =		{urn:nbn:de:0030-drops-100561},
  doi =		{10.4230/DagRep.8.6.63},
  annote =	{Keywords: co-processors, computer architecture, database systems, hardware support for databases, non-volatile memory}
}
Document
DOI: 10.4230/DagRep.8.6.77
Ubiquitous Gaze Sensing and Interaction (Dagstuhl Seminar 18252)

Authors: Lewis Chuang, Andrew Duchowski, Pernilla Qvarfordt, and Daniel Weiskopf

Abstract
This report documents the program and outcomes of the "'. The miniaturization of optical devices and advances in computer vision, as well as a lower cost point, have led to an increased integration of gaze sensing capabilities in computing systems. Eye tracking is no longer restricted to a well controlled laboratory setting, but moving into everyday settings. Therefore, this Dagstuhl Seminar brought together experts in computer graphics, signal processing, visualization, human-computer interaction, data analytics, pattern analysis and classification along with researchers who employ eye tracking across a diverse set of disciplines: geo-information systems, medicine, aviation, psychology, and neuroscience, to explore future applications and to identify requirements for reliable gaze sensing technology. This fostered a dialog and allowed: (1) computing scientists to understand the problems that are faced in recording and interpreting gaze data; (2) gaze researchers to consider how modern computing techniques could potentially advance their research. Other issues concerning the ubiquitous deployment of gaze sensing and interaction were also discussed, such ethical and privacy concerns when deploying gaze monitoring devices in everyday settings.
Cite as

Lewis Chuang, Andrew Duchowski, Pernilla Qvarfordt, and Daniel Weiskopf. Ubiquitous Gaze Sensing and Interaction (Dagstuhl Seminar 18252). In Dagstuhl Reports, Volume 8, Issue 6, pp. 77-148, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)

Copy BibTex To Clipboard

@Article{chuang_et_al:DagRep.8.6.77,
  author =	{Chuang, Lewis and Duchowski, Andrew and Qvarfordt, Pernilla and Weiskopf, Daniel},
  title =	{{Ubiquitous Gaze Sensing and Interaction (Dagstuhl Seminar 18252)}},
  pages =	{77--148},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2019},
  volume =	{8},
  number =	{6},
  editor =	{Chuang, Lewis and Duchowski, Andrew and Qvarfordt, Pernilla and Weiskopf, Daniel},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.8.6.77},
  URN =		{urn:nbn:de:0030-drops-100571},
  doi =		{10.4230/DagRep.8.6.77},
  annote =	{Keywords: eye tracking, computer vision, pattern analysis, ubiquitous computing, user modeling}
}
Document
DOI: 10.4230/DagRep.8.6.149
Discipline Convergence in Networked Systems (Dagstuhl Seminar 18261)

Authors: Yungang Bao, Lars Eggert, Simon Peter, and Noa Zilberman

Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 18261 "Discipline Convergence in Networked Systems". This seminar explored emerging networked system design approaches, seeking to increase performance, efficiency and security through the convergence of disciplines: compute, storage and networking. With technologies such as network function virtualization (NFV) having started the convergence of computing technologies and networking technologies, this seminar discussed new research directions to embrace the convergence of disciplines that used to be mainly isolated in the past.
Cite as

Yungang Bao, Lars Eggert, Simon Peter, and Noa Zilberman. Discipline Convergence in Networked Systems (Dagstuhl Seminar 18261). In Dagstuhl Reports, Volume 8, Issue 6, pp. 149-172, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)

Copy BibTex To Clipboard

@Article{bao_et_al:DagRep.8.6.149,
  author =	{Bao, Yungang and Eggert, Lars and Peter, Simon and Zilberman, Noa},
  title =	{{Discipline Convergence in Networked Systems (Dagstuhl Seminar 18261)}},
  pages =	{149--172},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2019},
  volume =	{8},
  number =	{6},
  editor =	{Bao, Yungang and Eggert, Lars and Peter, Simon and Zilberman, Noa},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.8.6.149},
  URN =		{urn:nbn:de:0030-drops-100583},
  doi =		{10.4230/DagRep.8.6.149},
  annote =	{Keywords: Big data, cloud computing, computer architecture, networked systems, rackscale computers}
}
Document
DOI: 10.4230/DagRep.8.6.173
10 Years of Web Science: Closing The Loop (Dagstuhl Perspectives Workshop 18262)

Authors: Susan Halford, James A. Hendler, Eirini Ntoutsi, and Steffen Staab

Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 18262 "10 years Web Science: Closing the Loop" that took place in Schloss Dagstuhl from 25-29 June 2018. In total, an interdisciplinary team of 22 researchers from computer science, sociology, philosophy and law gathered and discussed on the past, present and future of Web Science and what sort of actions the community should take to stay faithful to its initial mission for societal good. The role of Web Science is more critical than ever given the ever growing impact of the Web in our society.
Cite as

Susan Halford, James A. Hendler, Eirini Ntoutsi, and Steffen Staab. 10 Years of Web Science: Closing The Loop (Dagstuhl Perspectives Workshop 18262). In Dagstuhl Reports, Volume 8, Issue 6, pp. 173-198, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)

Copy BibTex To Clipboard

@Article{halford_et_al:DagRep.8.6.173,
  author =	{Halford, Susan and Hendler, James A. and Ntoutsi, Eirini and Staab, Steffen},
  title =	{{10 Years of Web Science: Closing The Loop (Dagstuhl Perspectives Workshop 18262)}},
  pages =	{173--198},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2019},
  volume =	{8},
  number =	{6},
  editor =	{Halford, Susan and Hendler, James A. and Ntoutsi, Eirini and Staab, Steffen},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.8.6.173},
  URN =		{urn:nbn:de:0030-drops-100594},
  doi =		{10.4230/DagRep.8.6.173},
  annote =	{Keywords: Dagstuhl Report, Web Science, Dagstuhl Perspectives Workshop}
}

Filters

  • Authors
  • B
  • Bao, Yungang
  • Boncz, Peter A.
  • C
  • Chuang, Lewis
  • D
  • Duchowski, Andrew
  • E
  • Eggert, Lars
  • G
  • Gill, Philippa
  • Graefe, Goetz
  • Grohe, Martin
  • Guruswami, Venkatesan
  • H
  • Halford, Susan
  • He, Binsheng
  • Hendler, James A.
  • M
  • Meyerhenke, Henning
  • N
  • Ntoutsi, Eirini
  • P
  • Peng, Richard
  • Perrig, Adrian
  • Peter, Simon
  • Q
  • Qvarfordt, Pernilla
  • S
  • Safro, Ilya
  • Sattler, Kai-Uwe
  • Staab, Steffen
  • W
  • Wählisch, Matthias
  • Weiskopf, Daniel
  • Z
  • Zilberman, Noa
  • Zivny, Stanislav

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
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact