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, Shmuel (1986). "Computing elementary functions: A new approach for achieving high accuracy and good performance". in "Accurate scientific computations", Springer. {{cite journal}}: Cite journal requires |journal= (help)
^Gal Shmuel (1979). "Search games with mobile and immobile hider". SIAM J. Control Optim. 17 (1): 99–122. doi:10.1137/0317009. MR0516859.
^Gal, S. (1980). Search Games. New York: Academic Press. ISBN0-12-273850-0.
^S. Alpern and S. Gal (2003). The Theory of Search Games and Rendezvous, Springer ISBN0-7923-7468-1.
^M. Chrobak (2004). "A princess swimming in the fog looking for a monster cow". ACM SIGACT News. 35 (2): 74–78. doi:10.1145/992287.992304. S2CID8687739.
^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.