Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=J. Complexity AND YEAR=2003
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
My dream quadrature rule
Fred J. Hickernell
Journal of Complexity
19
(3), 2003, pp. 420-427
Some current issues in quasi-Monte Carlo methods
Harald Niederreiter
Journal of Complexity
19
(3), 2003, pp. 428-433
Open problems for tractability of multivariate integration
Henryk Woźniakowski
Journal of Complexity
19
(3), 2003, pp. 434-444
An encyclopaedia of cubature formulas
Ronald Cools
Journal of Complexity
19
(3), 2003, pp. 445-453
Vector greedy algorithms
Adam Lutoborski
,
Vladimir N. Temlyakov
Journal of Complexity
19
(4), 2003, pp. 458-473
Probabilistic analysis of a differential equation for linear programming
Asa Ben-Hur
,
Joshua Feinberg
,
Shmuel Fishman
,
Hava T. Siegelmann
Journal of Complexity
19
(4), 2003, pp. 474-510
On the tractability of the Brownian bridge algorithm
G. Larcher
,
G. Leobacher
,
K. Scheicher
Journal of Complexity
19
(4), 2003, pp. 511-528
Bounds for the weighted
L^p
discrepancy and tractability of integration
Gunther Leobacher
,
Friedrich Pillichshammer
Journal of Complexity
19
(4), 2003, pp. 529-547
Some remarks on the condition number of a real random square matrix
J.A. Cuesta-Albertos
,
M. Wschebor
Journal of Complexity
19
(4), 2003, pp. 548-554
Linear algorithms for recovering linear functionals from jittered information
Dorota Da̧browska
Journal of Complexity
19
(4), 2003, pp. 555-563
Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers
Grégoire Lecerf
Journal of Complexity
19
(4), 2003, pp. 564-596
An efficient parallel algorithm for scheduling interval ordered tasks
Yoojin Chung
,
Kunsoo Park
Journal of Complexity
19
(4), 2003, pp. 597-609
Integration error for multivariate functions from anisotropic classes
Fang Gensun
,
Ye Peixin
Journal of Complexity
19
(4), 2003, pp. 610-627
Erratum to ''How to minimize the cost of iterative methods in the presence of perturbations''
Bolesƚaw Kacewicz
Journal of Complexity
19
(4), 2003, pp. 628-629
Use of algebraically independent numbers for zero recognition of polynomial terms
Daniel Richardson
,
Ahmed El-Sonbaty
Journal of Complexity
19
(5), 2003, pp. 631-637
Multivariate integration in
C^\infty([0,1]^d)
is not strongly tractable
Jakub Onufry Wojtaszczyk
Journal of Complexity
19
(5), 2003, pp. 638-643
Analog computers and recursive functions over the reals
Daniel Silva Graça
,
José Félix Costa
Journal of Complexity
19
(5), 2003, pp. 644-664
A note on different covering numbers in learning theory
Massimiliano Pontil
Journal of Complexity
19
(5), 2003, pp. 665-671
On the hierarchy and extension of monotonically computable real numbers
Robert Rettinger
,
Xizhong Zheng
Journal of Complexity
19
(5), 2003, pp. 672-691
Lower bounds for centered and wrap-around
L_2
-discrepancies and construction of uniform designs by threshold accepting
Kai-Tai Fang
,
Xuan Lu
,
Peter Winker
Journal of Complexity
19
(5), 2003, pp. 692-711
Five- and six-dimensional lattice rules generated by structured matrices
Ronald Cools
,
Hilde Govaert
Journal of Complexity
19
(6), 2003, pp. 715-729
Worst case complexity of multivariate Feynman-Kac path integration
Marek Kwas
,
Youming Li
Journal of Complexity
19
(6), 2003, pp. 730-743
I
-binomial scrambling of digital nets and sequences
Shu Tezuka
,
Henri Faure
Journal of Complexity
19
(6), 2003, pp. 744-757
Where does smoothness count the most for Fredholm equations of the second kind with noisy information?
Arthur G. Werschulz
Journal of Complexity
19
(6), 2003, pp. 758-798
A recursive algorithm for the infinity-norm fixed point problem
Spencer Shellman
,
K. Sikorski
Journal of Complexity
19
(6), 2003, pp. 799-834
Seiten
<
1
2