Erich Novak

Jan Vybíral

J. Complex., 2025

Matthieu Dolbeault is the winner of the 2024 Joseph F. Traub Information-Based Complexity Young Researcher Award.

[BibT_eX]

[DOI]

J. Complex., 2025

Intractability results for integration in tensor product spaces.

[BibT_eX]

[DOI]

J. Complex., 2025

2024

Changes of the Editorial Board.

[BibT_eX]

[DOI]

J. Complex., February, 2024

Kateryna Pozharska is the winner of the 2023 Joseph F. Traub Information-Based Complexity Young Researcher Award.

[BibT_eX]

[DOI]

J. Complex., February, 2024

David Krieg is the winner of the 2024 Joseph F. Traub Prize for Achievement in Information-Based Complexity.

[BibT_eX]

[DOI]

J. Complex., 2024

Thomas Jahn, Tino Ullrich and Felix Voigtlaender are the Winners of the 2023 Best Paper Award of the Journal of Complexity.

[BibT_eX]

[DOI]

J. Complex., 2024

Randomized approximation of summable sequences - adaptive and non-adaptive.

[BibT_eX]

[DOI]

Robert J. Kunsch

Marcin Wnuk

J. Approx. Theory, 2024

On the power of adaption and randomization.

[BibT_eX]

[DOI]

David Krieg

CoRR, 2024

Conditions for tractability of the weighted Lp-discrepancy and integration in non-homogeneous tensor product spaces.

[BibT_eX]

[DOI]

CoRR, 2024

The Lp-discrepancy for finite p>1 suffers from the curse of dimensionality.

[BibT_eX]

[DOI]

CoRR, 2024

2023

The curse of dimensionality for the Lp-discrepancy with finite p.

[BibT_eX]

[DOI]

J. Complex., December, 2023

Dmitriy Bilyk and Feng Dai are the winners of the 2023 Joseph F. Traub Prize for Achievement in Information-Based Complexity.

[BibT_eX]

[DOI]

J. Complex., August, 2023

Best Paper Award of the Journal of Complexity.

[BibT_eX]

[DOI]

J. Complex., April, 2023

Nominations for 2023 Joseph F. Traub Information-Based Complexity Young Researcher Award.

[BibT_eX]

[DOI]

J. Complex., April, 2023

Journal of Complexity Best Paper Award.

[BibT_eX]

[DOI]

J. Complex., April, 2023

Information-based complexity young researcher award.

[BibT_eX]

[DOI]

J. Complex., April, 2023

Optimal Algorithms for Numerical Integration: Recent Results and Open Problems.

[BibT_eX]

[DOI]

CoRR, 2023

The curse of dimensionality for the Lp-discrepancy with finite p.

[BibT_eX]

[DOI]

CoRR, 2023

2022

Recovery of Sobolev functions restricted to iid sampling.

[BibT_eX]

[DOI]

David Krieg

Mathias Sonnleitner

Math. Comput., 2022

Approximation and Geometry in High Dimensions.

[BibT_eX]

[DOI]

Joscha Prochno

J. Complex., 2022

Announcement: IBC award 2022 and the nomination deadline 2023.

[BibT_eX]

[DOI]

J. Complex., 2022

Nominations for 2022 Joseph F. Traub Information-Based Complexity Young Researcher Award.

[BibT_eX]

[DOI]

J. Complex., 2022

Michaela Szölgyenyi is the winner of the 2021 Joseph F. Traub Information-Based Complexity Young Researcher Award.

[BibT_eX]

[DOI]

J. Complex., 2022

Lower bounds for integration and recovery in L2.

[BibT_eX]

[DOI]

J. Complex., 2022

Changes of the Editorial Board.

[BibT_eX]

[DOI]

J. Complex., 2022

2021

V. N. Temlyakov, M. Ullrich and T. Ullrich are the winners of the 2021 Joseph F. Traub Prize for Achievement in Information-Based Complexity.

[BibT_eX]

[DOI]

J. Complex., 2021

Nominations for 2021 Joseph F. Traub Information-Based Complexity Young Researcher Award.

[BibT_eX]

[DOI]

J. Complex., 2021

David Krieg is the winner of the 2020 Joseph F. Traub Information-Based Complexity Young Researcher Award.

[BibT_eX]

[DOI]

J. Complex., 2021

Lower bounds for the error of quadrature formulas for Hilbert spaces.

[BibT_eX]

[DOI]

J. Complex., 2021

Lower bounds for integration and recovery in L2.

[BibT_eX]

[DOI]

CoRR, 2021

2020

Algorithms and complexity for functions on general domains.

[BibT_eX]

[DOI]

J. Complex., 2020

Heping Wang and Guiqiao Xu are the winners of the IBC Award 2020.

[BibT_eX]

[DOI]

J. Complex., 2020

Editorial board announcements.

[BibT_eX]

[DOI]

J. Complex., 2020

2019

Optimal Quadrature Formulas for the Sobolev Space $$H^1$$ H 1.

[BibT_eX]

[DOI]

Shun Zhang

J. Sci. Comput., 2019

Solvable integration problems and optimal sample size selection.

[BibT_eX]

[DOI]

Robert J. Kunsch

Daniel Rudolf

J. Complex., 2019

2018

2018 Joseph F. Traub Information-Based Complexity Young Researcher Award: Nomination deadline: Sept. 30 2018.

[BibT_eX]

[DOI]

J. Complex., 2018

Takashi Goda and Larisa Yaroslavtseva share the 2017 Joseph F. Traub Information-Based Complexity Young Researcher Award.

[BibT_eX]

[DOI]

J. Complex., 2018

Changes of the Editorial Board.

[BibT_eX]

[DOI]

J. Complex., 2018

New Members of the Editorial Board.

[BibT_eX]

[DOI]

J. Complex., 2018

2017

2017 Joseph F. Traub Prize for Achievement in Information-Based Complexity.

[BibT_eX]

[DOI]

J. Complex., 2017

Winners of the 2016 Best Paper Award.

[BibT_eX]

[DOI]

J. Complex., 2017

2017 Joseph F. Traub Information-Based Complexity Young Researcher Award: Nomination deadline: Sept. 30 2017.

[BibT_eX]

[DOI]

J. Complex., 2017

Mario Hefter Wins the 2016 Joseph F. Traub Information-Based Complexity Young Researcher Award.

[BibT_eX]

[DOI]

J. Complex., 2017

Product rules are optimal for numerical integration in classical smoothness spaces.

[BibT_eX]

[DOI]

J. Complex., 2017

A Universal Algorithm for Multivariate Integration.

[BibT_eX]

[DOI]

David Krieg

Found. Comput. Math., 2017

Complexity of oscillatory integrals on the real line.

[BibT_eX]

[DOI]

Adv. Comput. Math., 2017

2016

Nominations for 2016 Information-Based Complexity Young Researcher Award.

[BibT_eX]

[DOI]

J. Complex., 2016

Thomas Müller-Gronbach, Klaus Ritter and Larisa Yaroslavtseva share the 2015 Best Paper Award.

[BibT_eX]

[DOI]

J. Complex., 2016

Mario Ullrich Wins the 2015 Joseph F. Traub Information-Based Complexity Young Researcher Award.

[BibT_eX]

[DOI]

J. Complex., 2016

The Future of the Journal of Complexity.

[BibT_eX]

[DOI]

J. Complex., 2016

Tractability of multivariate problems for standard and linear information in the worst case setting: Part I.

[BibT_eX]

[DOI]

J. Approx. Theory, 2016

2015

In memory of Nikolai Sergeevich Bakhvalov (1934-2005).

[BibT_eX]

[DOI]

J. Complex., 2015

Complexity of oscillatory integration for univariate Sobolev spaces.

[BibT_eX]

[DOI]

J. Complex., 2015

Tino Ullrich Wins the 2014 Information-Based Complexity Young Researcher Award.

[BibT_eX]

[DOI]

J. Complex., 2015

Bernd Carl, Aicke Hinrichs, and Philipp Rudolph share the 2014 Best Paper Award.

[BibT_eX]

[DOI]

J. Complex., 2015

Joseph F. Traub, the Founding Editor of the Journal of Complexity, dies at 83.

[BibT_eX]

[DOI]

J. Complex., 2015

2014

The curse of dimensionality for numerical integration of smooth functions.

[BibT_eX]

[DOI]

Math. Comput., 2014

Announcement.

[BibT_eX]

[DOI]

J. Complex., 2014

Christoph Aistleitner Wins the 2013 Information-Based Complexity Young Researcher Award.

[BibT_eX]

[DOI]

J. Complex., 2014

Frances Kuo Wins the 2014 Information-Based Complexity Prize.

[BibT_eX]

[DOI]

J. Complex., 2014

Shu Tezuka, Joos Heintz, Bart Kuijpers, and Andrés Rojas Paredes Share the 2013 Best Paper Award.

[BibT_eX]

[DOI]

J. Complex., 2014

The curse of dimensionality for numerical integration of smooth functions II.

[BibT_eX]

[DOI]

J. Complex., 2014

Guest Editors' Preface.

[BibT_eX]

[DOI]

Andreas Neuenkirch

J. Complex., 2014

On weak tractability of the Clenshaw-Curtis Smolyak algorithm.

[BibT_eX]

[DOI]

J. Approx. Theory, 2014

Some Results on the Complexity of Numerical Integration.

[BibT_eX]

[DOI]

Proceedings of the Monte Carlo and Quasi-Monte Carlo Methods, 2014

2012

Thomas Daun, Leszek Plaskota, Greg W. Wasilkowski Win the 2011 Best Paper Award.

[BibT_eX]

[DOI]

J. Complex., 2012

Monte Carlo-Algorithmen.

[BibT_eX]

[DOI]

Springer-Lehrbuch, Springer, ISBN: 978-3-540-89140-6, 2012

2011

Lower bounds for the complexity of linear functionals in the randomized setting.

[BibT_eX]

[DOI]

J. Complex., 2011

Aicke Hinrichs, Simon Foucart, Alain Pajor, Holger Rauhut, Tino Ullrich win the 2010 Best Paper Award.

[BibT_eX]

[DOI]

J. Complex., 2011

The curse of dimensionality for the class of monotone functions and for the class of convex functions.

[BibT_eX]

[DOI]

J. Approx. Theory, 2011

2010

Optimal approximation of elliptic problems by linear and nonlinear mappings IV: Errors in L2 and other norms.

[BibT_eX]

[DOI]

J. Complex., 2010

2009

Approximation of infinitely differentiable multivariate functions is intractable.

[BibT_eX]

[DOI]

J. Complex., 2009

Changes to the Editorial Board.

[BibT_eX]

[DOI]

J. Complex., 2009

2008

Linear information versus function evaluations for L2-approximation.

[BibT_eX]

[DOI]

Jan Vybíral

J. Approx. Theory, 2008

2007

Cubature formulas for symmetric measures in higher dimensions with few points.

[BibT_eX]

[DOI]

Math. Comput., 2007

Simple Monte Carlo and the Metropolis algorithm.

[BibT_eX]

[DOI]

Peter Mathé

J. Complex., 2007

Optimal approximation of elliptic problems by linear and nonlinear mappings III: Frames.

[BibT_eX]

[DOI]

J. Complex., 2007

2006

Special issue.

[BibT_eX]

[DOI]

J. Complex., 2006

Optimal approximation of elliptic problems by linear and nonlinear mappings II.

[BibT_eX]

[DOI]

J. Complex., 2006

Optimal approximation of elliptic problems by linear and nonlinear mappings I.

[BibT_eX]

[DOI]

J. Complex., 2006

2004

Coin Tossing Algorithms for Integral Equations and Tractability.

[BibT_eX]

[DOI]

Harald Pfeiffer

Monte Carlo Methods Appl., 2004

Tractability of Approximation for Weighted Korobov Spaces on Classical and Quantum Computers.

[BibT_eX]

[DOI]

Ian H. Sloan

Found. Comput. Math., 2004

Optimal Approximation of Elliptic Problems by Linear and Nonlinear Mappings.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity for Continuous Problems, 26. September, 2004

04401 Abstracts Collection - Algorithms and Complexity for Continuous.

[BibT_eX]

[DOI]

Joseph F. Traub

Proceedings of the Algorithms and Complexity for Continuous Problems, 26. September, 2004

04401 Summary - Algorithms and Complexity for Continuous Problems.

[BibT_eX]

[DOI]

Joseph F. Traub

Proceedings of the Algorithms and Complexity for Continuous Problems, 26. September, 2004

Optimal Approximation of Elliptic Problems II: Wavelet Methods.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity for Continuous Problems, 26. September, 2004

2003

On a problem in quantum summation.

[BibT_eX]

[DOI]

Stefan Heinrich

J. Complex., 2003

2001

Spherical Product Algorithms and the Integration of Smooth Functions with One Singular Point.

[BibT_eX]

[DOI]

Ronald Cools

SIAM J. Numer. Anal., 2001

Intractability Results for Integration and Discrepancy.

[BibT_eX]

[DOI]

J. Complex., 2001

Quantum Complexity of Integration.

[BibT_eX]

[DOI]

J. Complex., 2001

GUEST EDITORS' PREFACE.

[BibT_eX]

[DOI]

Stefan Heinrich

J. Complex., 2001

2000

Complexity of Linear Problems with a Fixed Output Basis.

[BibT_eX]

[DOI]

J. Complex., 2000

High dimensional integration.

[BibT_eX]

[DOI]

Adv. Comput. Math., 2000

High dimensional polynomial interpolation on sparse grids.

[BibT_eX]

[DOI]

Volker Barthelmann

Adv. Comput. Math., 2000

1999

On the Cost of Uniform and Nonuniform Algorithms.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1999

Intractability Results for Positive Quadrature Formulas and Extremal Problems for Trigonometric Polynomials.

[BibT_eX]

[DOI]

J. Complex., 1999

Smolyak's Construction of Cubature Formulas of Arbitrary Trigonometric Degree.

[BibT_eX]

[DOI]

Ronald Cools

Computing, 1999

1997

Tractability of Tensor Product Linear Operators.

[BibT_eX]

[DOI]

Ian H. Sloan

J. Complex., 1997

Editor's Foreword: Dagstuhl Invited Papers.

[BibT_eX]

[DOI]

J. Complex., 1997

1996

Topological Complexity of Zero-Finding.

[BibT_eX]

[DOI]

J. Complex., 1996

Numerical Integration of Peak Functions.

[BibT_eX]

[DOI]

Ingo Roschmann

J. Complex., 1996

On the Power of Adaption.

[BibT_eX]

[DOI]

J. Complex., 1996

Quadrature Formulas for Multivariate Convex Functions.

[BibT_eX]

[DOI]

Carsten Katscher

J. Complex., 1996

1995

The Real Number Model in Numerical Analysis.

[BibT_eX]

[DOI]

J. Complex., 1995

1994

Information-Based Complexity (By Joseph F. Traub, G. W. Wasilkowski, and H. Woiniakowski).

[BibT_eX]

[DOI]

SIAM Rev., 1994

1993

Some Complexity Results for Zero Finding for Univariate Functions.

[BibT_eX]

[DOI]

J. Complex., 1993

1992

Relaxed verification for continuous problems.

[BibT_eX]

[DOI]

J. Complex., 1992

Optimal linear randomized methods for linear operators in Hilbert spaces.

[BibT_eX]

[DOI]

J. Complex., 1992

1989

A stochastic analog to Chebyshev centers and optimal average case algorithms.

[BibT_eX]

[DOI]

J. Complex., 1989

Average-case results for zero finding.

[BibT_eX]

[DOI]

J. Complex., 1989

On the adaptive and continuous information problems.

[BibT_eX]

[DOI]

Mark A. Kon

J. Complex., 1989

1986

On average case errors in numerical analysis.

[BibT_eX]

[DOI]