Sidney L. Hantler, PhD

Contact Information

• Office:    914.236.4268
• Fax:        914.861.5119
• Mobile:   914.325.1111
• Email:     sid@westchestermath.com

Education

• The University of Michigan, Ann Arbor, MI
  • PhD, Mathematics, Rackham Graduate School, August, 1974
    • Thesis: Estimates for Reproducing Kernels in Weighted Hilbert Spaces of Entire Functions
  • MS, Mathematics, Rackham Graduate School, May 1970
  • BS, Mathematics, Honors College, May 1969
    • High Distinction and Highest Honors in Mathematics

Academic Honors

• National Science Foundation Graduate Fellowship
• James B. Angell scholar (3 times)
• Branstrom Freshman Award
• Junior and Senior Honors
• University of Michigan Regents Scholarship
• Michigan Higher Education Association Scholarship

Memberships

• Phi Beta Kappa
• Society of the Sigma Xi

Research Experience

• Westchester Math and Physics, 2009-present
  • Founder and owner
• IBM TJ Watson Research Center, Yorktown Heights, NY, 1973-2009
  • Manager, Stochastic Analysis Department, 2000-2009
  • Assistant to the Vice President of Systems, 1992-2000
  • Manager, Communications Network Analysis Department, 1980-1992
  • Program Manager, Corporate Recruiting Systems, 1979-1980
  • Manager, Corporate PhD Program, 1976-1979
  • Research Staff Member, Computer Sciences Department, 1973-1976

Teaching Experience

• SUNY College at Purchase, Purchase, NY
  • Adjunct Professor of Mathematics, Winter, 1981, Summer, Fall 2009, Spring, Summer, Fall 2010, Spring 2011, Summer 2012
• Iona College, New Rochelle, NY
  • Adjunct Professor of Mathematics, Fall 2009
• Fordham University, Harrison, NY
  • Adjunct Professor of Mathematics, Fall 2008
• Polytechnic University, Hawthorne, NY
  • Adjunct Professor of Computer Science and Electrical Engineering, Fall 1996, Winter 1997, Winter 1998, Winter 1999, Winter 2002, Winter 2003
• Pace University, Pleasantville, NY
  • Adjunct Professor of Mathematics, Winter 1978, Fall 1979
• The University of Michigan, Ann Arbor, MI
  • Teaching Fellow, Department of Mathematics, 1969-1971
  • Research Assistant, Mental Health Research Institute, 1967-1969

IBM Awards

• Second Patent Plateau, June, 2007
• Corporate Technical Recognition Event, May, 2005
• Supplemental OIAA, Creation and Distribution of DataCase, November, 2003
• Outstanding Innovation Award, Creation and Distribution of DataCase, March, 2001
• First Patent Plateau, October, 2000
• Outstanding Technical Achievement Award, Commercialization of NetDA, December, 1998
• Outstanding Innovation Award, Multiserver Queueing Analysis, November, 1998
• Outstanding Innovation Award, Network Design and Analysis, January, 1986
• Research Division Outstanding Contribution Award, Applicant Tracking System, September, 1981

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.

Papers in Preparation

• H. R. Gail, S. L. Hantler, B. A. Taylor, Convergence of the Fixed Point Iteration for M/G/1 Type Markov Chains.
• H. R. Gail, S. L. Hantler, B. A. Taylor, Priority Chains of M/G/1 Type, available on request.
• H. R. Gail, S. L. Hantler, B. A. Taylor, Multidimensional Random Walks with Partially Homogeneous Transitions.

Research Reports

• H. R. Gail, S. L. Hantler, B. A. Taylor, 1990. Varieties in a Two Dimensional Polydisk with Univalent Projection at the Boundary, IBM Research Report RC 15848, available on request.
• H. R. Gail, S. L. Hantler,M. Sidi, B. A. Taylor, 1992. The Transform Method for M/G/1 Type Markov Chains, IBM Research Report RC 17891, available on request.
• A. H. Karp, S. L. Hantler, 1994. Bank Conflicts in Cache Tags, HP Laboratories Technical Report HPL-94-102, available on request.
• H. R. Gail, S. L. Hantler, B. A. Taylor, 2000. Extensions of Rouche's Theorem, IBM Research Report RC 21870, available on request.

United States Patents

• US Patent 5,257,258, The Least Time to Reach Bound Service Policy for Buffer Systems, October 26, 1993.
• US Patent 6,616,704, Two Step Method for Correcting Spelling of a Word or Phrase in a Document, September 9, 2003.
• US Patent 7,171,585, Diagnosing Faults and Errors from a Data Repository using Directed Graphs, January 30, 2007.
• US Patent 7,831,537, System and Method of Adaptive Generation of Problem Determination Procedures, October 9, 2008.
• US Patent 9,465,791, Method and apparatus for automatic detection of spelling errors in one or more documents, October 11, 2016.
• US Patent 9,552,349, Methods and apparatus for performing spelling corrections using one or more variant hash tables, January 24, 2017.
• YOR920070518US1, Method and apparatus for creating a subject specific repository of documents from a general repository of documents, filed June 13, 2008.
• YOR920090313202, Systems and methods for automated search-based problem determination and resolution for complex systems, filed December 17, 2009.