Issue

Dagstuhl Reports, Volume 11, Issue 6

Thumbnail PDF

Publication Details


Access Numbers

Documents

No documents found matching your filter selection.
Document
Complete Issue
DOI: 10.4230/DagRep.11.6
Dagstuhl Reports, Volume 11, Issue 6, July 2021, Complete Issue
Abstract
Dagstuhl Reports, Volume 11, Issue 6, June 2021, Complete Issue
Cite as

Dagstuhl Reports, Volume 11, Issue 6, pp. 1-165, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)

Copy BibTex To Clipboard

@Article{DagRep.11.6,
  title =	{{Dagstuhl Reports, Volume 11, Issue 6, July 2021, Complete Issue}},
  pages =	{1--165},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2021},
  volume =	{11},
  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.11.6},
  URN =		{urn:nbn:de:0030-drops-155758},
  doi =		{10.4230/DagRep.11.6},
  annote =	{Keywords: Dagstuhl Reports, Volume 11, Issue 6, June 2021, Complete Issue}
}
Document
Front Matter
DOI: 10.4230/DagRep.11.6.i
Dagstuhl Reports, Table of Contents, Volume 11, Issue 6, 2021
Abstract
Dagstuhl Reports, Table of Contents, Volume 11, Issue 6, 2021
Cite as

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

Copy BibTex To Clipboard

@Article{DagRep.11.6.i,
  title =	{{Dagstuhl Reports, Table of Contents, Volume 11, Issue 6, 2021}},
  pages =	{i--ii},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2021},
  volume =	{11},
  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.11.6.i},
  URN =		{urn:nbn:de:0030-drops-155765},
  doi =		{10.4230/DagRep.11.6.i},
  annote =	{Keywords: Table of Contents, Frontmatter}
}
Document
DOI: 10.4230/DagRep.11.6.1
Computational Proteomics (Dagstuhl Seminar 21271)

Authors: Sebastian Böcker, Rebekah Gundry, Lennart Martens, and Magnus Palmblad

Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 21271 "Computational Proteomics". The Seminar, which took place in a hybrid fashion with both local as well as online participation due to the COVID pandemic, was built around three topics: the rapid uptake of advanced machine learning in proteomics; computational challenges across the various rapidlly evolving approaches for structural and top-down proteomics; and the computational analysis of glycoproteomics data. These three topics were the focus of three corresponding breakout sessions, which ran in parallel throughout the seminar. A fourth breakout session was created during the seminar, on the specific topic of creating a Kaggle competition based on proteomics data. The abstracts presented here first describe the three introduction talks, one for each topic. These talk abstracts are then followed by one abstract each per breakout session, documenting that breakout’s discussion and outcomes. An Executive Summary is also provided, which details the overall seminar structure alongside the most important conclusions for the three topic-derived breakouts.
Cite as

Sebastian Böcker, Rebekah Gundry, Lennart Martens, and Magnus Palmblad. Computational Proteomics (Dagstuhl Seminar 21271). In Dagstuhl Reports, Volume 11, Issue 6, pp. 1-13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)

Copy BibTex To Clipboard

@Article{bocker_et_al:DagRep.11.6.1,
  author =	{B\"{o}cker, Sebastian and Gundry, Rebekah and Martens, Lennart and Palmblad, Magnus},
  title =	{{Computational Proteomics (Dagstuhl Seminar 21271)}},
  pages =	{1--13},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2021},
  volume =	{11},
  number =	{6},
  editor =	{B\"{o}cker, Sebastian and Gundry, Rebekah and Martens, Lennart and Palmblad, Magnus},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.11.6.1},
  URN =		{urn:nbn:de:0030-drops-155775},
  doi =		{10.4230/DagRep.11.6.1},
  annote =	{Keywords: bioinformatics, computational mass spectrometry, machine learning, proteomics}
}
Document
DOI: 10.4230/DagRep.11.6.14
Towards Climate-Friendly Internet Research (Dagstuhl Seminar 21272)

Authors: Vaibhav Bajpai, Oliver Hohlfeld, Jon Crowcroft, and Srinivasan Keshav

Abstract
This report presents guidelines for deciding when virtual or hybrid conferences are suitable and how to design them. The report is the output from a Dagstuhl seminar where the goal was to review the current status of virtual conferences and to develop best practices for hybrid conferences. The participants provided input on the state-of-the-art of virtual conferences: what works, what does not, and what needs improvement. From this discussion, the participants discussed the requirements, implications, and guidelines for designing hybrid conferences. The participants felt that in the future, small research meetings will move entirely online whereas larger ones will be held as hybrid events.
Cite as

Vaibhav Bajpai, Oliver Hohlfeld, Jon Crowcroft, and Srinivasan Keshav. Towards Climate-Friendly Internet Research (Dagstuhl Seminar 21272). In Dagstuhl Reports, Volume 11, Issue 6, pp. 14-37, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)

Copy BibTex To Clipboard

@Article{bajpai_et_al:DagRep.11.6.14,
  author =	{Bajpai, Vaibhav and Hohlfeld, Oliver and Crowcroft, Jon and Keshav, Srinivasan},
  title =	{{Towards Climate-Friendly Internet Research (Dagstuhl Seminar 21272)}},
  pages =	{14--37},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2021},
  volume =	{11},
  number =	{6},
  editor =	{Bajpai, Vaibhav and Hohlfeld, Oliver and Crowcroft, Jon and Keshav, Srinivasan},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.11.6.14},
  URN =		{urn:nbn:de:0030-drops-155780},
  doi =		{10.4230/DagRep.11.6.14},
  annote =	{Keywords: Carbon Footprint, Energy Efficient Networking, Climate Change}
}
Document
DOI: 10.4230/DagRep.11.6.38
Data Structures for Modern Memory and Storage Hierarchies (Dagstuhl Seminar 21283)

Authors: Stratos Idreos, Viktor Leis, Kai-Uwe Sattler, and Margo Seltzer

Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 21283 "Data Structures for Modern Memory and Storage Hierarchies". For decades, computers consisted of a CPU, volatile main memory, and persistent disk. Today, modern storage technologies such as flash and persistent memory as well as the seemingly inevitable migration into virtualized cloud instances, connected through high-speed networks, have radically changed the hardware landscape. These technologies have major implications on how to design data structures and high-performance systems software. The seminar discussed how to adapt data structures and software systems to this new hardware landscape.
Cite as

Stratos Idreos, Viktor Leis, Kai-Uwe Sattler, and Margo Seltzer. Data Structures for Modern Memory and Storage Hierarchies (Dagstuhl Seminar 21283). In Dagstuhl Reports, Volume 11, Issue 6, pp. 38-53, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)

Copy BibTex To Clipboard

@Article{idreos_et_al:DagRep.11.6.38,
  author =	{Idreos, Stratos and Leis, Viktor and Sattler, Kai-Uwe and Seltzer, Margo},
  title =	{{Data Structures for Modern Memory and Storage Hierarchies (Dagstuhl Seminar 21283)}},
  pages =	{38--53},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2021},
  volume =	{11},
  number =	{6},
  editor =	{Idreos, Stratos and Leis, Viktor and Sattler, Kai-Uwe and Seltzer, Margo},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.11.6.38},
  URN =		{urn:nbn:de:0030-drops-155797},
  doi =		{10.4230/DagRep.11.6.38},
  annote =	{Keywords: Cloud, Data Structures, Database Systems, Flash, Near-Data Processing, Persistent Memory}
}
Document
DOI: 10.4230/DagRep.11.6.54
Scalable Handling of Effects (Dagstuhl Seminar 21292)

Authors: Danel Ahman, Amal Ahmed, Sam Lindley, and Andreas Rossberg

