|
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). |
About us|Jobs|Help|Disclaimer|Advertising services|Contact us|Sign in|Website map|Search|
GMT+8, 2015-9-11 21:23 , Processed in 0.334152 second(s), 16 queries .
