An Extreme-Type Limit Law for a Storage Process. - Priscilla E. Greenwood; Gerard Hooghiemstra (Math. Oper. Res., 1988)

The M/M/c with critical jobs. - Ivo J. B. F. Adan; Gerard Hooghiemstra (Math. Methods Oper. Res., 1998)

On the convergence of the power series algorithm. - Gerard Hooghiemstra; Ger Koole (Perform. Evaluation, 2000)

On a recursive formula for the moments of phase noise. - Idelfonso Tafur Monroy; Gerard Hooghiemstra (IEEE Trans. Commun., 2000)

On the efficiency of multicast. - Piet Van Mieghem; Gerard Hooghiemstra; Remco van der Hofstad (IEEE/ACM Trans. Netw., 2001)

On the covariance of the level sizes in random recursive trees. - Remco van der Hofstad; Gerard Hooghiemstra; Piet Van Mieghem (Random Struct. Algorithms, 2002)

Large Deviations for Code Division Multiple Access Systems. - Gerard Hooghiemstra; Marten J. Klok; Remco van der Hofstad (SIAM J. Appl. Math., 2002)

Analytical Methods for CDMA Systems with Parallel Interference Cancellation: The Large Deviation Approach. - Marten J. Klok; Gerard Hooghiemstra; Remco van der Hofstad (Wirel. Pers. Commun., 2002)

Distances in random graphs with finite variance degrees. - Remco van der Hofstad; Gerard Hooghiemstra; Piet Van Mieghem (Random Struct. Algorithms, 2005)

Size and Weight of Shortest Path Trees with Exponential Link Weights. - Remco van der Hofstad; Gerard Hooghiemstra; Piet Van Mieghem (Comb. Probab. Comput., 2006)

A Phase Transition for the Diameter of the Configuration Model. - Remco van der Hofstad; Gerard Hooghiemstra; Dmitri Znamenski (Internet Math., 2007)

The weight of the shortest path tree. - Remco van der Hofstad; Gerard Hooghiemstra; Piet Van Mieghem (Random Struct. Algorithms, 2007)

The Weight and Hopcount of the Shortest Path in the Complete Graph with Exponential Weights. - Gerard Hooghiemstra; Piet Van Mieghem (Comb. Probab. Comput., 2008)

First Passage Percolation on the Erdős-Rényi Random Graph. - Shankar Bhamidi; Remco van der Hofstad; Gerard Hooghiemstra (Comb. Probab. Comput., 2011)