default search action
Journal of Complexity, Volume 31
Volume 31, Number 1, February 2015
- Cristóbal Guzmán
, Arkadi Nemirovski
On lower complexity bounds for large-scale smooth convex optimization. 1-14 - Erich Novak, Mario Ullrich
Complexity of oscillatory integration for univariate Sobolev spaces. 15-41 - Christiane Lemieux:
Tractability using periodized generalized Faure sequences. 42-56 - Safari Mukeru
The descriptive complexity of stochastic integration. 57-74 - Boleslaw Z. Kacewicz
Complexity of the derivative-free solution of systems of IVPs with unknown singularity hypersurface. 75-97 - Bing Guo, Qi Zhou, Runchu Zhang:
On construction of blocked general minimum lower-order confounding 2n-m: 2r designs with N/4+1 ≤ n ≤ 5N/16. 98-109 - Thomas Müller-Gronbach, Klaus Ritter, Larisa Yaroslavtseva:
On the complexity of computing quadrature formulas for marginal distributions of SDEs. 110-145
Volume 31, Number 2, April 2015
- Erich Novak, Ian H. Sloan
Tino Ullrich Wins the 2014 Information-Based Complexity Young Researcher Award. v
- Hans Triebel:
Global solutions of Navier-Stokes equations for large initial data belonging to spaces with dominating mixed smoothness. 147-161 - Wei Zhou, George Labahn, Arne Storjohann:
A deterministic algorithm for inverting a polynomial matrix. 162-173 - Christian Irrgeher, Gunther Leobacher
High-dimensional integration on Rd, weighted Hermite spaces, and orthogonal transforms. 174-205 - Alexander Kobel, Michael Sagraloff:
On the complexity of computing with planar algebraic curves. 206-236 - Takashi Goda
Constructing good higher order polynomial lattice rules with modulus of reduced degree. 237-259 - Roswitha Hofer:
Generalized Hofer-Niederreiter sequences and their discrepancy from an (u, e, s)-point of view. 260-276 - José Antonio Ezquerro
Center conditions on high order derivatives in the semilocal convergence of Newton's method. 277-292
Volume 31, Number 3, June 2015
- Erich Novak, Klaus Ritter, Ian H. Sloan
Bernd Carl, Aicke Hinrichs, and Philipp Rudolph share the 2014 Best Paper Award. v - Michael Gnewuch, Frances Y. Kuo
Guest Editors' Preface. vi
- Johann S. Brauchart, Peter J. Grabner
Distributing many points on spheres: Minimal energy and designs. 293-326 - Josef Dick
Proof techniques in quasi-Monte Carlo theory. 327-371
- István Berkes, Robert F. Tichy:
On permutation-invariance of limit theorems. 372-379 - Christian Irrgeher, Peter Kritzer
Integration in Hermite spaces of analytic functions. 380-404 - Mario Hefter, Klaus Ritter:
On embeddings of weighted tensor product Hilbert spaces. 405-423 - Lutz Kämmerer, Daniel Potts, Toni Volkmer:
Approximation of multivariate periodic functions by trigonometric polynomials based on sampling along rank-1 lattice with generating vector of Korobov form. 424-456 - Peter Kritzer
Propagation rules for (u,m,e,s)-nets and (u,e,s)-sequences. 457-473 - Gerhard Larcher:
On the star discrepancy of sequences in the unit interval. 474-485 - Stefan Steinerberger
A remark on the numerical integration of harmonic functions in the plane. 486-493
Volume 31, Number 4, August 2015
- Erich Novak, Henryk Wozniakowski:
In memory of Nikolai Sergeevich Bakhvalov (1934-2005). 495 - Vladimir M. Tikhomirov, V. B. Demidovich:
In memory of Nikolai Sergeevich Bakhvalov (1934-2005). 496-501 - Nikolai Sergeevich Bakhvalov:
On the approximate calculation of multiple integrals. 502-516 - Giovanni Migliorati, Fabio Nobile
Analysis of discrete least squares on multivariate polynomial spaces with evaluations at low-discrepancy point sets. 517-542 - Lutz Kämmerer, Daniel Potts, Toni Volkmer:
Approximation of multivariate periodic functions by trigonometric polynomials based on rank-1 lattice sampling. 543-576 - Dursun A. Bulutoglu, Kenneth Joseph Ryan:
Algorithms for finding generalized minimum aberration designs. 577-589 - Jérémy Berthomieu, Jean-Charles Faugère, Ludovic Perret:
Polynomial-time algorithms for quadratic isomorphism of polynomials: The regular case. 590-616 - Guiqiao Xu:
Exponential convergence-tractability of general linear problems in the average case setting. 617-636 - Daya Ram Sahu
Accessibility of solutions of operator equations by Newton-like methods. 637-657
Volume 31, Number 5, October 2015
- Mikhail Lifshits
Approximation of additive random fields based on standard information: Average case and probabilistic settings. 659-674 - Isaac Z. Pesenson:
Average sampling and space-frequency localized frames on bounded domains. 675-688 - Akitoshi Kawamura, Norbert Th. Müller, Carsten Rösnick, Martin Ziegler:
Computational benefit of smoothness: Parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy. 689-714 - Hassan Saberi Nik, Sohrab Effati
New ultimate bound sets and exponential finite-time synchronization for the complex Lorenz system. 715-730 - Qiuyan Wang, Yupeng Jiang, Dongdai Lin:
Linear complexity of binary generalized cyclotomic sequences over GF(q). 731-740 - Xiao Ke, Rong Zhang, Hua-Jun Ye:
Two- and three-level lower bounds for mixture L2-discrepancy and construction of uniform designs by threshold accepting. 741-753 - Nader Jafari Rad
NP-hardness of multiple bondage in graphs. 754-761 - Rui-Yuan Cao, Min-Qian Liu
Construction of second-order orthogonal sliced Latin hypercube designs. 762-772
Volume 31, Number 6, December 2015
- Erich Novak, Klaus Ritter, Ian H. Sloan
Joseph F. Traub, the Founding Editor of the Journal of Complexity, dies at 83. v
- Florian Pausinger
A Koksma-Hlawka inequality for general discrepancy systems. 773-797 - Mathieu Gerber
On integration methods based on scrambled nets of arbitrary size. 798-816 - Kinjal Basu:
Quasi-Monte Carlo tractability of high dimensional integration over products of simplices. 817-834 - Alexey A. Khartov:
Asymptotic analysis of average case approximation complexity of Hilbert space valued random elements. 835-866 - Daurenbek Bazarkhanov, Vladimir N. Temlyakov:
Nonlinear tensor product approximation of functions. 867-884
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-04 20:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: