Henryk Wozniakowski
Affiliations:- Columbia University, New York City, USA
According to our database1,
Henryk Wozniakowski
authored at least 142 papers
between 1977 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
On csauthors.net:
Bibliography
2024
Kateryna Pozharska is the winner of the 2023 Joseph F. Traub Information-Based Complexity Young Researcher Award.
J. Complex., February, 2024
2023
Adv. Comput. Math., April, 2023
2021
J. Complex., 2021
2020
Exponential tractability of linear weighted tensor product problems in the worst-case setting for arbitrary linear functionals.
J. Complex., 2020
2019
J. Complex., 2019
Simple characterizations of exponential tractability for linear multivariate problems.
J. Complex., 2019
2018
J. Complex., 2018
2017
Math. Comput., 2017
J. Complex., 2017
J. Complex., 2017
2016
Tractability of multivariate problems for standard and linear information in the worst case setting: Part I.
J. Approx. Theory, 2016
Tractability of multivariate approximation defined over Hilbert spaces with exponential weights.
J. Approx. Theory, 2016
2015
J. Complex., 2015
J. Complex., 2015
J. Complex., 2015
J. Complex., 2015
Found. Comput. Math., 2015
Dagstuhl Reports, 2015
2014
Multivariate integration of infinitely many times differentiable functions in weighted Korobov spaces.
Math. Comput., 2014
Math. Comput., 2014
Christoph Aistleitner Wins the 2013 Information-Based Complexity Young Researcher Award.
J. Complex., 2014
Shu Tezuka, Joos Heintz, Bart Kuijpers, and Andrés Rojas Paredes Share the 2013 Best Paper Award.
J. Complex., 2014
J. Complex., 2014
Proceedings of the Uniform Distribution and Quasi-Monte Carlo Methods, 2014
2012
On Dimension-independent Rates of Convergence for Function Approximation with Gaussian Kernels.
SIAM J. Numer. Anal., 2012
J. Complex., 2012
J. Complex., 2012
2011
Exponential convergence and tractability of multivariate integration for Korobov spaces.
Math. Comput., 2011
J. Complex., 2011
J. Complex., 2011
Aicke Hinrichs, Simon Foucart, Alain Pajor, Holger Rauhut, Tino Ullrich win the 2010 Best Paper Award.
J. Complex., 2011
The curse of dimensionality for the class of monotone functions and for the class of convex functions.
J. Approx. Theory, 2011
2010
2009
J. Complex., 2009
On the power of standard information for multivariate approximation in the worst case setting.
J. Approx. Theory, 2009
Polynomial-Time Algorithms for Multivariate Linear Problems with Finite-Order Weights: Average Case Setting.
Found. Comput. Math., 2009
Generalized Tractability for Multivariate Problems Part II: Linear Tensor Product Problems, Linear Information, and Unrestricted Tractability.
Found. Comput. Math., 2009
2008
J. Complex., 2008
Multivariate L<sub>∞</sub> approximation in the worst case setting over reproducing kernel Hilbert spaces.
J. Approx. Theory, 2008
2007
The Sturm-Liouville Eigenvalue Problem and NP-Complete Problems in the Quantum Setting with Queries.
Quantum Inf. Process., 2007
Math. Comput., 2007
The power of standard information for multivariate approximation in the randomized setting.
Math. Comput., 2007
Generalized tractability for multivariate problems Part I: Linear tensor product problems and linear information.
J. Complex., 2007
2006
Quantum Inf. Process., 2006
Numerische Mathematik, 2006
On the optimal convergence rate of universal and nonuniversal algorithms for multivariate integration and approximation.
Math. Comput., 2006
2005
Quantum Inf. Process., 2005
Polynomial-Time Algorithms for Multivariate Linear Problems with Finite-Order Weights: Worst Case Setting.
Found. Comput. Math., 2005
2004
J. Complex., 2004
J. Complex., 2004
J. Approx. Theory, 2004
Tractability of Approximation for Weighted Korobov Spaces on Classical and Quantum Computers.
Found. Comput. Math., 2004
2003
2002
Tractability of Integration in Non-periodic and Periodic Weighted Tensor Product Hilbert Spaces.
J. Complex., 2002
2001
Theor. Comput. Sci., 2001
J. Complex., 2001
Found. Comput. Math., 2001
2000
1999
Theor. Comput. Sci., 1999
J. Complex., 1999
1998
Estimating a largest eigenvector by Lanczos and polynomial algorithms with a random start.
Numer. Linear Algebra Appl., 1998
Numerical computation of characteristic polynomials of Boolean functions and its applications.
Numer. Algorithms, 1998
J. Complex., 1998
1997
Proceedings of the SOFSEM '97: Theory and Practice of Informatics, 1997
1996
1995
J. Complex., 1995
1994
Probabilistic Bounds on the Extremal Eigenvalues and Condition Number by the Lanczos Algorithm.
SIAM J. Matrix Anal. Appl., April, 1994
J. Complex., 1994
On Strong Tractability of Multivariate Problems.
Proceedings of the Technology and Foundations - Information Processing '94, Volume 1, Proceedings of the IFIP 13th World Computer Congress, Hamburg, Germany, 28 August, 1994
1993
J. Complex., 1993
Recent progress in information-based complexity.
Bull. EATCS, 1993
1992
Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start.
SIAM J. Matrix Anal. Appl., 1992
J. Complex., 1992
1989
1988
Information-based complexity.
Computer science and scientific computing, Academic Press, ISBN: 978-0-12-697545-1, 1988
1987
Complexity of approximation with relative error criterion in worst, average, and probabilistic settings.
J. Complex., 1987
1986
1985
1984
1983
A Note on Floating-point Summation of Very Many Terms.
J. Inf. Process. Cybern., 1983
1982
1980
A general theory of optimal algorithms.
ACM monograph series, Academic Press, ISBN: 978-0-12-697650-2, 1980
1979
1977
Proceedings of the Mathematical Foundations of Computer Science 1977, 1977