A sequence of upper and lower bounds for the Q function. - Thomas K. Philips; A. Sahraoui (IEEE Trans. Inf. Theory, 1984)

An Approximation of the Processing Time for Random Graph Model of Parallel Computation. - Erol Gelenbe; Randolph D. Nelson; Thomas K. Philips; Asser N. Tantawi (FJCC, 1986)

An Approximation to the Response Time for Shortest Queue Routing. - Randolph D. Nelson; Thomas K. Philips (SIGMETRICS, 1989)

Connectivity properties of a packet radio network model. - Thomas K. Philips; Shivendra S. Panwar; Asser N. Tantawi (IEEE Trans. Inf. Theory, 1989)

On the diameter of a class of random graphs. - Thomas K. Philips; Donald F. Towsley; Jack K. Wolf (IEEE Trans. Inf. Theory, 1990)

Correction to 'On the Diameter of a Class of Random Graphs'. - Thomas K. Philips; Donald F. Towsley; Jack K. Wolf (IEEE Trans. Inf. Theory, 1991)

Golden ratio scheduling for flow control with low buffer requirements. - Shivendra S. Panwar; Thomas K. Philips; Mon-Song Chen (IEEE Trans. Commun., 1992)

An Approximation for the Mean Response Time for Shortest Queue Routing with General Inerarrival and Service Times. - Randolph D. Nelson; Thomas K. Philips (Perform. Evaluation, 1993)