|
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
14 gevonden resultaten
| nr | titel | auteur | tijdschrift | jaar | jaarg. | afl. | pagina('s) | type |
| 1 | A Small Approximately Min-Wise Independent Family of Hash Functions |
Indyk, Piotr |
2001 |
38 | 1 |
p. 84-90 7 p. |
artikel |
|
| 2 | Balanced Aspect Ratio Trees: Combining the Advantages of k-d Trees and Octrees |
Duncan, Christian A. |
2001 |
38 | 1 |
p. 303-333 31 p. |
artikel |
|
| 3 | Combinatorial Approximation Algorithms for Generalized Flow Problems |
Oldham, Jeffrey D |
2001 |
38 | 1 |
p. 135-169 35 p. |
artikel |
|
| 4 | Compact Routing with Minimum Stretch |
Cowen, Lenore J |
2001 |
38 | 1 |
p. 170-183 14 p. |
artikel |
|
| 5 | Constructing Optimal Trees from Quartets |
Bryant, David |
2001 |
38 | 1 |
p. 237-259 23 p. |
artikel |
|
| 6 | Cut Tree Algorithms: An Experimental Study |
Goldberg, Andrew V |
2001 |
38 | 1 |
p. 51-83 33 p. |
artikel |
|
| 7 | Efficient Algorithms for Petersen's Matching Theorem |
Biedl, Therese C. |
2001 |
38 | 1 |
p. 110-134 25 p. |
artikel |
|
| 8 | Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions |
Barequet, Gill |
2001 |
38 | 1 |
p. 91-109 19 p. |
artikel |
|
| 9 | Eliminating Migration in Multi-processor Scheduling |
Kalyanasundaram, Bala |
2001 |
38 | 1 |
p. 2-24 23 p. |
artikel |
|
| 10 | Foreword |
Moret, Bernard M.E. |
2001 |
38 | 1 |
p. 1- 1 p. |
artikel |
|
| 11 | Median Bounds and Their Application |
Siegel, Alan |
2001 |
38 | 1 |
p. 184-236 53 p. |
artikel |
|
| 12 | Papers to Appear in Forthcoming Issues |
2001 |
38 | 1 |
p. 334- 1 p. |
artikel |
||
| 13 | Placement Algorithms for Hierarchical Cooperative Caching |
Korupolu, Madhukar R |
2001 |
38 | 1 |
p. 260-302 43 p. |
artikel |
|
| 14 | Wavelength Conversion in Optical Networks |
Kleinberg, Jon |
2001 |
38 | 1 |
p. 25-50 26 p. |
artikel |
14 gevonden resultaten