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=1998
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
When are quasi-Monte Carlo algorithms efficient for high dimensional integrals?
Ian H. Sloan
,
Henryk Woźniakowski
Journal of Complexity
14
(1), 1998, pp. 1-33
Asymptotically optimal weighted numerical integration
Peter Mathé
Journal of Complexity
14
(1), 1998, pp. 34-48
On the direct sum conjecture in the straight line model
Nader H. Bshouty
Journal of Complexity
14
(1), 1998, pp. 49-62
Shape from shadows - A Hilbert space setting
Michael Hatzitheodorou
Journal of Complexity
14
(1), 1998, pp. 63-84
Linear algorithms with finite deviation
Helmut Brass
Journal of Complexity
14
(1), 1998, pp. 85-101
A refined model of computation for continuous problems
Klaus Weihrauch
Journal of Complexity
14
(1), 1998, pp. 102-121
Optimal integration of Lipschitz functions with a Gaussian weight
Francisco Curbera
Journal of Complexity
14
(1), 1998, pp. 122-149
Monte Carlo complexity of global solution of integral equations
S. Heinrich
Journal of Complexity
14
(2), 1998, pp. 151-175
On the parallel complexity of the polynomial ideal membership problem
Peter Bürgisser
Journal of Complexity
14
(2), 1998, pp. 176-189
On a scheduling problem of time deteriorating jobs
Jin-Yi Cai
,
Pu Cai
,
Yixin Zhu
Journal of Complexity
14
(2), 1998, pp. 190-209
Lyapunov exponents versus expansivity and sensitivity in cellular automata
Michele Finelli
,
Giovanni Manzini
,
Luciano Margara
Journal of Complexity
14
(2), 1998, pp. 210-233
\delta
-uniform BSS machines
Paolo Boldi
,
Sebastiano Vigna
Journal of Complexity
14
(2), 1998, pp. 234-256
Fast rectangular matrix multiplication and applications
Xiaohan Huang
,
Victor Y. Pan
Journal of Complexity
14
(2), 1998, pp. 257-299
On the complexity of self-validating numerical integration and approximation of functions with singularities
Knut Petras
Journal of Complexity
14
(3), 1998, pp. 302-318
Relaxation of product Markov chains on product spaces
Peter Mathé
Journal of Complexity
14
(3), 1998, pp. 319-332
On the asymptotic average number of efficient vertices in multiple objective linear programming
K.-H. Küfer
Journal of Complexity
14
(3), 1998, pp. 333-377
Partial fraction decomposition in
C(z)
and simultaneous Newton iteration for factorization in
C[z]
Peter Kirrinnis
Journal of Complexity
14
(3), 1998, pp. 378-444
The exponent of discrepancy is at least 1.0669
Jiȓí Matous̑ek
Journal of Complexity
14
(4), 1998, pp. 448-453
Some lower bounds for the complexity of continuation methods
Jean-Pierre Dedieu
,
Steve Smale
Journal of Complexity
14
(4), 1998, pp. 454-465
Scrambling Sobol' and Niederreiter-Xing points
Art B. Owen
Journal of Complexity
14
(4), 1998, pp. 466-489
Feasible real random access machines
Vasco Brattka
,
Peter Hertling
Journal of Complexity
14
(4), 1998, pp. 490-526
On the
L_2
-discrepancy for anchored boxes
Jiȓí Matous̑ek
Journal of Complexity
14
(4), 1998, pp. 527-556
Approximating band- and energy-limited signals in the presence of jitter
Dorota Da̧browska
,
Marek A. Kowalski
Journal of Complexity
14
(4), 1998, pp. 557-570