nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A force-directed algorithm that preserves edge-crossing properties
|
Bertault, François |
|
2000 |
74 |
1-2 |
p. 7-13 7 p. |
artikel |
2 |
An algorithm for finding a k-median in a directed tree
|
Vigneron, Antoine |
|
2000 |
74 |
1-2 |
p. 81-88 8 p. |
artikel |
3 |
Approximating low-congestion routing and column-restricted packing problems
|
Baveja, Alok |
|
2000 |
74 |
1-2 |
p. 19-25 7 p. |
artikel |
4 |
A rely–guarantee discipline for open distributed systems design
|
Duarte, Carlos H.C. |
|
2000 |
74 |
1-2 |
p. 55-63 9 p. |
artikel |
5 |
Corrigendum to “Upward separation for FewP and related classes”, Information Processing Letters 52 (1994) 175–180
|
Rao, Rajesh P.N. |
|
2000 |
74 |
1-2 |
p. 89- 1 p. |
artikel |
6 |
Farmer's Theorem revisited
|
Veanes, Margus |
|
2000 |
74 |
1-2 |
p. 47-53 7 p. |
artikel |
7 |
On a generalized modularization theorem
|
Dimitrakos, Theodosis |
|
2000 |
74 |
1-2 |
p. 65-71 7 p. |
artikel |
8 |
On bounded occurrence constraint satisfaction
|
Håstad, Johan |
|
2000 |
74 |
1-2 |
p. 1-6 6 p. |
artikel |
9 |
On rewrite constraints and context unification
|
Niehren, Joachim |
|
2000 |
74 |
1-2 |
p. 35-40 6 p. |
artikel |
10 |
Rings of polynomial invariants of the alternating group have no finite SAGBI bases with respect to any admissible order
|
Göbel, Manfred |
|
2000 |
74 |
1-2 |
p. 15-18 4 p. |
artikel |
11 |
The ∃∀2 fragment of the first-order theory of atomic set constraints is Π0 1 -hard
|
Talbot, Jean-Marc |
|
2000 |
74 |
1-2 |
p. 27-33 7 p. |
artikel |
12 |
Trackless online algorithms for the server problem
|
Bein, Wolfgang W. |
|
2000 |
74 |
1-2 |
p. 73-79 7 p. |
artikel |
13 |
Variations on computing reciprocals of power series
|
Schönhage, Arnold |
|
2000 |
74 |
1-2 |
p. 41-46 6 p. |
artikel |