default search action
Shmuel Gal
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
- [j19]Steve Alpern, Robbert Fokkink, Shmuel Gal, Marco Timmer:
On Search Games That Include Ambush. SIAM J. Control. Optim. 51(6): 4544-4556 (2013) - 2010
- [j18]Steve Alpern, Shmuel Gal, Eilon Solan
:
A sequential selection game with vetoes. Games Econ. Behav. 68(1): 1-14 (2010)
2000 – 2009
- 2009
- [j17]Steve Alpern, Shmuel Gal:
Analysis and design of selection committees: a game theoretic secretary problem. Int. J. Game Theory 38(3): 377-394 (2009) - [j16]Steve Alpern, Vic Baston, Shmuel Gal:
Searching symmetric networks with Utilitarian-Postman paths. Networks 53(4): 392-402 (2009) - 2008
- [j15]Steve Alpern, Vic Baston, Shmuel Gal:
Network search games with immobile hider, without a designated searcher starting point. Int. J. Game Theory 37(2): 281-302 (2008) - [j14]Arnon Dagan, Shmuel Gal:
Network search games, with arbitrary searcher starting point. Networks 52(3): 156-161 (2008) - 2007
- [j13]Shmuel Gal, Michael Landsberger, Arkadi Nemirovski
Participation in auctions. Games Econ. Behav. 60(1): 75-103 (2007) - 2006
- [j12]Erik D. Demaine, Sándor P. Fekete, Shmuel Gal:
Online searching with turn cost. Theor. Comput. Sci. 361(2-3): 342-355 (2006) - 2004
- [i1]Erik D. Demaine, Sándor P. Fekete, Shmuel Gal:
Online Searching with Turn Cost. CoRR cs.DS/0406045 (2004) - 2003
- [b2]Steve Alpern, Shmuel Gal:
The theory of search games and rendezvous. International series in operations research and management science 55, Kluwer 2003, ISBN 978-0-7923-7468-8, pp. I-XIV, 1-319 - 2002
- [j11]Steve Alpern, Shmuel Gal:
Searching for an Agent Who May OR May Not Want to be Found. Oper. Res. 50(2): 311-323 (2002) - [j10]Patrick Jaillet, Matthew Stafford, Shmuel Gal:
Note: Online Searching / on the Optimality of the Geometric Sequences for the m Ray Search Online Searching. Oper. Res. 50(4): 744-745 (2002) - 2001
- [j9]Shmuel Gal:
On the optimality of a simple strategy for searching graphs. Int. J. Game Theory 29(4): 533-542 (2001)
1990 – 1999
- 1999
- [j8]Shmuel Gal:
Rendezvous Search on the Line. Oper. Res. 47(6): 974-976 (1999) - 1995
- [j7]Shmuel Gal, Boris Klots:
Optimal Partitioning Which Maximizes the Sum of the Weighted Averages. Oper. Res. 43(3): 500-508 (1995) - 1994
- [j6]Shmuel Gal, Yona Hollander, Alon Itai:
Optimal mapping in direct mapped cache environments. Math. Program. 63: 371-387 (1994) - 1992
- [c2]Shmuel Gal, Yona Hollander, Alon Itai:
Optimal Mapping in Direct Mapped Cache Environments. ISTCS 1992: 91-102 - 1991
- [j5]Shmuel Gal:
An accurate elementary mathematical library for the IEEE floating point standard. ACM Trans. Math. Softw. 17(1): 26-45 (1991)
1980 – 1989
- 1985
- [c1]Shmuel Gal:
Computing Elementary Functions: A New Approach for Achieving High Accuracy and Good Performance. Accurate Scientific Computations 1985: 1-16
1970 – 1979
- 1978
- [j4]Yuri Breitbart, Shmuel Gal:
Analysis of Algorithms for the Evaluation of Monotonic Boolean Functions. IEEE Trans. Computers 27(11): 1083-1087 (1978) - 1977
- [j3]Shmuel Gal, Willard L. Miranker:
Optimal Sequential and Parallel Seach for Finding a Root. J. Comb. Theory A 23(1): 1-14 (1977) - [j2]Moshe Ben-Bassat, Shmuel Gal:
Properties and convergence of a posteriori probabilities in classification problems. Pattern Recognit. 9(2): 99-107 (1977) - 1974
- [j1]Shmuel Gal:
Optimal Test Design for Reliability Demonstration. Oper. Res. 22(6): 1236-1242 (1974) - 1971
- [b1]Shmuel Gal:
פתרונות מינ-מקס לכמה בעיות חיפוש (Minimax solutions for certain search problems.). Hebrew University of Jerusalem, Israel, 1971
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: