There has been much work on the following question: given n, how large can a subset of {1, . . . , n} be that has no arithmetic progressions of length 3. We call such sets 3-free. Most of the workâ€¦ (More)

Let x1, . . . , xk be n-bit numbers and T âˆˆ N. Assume that P1, . . . , Pk are players such that Pi knows all of the numbers except xi. The players want to determine if âˆ‘k j=1 xj = T by broadcastingâ€¦ (More)

A two-player, finite, probabilistic game with perfect information can be presented as a four-partite graph. For Canâ€™t Stop, the graph is cyclic and the challenge is to determine the game-theoreticalâ€¦ (More)

We study algorithms for solving oneand two-player stochas tic games with perfect information, by modeling a game as a finite, possibly cyclic graph. We analyze a family of jeopardy stochastic games,â€¦ (More)

This paper reviews past analyses and research related to lunar south pole illumination and presents results of independent illumination analyses using an analytical tool and a radar digital elevationâ€¦ (More)

An n-player, finite, probabilistic game with perfect information can be presented as a 2n-partite graph. For Canâ€™t Stop, the graph is cyclic and the challenge is to determine the game-theoreticalâ€¦ (More)

T. Hayes, H-C. Hseuh, H. Huang, P. Ingrassia, U. Iriso-Ariz 0. Jinnouchi, J. Laster, R. Lee, A.'Luccio, Y. Luo W. W. McKay, Y. Makdisi, G. Marr, A. Marusic; G. McIntyre R. Michnoff, C. Montag, J;â€¦ (More)