The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications at "J. Complexity"( http://dblp.L3S.de/Venues/J._Complexity )

URL (DBLP): http://dblp.uni-trier.de/db/journals/jc

Publication years (Num. hits)
1985 (17) 1986 (21) 1987 (25) 1988 (20) 1989 (30) 1990 (25) 1991 (29) 1992 (27) 1993 (32) 1994 (25) 1995 (25) 1996 (35) 1997 (31) 1998 (27) 1999 (32) 2000 (34) 2001 (43) 2002 (49) 2003 (49) 2004 (52) 2005 (48) 2006 (49) 2007 (54) 2008 (37) 2009 (41) 2010 (35) 2011 (37) 2012 (35) 2013 (28) 2014 (48) 2015 (49) 2016 (48) 2017 (43) 2018 (38) 2019 (15)
Publication types (Num. hits)
article(1233)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.

Results
Found 1233 publication records. Showing 1233 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Peter Kritzer, Henryk Wozniakowski Simple characterizations of exponential tractability for linear multivariate problems. Search on Bibsonomy J. Complexity The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Yoshihito Kazashi, Quoc Thong Le Gia A non-uniform discretization of stochastic heat equations with multiplicative noise on the unit sphere. Search on Bibsonomy J. Complexity The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1David Krieg Uniform recovery of high-dimensional Cr-functions. Search on Bibsonomy J. Complexity The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Jia Chen, Heping Wang Approximation numbers of Sobolev and Gevrey type embeddings on the sphere and on the ball - Preasymptotics, asymptotics, and tractability. Search on Bibsonomy J. Complexity The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1David Barrera, Emmanuel Gobet Quantitative bounds for concentration-of-measure inequalities and empirical regression: The independent case. Search on Bibsonomy J. Complexity The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Shao-Bo Lin Nonparametric regression using needlet kernels for spherical data. Search on Bibsonomy J. Complexity The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Albert Cohen, Marguerite Zani IHP Meeting Special Issue. Search on Bibsonomy J. Complexity The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Henryk Wozniakowski ABC on IBC. Search on Bibsonomy J. Complexity The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Sotirios Sabanis, Ying Zhang On explicit order 1.5 approximations with varying coefficients: The case of super-linear diffusion coefficients. Search on Bibsonomy J. Complexity The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Alexey A. Khartov, Marguerite Zani Asymptotic analysis of average case approximation complexity of additive random fields. Search on Bibsonomy J. Complexity The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Aicke Hinrichs, Joscha Prochno, Mario Ullrich, Jan Vybíral The minimal k-dispersion of point sets in high dimensions. Search on Bibsonomy J. Complexity The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Nardo Giménez, Guillermo Matera On the bit complexity of polynomial system solving. Search on Bibsonomy J. Complexity The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Gilles Didier Optimal pattern matching algorithms. Search on Bibsonomy J. Complexity The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1H. N. Mhaskar Function approximation with zonal function networks with activation functions analogous to the rectified linear unit functions. Search on Bibsonomy J. Complexity The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Aicke Hinrichs, Joscha Prochno, Mario Ullrich The curse of dimensionality for numerical integration on general domains. Search on Bibsonomy J. Complexity The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Zvonko Iljazovic, Igor Susic Semicomputable manifolds in computable topological spaces. Search on Bibsonomy J. Complexity The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Erich Novak 2018 Joseph F. Traub Information-Based Complexity Young Researcher Award: Nomination deadline: Sept. 30 2018. Search on Bibsonomy J. Complexity The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Stefan Heinrich On the complexity of computing the Lq norm. Search on Bibsonomy J. Complexity The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Kateryna Tatarko An upper bound on the smallest singular value of a square random matrix. Search on Bibsonomy J. Complexity The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Jia Chen, Heping Wang, Jie Zhang Average case (s, t)-weak tractability of non-homogeneous tensor product problems. Search on Bibsonomy J. Complexity The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Alexander B. Reznikov, Edward B. Saff, A. Volberg Covering and separation of Chebyshev points for non-integrable Riesz potentials. Search on Bibsonomy J. Complexity The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Domingo Gómez-Pérez, Min Sha, Andrew Z. Tirkel On the linear complexity for multidimensional sequences. Search on Bibsonomy J. Complexity The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Marek Karpinski, László Mérai, Igor E. Shparlinski Identity testing and interpolation from high powers of polynomials of large degree over finite fields. Search on Bibsonomy J. Complexity The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Hongzhi Tong, Michael Ng Analysis of regularized least squares for functional linear regression model. Search on Bibsonomy J. Complexity The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Pascal Koiran, Timothée Pecatte, Ignacio García-Marco On the linear independence of shifted powers. Search on Bibsonomy J. Complexity The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1A.-L. Haji-Ali, Helmut Harbrecht, Michael Peters, Markus Siebenmorgen Novel results for the anisotropic sparse grid quadrature. Search on Bibsonomy J. Complexity The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Boleslaw Z. Kacewicz Asymptotically tight worst case complexity bounds for initial-value problems with nonadaptive information. Search on Bibsonomy J. Complexity The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Pawel Siedlecki (s, t)-weak tractability of Euler and Wiener integrated processes. Search on Bibsonomy J. Complexity The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Ian H. Sloan, Henryk Wozniakowski Multivariate approximation for analytic functions with Gaussian kernels. Search on Bibsonomy J. Complexity The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Friedrich Pillichshammer Tractability properties of the weighted star discrepancy of regular grids. Search on Bibsonomy J. Complexity The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Vladimir N. Temlyakov Universal discretization. Search on Bibsonomy J. Complexity The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Konstantin Yu. Osipenko Recovery of derivatives for functions defined on the semiaxis. Search on Bibsonomy J. Complexity The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Erich Novak Takashi Goda and Larisa Yaroslavtseva share the 2017 Joseph F. Traub Information-Based Complexity Young Researcher Award. Search on Bibsonomy J. Complexity The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Joseph Dick, Aicke Hinrichs, Erich Novak, Klaus Ritter 0001, Ian H. Sloan, Grzegorz W. Wasilkowski, Henryk Wozniakowski New Members of the Editorial Board. Search on Bibsonomy J. Complexity The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Litao Ding, Shuai Lu, Jin Cheng Weak-norm posterior contraction rate of the 4DVAR method for linear severely ill-posed problems. Search on Bibsonomy J. Complexity The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Roswitha Hofer A metric result for special sequences related to the Halton sequences. Search on Bibsonomy J. Complexity The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Joris van der Hoeven, Grégoire Lecerf Modular composition via factorization. Search on Bibsonomy J. Complexity The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Junhong Lin, Lorenzo Rosasco Generalization properties of doubly stochastic learning algorithms. Search on Bibsonomy J. Complexity The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Robert J. Kunsch Breaking the curse for uniform approximation in Hilbert spaces via Monte Carlo methods. Search on Bibsonomy J. Complexity The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Alexander E. Litvak, Anna Lytova, Konstantin E. Tikhomirov, Nicole Tomczak-Jaegermann, Pierre Youssef The rank of random regular digraphs of constant degree. Search on Bibsonomy J. Complexity The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Martin Avendano, Roman Kogan, Mounir Nisse, J. Maurice Rojas Metric estimates and membership complexity for Archimedean amoebae and tropical hypersurfaces. Search on Bibsonomy J. Complexity The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Julian Grote, Christoph Thäle Gaussian polytopes: A cumulant-based approach. Search on Bibsonomy J. Complexity The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Sjoerd Dirksen, Tino Ullrich Gelfand numbers related to structured sparsity and Besov space embeddings with small mixed smoothness. Search on Bibsonomy J. Complexity The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Glenn Byrenheid, Robert J. Kunsch, Van Kien Nguyen Monte Carlo methods for uniform approximation on periodic Sobolev spaces with mixed smoothness. Search on Bibsonomy J. Complexity The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Mario Ullrich, Jan Vybíral An upper bound on the minimal dispersion. Search on Bibsonomy J. Complexity The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1David Krieg On the dispersion of sparse grids. Search on Bibsonomy J. Complexity The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Dinh Dung, Michael Griebel, Vu Nhat Huy, Christian Rieger ε-dimension in infinite dimensional hyperbolic cross approximation and application to parametric elliptic PDEs. Search on Bibsonomy J. Complexity The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1David Krieg Tensor power sequences and the approximation of tensor product operators. Search on Bibsonomy J. Complexity The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Cordian Riener, Markus Schweighofer Optimization approaches to quadrature: New characterizations of Gaussian quadrature on the line and quadrature with few nodes on plane algebraic curves, on the plane and in higher dimensions. Search on Bibsonomy J. Complexity The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Josef Dick, Aicke Hinrichs, Erich Novak, Klaus Ritter 0001, Ian H. Sloan, Grzegorz W. Wasilkowski, Henryk Wozniakowski Changes of the Editorial Board. Search on Bibsonomy J. Complexity The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Eike Neumann, Arno Pauly A topological view on algebraic computation models. Search on Bibsonomy J. Complexity The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Anna Breger, Martin Ehler, Manuel Gräf Points on manifolds with asymptotically optimal covering radius. Search on Bibsonomy J. Complexity The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Janak Raj Sharma, Deepak Kumar A fast and efficient composite Newton-Chebyshev method for systems of nonlinear equations. Search on Bibsonomy J. Complexity The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Si Tiep Dinh, Tien Son Pham Łojasiewicz inequalities with explicit exponents for smallest singular value functions. Search on Bibsonomy J. Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Helene Laimer On combined component-by-component constructions of lattice point sets. Search on Bibsonomy J. Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Dennis Amelunxen, Martin Lotz Average-case complexity without the black swans. Search on Bibsonomy J. Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Larisa Yaroslavtseva On non-polynomial lower error bounds for adaptive strong approximation of SDEs. Search on Bibsonomy J. Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Pamela McCorduck Some personal things about Joseph Traub. Search on Bibsonomy J. Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Peter Dencker, Wolfgang Erb, Yurii Kolomoitsev, Tetiana Lomako Lebesgue constants for polyhedral sets and polynomial interpolation on Lissajous-Chebyshev nodes. Search on Bibsonomy J. Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Arthur G. Werschulz, Henryk Wozniakowski A new characterization of (s, t)-weak tractability. Search on Bibsonomy J. Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Guillermo Matera, Mariana Pérez, Melina Privitelli On the computation of rational points of a hypersurface over a finite field. Search on Bibsonomy J. Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Sou-Cheng T. Choi, Yuhan Ding, Fred J. Hickernell, Xin Tong Local adaption for approximation and minimization of univariate functions. Search on Bibsonomy J. Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Kosuke Suzuki Super-polynomial convergence and tractability of multivariate integration for infinitely times differentiable functions. Search on Bibsonomy J. Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Peter Kritzer, Friedrich Pillichshammer, Henryk Wozniakowski L∞-Approximation in Korobov spaces with exponential weights. Search on Bibsonomy J. Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Aicke Hinrichs, Erich Novak, Mario Ullrich, Henryk Wozniakowski Product rules are optimal for numerical integration in classical smoothness spaces. Search on Bibsonomy J. Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Jia Chen, Heping Wang Preasymptotics and asymptotics of approximation numbers of anisotropic Sobolev embeddings. Search on Bibsonomy J. Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Boleslaw Z. Kacewicz Complexity of certain nonlinear two-point BVPs with Neumann boundary conditions. Search on Bibsonomy J. Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Michael Griebel, Peter Oswald Stable splittings of Hilbert spaces of functions of infinitely many variables. Search on Bibsonomy J. Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Malgorzata Moczurad, Piotr Zgliczynski On the Petras algorithm for verified integration of piecewise analytic functions. Search on Bibsonomy J. Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Michael Gnewuch, Mario Hefter, Aicke Hinrichs, Klaus Ritter 0001, Grzegorz W. Wasilkowski Equivalence of weighted anchored and ANOVA spaces of functions with mixed smoothness of order one in Lp. Search on Bibsonomy J. Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Erich Novak Winners of the 2016 Best Paper Award. Search on Bibsonomy J. Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Peter Bürgisser, Felipe Cucker, Elisa Rocha Cardozo On the condition of the zeros of characteristic polynomials. Search on Bibsonomy J. Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Ignacio García-Marco, Pascal Koiran Lower bounds by Birkhoff interpolation. Search on Bibsonomy J. Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Yongping Liu, Guiqiao Xu Average case tractability of a multivariate approximation problem. Search on Bibsonomy J. Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Ioannis K. Argyros, Gilson N. Silva Extended Traub-Woźniakowski convergence and complexity of Newton iteration in Banach space. Search on Bibsonomy J. Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1James M. Calvin, Mario Hefter, André Herzwurm Adaptive approximation of the minimum of Brownian motion. Search on Bibsonomy J. Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Thomas Daun, Stefan Heinrich Complexity of Banach space valued and parametric stochastic Itô integration. Search on Bibsonomy J. Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Haralambos Evangelaras, Markos V. Koutras On second order orthogonal Latin hypercube designs. Search on Bibsonomy J. Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1George Labahn, Vincent Neiger, Wei Zhou Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix. Search on Bibsonomy J. Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Anargyros Papageorgiou, Iasonas Petras, Henryk Wozniakowski (s, lnκ)-weak tractability of linear problems. Search on Bibsonomy J. Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Alexander D. Gilbert, Greg W. Wasilkowski Small superposition dimension and active set construction for multivariate integration under modest error demand. Search on Bibsonomy J. Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Henryk Wozniakowski In Memory of Joseph F. Traub (1932-2015). Search on Bibsonomy J. Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Michael Maller On the complexity of Anosov saddle transitions. Search on Bibsonomy J. Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Peter Mathé, Sergei V. Pereverzev Complexity of linear ill-posed problems in Hilbert space. Search on Bibsonomy J. Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Erich Novak 2017 Joseph F. Traub Information-Based Complexity Young Researcher Award: Nomination deadline: Sept. 30 2017. Search on Bibsonomy J. Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Paula Escorcielo, Daniel Perrucci On the Davenport-Mahler bound. Search on Bibsonomy J. Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Abhishake Rastogi, Sivananthan Sampath Multi-task learning via linear functional strategy. Search on Bibsonomy J. Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Kirkwood Cloud, Mark Huber Fast perfect simulation of Vervaat perpetuities. Search on Bibsonomy J. Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Erich Novak 2017 Joseph F. Traub Prize for Achievement in Information-Based Complexity. Search on Bibsonomy J. Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Peter Kritzer, Friedrich Pillichshammer, Grzegorz W. Wasilkowski A note on equivalence of anchored and ANOVA spaces; lower bounds. Search on Bibsonomy J. Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Markus Passenbrunner Orthogonal projectors onto spaces of periodic splines. Search on Bibsonomy J. Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Kai-Tai Fang, Xiao Ke, A. M. Elsawah Construction of uniform designs via an adjusted threshold accepting algorithm. Search on Bibsonomy J. Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Yoel Drori The exact information-based complexity of smooth convex minimization. Search on Bibsonomy J. Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Erich Novak Mario Hefter Wins the 2016 Joseph F. Traub Information-Based Complexity Young Researcher Award. Search on Bibsonomy J. Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Van Kien Nguyen Gelfand numbers of embeddings of mixed Besov spaces. Search on Bibsonomy J. Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Martijn Baartse, Klaus Meer An algebraic proof of the real number PCP theorem. Search on Bibsonomy J. Complexity The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Josef Dick, Peter Kritzer On a projection-corrected component-by-component construction. Search on Bibsonomy J. Complexity The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Konstantin Yu. Osipenko Optimal recovery of operators and multidimensional Carlson type inequalities. Search on Bibsonomy J. Complexity The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Yongping Liu, Guiqiao Xu A note on tractability of multivariate analytic problems. Search on Bibsonomy J. Complexity The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Dinh Dung, Charles A. Micchelli Corrigendum to "Multivariate approximation by translates of the Korobov function on Smolyak grids" [J. Complexity 29 (2013) 424-437]. Search on Bibsonomy J. Complexity The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 1233 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][8][9][10][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license