Shmuel Gal

Shmuel Gal (Hebrew: שמואל גל, born 1940) is a mathematician and professor of statistics at the University of Haifa in Israel.

Shmuel Gal

He devised the Gal's accurate tables method for the computer evaluation of elementary functions.[1][2] With Zvi Yehudai he developed in 1993 a new algorithm for sorting which is used by IBM.[3]

Gal has solved the Princess and monster game[4] and made several significant contributions to the area of search games.[5][6][7]

He has been working on rendezvous problems with his collaborative colleagues Steve Alpern, Vic Baston, and John Howard.[8][9][10][11]

Gal received a Ph.D. in mathematics from the Hebrew University of Jerusalem. His thesis advisor was Aryeh Dvoretzky.


  1. Gal, Shmuel (1986). "Computing elementary functions: A new approach for achieving high accuracy and good performance". in "Accurate scientific computations", Springer. Cite journal requires |journal= (help)
  2. Gal, Shmuel; Bachelis, Boris (March 1991). "An accurate elementary mathematical library for the IEEE floating point standard". ACM Transactions on Mathematical Software. 17: 26–45. doi:10.1145/103147.103151.
  3. Gwynne, Peter. "Speeding of a sort". IBM Research.
  4. Gal Shmuel (1979). "Search games with mobile and immobile hider". SIAM J. Control Optim. 17 (1): 99–122. doi:10.1137/0317009. MR 0516859.
  5. Gal, S. (1980). Search Games. New York: Academic Press. ISBN 0-12-273850-0.
  6. S. Alpern and S. Gal (2003). The Theory of Search Games and Rendezvous, Springer ISBN 0-7923-7468-1.
  7. M. Chrobak (2004). "A princess swimming in the fog looking for a monster cow". ACM SIGACT News. 35 (2): 74–78. doi:10.1145/992287.992304.
  8. S. Alpern and S. Gal (1995). Rendezvous Search on the Line with Distinguishable Players, SIAM J. Control and Optimization.
  9. V. Baston and S. Gal (1998). Rendezvous on the line when the players' initial distance is given by an unknown probability distribution, SIAM J. Control and Optimization.
  10. S. Alpern and S. Gal (2002). Searching for an Agent who may or may not Want to be Found, OPERATIONS RESEARCH.
  11. S. Gal and J. Howard (2005). Rendezvous-evasion search in two boxes, OPERATIONS RESEARCH.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.