nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
An efficient parallel algorithm for scheduling interval ordered tasks
|
Chung, Yoojin |
|
2003 |
19 |
4 |
p. 597-609 13 p. |
artikel |
2 |
A new prize: the information-based complexity young researcher award
|
|
|
2003 |
19 |
4 |
p. 457- 1 p. |
artikel |
3 |
2002 Best Paper Award
|
|
|
2003 |
19 |
4 |
p. 455- 1 p. |
artikel |
4 |
Bounds for the weighted L p discrepancy and tractability of integration
|
Leobacher, Gunther |
|
2003 |
19 |
4 |
p. 529-547 19 p. |
artikel |
5 |
Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers
|
Lecerf, Grégoire |
|
2003 |
19 |
4 |
p. 564-596 33 p. |
artikel |
6 |
Ed. Board continued
|
|
|
2003 |
19 |
4 |
p. i- 1 p. |
artikel |
7 |
Ed. Board (Cover 2)
|
|
|
2003 |
19 |
4 |
p. IFC- 1 p. |
artikel |
8 |
Erratum to “How to minimize the cost of iterative methods in the presence of perturbations”
|
Kacewicz, Bolesław |
|
2003 |
19 |
4 |
p. 628-629 2 p. |
artikel |
9 |
Integration error for multivariate functions from anisotropic classes
|
Gensun, Fang |
|
2003 |
19 |
4 |
p. 610-627 18 p. |
artikel |
10 |
Linear algorithms for recovering linear functionals from jittered information
|
Da̧browska, Dorota |
|
2003 |
19 |
4 |
p. 555-563 9 p. |
artikel |
11 |
On the tractability of the Brownian Bridge algorithm
|
Larcher, G. |
|
2003 |
19 |
4 |
p. 511-528 18 p. |
artikel |
12 |
2003 Prize for Achievement in Information-Based Complexity
|
|
|
2003 |
19 |
4 |
p. 456- 1 p. |
artikel |
13 |
Probabilistic analysis of a differential equation for linear programming
|
Ben-Hur, Asa |
|
2003 |
19 |
4 |
p. 474-510 37 p. |
artikel |
14 |
Some remarks on the condition number of a real random square matrix
|
Cuesta-Albertos, J.A. |
|
2003 |
19 |
4 |
p. 548-554 7 p. |
artikel |
15 |
Vector greedy algorithms
|
Lutoborski, Adam |
|
2003 |
19 |
4 |
p. 458-473 16 p. |
artikel |