| Method and apparatus for automatic detection of spelling errors in one or more documents HR Gail, SL Hantler, MM Laker, J Lenchner, D Milch US Patent 9,465,791, 2016 | 277 | 2016 |
| An introduction to proving the correctness of programs SL Hantler, JC King ACM Computing Surveys (CSUR) 8 (3), 331-353, 1976 | 260 | 1976 |
| Methods and apparatus for performing spelling corrections using one or more variant hash tables SL Hantler, MM Laker, J Lenchner, D Milch US Patent 9,552,349, 2017 | 243 | 2017 |
| Spectral analysis of M/G/1 and G/M/1 type Markov chains HR Gail, SL Hantler, BA Taylor Advances in Applied Probability 28 (1), 114-165, 1996 | 212 | 1996 |
| An algorithm for optimal route selection in SNA networks B Gavish, S Hantler IEEE Transactions on Communications 31 (10), 1154-1161, 1983 | 168 | 1983 |
| Diagnosing faults and errors from a data repository using directed graphs HR Gail, SL Hantler, GB Leeman Jr, MM Laker, D Milch US Patent 7,171,585, 2007 | 133 | 2007 |
| Analysis of a non-preemptive priority multiserver queue HR Gail, SL Hantler, BA Taylor Advances in Applied Probability 20 (4), 852-879, 1988 | 130 | 1988 |
| On a preemptive Markovian queue with multiple servers and two priority classes HR Gail, SL Hantler, BA Taylor Mathematics of Operations research 17 (2), 365-391, 1992 | 102 | 1992 |
| Solutions of the basic matrix equation for M/G/l AND G/M/1 type markov chains HR Gail, SL Hantler, BA Taylor Stochastic Models 10 (1), 1-43, 1994 | 68 | 1994 |
| Non-skip-free M/G/1 and G/M/1 type Markov chains HR Gail, SL Hantler, BA Taylor Advances in Applied Probability 29 (3), 733-758, 1997 | 64 | 1997 |
| Buffer size requirements under longest queue first HR Gail, G Grover, R Guérin, SL Hantler, Z Rosberg, M Sidi Performance Evaluation 18 (2), 133-140, 1993 | 45 | 1993 |
| An optimal service policy for buffer systems A Birman, HR Gail, SL Hantler, Z Rosberg, M Sidi Journal of the ACM (JACM) 42 (3), 641-657, 1995 | 43 | 1995 |
| Use of characteristic roots for solving infinite state Markov chains HR Gail, SL Hantler, BA Taylor Computational probability, 205-255, 2000 | 42 | 2000 |
| Linear independence of root equations forM/G/1 type Markov chains HR Gail, SL Hantler, M Sidi, BA Taylor Queueing Systems 20, 321-339, 1995 | 40 | 1995 |
| Matrix-geometric invariant measures for G/M/l type Markov chains HR Gail, SL Hantler, BA Taylor Communications in statistics. Stochastic models 14 (3), 537-569, 1998 | 31 | 1998 |
| Spectral analysis of M/G/1 type Markov chains HR Gail, SL Hantler IBM Thomas J. Watson Research Division, 1992 | 28 | 1992 |
| Two step method for correcting spelling of a word or phrase in a document A Birman, HR Gail Jr, SL Hantler, GB Leeman Jr, D Milch US Patent 6,616,704, 2003 | 26 | 2003 |
| An analysis of a class of telecommunications models HR Gail, SL Hantler, AG Konheim, BA Taylor Performance Evaluation 21 (1-2), 151-161, 1994 | 25 | 1994 |
| Systems and methods for automated search-based problem determination and resolution for complex systems G Grabarnik, SL Hantler, S Larisa, WL Luken US Patent App. 12/138,991, 2009 | 11 | 2009 |
| " Least time to reach bound" service policy for buffer systems A Birman, HR Gail Jr, SL Hantler US Patent 5,257,258, 1993 | 11 | 1993 |
