Please select the name from the list. If the name is not there, means it is not connected with a GND -ID?
GND: 170392260
Click on the author name for her/his data, if available
List of co-authors associated with the respective author. The font size represents the frequency of co-authorship.
Click on a term to reduce result list
The result list below will be reduced to the selected search terms. The terms are generated from the titles, abstracts and STW thesaurus of publications by the respective author.
b
Match by:
Sort by:
Records:
The information on the author is retrieved from: Entity Facts (by DNB = German National Library data service), DBPedia and Wikidata
Shmuel Gal
Alternative spellings: Samuel Gal
Biblio: Tätig am IBM Israel Scientific Center; Tätig an der Univ. of Haifa Place of Activity: Haifa
Information about the license status of integrated media files (e.g. pictures or videos) can usually be called up by clicking on the Wikimedia Commons URL above.
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. With Zvi Yehudai he developed in 1993 a new algorithm for sorting which is used by IBM. Gal has solved the Princess and monster game and made several significant contributions to the area of search games. He has been working on rendezvous problems with his collaborative colleagues Steve Alpern, Vic Baston, and John Howard. Gal received a Ph.D. in mathematics from the Hebrew University of Jerusalem. His thesis advisor was Aryeh Dvoretzky. (Source: DBPedia)
Q7499646
Publishing years
1
2010
1
2009
1
2008
1
2007
1
2000
1
1989
1
1988
1
1987
Series
Discussion paper / Suntory-Toyota International Centre for Economics and Related Disciplines (1)
The result list below will be reduced to the selected search terms. The terms are generated from the titles, abstracts and STW thesaurus of publications by the respective author.
Official Website 