License
When quoting this document, please refer to the following
DOI: 10.4230/DagRep.8.7.44
URN: urn:nbn:de:0030-drops-101724
URL: http://drops.dagstuhl.de/opus/volltexte/2019/10172/
Go back to Dagstuhl Reports


Barbay, Jérémy ; Fischer, Johannes ; Kratsch, Stefan ; Satti, Srinivasa Rao
Weitere Beteiligte (Hrsg. etc.): Jérémy Barbay and Johannes Fischer and Stefan Kratsch and Srinivasa Rao Satti

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

pdf-format:
dagrep_v008_i007_p044_18281.pdf (9 MB)


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.

BibTeX - Entry

@Article{barbay_et_al:DR:2019:10172,
  author =	{J{\'e}r{\'e}my Barbay and Johannes Fischer and Stefan Kratsch and Srinivasa Rao Satti},
  title =	{{Synergies between Adaptive Analysis of Algorithms, Parameterized Complexity, Compressed Data Structures and Compressed Indices (Dagstuhl Seminar 18281)}},
  pages =	{44--61},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2019},
  volume =	{8},
  number =	{7},
  editor =	{J{\'e}r{\'e}my Barbay and Johannes Fischer and Stefan Kratsch and Srinivasa Rao Satti},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2019/10172},
  URN =		{urn:nbn:de:0030-drops-101724},
  doi =		{10.4230/DagRep.8.7.44},
  annote =	{Keywords: adaptive (analysis of) algorithms, compressed data structures, compressed indices, parameterized complexity}
}

Keywords: adaptive (analysis of) algorithms, compressed data structures, compressed indices, parameterized complexity
Seminar: Dagstuhl Reports, Volume 8, Issue 7
Issue Date: 2019
Date of publication: 22.01.2019


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI