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 (24)
Publication types (Num. hits)
article(953)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.

Results
Found 953 publication records. Showing 953 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Michael Gnewuch Weighted geometric discrepancies and numerical integration on reproducing kernel Hilbert spaces. Search on Bibsonomy J. Complexity The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Shun Zhang, Gensun Fang Gelfand and Kolmogorov numbers of Sobolev embeddings of weighted function spaces. Search on Bibsonomy J. Complexity The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Xiaoqun Wang, Ken Seng Tan How do path generation methods affect the accuracy of quasi-Monte Carlo methods for problems in finance? Search on Bibsonomy J. Complexity The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Xavier Dahan, Abdulilah Kadri, Éric Schost Bit-size estimates for triangular sets in positive dimension. Search on Bibsonomy J. Complexity The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Thomas Müller-Gronbach, Klaus Ritter, Larisa Yaroslavtseva Derandomization of the Euler scheme for scalar stochastic differential equations. Search on Bibsonomy J. Complexity The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Mehdi Slassi A Milstein-based free knot spline approximation for stochastic differential equations. Search on Bibsonomy J. Complexity The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Fu-Tao Hu, Jun-Ming Xu On the complexity of the bondage and reinforcement problems. Search on Bibsonomy J. Complexity The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Douglas P. Hardin, Edward B. Saff, J. Tyler Whitehouse Quasi-uniformity of minimal weighted energy points on compact metric spaces. Search on Bibsonomy J. Complexity The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Ioannis K. Argyros, Saïd Hilout Weaker conditions for the convergence of Newton's method. Search on Bibsonomy J. Complexity The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Jérémy Berthomieu, Luis Miguel Pardo Spherical Radon transform and the average of the condition number on certain Schubert subvarieties of a Grassmannian. Search on Bibsonomy J. Complexity The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Markus Weimar Tractability results for weighted Banach spaces of smooth functions. Search on Bibsonomy J. Complexity The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Alina Ostafe, Igor E. Shparlinski On the power generator and its multivariate analogue. Search on Bibsonomy J. Complexity The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Gunther Leobacher Fast orthogonal transforms and generation of Brownian paths. Search on Bibsonomy J. Complexity The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Dmitriy Bilyk, Vladimir N. Temlyakov, Rui Yu Fibonacci sets and symmetrization in discrepancy theory. Search on Bibsonomy J. Complexity The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint Complexity bounds for second-order optimality in unconstrained optimization. Search on Bibsonomy J. Complexity The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Grzegorz W. Wasilkowski Liberating the dimension for L2-approximation. Search on Bibsonomy J. Complexity The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1J. A. Ezquerro, Miquel Grau-Sánchez, M. A. Hernández Solving non-differentiable equations by a new one-point iterative method with memory. Search on Bibsonomy J. Complexity The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Shixin Zhu, Fulin Li Periodic sequences with maximal N-adic complexity and large k-error N-adic complexity over ZI(N). Search on Bibsonomy J. Complexity The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Juan-Luis García Zapata, Juan Carlos Díaz Martín A geometric algorithm for winding number computation with complexity analysis. Search on Bibsonomy J. Complexity The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Lutz Kämmerer, Stefan Kunis, Daniel Potts Interpolation lattices for hyperbolic cross trigonometric polynomials. Search on Bibsonomy J. Complexity The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Panos Giannopoulos, Christian Knauer, Magnus Wahlström, Daniel Werner Hardness of discrepancy computation and ε-net verification in high dimension. Search on Bibsonomy J. Complexity The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Orizon Pereira Ferreira, Benar Fux Svaiter A robust Kantorovich's theorem on the inexact Newton method with relative residual error tolerance. Search on Bibsonomy J. Complexity The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Harald Niederreiter The independence of two randomness properties of sequences over finite fields. Search on Bibsonomy J. Complexity The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Yong-Dao Zhou, Kai-Tai Fang, Jian-Hui Ning Constructing uniform designs: A heuristic integer programming method. Search on Bibsonomy J. Complexity The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Fang Pang, Min-Qian Liu Geometric isomorphism check for symmetric factorial designs. Search on Bibsonomy J. Complexity The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Thomas Daun On the randomized solution of initial value problems. Search on Bibsonomy J. Complexity The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Erich Novak, Ian H. Sloan, Joseph F. Traub, Henryk Wozniakowski Aicke Hinrichs, Simon Foucart, Alain Pajor, Holger Rauhut, Tino Ullrich win the 2010 Best Paper Award. Search on Bibsonomy J. Complexity The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Aicke Hinrichs, Lev Markhasin On lower bounds for the L2-discrepancy. Search on Bibsonomy J. Complexity The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Christoph Aistleitner Covering numbers, dyadic chaining and discrepancy. Search on Bibsonomy J. Complexity The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Gerardo Honorato, Sergio Plaza, Natalia Romero Dynamics of a higher-order family of iterative methods. Search on Bibsonomy J. Complexity The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Vasile Sinescu, Pierre L'Ecuyer Existence and construction of shifted lattice rules with an arbitrary number of points and bounded weighted star discrepancy for general decreasing weights. Search on Bibsonomy J. Complexity The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1James M. Calvin A lower bound on complexity of optimization under the r-fold integrated Wiener measure. Search on Bibsonomy J. Complexity The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1F. Bauer, Peter Mathé Parameter choice methods using minimization schemes. Search on Bibsonomy J. Complexity The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Hongwei Huang, Kunyang Wang On the widths of Sobolev classes. Search on Bibsonomy J. Complexity The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Stéphane Ballet, Julia Pieltant On the tensor rank of multiplication in any extension of Fs. Search on Bibsonomy J. Complexity The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Jan Baldeaux, Josef Dick, Julia Greslehner, Friedrich Pillichshammer Construction algorithms for higher order polynomial lattice rules. Search on Bibsonomy J. Complexity The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Nardo Giménez, Joos Heintz, Guillermo Matera, Pablo Solernó Lower complexity bounds for interpolation algorithms. Search on Bibsonomy J. Complexity The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Grzegorz W. Wasilkowski, Henryk Wozniakowski Liberating the dimension for function approximation. Search on Bibsonomy J. Complexity The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Stefan Heinrich, Bernhard Milla The randomized complexity of indefinite integration. Search on Bibsonomy J. Complexity The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Ying Jiang, Yuesheng Xu B-spline quasi-interpolation on sparse grids. Search on Bibsonomy J. Complexity The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Erich Novak, Henryk Wozniakowski Lower bounds for the complexity of linear functionals in the randomized setting. Search on Bibsonomy J. Complexity The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Ioannis K. Argyros, Saïd Hilout A unifying theorem for Newton's method on spaces with a convergence structure. Search on Bibsonomy J. Complexity The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1P. Wojtaszczyk Complexity of approximation of functions of few variables in high dimensions. Search on Bibsonomy J. Complexity The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Krzysztof Latuszynski, Wojciech Niemiro Rigorous confidence bounds for MCMC under a geometric drift condition. Search on Bibsonomy J. Complexity The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Zhiqiang Xu Deterministic sampling of sparse trigonometric polynomials. Search on Bibsonomy J. Complexity The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Grzegorz W. Wasilkowski, Henryk Wozniakowski Liberating the dimension for function approximation: Standard information. Search on Bibsonomy J. Complexity The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Ernesto De Vito, Veronica Umanità, Silvia Villa A consistent algorithm to solve Lasso, elastic-net and Tikhonov regularization. Search on Bibsonomy J. Complexity The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Frank Filbir, Hrushikesh Narhar Mhaskar Marcinkiewicz-Zygmund measures on manifolds. Search on Bibsonomy J. Complexity The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Aicke Hinrichs, Jan Vybíral On positive positive-definite functions and Bochner's Theorem. Search on Bibsonomy J. Complexity The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Dinh Dung B-spline quasi-interpolant representations and sampling recovery of functions with mixed smoothness. Search on Bibsonomy J. Complexity The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1O. P. Ferreira, M. L. N. Gonçalves, P. R. Oliveira Local convergence analysis of the Gauss-Newton method under a majorant condition. Search on Bibsonomy J. Complexity The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Vladislav F. Babenko, Sergiy V. Borodachov, Dmytro S. Skorokhodov Optimal cubature formulas for tensor products of certain classes of functions. Search on Bibsonomy J. Complexity The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Thomas Kühn Covering numbers of Gaussian reproducing kernel Hilbert spaces. Search on Bibsonomy J. Complexity The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Thomas Müller-Gronbach, Leszek Plaskota, Wolfgang Ch. Schmid Guest Editors' Preface. Search on Bibsonomy J. Complexity The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Guillaume Chèze Computation of Darboux polynomials and rational first integrals with bounded degree in polynomial time. Search on Bibsonomy J. Complexity The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Ben Niu, Fred J. Hickernell, Thomas Müller-Gronbach, Klaus Ritter Deterministic multi-level algorithms for infinite-dimensional integration on RN. Search on Bibsonomy J. Complexity The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Leszek Plaskota, Grzegorz W. Wasilkowski Tractability of infinite-dimensional integration in the worst case and randomized settings. Search on Bibsonomy J. Complexity The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Cheng Wang, Ding-Xuan Zhou Optimal learning rates for least squares regularized regression with unbounded sampling. Search on Bibsonomy J. Complexity The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Kerstin Hesse Complexity of numerical integration over spherical caps in a Sobolev space setting. Search on Bibsonomy J. Complexity The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Anargyros Papageorgiou, Iasonas Petras Tractability of tensor product problems in the average case setting. Search on Bibsonomy J. Complexity The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Michael Gnewuch, Henryk Wozniakowski Quasi-polynomial tractability. Search on Bibsonomy J. Complexity The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Guillaume Chèze Nearly optimal algorithms for the decomposition of multivariate rational functions and the extended Lüroth Theorem. Search on Bibsonomy J. Complexity The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Ioannis K. Argyros, Saïd Hilout Improved generalized differentiability conditions for Newton-like methods. Search on Bibsonomy J. Complexity The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Diego Armentano Stochastic perturbations and smooth condition numbers. Search on Bibsonomy J. Complexity The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Chen Guanggui, Nie Pengjuan, Luo Xinjian The approximation characteristic of diagonal matrix in probabilistic setting. Search on Bibsonomy J. Complexity The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Michael Griebel, Markus Holtz Dimension-wise integration of high-dimensional functions with applications to finance. Search on Bibsonomy J. Complexity The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Stephan Dahlke, Erich Novak, Winfried Sickel Optimal approximation of elliptic problems by linear and nonlinear mappings IV: Errors in L2 and other norms. Search on Bibsonomy J. Complexity The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Felipe Cucker, Raphael Hauser, Martin Lotz Adversarial smoothed analysis. Search on Bibsonomy J. Complexity The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Dima Grigoriev, Gerald Tenenbaum A low complexity probabilistic test for integer multiplication. Search on Bibsonomy J. Complexity The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Ioannis K. Argyros, Saïd Hilout Inexact Newton-type methods. Search on Bibsonomy J. Complexity The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Kuan-Yu Chen, Ping-Hui Hsu, Kun-Mao Chao Hardness of comparing two run-length encoded strings. Search on Bibsonomy J. Complexity The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Dennis Cheung, Felipe Cucker, Javier Peña On strata of degenerate polyhedral cones, II: Relations between condition measures. Search on Bibsonomy J. Complexity The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Anargyros Papageorgiou, Henryk Wozniakowski Tractability through increasing smoothness. Search on Bibsonomy J. Complexity The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Annamaria Mazzia, Giorgio Pini Product Gauss quadrature rules vs. cubature rules in the meshless local Petrov-Galerkin method. Search on Bibsonomy J. Complexity The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Vladislav F. Babenko, Sergiy V. Borodachov, Dmytro S. Skorokhodov Optimal recovery of isotropic classes of twice-differentiable multivariate functions. Search on Bibsonomy J. Complexity The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Guohui Song, Yuesheng Xu Approximation of high-dimensional kernel matrices by multilevel circulant matrices. Search on Bibsonomy J. Complexity The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Murat Cenk, Ferruh Özbudak On multiplication in finite fields. Search on Bibsonomy J. Complexity The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Zhenxiang Zhang On the effectiveness of a generalization of Miller's primality theorem. Search on Bibsonomy J. Complexity The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Q. T. Le Gia, T. Tran An overlapping additive Schwarz preconditioner for interpolation on the unit sphere with spherical radial basis functions. Search on Bibsonomy J. Complexity The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Martin Weimann A lifting and recombination algorithm for rational factorization of sparse polynomials. Search on Bibsonomy J. Complexity The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Gottlieb Pirsic, Arne Winterhof On the structure of digital explicit nonlinear and inversive pseudorandom number generators. Search on Bibsonomy J. Complexity The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Petko D. Proinov New general convergence theory for iterative processes and its applications to Newton-Kantorovich type theorems. Search on Bibsonomy J. Complexity The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Benjamin Doerr, Michael Gnewuch, Magnus Wahlström Algorithmic construction of low-discrepancy point sets via dependent randomized rounding. Search on Bibsonomy J. Complexity The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Chong Li, Nuchun Hu, Jinhua Wang Convergence behavior of Gauss-Newton's method and extensions of the Smale point estimate theory. Search on Bibsonomy J. Complexity The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Markus Hegland, Stefan Heinrich, Ian H. Sloan Guest Editors' Preface. Search on Bibsonomy J. Complexity The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Aicke Hinrichs Optimal importance sampling for the approximation of integrals. Search on Bibsonomy J. Complexity The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1T. Jordão, V. A. Menegatto Integral operators generated by multi-scale kernels. Search on Bibsonomy J. Complexity The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Frances Y. Kuo, Ian H. Sloan, Grzegorz W. Wasilkowski, Henryk Wozniakowski Liberating the dimension. Search on Bibsonomy J. Complexity The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Michael Griebel, Frances Y. Kuo, Ian H. Sloan The smoothing effect of the ANOVA decomposition. Search on Bibsonomy J. Complexity The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Clint Scovel, Don R. Hush, Ingo Steinwart, James Theiler Radial kernels and their reproducing kernel Hilbert spaces. Search on Bibsonomy J. Complexity The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Dirk Pflüger, Benjamin Peherstorfer, Hans-Joachim Bungartz Spatially adaptive sparse grids for high-dimensional data-driven problems. Search on Bibsonomy J. Complexity The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Frances Y. Kuo, Ian H. Sloan, Grzegorz W. Wasilkowski, Benjamin J. Waterhouse Randomly shifted lattice rules with the optimal rate of convergence for unbounded integrands. Search on Bibsonomy J. Complexity The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Fred J. Hickernell, Thomas Müller-Gronbach, Ben Niu, Klaus Ritter Multi-level Monte Carlo algorithms for infinite-dimensional integration on RN. Search on Bibsonomy J. Complexity The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Linqiang Pan, Mario J. Pérez-Jiménez Computational complexity of tissue-like P systems. Search on Bibsonomy J. Complexity The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Simon Foucart, Alain Pajor, Holger Rauhut, Tino Ullrich The Gelfand widths of lp-balls for 0p<=1. Search on Bibsonomy J. Complexity The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Ying Jiang, Yuesheng Xu Fast discrete algorithms for sparse Fourier expansions of high dimensional functions. Search on Bibsonomy J. Complexity The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Josef Dick, Harald Niederreiter Duality for digital sequences. Search on Bibsonomy J. Complexity The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Bernard Bialecki, Baker R. Kearfott, Krzysztof A. Sikorski, Masaki Sugihara Guest editors' preface: Issue dedicated to Professor Frank Stenger. Search on Bibsonomy J. Complexity The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Christine De Mol, Ernesto De Vito, Lorenzo Rosasco Elastic-net regularization in learning theory. Search on Bibsonomy J. Complexity The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Joanna Kapusta, Ryszard Smarzewski Fast algorithms for multivariate interpolation and evaluation at special points. Search on Bibsonomy J. Complexity The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 953 (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.