Search Results

Documents authored by Traub, Joseph

Found 2 Possible Name Variants:

Traub, Joseph F.

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}
}
Document
DOI: 10.4230/DagRep.2.9.200
Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 12391)

Authors: Alexander Keller, Frances Kuo, Andreas Neuenkirch, and Joseph F. Traub

Published in: Dagstuhl Reports, Volume 2, Issue 9 (2013)

Abstract
From 23.09.12 to 28.09.12, the Dagstuhl Seminar 12391 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 of 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

Alexander Keller, Frances Kuo, Andreas Neuenkirch, and Joseph F. Traub. Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 12391). In Dagstuhl Reports, Volume 2, Issue 9, pp. 200-225, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)

Copy BibTex To Clipboard

@Article{keller_et_al:DagRep.2.9.200,
  author =	{Keller, Alexander and Kuo, Frances and Neuenkirch, Andreas and Traub, Joseph F.},
  title =	{{Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 12391)}},
  pages =	{200--225},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2013},
  volume =	{2},
  number =	{9},
  editor =	{Keller, Alexander and Kuo, Frances and Neuenkirch, Andreas and Traub, Joseph F.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.2.9.200},
  URN =		{urn:nbn:de:0030-drops-38920},
  doi =		{10.4230/DagRep.2.9.200},
  annote =	{Keywords: Computational complexity of continuous problems, Partial information, Biomedical learning problems, Random media, Computational finance, Noisy data, Tractability, Quantum computation, Computational stochastic processes, High-dimensional problems}
}
Document
DOI: 10.4230/DagSemProc.09391.1
09391 Abstracts Collection – Algorithms and Complexity for Continuous Problems

Authors: Thomas Müller-Gronbach, Leszek Plaskota, and Joseph F. Traub

Published in: Dagstuhl Seminar Proceedings, Volume 9391, Algorithms and Complexity for Continuous Problems (2009)

Abstract
From 20.09.09 to 25.09.09, the Dagstuhl Seminar 09391 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 of the presentations given during the seminar are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.
Cite as

Thomas Müller-Gronbach, Leszek Plaskota, and Joseph F. Traub. 09391 Abstracts Collection – Algorithms and Complexity for Continuous Problems. In Algorithms and Complexity for Continuous Problems. Dagstuhl Seminar Proceedings, Volume 9391, pp. 1-23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)

Copy BibTex To Clipboard

@InProceedings{mullergronbach_et_al:DagSemProc.09391.1,
  author =	{M\"{u}ller-Gronbach, Thomas and Plaskota, Leszek and Traub, Joseph F.},
  title =	{{09391 Abstracts Collection – Algorithms and Complexity for Continuous Problems}},
  booktitle =	{Algorithms and Complexity for Continuous Problems},
  pages =	{1--23},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2009},
  volume =	{9391},
  editor =	{Thomas M\"{u}ller-Gronbach and Leszek Plaskota and Joseph. F. Traub},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09391.1},
  URN =		{urn:nbn:de:0030-drops-23005},
  doi =		{10.4230/DagSemProc.09391.1},
  annote =	{Keywords: Computational complexity of continuous problems, partial information, high-dimensional problems, tractability analysis, quasi-Monte Carlo methods, op operator equations, non-linear approximation, stochastic computation, ill posed-problems}
}
Document
DOI: 10.4230/DagSemProc.06391.1
06391 Abstracts Collection – Algorithms and Complexity for Continuous Problems

Authors: Stephan Dahlke, Klaus Ritter, Ian H. Sloan, and Joseph F. Traub

Published in: Dagstuhl Seminar Proceedings, Volume 6391, Algorithms and Complexity for Continuous Problems (2007)

Abstract
From 24.09.06 to 29.09.06, the Dagstuhl Seminar 06391 ``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 of the presentations given during the seminar are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.
Cite as

Stephan Dahlke, Klaus Ritter, Ian H. Sloan, and Joseph F. Traub. 06391 Abstracts Collection – Algorithms and Complexity for Continuous Problems. In Algorithms and Complexity for Continuous Problems. Dagstuhl Seminar Proceedings, Volume 6391, pp. 1-21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)

Copy BibTex To Clipboard

@InProceedings{dahlke_et_al:DagSemProc.06391.1,
  author =	{Dahlke, Stephan and Ritter, Klaus and Sloan, Ian H. and Traub, Joseph F.},
  title =	{{06391 Abstracts Collection – Algorithms and Complexity for Continuous Problems}},
  booktitle =	{Algorithms and Complexity for Continuous Problems},
  pages =	{1--21},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{6391},
  editor =	{Stephan Dahlke and Klaus Ritter and Ian H. Sloan and Joseph F. Traub},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06391.1},
  URN =		{urn:nbn:de:0030-drops-8782},
  doi =		{10.4230/DagSemProc.06391.1},
  annote =	{Keywords: Computational complexity, partial information, high-dimensional problems, operator equations, non-linear approximation, quantum computation, stochastic computation, ill posed-problems}
}
Document
DOI: 10.4230/DagSemProc.04401.1
04401 Abstracts Collection – Algorithms and Complexity for Continuous

Authors: Thomas Müller-Gronbach, Erich Novak, Knut Petras, and Joseph F. Traub

Published in: Dagstuhl Seminar Proceedings, Volume 4401, Algorithms and Complexity for Continuous Problems (2005)

Abstract
From 26.09.04 to 01.10.04, the Dagstuhl Seminar ``Algorithms and Complexity for Continuous Problems'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.
Cite as

Thomas Müller-Gronbach, Erich Novak, Knut Petras, and Joseph F. Traub. 04401 Abstracts Collection – Algorithms and Complexity for Continuous. In Algorithms and Complexity for Continuous Problems. Dagstuhl Seminar Proceedings, Volume 4401, pp. 1-21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)

Copy BibTex To Clipboard

@InProceedings{mullergronbach_et_al:DagSemProc.04401.1,
  author =	{M\"{u}ller-Gronbach, Thomas and Novak, Erich and Petras, Knut and Traub, Joseph F.},
  title =	{{04401 Abstracts Collection – Algorithms and Complexity for Continuous}},
  booktitle =	{Algorithms and Complexity for Continuous Problems},
  pages =	{1--21},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{4401},
  editor =	{Thomas M\"{u}ller-Gronbach and Erich Novak and Knut Petras and Joseph F. Traub},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04401.1},
  URN =		{urn:nbn:de:0030-drops-1545},
  doi =		{10.4230/DagSemProc.04401.1},
  annote =	{Keywords: Complexity and regularization of ill-posed problems , nonlinear approximation , tractability of high-dimensional numerical problems quantum computing , stochastic computation and quantization , global optimization , differential and integral equations}
}
Document
DOI: 10.4230/DagSemProc.04401.2
04401 Summary – Algorithms and Complexity for Continuous Problems

Authors: Thomas Müller-Gronbach, Erich Novak, Knut Petras, and Joseph F. Traub

Published in: Dagstuhl Seminar Proceedings, Volume 4401, Algorithms and Complexity for Continuous Problems (2005)

Abstract
The goal of this workshop was to bring together researchers from different communities working on computational aspects of continuous problems. Continuous computational problems arise in many areas of science and engineering. Examples include path and multivariate integration, function approximation, optimization, as well as differential, integral, and operator equations. Understanding the complexity of such problems and constructing efficient algorithms is both important and challenging. The workshop was of a very interdisciplinary nature with invitees from, e.g., computer science, numerical analysis, discrete, applied, and pure mathematics, physics, statistics, and scientific computation. Many of the lectures were presented by Ph.D. students. Compared to earlier meetings, several very active research areas received more emphasis. These include Quantum Computing, Complexity and Tractability of high-dimensional problems, Stochastic Computation, and Quantization, which was an entirely new field for this workshop. Due to strong connections between the topics treated at this workshop many of the participants initiated new cooperations and research projects. For more details, see the pdf-file with the same title.
Cite as

Thomas Müller-Gronbach, Erich Novak, Knut Petras, and Joseph F. Traub. 04401 Summary – Algorithms and Complexity for Continuous Problems. In Algorithms and Complexity for Continuous Problems. Dagstuhl Seminar Proceedings, Volume 4401, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)

Copy BibTex To Clipboard

@InProceedings{mullergronbach_et_al:DagSemProc.04401.2,
  author =	{M\"{u}ller-Gronbach, Thomas and Novak, Erich and Petras, Knut and Traub, Joseph F.},
  title =	{{04401 Summary – Algorithms and Complexity for Continuous Problems}},
  booktitle =	{Algorithms and Complexity for Continuous Problems},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{4401},
  editor =	{Thomas M\"{u}ller-Gronbach and Erich Novak and Knut Petras and Joseph F. Traub},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04401.2},
  URN =		{urn:nbn:de:0030-drops-1530},
  doi =		{10.4230/DagSemProc.04401.2},
  annote =	{Keywords: Complexity and Regularization of Ill-Posed Problems , Non-Linear Approximation , Tractability of High-Dimensional Numerical Problems Quasi-Monte Carlo Methods , Quantum Computing , Stochastic Computation and Quantization , Global Optimization , Differential and Integral Equation}
}
Document
DOI: 10.4230/DagSemRep.356
Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 02401)

Authors: Leszek Plakote, Klaus Ritter, Ian H. Sloan, and Joseph F. Traub

Published in: Dagstuhl Seminar Reports. Dagstuhl Seminar Reports, Volume 1 (2021)

Abstract
Cite as

Leszek Plakote, Klaus Ritter, Ian H. Sloan, and Joseph F. Traub. Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 02401). Dagstuhl Seminar Report 356, pp. 1-18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2003)

Copy BibTex To Clipboard

@TechReport{plakote_et_al:DagSemRep.356,
  author =	{Plakote, Leszek and Ritter, Klaus and Sloan, Ian H. and Traub, Joseph F.},
  title =	{{Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 02401)}},
  pages =	{1--18},
  ISSN =	{1619-0203},
  year =	{2003},
  type = 	{Dagstuhl Seminar Report},
  number =	{356},
  institution =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemRep.356},
  URN =		{urn:nbn:de:0030-drops-152361},
  doi =		{10.4230/DagSemRep.356},
}
Document
DOI: 10.4230/DagSemRep.211
Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 98201)

Authors: Peter Mathé, Klaus Ritter, and Joseph F. Traub

Published in: Dagstuhl Seminar Reports. Dagstuhl Seminar Reports, Volume 1 (2021)

Abstract
Cite as

Peter Mathé, Klaus Ritter, and Joseph F. Traub. Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 98201). Dagstuhl Seminar Report 211, pp. 1-25, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (1998)

Copy BibTex To Clipboard

@TechReport{mathe_et_al:DagSemRep.211,
  author =	{Math\'{e}, Peter and Ritter, Klaus and Traub, Joseph F.},
  title =	{{Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 98201)}},
  pages =	{1--25},
  ISSN =	{1619-0203},
  year =	{1998},
  type = 	{Dagstuhl Seminar Report},
  number =	{211},
  institution =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemRep.211},
  URN =		{urn:nbn:de:0030-drops-150972},
  doi =		{10.4230/DagSemRep.211},
}
Document
DOI: 10.4230/DagSemRep.159
Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 9643)

Authors: Erich Nowak, Joseph F. Traub, and Grzegorz W. Wasilkowski

Published in: Dagstuhl Seminar Reports. Dagstuhl Seminar Reports, Volume 1 (2021)

