Issue
Dagstuhl Reports, Volume 14, Issue 9
-
Part of:
Volume:
Dagstuhl Reports, Volume 14
Journal: Dagstuhl Reports (DagRep)
Event
Dagstuhl Seminars 24361, 24362, 24371, 24372, 24381, 24391, 24401, 24402Publication Details
- published at: 2025-04-04
- Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
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 14, Issue 9, September 2024, Complete Issue
Abstract
Dagstuhl Reports, Volume 14, Issue 9, September 2024, Complete Issue
Cite as
Dagstuhl Reports, Volume 14, Issue 9, pp. 1-194, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
Copy BibTex To Clipboard
@Article{DagRep.14.9,
title = {{Dagstuhl Reports, Volume 14, Issue 9, September 2024, Complete Issue}},
pages = {1--194},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2025},
volume = {14},
number = {9},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.14.9},
URN = {urn:nbn:de:0030-drops-230151},
doi = {10.4230/DagRep.14.9},
annote = {Keywords: Dagstuhl Reports, Volume 14, Issue 9, September 2024, Complete Issue}
}
Document
Front Matter
Dagstuhl Reports, Table of Contents, Volume 14, Issue 9, 2024
Abstract
Dagstuhl Reports, Table of Contents, Volume 14, Issue 9, 2024
Cite as
Dagstuhl Reports, Volume 14, Issue 9, pp. i-ii, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
Copy BibTex To Clipboard
@Article{DagRep.14.9.i,
title = {{Dagstuhl Reports, Table of Contents, Volume 14, Issue 9, 2024}},
pages = {i--ii},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2025},
volume = {14},
number = {9},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.14.9.i},
URN = {urn:nbn:de:0030-drops-226025},
doi = {10.4230/DagRep.14.9.i},
annote = {Keywords: Table of Contents, Frontmatter}
}
Document
Artificial Intelligence and Formal Methods Join Forces for Reliable Autonomy (Dagstuhl Seminar 24361)
Abstract
This report documents the program and outcomes of Dagstuhl Seminar 24361, "Artificial Intelligence and Formal Methods Join Forces for Reliable Autonomy." AI is a disruptive force with growing applications in everyday life. Therefore, AI systems require serious safety, correctness, and reliability considerations. Recently, the field of safety in AI has triggered a vast amount of research. This seminar brought together experts from the fields of artificial intelligence, formal methods, and robotics. Via a diverse program with ample space for open yet guided discussion, a common understanding of problems was developed. Consequently, the seminar provided a means to identify key challenges and open problems in the research areas that underpin reliable autonomy.
Cite as
Nils Jansen, Mykel Kochenderfer, Jan Kretinsky, Jana Tumova, and Maris Galesloot. Artificial Intelligence and Formal Methods Join Forces for Reliable Autonomy (Dagstuhl Seminar 24361). In Dagstuhl Reports, Volume 14, Issue 9, pp. 1-21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
Copy BibTex To Clipboard
@Article{jansen_et_al:DagRep.14.9.1,
author = {Jansen, Nils and Kochenderfer, Mykel and Kretinsky, Jan and Tumova, Jana and Galesloot, Maris},
title = {{Artificial Intelligence and Formal Methods Join Forces for Reliable Autonomy (Dagstuhl Seminar 24361)}},
pages = {1--21},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2025},
volume = {14},
number = {9},
editor = {Jansen, Nils and Kochenderfer, Mykel and Kretinsky, Jan and Tumova, Jana and Galesloot, Maris},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.14.9.1},
URN = {urn:nbn:de:0030-drops-226100},
doi = {10.4230/DagRep.14.9.1},
annote = {Keywords: artificial intelligence, autonomous systems, formal verification, machine learning, robotics}
}
Document
Next-Generation Secure Distributed Computing (Dagstuhl Seminar 24362)
Abstract
The fast-evolving space of distributed systems spans various different areas such as applied cryptography, distributed computing, and game theory. The purpose of this seminar was to bring together researchers from these respective fields and to provide a unique opportunity of fostering interdisciplinary discussions on various related topics.
Cite as
Aniket Kate, Julian Loss, and Kartik Nayak. Next-Generation Secure Distributed Computing (Dagstuhl Seminar 24362). In Dagstuhl Reports, Volume 14, Issue 9, pp. 22-44, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
Copy BibTex To Clipboard
@Article{kate_et_al:DagRep.14.9.22,
author = {Kate, Aniket and Loss, Julian and Nayak, Kartik},
title = {{Next-Generation Secure Distributed Computing (Dagstuhl Seminar 24362)}},
pages = {22--44},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2025},
volume = {14},
number = {9},
editor = {Kate, Aniket and Loss, Julian and Nayak, Kartik},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.14.9.22},
URN = {urn:nbn:de:0030-drops-226097},
doi = {10.4230/DagRep.14.9.22},
annote = {Keywords: blockchain, cryptography, distributed computing, game theory}
}
Document
Extended Reality Accessibility (Dagstuhl Seminar 24371)
Abstract
Extended Reality (XR), including Augmented Reality (AR) and Virtual Reality (VR), technologies are on the cusp of becoming mainstream. In 2019, about 6 million VR and AR headsets were shipped worldwide, with an estimated 16.5 million headsets in use in 2021, and predictions of over 50 million by 2026. By some estimates, this represents a $1 trillion market. Ideally, these technologies would be accessible to all who desire to use them; however, today, XR technologies are not accessible to millions of people with disabilities or impairments (visual, motor, cognitive), with incompatible physical characteristics (e.g., hairstyles and head shapes), with health conditions, and beyond. This includes children and the growing group of elderly people. In particular, the low accessibility of these technologies today hinders their widespread adoption worldwide, especially in the educational systems (learning, training), in industry (training, assistance), and in health care (rehabilitation, therapy, telemedicine). Thus, this Dagstuhl Seminar addressed an urgent need in the field to ensure that all individuals can benefit from the applications that XR offers.
Cite as
Gerd Bruder, Thies Pfeiffer, Jeanine Stefanucci, and Dylan Fox. Extended Reality Accessibility (Dagstuhl Seminar 24371). In Dagstuhl Reports, Volume 14, Issue 9, pp. 45-66, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
Copy BibTex To Clipboard
@Article{bruder_et_al:DagRep.14.9.45,
author = {Bruder, Gerd and Pfeiffer, Thies and Stefanucci, Jeanine and Fox, Dylan},
title = {{Extended Reality Accessibility (Dagstuhl Seminar 24371)}},
pages = {45--66},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2025},
volume = {14},
number = {9},
editor = {Bruder, Gerd and Pfeiffer, Thies and Stefanucci, Jeanine and Fox, Dylan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.14.9.45},
URN = {urn:nbn:de:0030-drops-226081},
doi = {10.4230/DagRep.14.9.45},
annote = {Keywords: Virtual Reality, Augmented Reality, Extended Reality, Accessibility, Human-Computer Interaction, Diversity, Equity, Inclusion}
}
Document
Explainable AI for Sequential Decision Making (Dagstuhl Seminar 24372)
Abstract
As more and more AI applications have become ubiquitous in our lives, the research area of explainable AI (XAI) has rapidly developed, with goals such as enabling transparency, enhancing collaboration, and increasing trust in AI. However, the focus of XAI to date has largely been on explaining the input-output mappings of "black box" models like neural networks, which have been seen as the central problem for the explainability of AI systems. The challenge of explaining intelligent behavior that extends over time, such as that of robots collaborating with humans or software agents engaged in complex ongoing tasks, has only recently gained attention. We may have AIs that can beat us in Go, but can they teach us how to play?
This Dagstuhl Seminar brought together academic researchers and industry experts from communities such as reinforcement learning, planning, game AI, robotics, and cognitive science to discuss their work on explainability in sequential decision-making contexts. The seminar aimed to move towards a shared understanding of the field and develop a common roadmap for moving it forward. This report documents the program and its results.
Cite as
Hendrik Baier, Mark T. Keane, Sarath Sreedharan, Silvia Tulli, Abhinav Verma, and Stylianos Loukas Vasileiou. Explainable AI for Sequential Decision Making (Dagstuhl Seminar 24372). In Dagstuhl Reports, Volume 14, Issue 9, pp. 67-103, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
Copy BibTex To Clipboard
@Article{baier_et_al:DagRep.14.9.67,
author = {Baier, Hendrik and Keane, Mark T. and Sreedharan, Sarath and Tulli, Silvia and Verma, Abhinav and Vasileiou, Stylianos Loukas},
title = {{Explainable AI for Sequential Decision Making (Dagstuhl Seminar 24372)}},
pages = {67--103},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2025},
volume = {14},
number = {9},
editor = {Baier, Hendrik and Keane, Mark T. and Sreedharan, Sarath and Tulli, Silvia and Verma, Abhinav and Vasileiou, Stylianos Loukas},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.14.9.67},
URN = {urn:nbn:de:0030-drops-226071},
doi = {10.4230/DagRep.14.9.67},
annote = {Keywords: Explainable artificial intelligence, explainable agents, sequential decision making, planning, learning}
}
Document
Algebraic and Analytic Methods in Computational Complexity (Dagstuhl Seminar 24381)
Abstract
Computational Complexity is concerned with the resources that are required for algorithms to detect properties of combinatorial objects and structures. It has often proven true that the best way to argue about these combinatorial objects is by establishing a connection (perhaps approximate) to a more well-behaved algebraic setting. Indeed, many of the deepest and most powerful results in Computational Complexity rely on algebraic proof techniques.
The algebraic theme continues to play a central role in some of the most exciting recent progress in computational complexity in areas like circuit complexity, polynomial identity testing, pseudorandomness and derandomization, or error correcting codes.
Beside algebraic methods, analytic methods like Fourier analysis have been used for quite some time in theoretical computer science. These methods have been used recently in some breakthrough results in complexity theory in areas like hardness of approximation, quantum computation, and scaling algorithms.
A new theme that has gained importance in the last years is the area of meta-complexity, that is, the complexity of computational problems that are themselves problems about the complexity of computation. Meta-complexity provides a link between a variety of important areas like circuit complexity, proof complexity, cryptography, and learning theory.
These new directions were in the focus of the Dagstuhl Seminar and reflect the developments in the field since the previous Dagstuhl Seminar 22371. Taking the recent exciting developments outlined above into account, we also included analytic methods this time.
This Dagstuhl Seminar aimed to capitalize on recent progress and brought together researchers who are using a diverse array of algebraic and analytic methods in a variety of settings. Researchers in these areas are relying on ever more sophisticated and specialized mathematics and we hope that this seminar has contributed in educating a diverse community about the latest new techniques.
Cite as
Markus Bläser, Shubhangi Saraf, Ronen Shaltiel, Jacobo Torán, and Kilian Rothmund. Algebraic and Analytic Methods in Computational Complexity (Dagstuhl Seminar 24381). In Dagstuhl Reports, Volume 14, Issue 9, pp. 104-126, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
Copy BibTex To Clipboard
@Article{blaser_et_al:DagRep.14.9.104,
author = {Bl\"{a}ser, Markus and Saraf, Shubhangi and Shaltiel, Ronen and Tor\'{a}n, Jacobo and Rothmund, Kilian},
title = {{Algebraic and Analytic Methods in Computational Complexity (Dagstuhl Seminar 24381)}},
pages = {104--126},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2025},
volume = {14},
number = {9},
editor = {Bl\"{a}ser, Markus and Saraf, Shubhangi and Shaltiel, Ronen and Tor\'{a}n, Jacobo and Rothmund, Kilian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.14.9.104},
URN = {urn:nbn:de:0030-drops-226065},
doi = {10.4230/DagRep.14.9.104},
annote = {Keywords: Algebraic complexity theory, circuit complexity, pseudorandomnes and derandomization, error correcting codes}
}
Document
Statistical and Probabilistic Methods in Algorithmic Data Analysis (Dagstuhl Seminar 24391)
Abstract
This report documents the program and the outcomes of Dagstuhl Seminar "Statistical and Probabilistic Methods in Algorithmic Data Analysis" (24391). Modern algorithms for data analysis require the use of advanced probabilistic methods to achieve the necessary scalability and accuracy guarantees. At the same time, modern tasks of knowledge discovery from data require the use of advanced statistics to handle challenges such as the test of multiple hypotheses or dependency structure of the data points, such as in time series or graphs. Probabilistic methods are also at the core of areas of theoretical computer science such as sub-linear algorithms and average-case analysis. The application of these methods requires careful balancing of theoretical and practical considerations, to obtain efficient algorithms for data analysis. The Dagstuhl Seminar focused on statistical and probabilistic methods to develop and analyze useful, scalable algorithms for knowledge discovery from large, rich datasets. Participants from different countries, at different stages of their careers, and from both industry and academia gave talks on the topics of the seminar, usually presenting their own research, either recently published or soon-to-be. There was ample time for socializing, networking, and starting or continuing collaborations, and new results are expected to be published thanks to these collaborations.
Cite as
Aristides Gionis, Matteo Riondato, and Eli Upfal. Statistical and Probabilistic Methods in Algorithmic Data Analysis (Dagstuhl Seminar 24391). In Dagstuhl Reports, Volume 14, Issue 9, pp. 127-144, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
Copy BibTex To Clipboard
@Article{gionis_et_al:DagRep.14.9.127,
author = {Gionis, Aristides and Riondato, Matteo and Upfal, Eli},
title = {{Statistical and Probabilistic Methods in Algorithmic Data Analysis (Dagstuhl Seminar 24391)}},
pages = {127--144},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2025},
volume = {14},
number = {9},
editor = {Gionis, Aristides and Riondato, Matteo 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.14.9.127},
URN = {urn:nbn:de:0030-drops-226050},
doi = {10.4230/DagRep.14.9.127},
annote = {Keywords: approximation algorithms, data science, online algorithms, randomized algorithms, statistical data analysis}
}
Document
Fair Division: Algorithms, Solution Concepts, and Applications (Dagstuhl Seminar 24401)
Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 24401 "Fair Division: Algorithms, Solution Concepts, and Applications". The main goal of the seminar was to bring together leading scientists in the field of fair division so as to discuss current challenges and research directions. We summarize organizational aspects of the seminar, the talk abstracts, and the problems that were discussed in the open problem sessions.
Cite as
Evangelos Markakis, Ruta Mehta, and Yair Zick. Fair Division: Algorithms, Solution Concepts, and Applications (Dagstuhl Seminar 24401). In Dagstuhl Reports, Volume 14, Issue 9, pp. 145-166, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
Copy BibTex To Clipboard
@Article{markakis_et_al:DagRep.14.9.145,
author = {Markakis, Evangelos and Mehta, Ruta and Zick, Yair},
title = {{Fair Division: Algorithms, Solution Concepts, and Applications (Dagstuhl Seminar 24401)}},
pages = {145--166},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2025},
volume = {14},
number = {9},
editor = {Markakis, Evangelos and Mehta, Ruta and Zick, Yair},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.14.9.145},
URN = {urn:nbn:de:0030-drops-226049},
doi = {10.4230/DagRep.14.9.145},
annote = {Keywords: algorithm design, Algorithmic game theory, cake cutting, envy-freeness, fair division}
}
Document
Greening Networking: Toward a Net Zero Internet (Dagstuhl Seminar 24402)
Abstract
This is the report of the Dagstuhl Seminar 24402 on Greening Networking: Toward a Net Zero Internet that took place from September 29th to October 2nd 2024. The seminar discussed the most impactful networking improvements for reducing carbon emissions in three different areas: 1) applications, systems, and stakeholders; 2) network technologies; and 3) lifecycle and control loops. As a major result of the seminar, the following problems and topics for future research were identified: 1) characterizing the Internet footprint on carbon emissions accurately; 2) understanding attributional and consequential accounting of carbon emissions in networked systems; and 3) identifying potential solutions to give network systems more flexibility in better supporting energy grids and connecting to renewable energy sources. One of the concrete results of this seminar is a list of technologies and research opportunities for which we estimated the potential impact and time horizons.
Cite as
Alexander Clemm, Dirk Kutscher, Michael Welzl, Cedric Westphal, Noa Zilberman, and Simone Ferlin-Reiter. Greening Networking: Toward a Net Zero Internet (Dagstuhl Seminar 24402). In Dagstuhl Reports, Volume 14, Issue 9, pp. 167-192, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
Copy BibTex To Clipboard
@Article{clemm_et_al:DagRep.14.9.167,
author = {Clemm, Alexander and Kutscher, Dirk and Welzl, Michael and Westphal, Cedric and Zilberman, Noa and Ferlin-Reiter, Simone},
title = {{Greening Networking: Toward a Net Zero Internet (Dagstuhl Seminar 24402)}},
pages = {167--192},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2025},
volume = {14},
number = {9},
editor = {Clemm, Alexander and Kutscher, Dirk and Welzl, Michael and Westphal, Cedric and Zilberman, Noa and Ferlin-Reiter, Simone},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.14.9.167},
URN = {urn:nbn:de:0030-drops-226037},
doi = {10.4230/DagRep.14.9.167},
annote = {Keywords: Green networking, carbon-aware networking, sustainable networking, energy-efficient networking}
}