 | 2009 |
| 11 |  | Yuri Leonidovich Ershov,
Klaus Keimel,
Ulrich Kohlenbach,
Andrei Morozov:
Preface.
Ann. Pure Appl. Logic 159(3): 249-250 (2009) |
| 10 |  | Yuri Leonidovich Ershov:
On the classification of (effective) phi-spaces.
Ann. Pure Appl. Logic 159(3): 285-291 (2009) |
| 2005 |
| 9 |  | Yuri Leonidovich Ershov,
V. Filippov,
O. Klimenko,
O. Trofimov:
Mathtree - Tree Catalog of Mathematical Resources in the Internet.
Automation, Control, and Information Technology 2005: 76-80 |
| 2000 |
| 8 |  | Yuri Leonidovich Ershov:
Sigma predicates of finite types.
Electr. Notes Theor. Comput. Sci. 35: 85 (2000) |
| 1999 |
| 7 |  | Yuri Leonidovich Ershov:
On d-Spaces.
Theor. Comput. Sci. 224(1-2): 59-72 (1999) |
| 1997 |
| 6 |  | Yuri Leonidovich Ershov:
The Bounded-Complete Hull of an Alpha-Space.
Theor. Comput. Sci. 175(1): 3-13 (1997) |
| 1993 |
| 5 |  | Yuri Leonidovich Ershov:
Theory of Domains and Nearby (Invited Paper).
Formal Methods in Programming and Their Applications 1993: 1-7 |
| 1989 |
| 4 |  | Yuri Leonidovich Ershov:
RRC-Fields with Small Absolute Galois Groups.
Ann. Pure Appl. Logic 43(3): 197-208 (1989) |
| 1987 |
| 3 |  | Yuri Leonidovich Ershov,
Sergei S. Goncharov,
Dmitri Ivanovich Sviridenko:
Semantic Foundations of Programming.
FCT 1987: 116-122 |
| 1986 |
| 2 |  | Sergei S. Goncharov,
Yuri Leonidovich Ershov,
Dmitri Ivanovich Sviridenko:
Semantic Programming.
IFIP Congress 1986: 1113-1120 |
| 1979 |
| 1 |  | Yuri Leonidovich Ershov:
How does algebra help to solve problems from the theory of algorithms (an example).
Algorithms in Modern Mathematics and Computer Science 1979: 462-463 |