פתרונות מינ-מקס לכמה בעיות חיפוש (Minimax solutions for certain search problems.). - Shmuel Gal (1971)

Optimal Test Design for Reliability Demonstration. - Shmuel Gal (Oper. Res., 1974)

Optimal Sequential and Parallel Seach for Finding a Root. - Shmuel Gal; Willard L. Miranker (J. Comb. Theory A, 1977)

Properties and convergence of a posteriori probabilities in classification problems. - Moshe Ben-Bassat; Shmuel Gal (Pattern Recognit., 1977)

Analysis of Algorithms for the Evaluation of Monotonic Boolean Functions. - Yuri Breitbart; Shmuel Gal (IEEE Trans. Computers, 1978)

Computing Elementary Functions: A New Approach for Achieving High Accuracy and Good Performance. - Shmuel Gal (Accurate Scientific Computations, 1985)

An accurate elementary mathematical library for the IEEE floating point standard. - Shmuel Gal (ACM Trans. Math. Softw., 1991)

Optimal Mapping in Direct Mapped Cache Environments. - Shmuel Gal; Yona Hollander; Alon Itai (ISTCS, 1992)

Optimal Partitioning Which Maximizes the Sum of the Weighted Averages. - Shmuel Gal; Boris Klots (Oper. Res., 1995)

Rendezvous Search on the Line. - Shmuel Gal (Oper. Res., 1999)

On the optimality of a simple strategy for searching graphs. - Shmuel Gal (Int. J. Game Theory, 2001)

Searching for an Agent Who May OR May Not Want to be Found. - Steve Alpern; Shmuel Gal (Oper. Res., 2002)

Note: Online Searching / on the Optimality of the Geometric Sequences for the m Ray Search Online Searching. - Patrick Jaillet; Matthew Stafford; Shmuel Gal (Oper. Res., 2002)

The theory of search games and rendezvous. - Steve Alpern; Shmuel Gal (Kluwer, 2003)

Online searching with turn cost. - Erik D. Demaine; Sándor P. Fekete; Shmuel Gal (Theor. Comput. Sci., 2006)

Participation in auctions. - Shmuel Gal; Michael Landsberger; Arkadi Nemirovski (Games Econ. Behav., 2007)

Network search games with immobile hider, without a designated searcher starting point. - Steve Alpern; Vic Baston; Shmuel Gal (Int. J. Game Theory, 2008)

Network search games, with arbitrary searcher starting point. - Arnon Dagan; Shmuel Gal (Networks, 2008)

Analysis and design of selection committees: a game theoretic secretary problem. - Steve Alpern; Shmuel Gal (Int. J. Game Theory, 2009)

Searching symmetric networks with Utilitarian-Postman paths. - Steve Alpern; Vic Baston; Shmuel Gal (Networks, 2009)

A sequential selection game with vetoes. - Steve Alpern; Shmuel Gal; Eilon Solan (Games Econ. Behav., 2010)

On Search Games That Include Ambush. - Steve Alpern; Robbert Fokkink; Shmuel Gal; Marco Timmer (SIAM J. Control. Optim., 2013)