DagRep.14.5.12.pdf
- Filesize: 2.21 MB
- 13 pages
Document
Discrete Algorithms on Modern and Emerging Compute Infrastructure (Dagstuhl Seminar 24201)
Authors and all authors of the abstracts in this report
-
Part of:
Issue:
Dagstuhl Reports, Volume 14, Issue 5
Volume: Dagstuhl Reports, Volume 14
Journal: Dagstuhl Reports (DagRep) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2024-11-26
Cite AsGet BibTex
Kathrin Hanauer, Uwe Naumann, Alex Pothen, and Robert Schreiber. Discrete Algorithms on Modern and Emerging Compute Infrastructure (Dagstuhl Seminar 24201). In Dagstuhl Reports, Volume 14, Issue 5, pp. 12-24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/DagRep.14.5.12
https://doi.org/10.4230/DagRep.14.5.12
Abstract
Inspired by three plenary talks by leading figures in the area of "Discrete algorithms on modern and emerging compute infrastructure" this Dagstuhl Seminar emphasized focus sessions and working groups to dive into this very versatile topic. Lively discussions between experts from academia, research laboratories, and industry yielded a number of promising prospects for follow-up activities. As always, Dagstuhl provided the perfect setting for this kind of scientific exchange.
Subject Classification
ACM Subject Classification
- Mathematics of computing → Discrete mathematics
- Mathematics of computing → Mathematical software
- Computing methodologies → Parallel computing methodologies
Keywords
- Combinatorial Scientific Computing
- Discrete Algorithms
- Graph Algorithms
- High-Performance Computing
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads