Continuous computational problems arise in diverse areas of science and engineering. There is great interest in computational aspects of multivariate problems. Examples include path and multivariate integration, function approximation, optimization, differential, integral and operator equations. Understanding the complexity of such problems and construction of efficient algorithms is both important and challenging.

An exciting area of research is algorithms and complexity for quantum computation. There will be a number of talks in this area. The study of quantum algorithms and complexity for continuous problems was recently initiated and will be discussed.

A major focus of the Workshop will continue to be the complexity of high dimensional problems and their tractability. Efficient or, ideally, optimal algorithms will be presented. Since Monte Carlo and/or quasi-Monte Carlo algorithms are often used for such problems, their efficiency will be addressed. There will be a number of talks on applications to finance. Models of computation and various settings (e.g., worst case, average case, or probabilistic) are important parts of the complexity study and these will be discussed as well.

Selected papers from the workshop will be published in a special issue of the Journal of Complexity.

Scope

Theoretical and applied research on algorithms and complexity for continuous problems

• Emanouil Atanassov (Academy of Sciences - Sofia, BG)
• Arvid Bessen (Columbia University - New York, US)
• Karl-Heinz Borgwardt (Universität Augsburg, DE)
• James M. Calvin (NJIT - Newark, US) [dblp]
• Ronald Cools (KU Leuven, BE) [dblp]
• Jakob Creutzig (TU Darmstadt, DE)
• Stephan Dahlke (Universität Marburg, DE) [dblp]
• Alexander Goldenshluger (Haifa University, IL)
• Hilde Govaert (KU Leuven, BE)
• Stefan Heinrich (TU Kaiserslautern, DE) [dblp]
• Peter Hertling (Universität der Bundeswehr - München, DE) [dblp]
• Norbert Hofmann (Aareal Bank AG - Wiesbaden, DE)
• Matthias U. Horn (Universität Jena, DE)
• Stefan Jaschke (Weierstraß Institut - Berlin, DE)
• Boleslaw Z. Kacewicz (AGH Univ. of Science & Technology-Krakow, PL)
• Reinhold Kainhofer (TU Graz, AT)
• Aneta Karaivanova (Academy of Sciences - Sofia, BG)
• Alexander Keller (Universität Ulm, DE) [dblp]
• Peter Kloeden (Universität Frankfurt, DE)
• Marek Kwas (Univ. of Inf. Technology & Management - Rzeszow, PL)
• Peter Mathé (Weierstraß Institut - Berlin, DE) [dblp]
• Klaus Meer (University of Southern Denmark - Odense, DK) [dblp]
• Hrushikesh N. Mhaskar (California State Univ. - Los Angeles, US)
• Thomas Müller-Gronbach (Universität Magdeburg, DE) [dblp]
• Erich Novak (Universität Jena, DE) [dblp]
• Anargyros Papageorgiou (Columbia University - New York, US) [dblp]
• Sergei Pereverzyev (RICAM - Linz, AT) [dblp]
• Knut Petras (Bergische Universität Wuppertal, DE)
• Harald Pfeiffer (Universität Jena, DE)
• Friedrich Pillichshammer (Universität Linz, AT) [dblp]
• Allan Pinkus (Technion - Haifa, IL)
• Leszek Plaskota (University of Warsaw, PL) [dblp]
• Klaus Ritter (TU Darmstadt, DE) [dblp]
• Wolfgang Ch. Schmid (Universität Salzburg, AT)
• Arjen Sevenster (Elsevier Publishing - Amsterdam, NL)
• Spencer Shellman (Los Alamos National Lab., US)
• Winfried Sickel (Universität Jena, DE) [dblp]
• Ian H. Sloan (UNSW - Sydney, AU) [dblp]
• Ingo Steinwart (Universität Jena, DE) [dblp]
• Vladimir N. Temlyakov (University of South Carolina, US) [dblp]
• Shu Tezuka (Kyushu University, JP)
• Joseph F. Traub (Columbia University - New York, US) [dblp]
• Grzegorz Wasilkowski (University of Kentucky - Lexington, US) [dblp]
• Carsten Wiegand (TU Kaiserslautern, DE)
• Henryk Wozniakowski (Columbia University - New York, US) [dblp]
• Peixin Ye (Chinese Academy of Sciences, CN)