Shmuel Gal
Encyclopedia
Shmuel Gal is a professor of statistics
at the University of Haifa
in Israel.
Gal received a Ph.D. in mathematics from the Hebrew University of Jerusalem
.
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. He has also solved the Princess and monster game
and made several significant contributions to the area of search games
.
Gal has been working on rendezvous problem
s with his collaborative colleagues Steve Alpern
, Vic Baston, and John Howard.
Statistics
Statistics is the study of the collection, organization, analysis, and interpretation of data. It deals with all aspects of this, including the planning of data collection in terms of the design of surveys and experiments....
at the University of Haifa
University of Haifa
The University of Haifa is a university in Haifa, Israel.The University of Haifa was founded in 1963 by Haifa mayor Abba Hushi, to operate under the academic auspices of the Hebrew University of Jerusalem....
in Israel.
Gal received a Ph.D. in mathematics from the Hebrew University of Jerusalem
Hebrew University of Jerusalem
The Hebrew University of Jerusalem ; ; abbreviated HUJI) is Israel's second-oldest university, after the Technion – Israel Institute of Technology. The Hebrew University has three campuses in Jerusalem and one in Rehovot. The world's largest Jewish studies library is located on its Edmond J...
.
He devised the Gal's accurate tables
Gal's accurate tables
Gal's accurate tables is a method devised by Shmuel Gal to provide accurate values of special functions using a lookup table and interpolation. It is a fast and efficient method for generating values of functions like the exponential or the trigonometric functions to within last-bit accuracy for...
method for the computer evaluation of elementary functions. With Zvi Yehudai he developed in 1993 a new algorithm for sorting
Sorting algorithm
In computer science, a sorting algorithm is an algorithm that puts elements of a list in a certain order. The most-used orders are numerical order and lexicographical order...
which is used by IBM. He has also solved the Princess and monster game
Princess and monster game
In game theory, the princess and monster game is a pursuit-evasion game played by two players in a region. The game was devised by Rufus Isaacs and published in his book Differential Games as follows. "The monster searches for the princess, the time required being the payoff. They are both in a...
and made several significant contributions to the area of search games
Search games
A search game is a two-person zero-sum game which takes place in a set called the search space. The searcher can choose any continuous trajectory subject to a maximal velocity constraint...
.
Gal has been working on rendezvous problem
Rendezvous problem
The rendezvous dilemma can be formulated in this way:If they both choose to wait, of course, they will never meet. If they both choose to walk there are chances that they meet and chances that they do not...
s with his collaborative colleagues Steve Alpern
Steve Alpern
Steven Alpern is a professor of mathematics at the London School of Economics. He has made a significant contribution to both the fields of search games and Rendezvous, informally introducing the rendezvous problem as early as 1976. His collaborators include Shmuel Gal, Vic Baston and Robbert...
, Vic Baston, and John Howard.