Shmuel Gal Explained

Shmuel Gal
Native Name:	שמואל גל
Native Name Lang:	he
Birth Date:	1940
Fields:	Mathematics, Statistics
Workplaces:	University of Haifa
Alma Mater:	Hebrew University of Jerusalem
Doctoral Advisor:	Aryeh Dvoretzky
Known For:	Gal's accurate tables method, Princess and monster game, search games, rendezvous problems

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

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.

Notes and References

1. Computing elementary functions: A new approach for achieving high accuracy and good performance . 1986 . Gal . Shmuel . in "Accurate scientific computations", Springer.
2. An accurate elementary mathematical library for the IEEE floating point standard . March 1991 . 17 . 26–45 . Gal . Shmuel . Bachelis . Boris . ACM Transactions on Mathematical Software . 10.1145/103147.103151. 16245519 . free .
3. Web site: Speeding of a sort . Gwynne . Peter . IBM Research.
4. Gal Shmuel . Search games with mobile and immobile hider . SIAM J. Control Optim. . 17 . 1979 . 1 . 99–122 . 10.1137/0317009 . 0516859.
5. Book: S. . Gal . Search Games . Academic Press . New York . 1980 . 0-12-273850-0.
6. S. Alpern and S. Gal (2003). The Theory of Search Games and Rendezvous, Springer .
7. M. Chrobak . A princess swimming in the fog looking for a monster cow . ACM SIGACT News . 35 . 2 . 74–78 . 2004 . 10.1145/992287.992304. 8687739 .
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.