Shmuel Gal
From Infogalactic: the planetary knowledge core
Shmuel Gal (Hebrew: שמואל גל) 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 (thesis advisor: Aryeh Dvoretzky).
References
- ↑ Lua error in package.lua at line 80: module 'strict' not found.
- ↑ Lua error in package.lua at line 80: module 'strict' not found.
- ↑ Lua error in package.lua at line 80: module 'strict' not found.
- ↑ Lua error in package.lua at line 80: module 'strict' not found.
- ↑ Lua error in package.lua at line 80: module 'strict' not found.
- ↑ S. Alpern and S. Gal (2003). The Theory of Search Games and Rendezvous, Springer ISBN 0-7923-7468-1.
- ↑ Lua error in package.lua at line 80: module 'strict' not found.
- ↑ S. Alpern and S. Gal (1995). Rendezvous Search on the Line with Distinguishable Players, SIAM J. Control and Optimization.
- ↑ 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.
- ↑ S. Alpern and S. Gal (2002). Searching for an Agent who may or may not Want to be Found, OPERATIONS RESEARCH.
- ↑ S. Gal and J. Howard (2005). Rendezvous-evasion search in two boxes, OPERATIONS RESEARCH.
External links
Lua error in package.lua at line 80: module 'strict' not found.