Abstract
Built on solid mathematical foundations, effect handlers offer a uniform and elegant approach to programming with user-defined computational effects. They subsume many widely used programming concepts and abstractions, such as actors, async/await, backtracking, coroutines, generators/iterators, and probabilistic programming. As such, they allow language implementers to target a single implementation of effect handlers, freeing language implementers from having to maintain separate ad hoc implementations of each of the features listed above. Due to their wide applicability, effect handlers are enjoying growing interest in academia and industry. For instance, several effect handler oriented research languages are under active development (such as Eff, Frank, and Koka), as are effect handler libraries for mainstream languages (such as C and Java), effect handlers are seeing increasing use in probabilistic programming tools (such as Uber’s Pyro), and proposals are in the pipeline to include them natively in low-level languages (such as WebAssembly). Effect handlers are also a key part of Multicore OCaml, which incorporates an efficient implementation of them for uniformly expressing user-definable concurrency models in the language. However, enabling effect handlers to scale requires tackling some hard problems, both in theory and in practice. Inspired by experience of developing, programming with, and reasoning about effect handlers in practice, we identify five key problem areas to be addressed at this Dagstuhl Seminar in order to enable effect handlers to scale: Safety, Modularity, Interoperability, Legibility, and Efficiency. In particular, we seek answers to the following questions: - How can we enforce safe interaction between effect handler programs and external resources? - How can we enable modular use of effect handlers for programming in the large? - How can we support interoperable effect handler programs written in different languages? - How can we write legible effect handler programs in a style accessible to mainstream programmers? - How can we generate efficient code from effect handler programs?
Cite as

Danel Ahman, Amal Ahmed, Sam Lindley, and Andreas Rossberg. Scalable Handling of Effects (Dagstuhl Seminar 21292). In Dagstuhl Reports, Volume 11, Issue 6, pp. 54-81, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)

Copy BibTex To Clipboard

@Article{ahman_et_al:DagRep.11.6.54,
  author =	{Ahman, Danel and Ahmed, Amal and Lindley, Sam and Rossberg, Andreas},
  title =	{{Scalable Handling of Effects (Dagstuhl Seminar 21292)}},
  pages =	{54--81},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2021},
  volume =	{11},
  number =	{6},
  editor =	{Ahman, Danel and Ahmed, Amal and Lindley, Sam and Rossberg, Andreas},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.11.6.54},
  URN =		{urn:nbn:de:0030-drops-155800},
  doi =		{10.4230/DagRep.11.6.54},
  annote =	{Keywords: continuations, Effect handlers, Wasm}
}
Document
DOI: 10.4230/DagRep.11.6.82
Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 21293)

Authors: Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg, and Meirav Zehavi

Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 21293 "Parameterized Complexity in Graph Drawing". The seminar was held mostly in-person from July 18 to July 23, 2021. It brought together 28 researchers from the Graph Drawing and the Parameterized Complexity research communities with the aim to discuss and explore open research questions on the interface between the two fields. The report collects the abstracts of talks and open problems presented in the seminar, as well as brief progress reports from the working groups.
Cite as

Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg, and Meirav Zehavi. Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 21293). In Dagstuhl Reports, Volume 11, Issue 6, pp. 82-123, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)

Copy BibTex To Clipboard

@Article{ganian_et_al:DagRep.11.6.82,
  author =	{Ganian, Robert and Montecchiani, Fabrizio and N\"{o}llenburg, Martin and Zehavi, Meirav},
  title =	{{Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 21293)}},
  pages =	{82--123},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2021},
  volume =	{11},
  number =	{6},
  editor =	{Ganian, Robert and Montecchiani, Fabrizio and N\"{o}llenburg, Martin and Zehavi, Meirav},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.11.6.82},
  URN =		{urn:nbn:de:0030-drops-155817},
  doi =		{10.4230/DagRep.11.6.82},
  annote =	{Keywords: exact computation, graph algorithms, graph drawing, parameterized complexity}
}
Document
DOI: 10.4230/DagRep.11.6.124
Matching Under Preferences: Theory and Practice (Dagstuhl Seminar 21301)

Authors: Haris Aziz, Péter Biró, Tamás Fleiner, and Bettina Klaus

Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 21301 "Matching Under Preferences: Theory and Practice". The seminar featured a mixture of technical scientific talks, survey talks, open problem presentations, working group sessions, five-minute contributions ("rump session"), and a panel discussion. This was the first Dagstuhl seminar that was dedicated to matching under preferences.
Cite as

Haris Aziz, Péter Biró, Tamás Fleiner, and Bettina Klaus. Matching Under Preferences: Theory and Practice (Dagstuhl Seminar 21301). In Dagstuhl Reports, Volume 11, Issue 6, pp. 124-146, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)

Copy BibTex To Clipboard

