An Introduction to Proving the Correctness of Programs. - Sidney L. Hantler; James C. King (ACM Comput. Surv., 1976)

An Algorithm for Optimal Route Selection in SNA Networks. - Bezalel Gavish; Sidney L. Hantler (IEEE Trans. Commun., 1983)

On a Preemptive Markovian Queue with Multiple Servers and Two Priority Classes. - H. Richard Gail; Sidney L. Hantler; B. A. Taylor (Math. Oper. Res., 1992)

Buffer Size Requirements Under Longest Queue First. - H. Richard Gail; George A. Grover; Roch Guérin; Sidney L. Hantler; Zvi Rosberg; Moshe Sidi (Perform. Evaluation, 1993)

Designing reliable networks with short paths. - Sidney L. Hantler; D. Milch (Telecommun. Syst., 1993)

An Analysis of a Class of Telecommunications Models. - H. Richard Gail; Sidney L. Hantler; Alan G. Konheim; B. A. Taylor (Perform. Evaluation, 1994)

An Optimal Service Policy for Buffer Systems. - Alexander Birman; H. Richard Gail; Sidney L. Hantler; Zvi Rosberg; Moshe Sidi (J. ACM, 1995)

Linear independence of root equations forM/G/1 type Markov chains. - H. Richard Gail; Sidney L. Hantler; Moshe Sidi; B. A. Taylor (Queueing Syst. Theory Appl., 1995)

Surrogate Cost Techniques in Countable Classification. - Sidney L. Hantler (ISDA, 2007)