Refereed Publications
S. L. Hantler, M. Kochen, 1974. ASP: A Program Using Stored Hypotheses to Select Actions Journal of Cybernetics, 3:(1-12).
S. L. Hantler, 1976. Estimates for the ∂ -Neumann Operator in Weighted Hilbert Spaces. Transactions of the American Mathematical Society, 217:(395-406).
S. L. Hantler, 1976. Polynomial Approximation in Certain Weighted Hilbert Spaces of Entire Functions. Mathematica Scandinavica, 39:(113-124).
S. L. Hantler, J. C. King, 1976. An Introduction to Proving the Correctness of Programs. ACM Computing Surveys, 8(3):331(353).
B. Gavish, S. L. Hantler, 1983. An Algorithm for Optimal Route Selection in SNA Networks, IEEE Transactions on Communications, COM(31, 1154-1161).
D. Milch,, S. L. Hantler, H. R. Gail, 1986. NetDA: A Design and Analysis Tool for SNA Computer Networks, Proceedings of IEEE Global Telecommunications Conference, 44(3)(1-7).
H. R. Gail, S. L. Hantler, Taylor B.A., 1988. Analysis of a Preemptive Priority Multiserver Queue, Data Communication Systems and Their Performance, Elsevier Science Publishers B. V. (North-Holland), (327-342).
H. R. Gail, S. L. Hantler, B. A. Taylor, 1988. Analysis of a Non-Preemptive Priority Multiserver Queue, Advances in Applied Probability, 20:(852-879).
S. L. Hantler, Z. Rosberg, 1989. Optimal Estimation for an M/M/c Queue with Time-Varying Parameters, Communications in Statistics - Stochastic Models, 5(2):295-313),
H. R. Gail, S. L. Hantler, B. A. Taylor, 1989. Partial Preemption in a System with Two Processors, Performance of Distributed and Parallel Systems, Elsevier Science Publishers B. V. (North-Holland), (209-224).
H. R. Gail, S. L. Hantler, B. A. Taylor, 1992. On a Preemptive Markovian Queue with Multiple Servers and Two Priority Classes, Mathematics of Operations Research, 17(2):(365-391).
H. R. Gail, G. Grover, R. Guerin, S. L. Hantler, Z. Rosberg, M. Sidi, 1992. Buffer Size Requirements under Longest Queue First, in Performance of Distributed Systems and Integrated Communication Networks, Elsevier Science Publishers B. V. (North-Holland), (413-424).
S. L. Hantler, D. Milch, 1993. Designing Reliable Networks with Short Paths, Telecommunication Systems, 1:43-50.
H. R. Gail, G. Grover, R. Guerin, S. L. Hantler, Z. Rosberg, M. Sidi, 1993. Buffer Size Requirements under Longest Queue First, Performance Evaluation, 18:(133-140).
H. R. Gail, S. L. Hantler, A. G. Konheim, B. A. Taylor, 1994. An Analysis of a Class of Telecommunications Models, Performance Evaluation, 21:(151-161).
H. R. Gail, S. L. Hantler, B. A. Taylor, 1994. Solutions of the Basic Matrix Equation for M/G/1 and G/M/1 Type Markov Chains, Stochastic Models, 10:(1-43).
A. Birman, H. R. Gail, S. L. Hantler, Z. Rosberg, M. Sidi, 1995. An Optimal Service Policy for Buffer Systems, Journal of the Association for Computing Machinery, 42(3):(641-657).
H. R. Gail, S. L. Hantler, M. Sidi, B. A. Taylor, 1995. Linear Independence of Root Equations for M/G/1 Type Markov Chains, Queueing Systems, 20:(321-339).
H. R. Gail, S. L. Hantler, B. A. Taylor, 1996. Spectral Analysis of M/G/1 and G/M/1 Type Markov Chains, Advances in Applied Probability, 28:(114-165).
H. R. Gail, S. L. Hantler, B. A. Taylor, 1997. Non-Skip-Free M/G/1 and G/M/1 Type Markov Chains, Advances in Applied Probability, 29:(733-758).
H. R. Gail, S. L. Hantler, B. A. Taylor, 1998. M/G/1 Type Markov Chains with Rational Generating Functions, Advances in Matrix Analytic Methods for Stochastic Models, A. S. Alfa and S. R. Chakravarthy (editors), Notable Publications, (1-16).
H. R. Gail, S. L. Hantler, B. A. Taylor, 1998. Matrix-Geometric Invariant Measures for G/M/1 Type Markov Chains, Stochastic Models, 14, (537-569).
H. R. Gail, S. L. Hantler, B. A. Taylor, 2000. Use of Characteristic Roots for Solving in Finite State Markov Chains, Computational Probability, W. K. Grassmann (editor), Kluwer Academic Publishers, (205-255).
S. L. Hantler, Surrogate Cost Techniques in Countable Classification, 2007, ISDA07