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

doi:10.4230/DagRep.8.7.44

Document

Synergies between Adaptive Analysis of Algorithms, Parameterized Complexity, Compressed Data Structures and Compressed Indices (Dagstuhl Seminar 18281)

Authors Jérémy Barbay, Johannes Fischer, Stefan Kratsch, Srinivasa Rao Satti and all authors of the abstracts in this report

Part of: Issue: Dagstuhl Reports, Volume 8, Issue 7
Part of: Volume: Dagstuhl Reports, Volume 8
Part of: Journal: Dagstuhl Reports (DagRep)
License: Creative Commons Attribution 3.0 Unported license
Publication Date: 2019-01-22

PDF

File

DagRep.8.7.44.pdf

Filesize: 8.84 MB
18 pages

Document Identifiers

DOI: 10.4230/DagRep.8.7.44
URN: urn:nbn:de:0030-drops-101724

Author Details

Jérémy Barbay

Johannes Fischer

Stefan Kratsch

Srinivasa Rao Satti

and all authors of the abstracts in this report

Cite AsGet BibTex

Jérémy Barbay, Johannes Fischer, Stefan Kratsch, and Srinivasa Rao Satti. Synergies between Adaptive Analysis of Algorithms, Parameterized Complexity, Compressed Data Structures and Compressed Indices (Dagstuhl Seminar 18281). In Dagstuhl Reports, Volume 8, Issue 7, pp. 44-61, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
https://doi.org/10.4230/DagRep.8.7.44

Abstract

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.

Keywords

adaptive (analysis of) algorithms
compressed data structures
compressed indices
parameterized complexity

Metrics

Access Statistics
Total Accesses (updated on a weekly basis)

0

PDF Downloads

0

Metadata Views

Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail