DROPS

Document

Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 23351)

Authors: Dmitriy Bilyk, Michael Gnewuch, Jan Vybíral, Larisa Yaroslavtseva, and Kumar Harsha

Published in: Dagstuhl Reports, Volume 13, Issue 8 (2024)

Abstract

The Dagstuhl Seminar 23351 was held at the Leibniz Center for Informatics, Schloss Dagstuhl, from August 27 to September 1, 2023. This event was the 14th in a series of Dagstuhl Seminars, starting in 1991. During the seminar, researchers presented overview talks, recent research results, work in progress and open problems. The first section of this report describes the goal of the seminar, the main seminar topics, and the general structure of the seminar. The third section contains the abstracts of the talks given during the seminar and the forth section the problems presented at the problem session.

Cite as

Dmitriy Bilyk, Michael Gnewuch, Jan Vybíral, Larisa Yaroslavtseva, and Kumar Harsha. Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 23351). In Dagstuhl Reports, Volume 13, Issue 8, pp. 106-128, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)

Copy BibTex To Clipboard

@Article{bilyk_et_al:DagRep.13.8.106,
  author =	{Bilyk, Dmitriy and Gnewuch, Michael and Vyb{\'\i}ral, Jan and Yaroslavtseva, Larisa and Harsha, Kumar},
  title =	{{Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 23351)}},
  pages =	{106--128},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2024},
  volume =	{13},
  number =	{8},
  editor =	{Bilyk, Dmitriy and Gnewuch, Michael and Vyb{\'\i}ral, Jan and Yaroslavtseva, Larisa and Harsha, Kumar},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.13.8.106},
  URN =		{urn:nbn:de:0030-drops-198152},
  doi =		{10.4230/DagRep.13.8.106},
  annote =	{Keywords: computational stochastics, infinite-variate problems, quasi-\{M\}onte \{C\}arlo, sampling, tractability analysis}
}

Document

DOI: 10.4230/DagRep.5.9.57

Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 15391)

Authors: Aicke Hinrichs, Joseph F. Traub, Henryk Wozniakowski, and Larisa Yaroslavtseva

Published in: Dagstuhl Reports, Volume 5, Issue 9 (2016)

Abstract

From 20.09.15 to 25.09.15, the Dagstuhl Seminar 15391 Algorithms and Complexity for Continuous Problems was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, participants presented their current research, and ongoing work and open problems were discussed. Abstracts or the presentations given during the seminar can be found in this report. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.

Cite as

Aicke Hinrichs, Joseph F. Traub, Henryk Wozniakowski, and Larisa Yaroslavtseva. Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 15391). In Dagstuhl Reports, Volume 5, Issue 9, pp. 57-76, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)

Copy BibTex To Clipboard

@Article{hinrichs_et_al:DagRep.5.9.57,
  author =	{Hinrichs, Aicke and Traub, Joseph F. and Wozniakowski, Henryk and Yaroslavtseva, Larisa},
  title =	{{Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 15391)}},
  pages =	{57--76},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2016},
  volume =	{5},
  number =	{9},
  editor =	{Hinrichs, Aicke and Traub, Joseph F. and Wozniakowski, Henryk and Yaroslavtseva, Larisa},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.5.9.57},
  URN =		{urn:nbn:de:0030-drops-56854},
  doi =		{10.4230/DagRep.5.9.57},
  annote =	{Keywords: High Dimensional Problems, Tractability, Random coefficients, Multilevel algorithms, computational stochastic processes, Compressed sensing, Learning theory}
}

Search Results

Documents authored by Yaroslavtseva, Larisa

Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 23351)

Abstract

Cite as

Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 15391)

Abstract

Cite as

Thanks for your feedback!

Could not send message