Abstract
Cite as

Erich Nowak, Joseph F. Traub, and Grzegorz W. Wasilkowski. Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 9643). Dagstuhl Seminar Report 159, pp. 1-25, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (1996)

Copy BibTex To Clipboard

@TechReport{nowak_et_al:DagSemRep.159,
  author =	{Nowak, Erich and Traub, Joseph F. and Wasilkowski, Grzegorz W.},
  title =	{{Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 9643)}},
  pages =	{1--25},
  ISSN =	{1619-0203},
  year =	{1996},
  type = 	{Dagstuhl Seminar Report},
  number =	{159},
  institution =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemRep.159},
  URN =		{urn:nbn:de:0030-drops-150465},
  doi =		{10.4230/DagSemRep.159},
}
Document
DOI: 10.4230/DagSemRep.101
Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 9442)

Authors: Stefan Heinrich, Joseph F. Traub, and Henryk Wozniakowski

Published in: Dagstuhl Seminar Reports. Dagstuhl Seminar Reports, Volume 1 (2021)

Abstract
Cite as

Stefan Heinrich, Joseph F. Traub, and Henryk Wozniakowski. Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 9442). Dagstuhl Seminar Report 101, pp. 1-22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (1994)

Copy BibTex To Clipboard

@TechReport{heinrich_et_al:DagSemRep.101,
  author =	{Heinrich, Stefan and Traub, Joseph F. and Wozniakowski, Henryk},
  title =	{{Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 9442)}},
  pages =	{1--22},
  ISSN =	{1619-0203},
  year =	{1994},
  type = 	{Dagstuhl Seminar Report},
  number =	{101},
  institution =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemRep.101},
  URN =		{urn:nbn:de:0030-drops-149891},
  doi =		{10.4230/DagSemRep.101},
}
Document
DOI: 10.4230/DagSemRep.50
Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 9242)

Authors: Erich Novak, Steve Smale, and Joseph F. Traub

Published in: Dagstuhl Seminar Reports. Dagstuhl Seminar Reports, Volume 1 (2021)

Abstract
Cite as

Erich Novak, Steve Smale, and Joseph F. Traub. Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 9242). Dagstuhl Seminar Report 50, pp. 1-24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (1992)

Copy BibTex To Clipboard

@TechReport{novak_et_al:DagSemRep.50,
  author =	{Novak, Erich and Smale, Steve and Traub, Joseph F.},
  title =	{{Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 9242)}},
  pages =	{1--24},
  ISSN =	{1619-0203},
  year =	{1992},
  type = 	{Dagstuhl Seminar Report},
  number =	{50},
  institution =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemRep.50},
  URN =		{urn:nbn:de:0030-drops-149383},
  doi =		{10.4230/DagSemRep.50},
}

Traub, Joseph

Document
DOI: 10.4230/DagSemRep.287
Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 00391)

Authors: Stefan Heinrich, Sergei Pereverzev, Joseph Traub, and Grzegorz Wasilkowski

Published in: Dagstuhl Seminar Reports. Dagstuhl Seminar Reports, Volume 1 (2021)

Abstract
Cite as

Stefan Heinrich, Sergei Pereverzev, Joseph Traub, and Grzegorz Wasilkowski. Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 00391). Dagstuhl Seminar Report 287, pp. 1-15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2001)

Copy BibTex To Clipboard

@TechReport{heinrich_et_al:DagSemRep.287,
  author =	{Heinrich, Stefan and Pereverzev, Sergei and Traub, Joseph and Wasilkowski, Grzegorz},
  title =	{{Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 00391)}},
  pages =	{1--15},
  ISSN =	{1619-0203},
  year =	{2001},
  type = 	{Dagstuhl Seminar Report},
  number =	{287},
  institution =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemRep.287},
  URN =		{urn:nbn:de:0030-drops-151719},
  doi =		{10.4230/DagSemRep.287},
}
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact