2008 |
8 | EE | Gerard Hooghiemstra,
Piet Van Mieghem:
The Weight and Hopcount of the Shortest Path in the Complete Graph with Exponential Weights.
Combinatorics, Probability & Computing 17(4): 537-548 (2008) |
2007 |
7 | EE | Remco van der Hofstad,
Gerard Hooghiemstra,
Piet Van Mieghem:
The weight of the shortest path tree.
Random Struct. Algorithms 30(3): 359-379 (2007) |
2006 |
6 | EE | Remco van der Hofstad,
Gerard Hooghiemstra,
Piet Van Mieghem:
Size and Weight of Shortest Path Trees with Exponential Link Weights.
Combinatorics, Probability & Computing 15(6): 903-926 (2006) |
2005 |
5 | EE | Remco van der Hofstad,
Gerard Hooghiemstra,
Piet Van Mieghem:
Distances in random graphs with finite variance degrees.
Random Struct. Algorithms 27(1): 76-123 (2005) |
2002 |
4 | EE | Remco van der Hofstad,
Gerard Hooghiemstra,
Piet Van Mieghem:
On the covariance of the level sizes in random recursive trees.
Random Struct. Algorithms 20(4): 519-539 (2002) |
3 | EE | Gerard Hooghiemstra,
Marten J. Klok,
Remco van der Hofstad:
Large Deviations for Code Division Multiple Access Systems.
SIAM Journal of Applied Mathematics 62(3): 1044-1065 (2002) |
2001 |
2 | EE | Piet Van Mieghem,
Gerard Hooghiemstra,
Remco van der Hofstad:
On the efficiency of multicast.
IEEE/ACM Trans. Netw. 9(6): 719-732 (2001) |
2000 |
1 | | Gerard Hooghiemstra,
Ger Koole:
On the convergence of the power series algorithm.
Perform. Eval. 42(1): 21-39 (2000) |