Issue
Dagstuhl Reports, Volume 7, Issue 4
-
Part of:
Volume:
Dagstuhl Reports, Volume 7
Journal: Dagstuhl Reports (DagRep)
Event
Dagstuhl Seminars 17141, 17142, 17161, 17162, 17171Publication Details
- published at: 2018-02-07
- Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
- DBLP: db/journals/dagstuhl-reports/dagstuhl-reports7
Access Numbers
- Detailed Access Statistics available here
-
Total Document Accesses (updated on a weekly basis):
0PDF Downloads
Documents
No documents found matching your filter selection.
Document
Complete Issue
Dagstuhl Reports, Volume 7, Issue 4, April 2017, Complete Issue
Abstract
Dagstuhl Reports, Volume 7, Issue 4, April 2017, Complete Issue
Cite as
Dagstuhl Reports, Volume 7, Issue 4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
Copy BibTex To Clipboard
@Article{DagRep.7.4,
title = {{Dagstuhl Reports, Volume 7, Issue 4, April 2017, Complete Issue}},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2018},
volume = {7},
number = {4},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.7.4},
URN = {urn:nbn:de:0030-drops-84355},
doi = {10.4230/DagRep.7.4},
annote = {Keywords: Dagstuhl Reports, Volume 7, Issue 4, April 2017, Complete Issue}
}
Document
Front Matter
Dagstuhl Reports, Table of Contents, Volume 7, Issue 4, 2017
Abstract
Table of Contents, Frontmatter
Cite as
Dagstuhl Reports, Volume 7, Issue 4, pp. i-ii, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
Copy BibTex To Clipboard
@Article{DagRep.7.4.i,
title = {{Dagstuhl Reports, Table of Contents, Volume 7, Issue 4, 2017}},
pages = {i--ii},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2018},
volume = {7},
number = {4},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.7.4.i},
URN = {urn:nbn:de:0030-drops-84349},
doi = {10.4230/DagRep.7.4.i},
annote = {Keywords: Dagstuhl Reports, Table of Contents, Volume 7, Issue 4, 2017}
}
Document
Probabilistic Methods in the Design and Analysis of Algorithms (Dagstuhl Seminar 17141)
Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 17141 "Probabilistic Methods in the Design and Analysis of Algorithms".
Probabilistic methods play a central role in theoretical computer science. They are a powerful and widely applied tool used, for example, for designing efficient randomized algorithms and for establishing various lower bounds in complexity theory. They also form the basis of frameworks like average-case and smoothed analysis, in which algorithms are analyzed beyond the classical worst-case perspective. The seminar was on probabilistic methods with a focus on the design and analysis of algorithms.
The seminar helped to consolidate the research and to foster collaborations among the researchers who use probabilistic methods in different areas of the design and analysis of algorithms.
Cite as
Bodo Manthey, Claire Mathieu, Heiko Röglin, and Eli Upfal. Probabilistic Methods in the Design and Analysis of Algorithms (Dagstuhl Seminar 17141). In Dagstuhl Reports, Volume 7, Issue 4, pp. 1-22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
Copy BibTex To Clipboard
@Article{manthey_et_al:DagRep.7.4.1,
author = {Manthey, Bodo and Mathieu, Claire and R\"{o}glin, Heiko and Upfal, Eli},
title = {{Probabilistic Methods in the Design and Analysis of Algorithms (Dagstuhl Seminar 17141)}},
pages = {1--22},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2017},
volume = {7},
number = {4},
editor = {Manthey, Bodo and Mathieu, Claire and R\"{o}glin, Heiko and Upfal, Eli},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.7.4.1},
URN = {urn:nbn:de:0030-drops-75452},
doi = {10.4230/DagRep.7.4.1},
annote = {Keywords: analysis of algorithms, average-case analysis, random graphs, randomized algorithms, smoothed analysis, sub-linear algorithms}
}
Document
Formal Methods of Transformations (Dagstuhl Seminar 17142)
Abstract
The goal of this Dagstuhl seminar was to gather researchers working on the theory and practice of transformations (also know as transductions) of word and tree structures, which are realised by transducers (automata with outputs). This seminar was motivated by recent advances and breakthrough results, both in the settings of words and trees.
Cite as
Emmanuel Filiot, Sebastian Maneth, and Helmut Seidl. Formal Methods of Transformations (Dagstuhl Seminar 17142). In Dagstuhl Reports, Volume 7, Issue 4, pp. 23-37, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
Copy BibTex To Clipboard
@Article{filiot_et_al:DagRep.7.4.23,
author = {Filiot, Emmanuel and Maneth, Sebastian and Seidl, Helmut},
title = {{Formal Methods of Transformations (Dagstuhl Seminar 17142)}},
pages = {23--37},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2017},
volume = {7},
number = {4},
editor = {Filiot, Emmanuel and Maneth, Sebastian and Seidl, Helmut},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.7.4.23},
URN = {urn:nbn:de:0030-drops-75462},
doi = {10.4230/DagRep.7.4.23},
annote = {Keywords: string transducers, tree transducers, expressiveness, complexity}
}
Document
Ambient Notification Environments (Dagstuhl Seminar 17161)
Abstract
Direct notifications are on the exponential rise. In our time, numerous personal computing devices and applications vie for limited attention, racing to deliver large amounts of information to us. This often results in users being overwhelmed by notifications and interruptions to their regular schedule, to whom a complete avoidance of technology seems to be the only viable option. In other words, the current approach for notification delivery is unsustainable and will not scale. In the Dagstuhl Seminar 17161 ``Ambient Notification Environments'' we brought together experts from different fields related to smart homes, ambient intelligence, human-computer interaction, activity recognition, and psychology to discuss a potential alternative approach: ambient notifications. We explored how ambient notifications can support people in their daily activities, by providing relevant information that are contextually embedded in the environment. The objective is to facilitate unobtrusive access to information at the right time and in the right place, hence reducing the disruptions and annoyances that are commonly associated with direct notifications. In this report, we present the numerous ideas and concepts of how the research community could strive toward towards realising ambient notifications. This is based on the presentations and activities conducted during the seminar. Overall, the community is in agreement that current approaches to notifications will not scale and that ambient notifications are a potential solution.
Cite as
Lewis Chuang, Sven Gehring, Judy Kay, and Albrecht Schmidt. Ambient Notification Environments (Dagstuhl Seminar 17161). In Dagstuhl Reports, Volume 7, Issue 4, pp. 38-82, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
Copy BibTex To Clipboard
@Article{chuang_et_al:DagRep.7.4.38,
author = {Chuang, Lewis and Gehring, Sven and Kay, Judy and Schmidt, Albrecht},
title = {{Ambient Notification Environments (Dagstuhl Seminar 17161)}},
pages = {38--82},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2017},
volume = {7},
number = {4},
editor = {Chuang, Lewis and Gehring, Sven and Kay, Judy and Schmidt, Albrecht},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.7.4.38},
URN = {urn:nbn:de:0030-drops-75475},
doi = {10.4230/DagRep.7.4.38},
annote = {Keywords: Ambient Notifications, Dagstuhl Seminar, Skill Transfer}
}
Document
Online Privacy and Web Transparency (Dagstuhl Seminar 17162)
Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 17162 "Online Privacy and Web Transparency". The seminar brought 29 participants in computer science, law and policy together, coming from companies and research institutions across Europe and the US.
The 2.5-days seminar had a well-filled program, with 25 research talks, followed by 7 short panel discussions, and 6 5-minute talks. Online privacy and Web transparency is a broad research field, that includes detection of privacy leaks on the Web and mobiles, measurement of tracking technologies on the Web, transparency tools to detect bias and discrimination, as well as how laws and regulations address these problems from a law research perspective, and how technical solutions can influence standards and laws.
Cite as
Nataliia Bielova, Nikolaos Laoutaris, Arvind Narayanan, and Nick Nikiforakis. Online Privacy and Web Transparency (Dagstuhl Seminar 17162). In Dagstuhl Reports, Volume 7, Issue 4, pp. 83-106, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
Copy BibTex To Clipboard
@Article{bielova_et_al:DagRep.7.4.83,
author = {Bielova, Nataliia and Laoutaris, Nikolaos and Narayanan, Arvind and Nikiforakis, Nick},
title = {{Online Privacy and Web Transparency (Dagstuhl Seminar 17162)}},
pages = {83--106},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2017},
volume = {7},
number = {4},
editor = {Bielova, Nataliia and Laoutaris, Nikolaos and Narayanan, Arvind and Nikiforakis, Nick},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.7.4.83},
URN = {urn:nbn:de:0030-drops-75483},
doi = {10.4230/DagRep.7.4.83},
annote = {Keywords: Big data, Privacy Enhancing Technologies, Transparency, User Discrimination, Web Privacy}
}
Document
Computational Geometry (Dagstuhl Seminar 17171)
Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 17171 "Computational Geometry". The seminar was held from 23rd to 28th April 2017 and 47 participants from various countries attended it. Recent advances in computational geometry were presented and new challenges were identified. The report collects the abstracts of talks and open problems presented in the seminar.
Cite as
Orfried Cheong, Anne Driemel, and Jeff Erickson. Computational Geometry (Dagstuhl Seminar 17171). In Dagstuhl Reports, Volume 7, Issue 4, pp. 107-127, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
Copy BibTex To Clipboard
@Article{cheong_et_al:DagRep.7.4.107,
author = {Cheong, Orfried and Driemel, Anne and Erickson, Jeff},
title = {{Computational Geometry (Dagstuhl Seminar 17171)}},
pages = {107--127},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2017},
volume = {7},
number = {4},
editor = {Cheong, Orfried and Driemel, Anne and Erickson, Jeff},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.7.4.107},
URN = {urn:nbn:de:0030-drops-82771},
doi = {10.4230/DagRep.7.4.107},
annote = {Keywords: algorithms, applications, combinatorics, complexity, geometric computing, high-dimensional computational geometry, implementation, monitoring and shape data}
}