Extension of Gurevich-Harrington's Restricted Memory Determinacy Theorem: A Criterion for the Winning Player and an Explicit Class of Winning Strategies. - Alexander Yakhnis; Vladimir Yakhnis (Ann. Pure Appl. Log., 1990)

Some Effectively Infinite Classes of Enumerations. - Sergei S. Goncharov; Alexander Yakhnis; Vladimir Yakhnis (Ann. Pure Appl. Log., 1993)

Gurevich-Harrington's Games Defined by Finite Automata. - Alexander Yakhnis; Vladimir Yakhnis (Ann. Pure Appl. Log., 1993)

Controllers as Fixed Points of Set-Valued Operators. - Anil Nerode; Jeffrey B. Remmel; Alexander Yakhnis (Hybrid Systems, 1994)

Viability in Hybrid Systems. - Wolf Kohn; Anil Nerode; Jeffrey B. Remmel; Alexander Yakhnis (Theor. Comput. Sci., 1995)

Hybrid System Games: Extraction of Control Automata with Small Topologies. - Anil Nerode; Jeffrey B. Remmel; Alexander Yakhnis (Hybrid Systems, 1996)

McNaughton Games and Extracting Strategies for Concurrent Programs. - Anil Nerode; Jeffrey B. Remmel; Alexander Yakhnis (Ann. Pure Appl. Log., 1996)

Games with Unknown Past. - Bakhadyr Khoussainov; Alexander Yakhnis; Vladimir Yakhnis (Math. Log. Q., 1998)

Searches for New Information over World Wide Web. - Alexander Yakhnis; Wu Ke (International Conference on Internet Computing, 2003)