@Article{aziz_et_al:DagRep.11.6.124,
  author =	{Aziz, Haris and Bir\'{o}, P\'{e}ter and Fleiner, Tam\'{a}s and Klaus, Bettina},
  title =	{{Matching Under Preferences: Theory and Practice (Dagstuhl Seminar 21301)}},
  pages =	{124--146},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2021},
  volume =	{11},
  number =	{6},
  editor =	{Aziz, Haris and Bir\'{o}, P\'{e}ter and Fleiner, Tam\'{a}s and Klaus, Bettina},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.11.6.124},
  URN =		{urn:nbn:de:0030-drops-155826},
  doi =		{10.4230/DagRep.11.6.124},
  annote =	{Keywords: market design, matching under preferences, matching with distributional constraints, organ exchange, stable matching}
}
Document
DOI: 10.4230/DagRep.11.6.147
Approximate Systems (Dagstuhl Seminar 21302)

Authors: Eva Darulova, Babak Falsafi, Andreas Gerstlauer, and Phillip Stanley-Marbell

Abstract
This report summarizes the presentations and discussion sessions at the Dagstuhl Seminar 21302 "Approximate Systems" that took place during July 25 - 30, 2021. Due to COVID, the seminar was held in a hybrid fashion, with around 1/3 of the attendees on-site and the remaining ones online. The seminar discussed advances and open challenges in applying approximate computing techniques across the stack and across different application domains, and we hope that this report can provide a useful resource also for other researchers.
Cite as

Eva Darulova, Babak Falsafi, Andreas Gerstlauer, and Phillip Stanley-Marbell. Approximate Systems (Dagstuhl Seminar 21302). In Dagstuhl Reports, Volume 11, Issue 6, pp. 147-163, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)

Copy BibTex To Clipboard

@Article{darulova_et_al:DagRep.11.6.147,
  author =	{Darulova, Eva and Falsafi, Babak and Gerstlauer, Andreas and Stanley-Marbell, Phillip},
  title =	{{Approximate Systems (Dagstuhl Seminar 21302)}},
  pages =	{147--163},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2021},
  volume =	{11},
  number =	{6},
  editor =	{Darulova, Eva and Falsafi, Babak and Gerstlauer, Andreas and Stanley-Marbell, Phillip},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.11.6.147},
  URN =		{urn:nbn:de:0030-drops-155836},
  doi =		{10.4230/DagRep.11.6.147},
  annote =	{Keywords: approximate computing, energy-efficient computing, pareto optimization}
}

Filters

  • Authors
  • A
  • Ahman, Danel
  • Ahmed, Amal
  • Aziz, Haris
  • B
  • Bajpai, Vaibhav
  • Biró, Péter
  • Böcker, Sebastian
  • C
  • Crowcroft, Jon
  • D
  • Darulova, Eva
  • F
  • Falsafi, Babak
  • Fleiner, Tamás
  • G
  • Ganian, Robert
  • Gerstlauer, Andreas
  • Gundry, Rebekah
  • H
  • Hohlfeld, Oliver
  • I
  • Idreos, Stratos
  • K
  • Keshav, Srinivasan
  • Klaus, Bettina
  • L
  • Leis, Viktor
  • Lindley, Sam
  • M
  • Martens, Lennart
  • Montecchiani, Fabrizio
  • N
  • Nöllenburg, Martin
  • P
  • Palmblad, Magnus
  • R
  • Rossberg, Andreas
  • S
  • Sattler, Kai-Uwe
  • Seltzer, Margo
  • Stanley-Marbell, Phillip
  • Z
  • Zehavi, Meirav

  • Subjects
  • Applied computing
  • Applied computing → Bioinformatics
  • Applied computing → Economics
  • Computer systems organization
  • Computer systems organization → Architectures
  • Computer systems organization → Embedded and cyber-physical systems
  • Hardware
  • Hardware → Analysis and design of emerging devices and systems
  • Information systems
  • Information systems → Data management systems
  • Mathematics of computing
  • Mathematics of computing → Graph theory
  • Networks
  • Networks
  • Social and professional topics
  • Social and professional topics
  • Software and its engineering
  • Software and its engineering → Software notations and tools
  • Theory of computation
  • Theory of computation → Algorithmic game theory and mechanism design
  • Theory of computation → Computational geometry
  • Theory of computation → Control primitives
  • Theory of computation → Graph algorithms analysis
  • Theory of computation → Parameterized complexity and exact algorithms
  • Theory of computation → Program semantics
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