eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Dagstuhl Reports
2192-5283
2019-01-22
44
61
10.4230/DagRep.8.7.44
article
Synergies between Adaptive Analysis of Algorithms, Parameterized Complexity, Compressed Data Structures and Compressed Indices (Dagstuhl Seminar 18281)
Barbay, Jérémy
Fischer, Johannes
Kratsch, Stefan
Satti, Srinivasa Rao
From the 8th of July 2018 to the 13th of July 2018, a Dagstuhl Seminar took place with the topic "Synergies between Adaptive Analysis of Algorithms, Parameterized Complexity, Compressed Data Structures and Compressed Indices".
There, 40 participants from as many as 14 distinct countries
and four distinct research areas, dealing with running time analysis and space usage analysis of algorithms and data structures, gathered to discuss results and techniques to "go beyond the worst-case" for classes of structurally restricted inputs, both for (fast) algorithms and (compressed) data structures.
The seminar consisted of (1) a first session of personal introduction, each participant presenting his expertise and themes of interests in two slides; (2) a series of four technical talks; and (3) a larger series of presentations of open problems, with ample time left for the participants to gather and work on such open problems.
https://drops.dagstuhl.de/storage/04dagstuhl-reports/volume08/issue07/18281/DagRep.8.7.44/DagRep.8.7.44.pdf
adaptive (analysis of) algorithms
compressed data structures
compressed indices
parameterized complexity