 | 2003 |
|---|
| 9 |       | Alexander Yakhnis,
Wu Ke:
Searches for New Information over World Wide Web.
International Conference on Internet Computing 2003: 53-57 |
| 1998 |
|---|
| 8 | | Bakhadyr Khoussainov,
Alexander Yakhnis,
Vladimir Yakhnis:
Games with Unknown Past.
Math. Log. Q. 44: 185-204 (1998) |
| 1996 |
|---|
| 7 | | Anil Nerode,
Jeffrey B. Remmel,
Alexander Yakhnis:
Hybrid System Games: Extraction of Control Automata with Small Topologies.
Hybrid Systems 1996: 248-293 |
| 6 | | Anil Nerode,
Jeffrey B. Remmel,
Alexander Yakhnis:
McNaughton Games and Extracting Strategies for Concurrent Programs.
Ann. Pure Appl. Logic 78(1-3): 203-242 (1996) |
| 1995 |
|---|
| 5 |  | Wolf Kohn,
Anil Nerode,
Jeffrey B. Remmel,
Alexander Yakhnis:
Viability in Hybrid Systems.
Theor. Comput. Sci. 138(1): 141-168 (1995) |
| 1994 |
|---|
| 4 | | Anil Nerode,
Jeffrey B. Remmel,
Alexander Yakhnis:
Controllers as Fixed Points of Set-Valued Operators.
Hybrid Systems 1994: 344-358 |
| 1993 |
|---|
| 3 | | Sergei S. Goncharov,
Alexander Yakhnis,
Vladimir Yakhnis:
Some Effectively Infinite Classes of Enumerations.
Ann. Pure Appl. Logic 60(3): 207-235 (1993) |
| 2 | | Alexander Yakhnis,
Vladimir Yakhnis:
Gurevich-Harrington's Games Defined by Finite Automata.
Ann. Pure Appl. Logic 62(3): 265-294 (1993) |
| 1990 |
|---|
| 1 | | Alexander Yakhnis,
Vladimir Yakhnis:
Extension of Gurevich-Harrington's Restricted Memory Determinacy Theorem: A Criterion for the Winning Player and an Explicit Class of Winning Strategies.
Ann. Pure Appl. Logic 48(3): 277-297 (1990) |
